Luérbio Faria

According to our database1, Luérbio Faria authored at least 61 papers between 1995 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
On the (parameterized) complexity of recognizing well-covered (r, )-graph.
Theor. Comput. Sci., 2018

Chordal-(2, 1) graph sandwich problem with boundary conditions.
Electron. Notes Discret. Math., 2018

The partitioned probe problem: NP-complete versus polynomial dichotomy.
Discret. Appl. Math., 2018

On the forbidden induced subgraph probe and sandwich problems.
Discret. Appl. Math., 2018

2017
Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion.
Theory Comput. Syst., 2017

Maximum Cuts in Edge-colored Graphs.
Electron. Notes Discret. Math., 2017

Improved kernels for Signed Max Cut parameterized above lower bound on (r, l)-graphs.
Discrete Mathematics & Theoretical Computer Science, 2017

2016
The Same Upper Bound for Both: The 2-page and the Rectilinear Crossing Numbers of the n-Cube.
Journal of Graph Theory, 2016

The (k, ℓ) unpartitioned probe problem NP-complete versus polynomial dichotomy.
Inf. Process. Lett., 2016

On complexities of minus domination.
Discret. Optim., 2016

A note on the middle levels problem.
Discret. Appl. Math., 2016

Preface: LAGOS'13: Seventh Latin-American Algorithms, Graphs, and Optimization Symposium, Playa del Carmen, México - 2013.
Discret. Appl. Math., 2016

On the (Parameterized) Complexity of Recognizing Well-Covered (r, l)-graphs.
Proceedings of the Combinatorial Optimization and Applications, 2016

2015
The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles.
Theor. Comput. Sci., 2015

Structural characterization and decomposition for cographs-(2, 1) and (1, 2): a natural generalization of threshold graphs.
Electron. Notes Discret. Math., 2015

On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

On the forbidden induced subgraph probe problem.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014
Chordal-(k, ℓ) and strongly chordal-(k, ℓ)graph sandwich problems.
J. Braz. Comp. Soc., 2014

On defensive alliances and strong global offensive alliances.
Discret. Appl. Math., 2014

2013
Split clique graph complexity.
Theor. Comput. Sci., 2013

The generalized split probe problem.
Electron. Notes Discret. Math., 2013

Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs.
Electron. Notes Discret. Math., 2013

Forbidden subgraphs and the König-Egerváry property.
Discret. Appl. Math., 2013

The Same Upper Bound for Both: The 2-Page and the Rectilinear Crossing Numbers of the n-Cube.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

On specifying boundary conditions for the graph sandwich problem.
Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

An oriented 8-coloring for acyclic oriented graphs with maximum degree 3.
Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

The Edge-Recoloring Cost of Paths and Cycles in Edge-Colored Graphs and Digraphs.
Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013

On (k, ℓ)-Graph Sandwich Problems.
Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013

2012
Odd Cycle Transversals and Independent Sets in Fullerene Graphs.
SIAM J. Discrete Math., 2012

On the Oriented Chromatic Number of Union of Graphs.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011
A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation.
RAIRO - Theor. Inf. and Applic., 2011

Forbidden subgraphs and the Kőnig property.
Electron. Notes Discret. Math., 2011

Hamiltonian Cycles in Kneser Graphs for n=2k+2.
Electron. Notes Discret. Math., 2011

2010
Unitary Toric Classes, the Reality and Desire Diagram, and Sorting by Transpositions.
SIAM J. Discrete Math., 2010

2K2 vertex-set partition into nonempty parts.
Discret. Math., 2010

Advances on the List Stubborn Problem.
Proceedings of the Theory of Computing 2010, 2010

2009
The complexity of clique graph recognition.
Theor. Comput. Sci., 2009

Skewness, splitting number and vertex deletion of some toroidal meshes.
Ars Comb., 2009

Recognition of Reducible Flow Hypergraphs.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008
Paths and trails in edge-colored graphs.
Theor. Comput. Sci., 2008

An improved upper bound on the crossing number of the hypercube.
Journal of Graph Theory, 2008

Flow Hypergraph Reducibility.
Electron. Notes Discret. Math., 2008

2K2 vertex-set partition into nonempty parts.
Electron. Notes Discret. Math., 2008

On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs.
Electron. Notes Discret. Math., 2008

Partition into cliques for cubic graphs: Planar case, complexity and approximation.
Discret. Appl. Math., 2008

On the Toric Graph as a Tool to Handle the Problem of Sorting by Transpositions.
Proceedings of the Advances in Bioinformatics and Computational Biology, 2008

2007
On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs.
Theor. Comput. Sci., 2007

2006
On maximum planar induced subgraphs.
Discret. Appl. Math., 2006

Clique Graph Recognition Is NP-Complete.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006

2005
2K2-Partition Problem.
Electron. Notes Discret. Math., 2005

The non planar vertex deletion of Cn x Cm.
Ars Comb., 2005

2004
Nonplanar vertex deletion: maximum degree thresholds for NP/Max SNP-hardness and a I-approximation for finding maximum planar induced subgraphs.
Electron. Notes Discret. Math., 2004

On minimum clique partition and maximum independent set on unit disk graphs and penny graphs: complexity and approximation.
Electron. Notes Discret. Math., 2004

On decision and optimization (k, l)-graph sandwich problems.
Discret. Appl. Math., 2004

2002
The splitting number and skewness of Cn x Cm.
Ars Comb., 2002

On the Complexity of (k, l)-Graph Sandwich Problems.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

2001
On the complexity of the approximation of nonplanarity parameters for cubic graphs.
Electron. Notes Discret. Math., 2001

SPLITTING NUMBER is NP-complete.
Discret. Appl. Math., 2001

1999
Optimal Node-Degree Bounds for the Complexity of Nonplanarity Parameters.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998
The Splitting Number of the 4-Cube.
Proceedings of the LATIN '98: Theoretical Informatics, 1998

1995
Optimal Mapping of Neighbourhood-Constrained Systems.
Proceedings of the Parallel Algorithms for Irregularly Structured Problems, 1995


  Loading...