Fabiano S. Oliveira

Follow

Generating author description...

All published works
Action Title Year Authors
+ PDF Chat Thinness and its variations on some graph families and coloring graphs of bounded thinness 2024 Flavia Bonomo
Eric Brandwein
Fabiano S. Oliveira
Moysés S. Sampaio
Agustin Sansone
Jayme L. Szwarcfiter
+ PDF Chat Maximum Cut on Interval Graphs of Interval Count Four is NP-Complete 2023 Celina M.H. de Figueiredo
Alexsander A. de Melo
Fabiano S. Oliveira
Ana Silva
+ PDF Chat MaxCut on permutation graphs is NP‐complete 2023 Celina M.H. de Figueiredo
Alexsander A. de Melo
Fabiano S. Oliveira
Ana Silva
+ Thinness and its variations on some graph families and coloring graphs of bounded thinness 2023 Flavia Bonomo
Eric Brandwein
Fabiano S. Oliveira
Moysés S. Sampaio
Agustin Sansone
Jayme L. Szwarcfiter
+ Edge Intersection Graphs of Paths on a Triangular Grid 2022 Vitor Tocci F. de Luca
MarĂ­a PĂ­a Mazzoleni
Fabiano S. Oliveira
Jayme L. Szwarcfiter
+ WITHDRAWN: On the unit interval number of certain graphs 2022 Guillermo DurĂĄn
F. FernĂĄndez Slezak
Luciano N. Grippo
Fabiano S. Oliveira
Jayme L. Szwarcfiter
+ On subclasses of interval count two and on Fishburn’s conjecture 2022 Mathew C. Francis
LĂ­via Salgado Medeiros
Fabiano S. Oliveira
Jayme L. Szwarcfiter
+ Edge Intersection Graphs of Paths on a Triangular Grid 2022 Vitor Tocci F. de Luca
MarĂ­a PĂ­a Mazzoleni
Fabiano S. Oliveira
Tanilson Dias dos Santos
Jayme L. Szwarcfiter
+ MaxCut on Permutation Graphs is NP-complete 2022 Celina M.H. de Figueiredo
Alexsander A. de Melo
Fabiano S. Oliveira
Ana Silva
+ PDF Chat B1-EPG representations using block-cutpoint trees 2021 Vitor Tocci F. de Luca
Fabiano S. Oliveira
Jayme L. Szwarcfiter
+ PDF Chat Linear‐time algorithms for eliminating claws in graphs 2021 Flavia Bonomo
Julliano R. Nascimento
Fabiano S. Oliveira
UĂ©verton S. Souza
Jayme L. Szwarcfiter
+ PDF Chat Precedence thinness in graphs 2021 Flavia Bonomo
Fabiano S. Oliveira
Moysés S. Sampaio
Jayme L. Szwarcfiter
+ PDF Chat Thinness of product graphs 2021 Flavia Bonomo
Carolina LucĂ­a Gonzalez
Fabiano S. Oliveira
Moysés S. Sampaio
Jayme L. Szwarcfiter
+ B1-EPG representations using block-cutpoint trees 2021 Vitor Tocci F. de Luca
Fabiano S. Oliveira
Jayme L. Szwarcfiter
+ Minimum Number of Bends of Paths of Trees in a Grid Embedding 2021 Vitor Tocci F. de Luca
Fabiano S. Oliveira
Jayme L. Szwarcfiter
+ Minimum Number of Bends of Paths of Trees in a Grid Embedding 2021 Vitor Tocci F. de Luca
Fabiano S. Oliveira
Jayme L. Szwarcfiter
+ Maximum cut on interval graphs of interval count five is NP-complete 2020 Celina M.H. de Figueiredo
Alexsander A. de Melo
Fabiano S. Oliveira
Ana Silva
+ Precedence thinness in graphs 2020 Flavia Bonomo
Fabiano S. Oliveira
Moysés S. Sampaio
Jayme L. Szwarcfiter
+ Thinness of product graphs 2020 Flavia Bonomo
Carolina LucĂ­a Gonzalez
Fabiano S. Oliveira
Moysés S. Sampaio
Jayme L. Szwarcfiter
+ Linear-time Algorithms for Eliminating Claws in Graphs 2020 Flavia Bonomo
Julliano R. Nascimento
Fabiano S. Oliveira
UĂ©verton S. Souza
Jayme L. Szwarcfiter
+ PDF Chat Linear-Time Algorithms for Eliminating Claws in Graphs 2020 Flavia Bonomo
Julliano R. Nascimento
Fabiano S. Oliveira
UĂ©verton S. Souza
Jayme L. Szwarcfiter
+ Maximum cut on interval graphs of interval count four is NP-complete 2020 Celina M.H. de Figueiredo
Alexsander A. de Melo
Fabiano S. Oliveira
Ana Silva
+ Linear-time Algorithms for Eliminating Claws in Graphs 2020 Flavia Bonomo
Julliano R. Nascimento
Fabiano S. Oliveira
UĂ©verton S. Souza
Jayme L. Szwarcfiter
+ Precedence thinness in graphs 2020 Flavia Bonomo
Fabiano S. Oliveira
Moysés S. Sampaio
Jayme L. Szwarcfiter
+ Uma Nova Proposta para a Obtenção da Complexidade de Pior Caso do ShellSort 2019 Raquel M. Souza
Fabiano S. Oliveira
Paulo E. D. Pinto
+ Two Problems on Interval Counting 2019 LĂ­via Salgado Medeiros
Fabiano S. Oliveira
Jayme L. Szwarcfiter
+ PDF Chat A note on counting independent terms in asymptotic expressions of computational complexity 2016 Fabiano S. Oliveira
Valmir C. Barbosa
+ On the mediation of program allocation in high-demand environments 2016 Fabiano S. Oliveira
Valmir C. Barbosa
+ PDF Chat Counting independent terms in big-oh notation. 2015 Fabiano S. Oliveira
Valmir C. Barbosa
+ On unit interval graphs with integer endpoints 2015 Guillermo DurĂĄn
F. FernĂĄndez Slezak
Luciano N. Grippo
Fabiano S. Oliveira
Jayme L. Szwarcfiter
+ On the minimum neighborhood of independent sets in the n-cube 2015 MoysĂ©s JĂșnior
Fabiano S. Oliveira
Luérbio Faria
Paulo E. D. Pinto
+ PDF Chat Revisiting deadlock prevention: A probabilistic approach 2013 Fabiano S. Oliveira
Valmir C. Barbosa
+ On counting interval lengths of interval graphs 2010 MĂĄrcia R. Cerioli
Fabiano S. Oliveira
Jayme L. Szwarcfiter
Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ On the thinness and proper thinness of a graph 2018 Flavia Bonomo
Diego de Estrada
5
+ PDF Chat Powers of tensors and fast matrix multiplication 2014 François Le Gall
3
+ PDF Chat The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative-Type Metrics into ℓ <sub>1</sub> 2015 Subhash Khot
Nisheeth K. Vishnoi
3
+ Vertex deletion problems on chordal graphs 2018 Yixin Cao
Yuping Ke
Yota Otachi
Jie You
3
+ On counting interval lengths of interval graphs 2010 MĂĄrcia R. Cerioli
Fabiano S. Oliveira
Jayme L. Szwarcfiter
3
+ Dominating set is fixed parameter tractable in claw-free graphs 2011 Marek Cygan
Geevarghese Philip
Marcin Pilipczuk
MichaƂ Pilipczuk
Jakub Onufry Wojtaszczyk
3
+ The Interval Count of a Graph 1982 Rochelle Leibowitz
Susan F. Assmann
G. W. Peck
3
+ On hamiltonian claw-free graphs 1993 Evelyne Flandrin
Jean‐Luc Fouquet
H. Li
3
+ Complement reducible graphs 1981 Derek G. Corneil
H. Lerchs
L.Stewart Burlingham
3
+ Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition 2014 Yuri Faenza
Gianpaolo Oriolo
Gautier Stauffer
3
+ PDF Chat Graphs with 1-factors 1974 David P. Sumner
3
+ PDF Chat Revising Johnson’s table for the 21st century 2021 Celina M.H. de Figueiredo
Alexsander A. de Melo
Diana Sasaki
Ana Silva
3
+ Interval Orders with Two Interval Lengths 2017 Simona Boyadzhiyska
Garth Isaak
Ann N. Trenk
2
+ The fractional version of Hedetniemi’s conjecture is true 2011 Xuding Zhu
2
+ Weighted and locally bounded list-colorings in split graphs, cographs, and partial k-trees 2019 CĂ©dric Bentz
2
+ PDF Chat New Bounds on the Grundy Number of Products of Graphs 2012 VĂ­ctor Campos
AndrĂĄs GyĂĄrfĂĄs
Frédéric Havet
ClĂĄudia Linhares Sales
Frédéric Maffray
2
+ On the b-chromatic number of some graph products 2012 Marko Jakovac
Iztok Peterin
2
+ PDF Chat Counterexamples to Hedetniemi's conjecture 2019 Yaroslav Shitov
2
+ PDF Chat Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time 2011 Marek Cygan
Jesper Nederlof
Marcin Pilipczuk
MichaƂ Pilipczuk
Joham M.M. van Rooij
Jakub Onufry Wojtaszczyk
2
+ PDF Chat Game Chromatic Number of Cartesian Product Graphs 2008 Tomasz Bartnicki
BoĆĄtjan BreĆĄar
JarosƂaw Grytczuk
MatjaĆŸ KovĆĄe
Zofia Miechowicz
Iztok Peterin
2
+ Grundy number and products of graphs 2009 Marie Asté
Frédéric Havet
ClĂĄudia Linhares Sales
2
+ Characterizing paths graphs on bounded degree trees by minimal forbidden induced subgraphs 2014 Liliana AlcĂłn
M. Gutierrez
MarĂ­a PĂ­a Mazzoleni
2
+ On the Sum Coloring Problem on Interval Graphs 1999 Sara Nicoloso
Majid Sarrafzadeh
Xiaoyu Song
2
+ Interval-regular graphs 1982 Henry Martyn Mulder
2
+ A New Property of Critical Imperfect Graphs and some Consequences 1987 H. Meyniel
2
+ The chromatic number and other functions of the lexicographic product 1975 Dennis P. Geller
Saul Stahl
2
+ PDF Chat The structure of claw-free graphs 2005 Maria Chudnovsky
Paul Seymour
2
+ Independence and coloring properties of direct products of some vertex-transitive graphs 2006 Mario Valencia-Pabon
Juan C. Vera
2
+ Edge-intersection graphs of grid paths: The bend-number 2013 Daniel Heldt
Kolja Knauer
Torsten Ueckerdt
2
+ Boxicity and cubicity of product graphs 2015 L. Sunil Chandran
Wilfried Imrich
Rogers Mathew
Deepak Rajendraprasad
2
+ PDF Chat A $c^k n$ 5-Approximation Algorithm for Treewidth 2016 Hans L. Bodlaender
PÄl GrÞnÄs Drange
Markus Sortland Dregi
Fedor V. Fomin
Daniel Lokshtanov
MichaƂ Pilipczuk
2
+ Graph Homomorphisms for Quantum Players 2012 Laura Mančinska
David E. Roberson
2
+ PDF Chat <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.gif" display="inline" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-tuple colorings of the Cartesian product of graphs 2017 Flavia Bonomo
Ivo Koch
Pablo Torres
Mario Valencia-Pabon
2
+ A short proof of the NP-completeness of minimum sum interval coloring 2004 DĂĄniel Marx
2
+ Structure of Graph Homomorphisms 1997 Roman Bačík
2
+ On double and multiple interval graphs 1979 William T. Trotter
Frank Harary
2
+ Interval Count of Generalizations of Threshold Graphs 2012 MĂĄrcia R. Cerioli
Fernando A. Oliveira
Jayme L. Szwarcfiter
1
+ Unit Interval Graphs of Open and Closed Intervals 2012 Dieter Rautenbach
Jayme L. Szwarcfiter
1
+ Orders of Infinity: The ‘Infinitarcalcul' of Paul du Bois-Reymond 2013 G. H. Hardy
1
+ On Restrictions of Balanced 2-Interval Graphs 2007 Philippe Gambette
Stéphane Vialette
1
+ PDF Chat The Combinatorics of Resource Sharing 2002 Valmir C. Barbosa
1
+ Structural results on circular-arc graphs and circle graphs: A survey and the main open problems 2013 Guillermo DurĂĄn
Luciano N. Grippo
MartĂ­n D. Safe
1
+ Minimal representation of a semiorder 1990 Marc Pirlot
1
+ PDF Chat Extremal Values of the Interval Number of a Graph 1980 Jerrold R. Griggs
Douglas B. West
1
+ On the interval number of a chordal graph 1988 Edward R. Scheinerman
1
+ Surveys in Combinatorics 2005 2005 B. S Webb
1
+ On the unit interval number of a graph 1988 Thomas Andreae
1
+ Extremal values of the interval number of a graph, II 1979 Jerrold R. Griggs
1
+ The rank-width of the square grid 2009 VĂ­t JelĂ­nek
1
+ PDF Chat Gene clusters as intersections of powers of paths 2012 Vı́tor Santos Costa
Simone Dantas
David Sankoff
Ximing Xu
1