most significant
·
Lattes cv
·
Mathematical Reviews
·
Google Scholar
·
Microsoft Academic
·
dblp
·
orcid
Papers in refereed journals

Revising Johnson's table for the 21st century
to appear in
Discrete Applied Mathematics
(with Alexsander Melo, Diana Sasaki, Ana Silva).

On undirected twocommodity integral flow, disjoint paths and strict terminal connection problems
to appear in
Networks
(with Alexsander Melo and Ueverton Souza).

A computational complexity comparative study of graph tessellation problems
Theoretical Computer Science
858 (2021) 8189
(with Alexandre Santiago de Abreu, Luis Felipe Cunha, Luis A. B. Kowada, Franklin de Lima Marquezino, Renato Portugal, Daniel Posner).

The guide to NPcompleteness is 40 years old: A homage to David S. Johnson
Pesquisa Operacional
40 (2020) e236329
(with Luciana Buriol, Mauricio Resende, Eduardo Uchoa).

Complexityseparating graph classes for vertex, edge and total colouring
Discrete Applied Mathematics
281 (2020) 162171.

A multivariate analysis of the strict terminal connection problem
Journal of Computer and System Sciences
111 (2020) 2241
(with Alexsander Melo and Ueverton Souza).

On the computational complexity of closest genome problems
Discrete Applied Mathematics
274 (2020) 2634
(with Luis Felipe Cunha, Pedro Feijão, Vinicius Santos, Luis A. B. Kowada).

The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness
Theoretical Computer Science
801 (2020) 175191
(with Alexandre Santiago de Abreu, Luis Felipe Cunha, Luis A. B. Kowada, Franklin de Lima Marquezino, Daniel Posner, Renato Portugal).

Timber game as a counting problem
Discrete Applied Mathematics
261 (2019) 193202
(with Ana Furtado, Simone Dantas, Sylvain Gravier).

On the embedding of cone graphs in the line with distinct distances between neighbors
Discrete Applied Mathematics
251 (2019) 157162
(with Rodrigo M. Zhou, Raphael Machado, Vinícius Gusmão P. de Sá).

On NordhausGaddum type inequalities for the game chromatic and game coloring numbers
Discrete Mathematics
342 (2019) 13181324
(with Clément Charpentier, Simone Dantas, Ana Furtado, Sylvain Gravier).

Sandwich and probe problems for excluding paths
Discrete Applied Mathematics
251 (2018) 146154
(with Sophie Spirkl).

The sandwich problem for decompositions and almost monotone properties
Algorithmica
80 (2018) 36183645
(with Maria Chudnovsky, Sophie Spirkl).

Using SPQRtrees to speed up recognition algorithms based on 2cutsets
Discrete Applied Mathematics
245 (2018) 101108
(with
Helio Macedo Filho, Zhentao Li, Raphael Machado).

The (k,l) partitioned probe problem: NPcomplete versus polynomial dichotomy
Discrete Applied Mathematics
234 (2018) 6775
(with Simone Dantas, Luerbio Faria, Rafael B. Teixeira).

Shifting coresets: obtaining lineartime approximations for unit disk graphs and other geometric intersection graphs
International Journal of Computational Geometry and Applications
27 (2017) 255276
(with Vinícius Gusmão P. de Sá,
Guilherme Fonseca).

Efficient algorithms for cliquecolouring and bicliquecolouring unichordfree graphs
Algorithmica
77 (2017) 786814
(with Hélio Macêdo Filho, Raphael Machado).

The same upper bound for both:
the 2page and the rectilinear crossing numbers of the ncube
Journal of Graph Theory
83 (2016) 1933
(with Luerbio Faria, Bruce Richter, Imrich Vrto).

On the equitable total chromatic number of cubic graphs
Discrete Applied Mathematics
209 (2016) 8491
(with Simone Dantas, Giuseppe Mazzuoccolo, Myriam Preissmann,
Vinicius Santos, Diana Sasaki).

A note on the middle levels problem
Discrete Applied Mathematics
210 (2016) 290296
(with Andreia Gusmão, Letícia Rodrigues Bueno, Rodrigo Hausen, Luerbio Faria).

The cost of perfection for matchings in graphs
Discrete Applied Mathematics
210 (2016) 112122
(with Emilio Vital Brazil, Guilherme Fonseca, Diana Sasaki).
 Lineartime graph distance and diameter approximation
International Transactions in Operational Research
23 (2016) 843851
(with Raphael Machado).

Hierarchical complexity of 2cliquecolouring weakly chordal graphs and perfect graphs having cliques of size at least 3
Theoretical Computer Science
618 (2016) 122134
(with Hélio Macêdo Filho, Raphael Machado).

On the total coloring of generalized Petersen graphs
Discrete Mathematics
339 (2016) 14711475
(with Simone Dantas, Giuseppe Mazzuoccolo, Myriam Preissmann,
Vinicius Santos, Diana Sasaki).
 The (k,l)unpartitioned probe problem NPcomplete versus Polynomial dichotomy
Information Processing Letters
116 (2016) 294298
(with Simone Dantas, Luerbio Faria, Rafael B. Teixeira).

A faster 1.375approximation algorithm for sorting by transpositions
Journal of Computational Biology
22 (2015) 10441056
(with Luis Felipe Cunha, Luis A. B. Kowada, Rodrigo Hausen).

On the recognition of unit disk graphs and the distance geometry problem with ranges
Discrete Applied Mathematics
197 (2015) 319
(with Vinícius Gusmão P. de Sá,
Guilherme Fonseca,
Raphael Machado).

Bicliquecolouring verification complexity and bicliquecolouring power graphs
Discrete Applied Mathematics
192 (2015) 6576
(with Helio Macedo Filho, Simone Dantas, Raphael Machado).

Hamiltonian cycles in unitary prefix transposition rearrangement graphs
Discrete Applied Mathematics
192 (2015) 8286
(with Caroline Reis, Luis A. B. Kowada, Leticia Rodrigues Bueno,
Andre Cunha Ribeiro).

On probe cobipartite and probe diamondfree graphs
Discrete Mathematics and Theoretical Computer Science
17 (2015) 187200
(with Flavia Bonomo, Guillermo Durán, Luciano Grippo,
Martín Safe, Jayme Szwarcfiter).

The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem
Discrete Applied Mathematics
182 (2015) 1524
(with Simone Dantas, Frédéric Maffray, Rafael B. Teixeira).

Blindfriendly von Neumann's heads or tails
The American Mathematical Monthly
121 (2014) 600609
(with
Vinícius Gusmão P. de Sá).

Efficient sub5 approximations for minimum dominating sets in unit disk graphs
Theoretical Computer Science
540 (2014) 7081
(with Vinícius Gusmão P. de Sá,
Guilherme Fonseca,
Raphael Machado).

Complexity of colouring problems restricted to unichordfree and
{square,unichord}free graphs
Discrete Applied Mathematics
164 (2014) 191199
(with
Raphael Machado,
Nicolas Trotignon).

The hunting of a snark with total chromatic number 5
Discrete Applied Mathematics
164 (2014) 470481
(with Diana Sasaki, Simone Dantas, Myriam Preissmann).

Advancing the transposition distance and diameter through lonely permutations
SIAM Journal on Discrete Mathematics
27 (2013) 16821709
(with Luis Felipe Cunha, Luis A. B. Kowada, Rodrigo Hausen).

Split clique graph complexity
Theoretical Computer Science
506 (2013) 2942
(with
Liliana Alcon,
Luerbio Faria,
Marisa Gutierrez).

Edgecolouring and totalcolouring chordless graphs
Discrete Mathematics
313 (2013) 15471552
(with
Raphael Machado,
Nicolas Trotignon).

The P vs. NPcomplete dichotomy of some challenging problems in graph
theory
Discrete Applied Mathematics
160 (2012) 26812693.

The total chromatic number of splitindifference graphs
Discrete Mathematics
312 (2012) 26902693
(with
Christiane Neme Campos,
Raphael Machado,
Célia Mello).

Complexity separating
classes for edgecolouring and totalcolouring
Journal of the Brazilian Computer Society
17 (2011) 281285
(with
Raphael Machado).

Totalchromatic
number of unichordfree graphs
Discrete Applied Mathematics
159 (2011) 18511864
(with
Raphael Machado).

On the forbidden
induced subgraph sandwich problem
Discrete Applied Mathematics
159 (2011) 17171725
(with
Simone Dantas,
Murilo V. G. Da Silva,
Rafael B. Teixeira).

The chain graph
sandwich problem
Annals of Operations Research
188 (2011) 133139
(with
Simone Dantas,
Martin Charles Golumbic,
Sulamita Klein,
Frédéric Maffray).

A decomposition for totalcolouring partialgrids and listtotalcolouring
outerplanar graphs
Networks
57 (2011) 261269
(with
Raphael Machado).

Complexity dichotomy on partial
grid recognition
Theoretical Computer Science
412 (2011) 23702379
(with
Vinícius Gusmão P. de Sá,
Guilherme Fonseca,
Raphael Machado).

Transitive
orientations in bullreducible Berge graphs
Discrete Applied Mathematics
159 (2011) 561573
(with
Frédéric Maffray,
Cláudia R. Villela Maciel).

The external
constraint 4 nonempty part sandwich problem
Discrete Applied Mathematics
159 (2011) 661673
(with
Rafael B. Teixeira,
Simone Dantas).

Chromatic index of
graphs with no cycle with a unique chord
Theoretical Computer Science
411 (2010) 12211234
(with
Raphael Machado,
Kristina Vuskovic).

Unitary toric classes,
the reality and desire diagram, and sorting by transpositions
SIAM Journal on Discrete Mathematics
24 (2010) 792807
(with
Rodrigo Hausen,
Luerbio Faria,
Luis Antonio B. Kowada).

The polynomial
dichotomy for three nonempty part sandwich problems
Discrete Applied Mathematics
158 (2010) 12861304
(with
Rafael B. Teixeira,
Simone Dantas).

2K2 vertexset
partition into nonemptyparts
Discrete Mathematics
310 (2010) 12591264
(with
Simone Dantas,
Elaine Eschen,
Luerbio Faria,
Sulamita Klein).

Decompositions for
edgecoloring join graphs and cobipartite graphs
Discrete Applied Mathematics
158 (2010) 13361342
(with
Raphael Machado).

On maximizing
clique, cliqueHelly and hereditary cliqueHelly induced subgraphs
Discrete Applied Mathematics
158 (2010) 12791285
(with
Liliana Alcon,
Luerbio Faria,
Marisa Gutierrez).

Enclosing weighted
points with an almostunit ball
Information Processing Letters
109 (2009) 12161221
(with
Guilherme Fonseca).

Hamiltonian
paths in odd graphs
Applicable Analysis and Discrete Mathematics
3 (2009) 386394
(with
Luerbio Faria,
Guilherme Fonseca,
Leticia Rodrigues Bueno).

Skewness,
splitting number and vertex deletion of some toroidal meshes
Ars Combinatoria
92 (2009) 5365
(with
Luerbio Faria,
Candido F. Xavier de Mendonça
Neto,
Jorge Stolfi).

The complexity of
clique graph recognition
Theoretical Computer Science
410 (2009) 20722083
(with
Liliana Alcon,
Luerbio Faria,
Marisa Gutierrez).

Helly property, clique graphs, complementary graph classes,
and sandwich problems
Journal of the Brazilian Computer Society
14 (2008) 4552
(with
Mitre C. Dourado,
Priscila Petito,
Rafael B. Teixeira).

An improved upper bound on the crossing number of the hypercube
Journal of Graph Theory
59 (2008) 145161
(with
Luerbio Faria,
Ondrej Sykora,
Imrich Vrto).

A new quantum algorithm
to solve the minimum searching problem
International Journal of Quantum Information
6 (2008) 427436
(with
Luis Antonio B. Kowada,
Carlile Lavor,
Renato Portugal).

On the complexity of
the sandwich problems for strongly chordal graphs and chordal bipartite
graphs
Theoretical Computer Science
381 (2007) 5767
(with
Luerbio Faria,
R. Sritharan,
Sulamita Klein).

On the generation of
bicliques of a graph
Discrete Applied Mathematics
155 (2007) 18261832
(with
Vania Dias,
Jayme
Szwarcfiter).

Cycles
and asteroidal sets in loop graphs
Actas de la Academia Nacional de Ciencias, Argentina
13 (2007) 4149
(with
Liliana Alcon,
Márcia R. Cerioli,
João Meidanis
and
Marisa Gutierrez).

Tree loop
graphs
Discrete Applied Mathematics, Computational Molecular Biology Series,
Issue V
155 (2007) 686694
(with
Liliana Alcon,
Márcia R. Cerioli,
João Meidanis
and
Marisa Gutierrez).

Reversible Karatsuba's algorithm
Journal of Universal Computer Science
12 (2006) 499511
(with
Luis Antonio B. Kowada,
Renato Portugal).

The
pair completion algorithm for the homogeneous set sandwich problem
Information Processing Letters
98 (2006) 8791
(with
Claudson Bornstein,
Vinicius G. P. de Sá).

On maximum planar
induced subgraphs
Discrete Applied Mathematics
154 (2006) 17741782
(with
Luerbio Faria,
Sylvain
Gravier,
Candido F. Xavier de Mendonça
Neto,
Jorge Stolfi).

The sandwich problem
for cutsets: clique cutset, kstar cutset
Discrete Applied Mathematics
154 (2006) 17911798
(with
Rafael B. Teixeira).

Algorithms
for the homogeneous set sandwich problem
Algorithmica
46 (2006) 149180
(with
Guilherme Fonseca,
Vinicius G. P. de Sá,
Jeremy Spinrad).

A characterization
of P4comparability graphs
Discrete Mathematics
306 (2006) 24612472
(with
Chinh T. Hoang
and
Frédéric Maffray).

Extended skew
partition problem
Discrete Mathematics
306 (2006) 24382449
(with
Simone Dantas,
Sylvain
Gravier
and
Sulamita Klein).

Generating
bicliques of a graph in lexicographic order
Theoretical Computer Science
337 (2005) 240248
(with
Vania Dias,
Jayme
Szwarcfiter).

The non
planar vertex deletion of C_{n} x C_{m}
Ars Combinatoria
76 (2005) 328
(with
Jorge Stolfi,
Candido F. Xavier de Mendonça Neto,
and
Luerbio Faria).

The perfection and recognition of bullreducible Berge graphs
RAIROTheoretical Informatics and Applications
39 (2005) 145160
(with
Hazel Everett,
Sulamita Klein,
Bruce Reed).

Finding Hpartitions efficiently
RAIROTheoretical Informatics and Applications
39 (2005) 133144
(with
Simone Dantas,
Sylvain
Gravier
and
Sulamita Klein).

Note on the homogeneous
set sandwich problem
Information Processing Letters
93 (2005) 7581
(with
Vinicius G. P. de Sá).

Optimizing
bullfree perfect graphs
SIAM Journal on Discrete Mathematics
18 (2004) 226240
(with
Frédéric Maffray).

On decision and
optimization (k,l)graph sandwich problems
Discrete Applied Mathematics
143 (2004) 155165
(with
Luerbio Faria
and
Simone Dantas).

Stable skew partition
problem
Discrete Applied Mathematics
143 (2004) 1722
(with
Simone Dantas,
Sylvain
Gravier,
Sulamita Klein,
Bruce Reed).

On the complexity of the approximation of nonplanarity parameters for cubic graphs
Discrete Applied Mathematics
141 (2004) 119134
(with
Luerbio Faria
and
Candido F. Xavier de Mendonça Neto).

Kinetic hanger
Information Processing Letters
89 (2004) 151157
(with
Guilherme Fonseca
and
Paulo C. P. Carvalho).

The stable
marriage problem with restricted pairs
Theoretical Computer Science
306 (2003) 391405
(with
Vania Dias,
Guilherme Fonseca
and
Jayme Szwarcfiter).

Decompositions for the edge colouring of reduced indifference
graphs
Theoretical Computer Science
297 (2003) 145155
(with
João Meidanis,
Célia Mello,
and
Carmen Ortiz).

Kinetic
heapordered trees: tight analysis and improved algorithms
Information Processing Letters
85 (2003) 165169
(with
Guilherme Fonseca).

The graph sandwich problem for 1join composition is NPcomplete
Discrete Applied Mathematics
121 (2002) 7382
(with
Sulamita Klein
and
Kristina Vuskovic).

A note on transitive orientations with maximum sets of sources and sinks
Discrete Applied Mathematics
120 (2002) 9195
(with
Jayme Szwarcfiter,
Célia Mello,
and
John Gimbel).

The splitting
number and skewness of C_{n} x C_{m}
Ars Combinatoria
63 (2002) 193205
(with
Érico F. Xavier,
Karl Schaffer,
Jorge Stolfi,
Candido F. Xavier de Mendonça Neto,
and
Luerbio Faria).

On the structure of bullfree perfect graphs, 2:
the weakly triangulated case
Graphs and Combinatorics
17 (2001) 435456
(with
Frédéric Maffray
and
Oscar Porto).

Recognition of quasiMeyniel graphs
Discrete Applied Mathematics
113 (2001) 255260
(with
Kristina Vuskovic).

On Tucker's proof of the strong perfect graph conjecture for
(K_{4}  e)free graphs
Discrete Mathematics
232 13 (2001) 105108
(with
Sylvain Gravier
and
Cláudia Linhares Sales).

Splitting number is NPcomplete
Discrete Applied Mathematics
108 (2001) 6583
(with
Luerbio Faria
and
Candido F. Xavier de Mendonça Neto).

Finding skew partitions efficiently
Journal of Algorithms
37 (2000) 505521
(with
Sulamita Klein,
Yoshiharu Kohayakawa,
and
Bruce Reed).

On Eggleton and Guy conjectured upper bound for the crossing number of the
ncube
Mathematica Slovaca
50 (2000) 271287
(with
Luerbio Faria).

A class of betaperfect graphs
Discrete Mathematics 216 (2000) 169193
(with Kristina Vuskovic).

Local conditions for edgecoloring
Journal of Combinatorial Mathematics and Combinatorial Computing
32 (2000) 7991
(with
João Meidanis
and
Célia Mello).

Total chromatic number and chromatic index of dually chordal graphs
Information Processing Letters
70 (1999) 147152
(with
João Meidanis
and
Célia Mello).

Even and odd pairs in comparability and in P4comparability graphs
Discrete Applied Mathematics 91 (1999) 293297
(with
Jayme Szwarcfiter,
Célia Mello,
and
John Gimbel).

The homogeneous set sandwich problem
Information Processing Letters 67 (1998) 3135
(with
Hazel Everett,
Sulamita Klein,
and
Márcia R. Cerioli).

Sources and sinks in
comparability graphs
Order 14 (1997) 7583
(with
John Gimbel,
Célia Mello,
and
Jayme Szwarcfiter).

On edgecolouring indifference graphs
Theoretical Computer Science 181 (1997) 91106
(with
João Meidanis
and
Célia Mello).

Path parity and perfection
Discrete Mathematics 165/166 (1997) 233252
(with
Hazel Everett,
Frédéric Maffray,
and
Bruce Reed).

On the structure of
bullfree perfect graphs
Graphs and Combinatorics 13 (1997) 3155
(with
Frédéric Maffray
and
Oscar Porto).

The NPcompleteness of multipartite cutset testing
Congressus Numerantium 119 (1996) 217222
(with
Sulamita Klein).

A lineartime algorithm for proper interval graph recognition
Information Processing Letters 56 (1995) 179184
(with
João Meidanis
and
Célia Mello).

A greedy method for edgecolouring odd maximum degree doubly
chordal graphs
Congressus Numerantium 111 (1995) 170176
(with
João Meidanis
and
Célia Mello).

Splitindifference graphs
Investigación Operativa 3 (1993) 6168
(with
Célia Mello,
Carmen Ortiz,
and
Mónica Villanueva).

On transitive orientations with prescribed sources and sinks
Congressus Numerantium 98 (1993) 191198
(with
Jayme Szwarcfiter
and
Célia Mello).

Ordens indiferença
Pesquisa Operacional 11 (1991) 4347
(with
Jayme Szwarcfiter,
Sulamita Klein,
and
Célia Mello).
Papers in refereed conferences

On total coloring the direct product of complete graphs
Proceedings of LAGOS 2021, Electronic Notes in Theoretical Computer Science
(with D. Castonguay, L. A. B. Kowada, C. S. R. Patrão, D. Sasaki, M. ValenciaPabon).

On the terminal connection problem
Proceedings of SOFSEM 2021, Foundations of Computer Science, Lecture Notes in Computer Science (with Alexsander A. Melo, Uéverton S. Souza).

On the chromatic index of complementary prisms
Proceedings of EUROCOMB 2019, Acta Math. Univ. Comenianae, Vol. LXXXVIII, 3 (2019), pp. 10711077
(with Leandro Zatesko, Renato Carmo, André Guedes, Alesom Zorzi, Raphael Machado).

Evenpower of cycles with many vertices are Type 1 total colorable
Proceedings of LAGOS 2019, Electronic Notes in Theoretical Computer Science
346 (2019) 747758
(with Alesom Zorzi, Raphael Machado, Uéverton S. Souza).

On caterpillars of game chromatic number 4
Proceedings of LAGOS 2019, Electronic Notes in Theoretical Computer Science
346 (2019) 461472
(with Ana Luísa Furtado, Simone Dantas, Sylvain Gravier).

A general method for forbidden induced sandwich problem NPcompleteness
Proceedings of LAGOS 2019, Electronic Notes in Theoretical Computer Science
346 (2019) 393400
(with Simone Dantas, Priscila Petito, Rafael B. Teixeira).

The graph tessellation cover number: extremal bounds, efficient algorithms and hardness
Proceedings of LATIN 2018, Lecture Notes in Computer Science
10807 (2018) 113
(with Alexandre Abreu, Luís Cunha, Tharso Fernandes, Luis Kowada, Franklin Marquezino, Daniel Posner, Renato Portugal).
 Simple undirected twocommodity integral flow with a unitary demand
Proceedings of LAGOS 2017,
LatinAmerican Algorithms, Graphs and Optimization Symposium,
Electronic Notes in Discrete Mathematics
625 (2017) 279284
(with Alexsander A. Melo, Uéverton S. Souza).

Using SPQRtrees to speed up algorithms based on 2cutset decompositions
Proceedings of LAGOS 2015,
LatinAmerican Algorithms, Graphs and Optimization Symposium,
Electronic Notes in Discrete Mathematics
50 (2015) 169174
(with
Helio Macedo Filho, Zhentao Li, Raphael Machado, Nicolas Trotignon).

A new reversible circuit
synthesis algorithm based on cycle representations of permutations
Proceedings of LAGOS 2015,
LatinAmerican Algorithms, Graphs and Optimization Symposium,
Electronic Notes in Discrete Mathematics
50 (2015) 187192
(with
Andre Cunha Ribeiro, Luis A. B. Kowada, Franklin Marquezino).

Lineartime approximation algorithms for unit disk graphs
Proceedings of 12th Workshop on Approximation and Online Algorithms WAOA 2014,
Lecture Notes in Computer Science
8952 (2015) 132143
(with Vinícius Gusmão P. de Sá, Guilherme Fonseca).

A faster 1.375approximation algorithm for sorting by transpositions
Proceedings of 14th Workshop on Algorithms in Bioinformatics WABI 2014,
Lecture Notes in Computer Science,
Sublibrary: Lecture Notes in Bioinformatics
8701 (2014) 2637
(with Luis Felipe Cunha, Luis A. B. Kowada, Rodrigo Hausen).

Hierarchical complexity of 2cliquecolouring weakly chordal graphs and perfect graphs having cliques of size at least 3
Proceedings of LATIN 2014, Lecture Notes in Computer Science
8392 (2014) 1323
(with
Raphael Machado,
Helio Macedo Filho).

The same upper bound for both: the 2page and the rectilinear crossing numbers of the ncube
Proceedings of the 39th International Workshop
on GraphTheoretic Concepts in Computer Science WG 2013,
Lecture Notes in Computer Science
8165 (2013) 249260
(with Luerbio Faria, Bruce Richter, Imrich Vrto).

On the 1.375approximation algorithm for sorting by transpositions in O(nlog n) time
Proceedings of Brazilian Symposium on Bioinformatics BSB 2013,
Lecture Notes in Computer Science,
Sublibrary: Lecture Notes in Bioinformatics
8213 (2013) 126135
(with Luis Felipe Cunha, Luis A. B. Kowada, Rodrigo Hausen).

The generalized split probe problem
Proceedings of LAGOS 2013,
LatinAmerican Algorithms, Graphs and Optimization Symposium, Electronic
Notes in Discrete Mathematics
44 (2013) 3945
(with
Simone Dantas, Luerbio Faria, Rafael B. Teixeira).

On total coloring and equitable total coloring of cubic graphs with large girth
Proceedings of CTW 2013, CologneTwente Workshop on Graphs and Combinatorial
Optimization
(with Diana Sasaki, Myriam Preissmann, Simone Dantas, Giuseppe Mazzuoccolo, Vinícius F. Dos Santos)

Linear time approximation for dominating sets and independent dominating sets in unit disk graphs
Proceedings of 10th Workshop on Approximation and Online Algorithms
WAOA 2012,
Lecture Notes in Computer Science
7846 (2013) 8292
(with Vinícius Gusmão P. de Sá, Guilherme Fonseca, Raphael Machado).

Transposition diameter and lonely permutations
Proceedings of Brazilian Symposium on Bioinformatics BSB 2012,
Lecture Notes in Computer Science, Sublibrary: Lecture Notes in
Bioinformatics
7409 (2012) 112
(with Luis Felipe Cunha, Luis A. B. Kowada, Rodrigo Hausen).

Bicliquecolouring powers of paths and powers of cycles
Proceedings of CTW 2012, CologneTwente Workshop on Graphs and Combinatorial
Optimization
(with
Helio Macedo Filho, Simone Dantas,
Raphael Machado.).

Finding Type 2 snarks with squares is not trivial
Proceedings of CTW 2012, CologneTwente Workshop on Graphs and Combinatorial
Optimization
(with Diana Sasaki, Myriam Preissmann, Simone Dantas)

Cliquecolouring and bicliquecolouring unichordfree graphs
Proceedings of LATIN 2012, Lecture Notes in Computer Science
7256 (2012) 530541
(with
Raphael Machado,
Helio Macedo Filho).

Split clique graph complexity
Proceedings of WG 2011, Lecture Notes in Computer Science
6986 (2011) 1122
(with
Liliana Alcon,
Luerbio Faria,
Marisa Gutierrez).

Analysis and implementation of sorting by transpositions using permutation trees
Proceedings of Brazilian Symposium on Bioinformatics BSB 2011,
Lecture Notes in Computer Science, Sublibrary: Lecture Notes in
Bioinformatics
6832 (2011) 4249
(with
Marcelo P. Lopes, Marilia D. V. Braga, Rodrigo de A. Hausen, Luis Antonio
B. Kowada).

Hamiltonian cycles in
Kneser graphs for n=2k+2
Proceedings of LAGOS 2011,
LatinAmerican Algorithms, Graphs and Optimization Symposium, Electronic
Notes in Discrete Mathematics
37 (2011) 291296
(with
Leticia Rodrigues Bueno, Luerbio Faria, Candido F. Xavier de Mendonça Neto,
Rodrigo Hausen).

On coloring problems of
snark families
Proceedings of LAGOS 2011,
LatinAmerican Algorithms, Graphs and Optimization Symposium, Electronic
Notes in Discrete Mathematics
37 (2011) 4550
(with
Diana Sasaki,
Simone Dantas).

Bounds on the
transposition distance for lonely permutations
Proceedings of Brazilian Symposium on Bioinformatics BSB 2010,
Lecture Notes in Computer Science, Sublibrary: Lecture Notes in
Bioinformatics
6268 (2010) 3546
(with
Rodrigo Hausen,
Luis Antonio B. Kowada).

Chromatic index of chordless graphs
Proceedings of CTW 2010 CologneTwente Workshop on Graphs and Combinatorial
Optimization
(with
Raphael Machado
and
Nicolas Trotignon).

On breadth first search and graph diameter bounds
Proceedings of ALIOINFORMS Joint International Meeting 2010
(with
Raphael Machado).

Complexity dichotomy
on degreeconstrained VLSI layouts with unitlength edges
Proceedings of ISCO 2010, International Symposium on Combinatorial
Optimization, Electronic Notes in Discrete Mathematics
36 (2010) 391398
(with
Vinícius Gusmão P. de Sá,
Guilherme Fonseca,
Raphael Machado).

Total chromatic
number of {square,unichord}free graphs
Proceedings of ISCO 2010, International Symposium on Combinatorial
Optimization, Electronic Notes in Discrete Mathematics
36 (2010) 671678
(with
Raphael Machado).

Advances on the list stubborn problem
Proceedings of CATS 2010, Computing: The Australasian Theory Symposium
Brisbane, Australia
(with
Simone Dantas,
Luerbio Faria,
Sulamita Klein,
Loana Tito Nogueira,
Fabio Protti).

Edgecolouring subject to local restrictions
Proceedings of Lagos 2009, LatinAmerican Algorithms,
Graphs and Optimization Symposium
(with
Raphael Machado).

Skew partition
sandwich problem is NPcomplete
Proceedings of Lagos 2009, LatinAmerican Algorithms,
Graphs and Optimization Symposium, Electronic Notes in Discrete Mathematics
35 (2009) 914
(with
Rafael B. Teixeira,
Simone Dantas).

NPcompleteness of determining the total chromatic number of graphs that
do not contain a cycle with a unique chord
Proceedings of CologneTwente Workshop on Graphs and Combinatorial
Optimization 2009
(with
Raphael Machado).

Edgecoloring graphs with no cycle with a unique chord
Proceedings of VI ALIO/EURO Workshop on Applied Combinatorial Optimization
(with
Raphael Machado,
Kristina Vuskovic).

The external constraint 4 nonempty part sandwich problem
Proceedings of CLAIO 2008
(with
Rafael B. Teixeira,
Simone Dantas).

On the
toric graph as a tool to handle the problem of sorting by
transpositions
Proceedings of Brazilian Symposium on Bioinformatics BSB 2008, Lecture
Notes in Computer Science, Sublibrary: Lecture Notes in Bioinformatics
5167 (2008) 7991
(with
Rodrigo Hausen,
Luerbio Faria,
Luis Antonio B. Kowada).

A decomposition for totalcoloring graphs of maximum degree 3
Proceedings of CologneTwente Workshop 2008
(with
Raphael Machado).

On maximizing
clique, cliqueHelly, and hereditary cliqueHelly induced
subgraphs
Proceedings of Lagos 2007, LatinAmerican Algorithms,
Graphs and Optimization Symposium, Electronic Notes in Discrete Mathematics
30 (2008) 147152
(with
Liliana Alcon,
Luerbio Faria,
Marisa Gutierrez).

2K2 vertexset
partition into nonemptyparts
Proceedings of Lagos 2007, LatinAmerican Algorithms,
Graphs and Optimization Symposium, Electronic Notes in Discrete Mathematics
30 (2008) 291296
(with
Simone Dantas,
Elaine Eschen,
Luerbio Faria,
Sulamita Klein).

The polynomial
dichotomy for three nonempty part sandwich problems
Proceedings of Lagos 2007, LatinAmerican Algorithms,
Graphs and Optimization Symposium, Electronic Notes in Discrete Mathematics
30 (2008) 8186
(with
Rafael B. Teixeira,
Simone Dantas).

Sufficient conditions
for a graph to be edgecolorable with maximum degree colors
Proceedings of Lagos 2007, LatinAmerican Algorithms,
Graphs and Optimization Symposium, Electronic Notes in Discrete Mathematics
30 (2008) 6974
(with
Raphael Machado).

Clique graph recognition
is NPcomplete
Proceedings of WG 2006, Lecture Notes in Computer Science
4271 (2006) 269277
(with
Liliana Alcon,
Luerbio Faria,
Marisa Gutierrez).

Loop graphs and
asteroidal sets
Proceedings of 7th International Colloquium on Graph Theory, ICGT '05,
Electronic Notes in Discrete Mathematics
22 179183 (2005)
(with
Liliana Alcon,
Márcia R. Cerioli,
João Meidanis
and
Marisa Gutierrez).

Non loop graphs
with induced cycles
Proceedings of Brazilian Symposium on Graphs, Algorithms
and Combinatorics, Electronic Notes in Discrete Mathematics
19 289295 (2005)
(with
Liliana Alcon,
Márcia R. Cerioli,
João Meidanis
and
Marisa Gutierrez).

Tree loop graphs
Proceedings of LACGA 2004, Electronic Notes in Discrete Mathematics
18 1723 (2004)
(with
Liliana Alcon,
Márcia R. Cerioli,
João Meidanis
and
Marisa Gutierrez).

The sandwich problem for cutsets
Proceedings of LACGA 2004,
Electronic Notes in Discrete Mathematics
18 219225 (2004)
(with
Rafael B. Teixeira).

Nonplanar vertex deletion: maximum degree thresholds for NP/Max SNPhardness and a 3/4approximation for
finding maximum planar induced subgraphs
Proceedings of LACGA 2004,
Electronic Notes in Discrete Mathematics
18 121126 (2004)
(with
Jorge Stolfi,
Candido F. Xavier de Mendonça
Neto,
and
Luerbio Faria).

On the generation of
bicliques of a graph
Proceedings of CTW 2004, Electronic Notes in Discrete Mathematics
17 123127 (2004)
(with
Vania Dias,
Jayme
Szwarcfiter).

Faster deterministic and randomized algorithms on the Homogeneous Set Sandwich Problem
Proceedings of WEA 2004, Lecture Notes in Computer Science
3059 (2004) 243252
(with
Guilherme Fonseca,
Vinicius G. P. de Sá,
Jeremy Spinrad).

Simple maxcut for splitindifference graphs and graphs with few P4's
Proceedings of WEA 2004, Lecture Notes in Computer Science
3059 (2004) 8799
(with
Hans L. Bodlaender,
Marisa Gutierrez,
Ton Kloks,
Rolf Niedermeier).

An improved upper bound on the crossing number of the
hypercube
Proceedings of WG 2003, Lecture Notes in Computer Science
2880 (2003) 230236
(with
Luerbio Faria,
Ondrej Sykora
and
Imrich Vrto).

On the complexity of (k,l)graph sandwich problems
Proceedings of WG 2002, Lecture Notes in Computer Science
2573 (2002) 92101
(with
Luerbio Faria
and
Simone Dantas).

Bullreducible
Berge graphs are perfect
Proceedings of Comb01, EuroConference on Combinatorics, Graph Theory and
Applications,
Electronic Notes in Discrete Mathematics 10 (2001) 13
(with
Hazel Everett,
Sulamita Klein,
and
Bruce Reed).

Stable marriages
with restricted pairs
Proceedings of Brazilian Symposium on Graphs, Algorithms and
Combinatorics,
Electronic Notes in Discrete Mathematics 7 (2001) 14
(with
Vania Felix Dias,
Guilherme Dias da Fonseca,
and
Jayme
Szwarcfiter).

On the complexity of the approximation of nonplanarity parameters for
cubic graphs
Proceedings of Brazilian Symposium on Graphs,
Algorithms and Combinatorics,
Electronic Notes in Discrete Mathematics 7 (2001) 14
(with
Luerbio Faria
and
Candido F. Xavier de Mendonça
Neto).

The graph sandwich
problem for 1join composition is NPcomplete
Proceedings of 6th International Conference on Graph Theory,
Electronic Notes in Discrete Mathematics 5 (2000) 8992
(with
Sulamita Klein
and
Kristina Vuskovic).

Edge colouring reduced
indifference graphs
Proceedings of LATIN 2000,
Lecture Notes in Computer Science 1776 (2000) 145153
(with
Célia Mello
and
Carmen Ortiz).

Finding skew partitions
efficiently
Proceedings of LATIN 2000,
Lecture Notes in Computer Science 1776 (2000) 163172
(with
Sulamita Klein,
Yoshiharu Kohayakawa,
and
Bruce Reed).

Lineartime
algorithms for maximum sets of sources and sinks
Proceedings of 6th Twente Workshop on Graphs and Combinatorial
Optimization, Electronic Notes in Discrete Mathematics
3 230234 (1999)
(with
John Gimbel,
Célia Mello,
and
Jayme Szwarcfiter).

Optimal nodedegree bounds for the complexity of nonplanarity parameters
Proceedings of SODA'99,
Tenth Annual ACMSIAM Symposium on Discrete Algorithms (1999) 887888
(with
Luerbio Faria
and
Candido F. Xavier de Mendonça Neto).

Splitting number is NPcomplete
Proceedings of WG'98,
Lecture Notes in Computer Science 1517 (1998) 285297
(with
Luerbio Faria
and
Candido F. Xavier de Mendonça Neto).

The splitting number of the 4cube
Proceedings of LATIN'98,
Lecture Notes in Computer Science 1380 (1998) 141150
(with
Luerbio Faria
and
Candido F. Xavier de Mendonça Neto).

On the edgecolouring of split graphs
Proceedings of SEMISH 96,
XXIII Seminário Integrado de Software e Hardware, 415420
(with
João Meidanis
and
Célia Mello).

Even pairs and bullfree perfect graphs
Proceedings of VII Quadrennial International Conference on
the Theory and Applications of Graphs,
Edited by Y. Alavi and A. Schwenk,
Volume I, 391401, Wiley Interscience, 1995.

On edgecolouring
indifference graphs
Proceedings of LATIN'95,
Lecture Notes in Computer Science 911 (1995) 286299
(with
João Meidanis
and
Célia Mello).
Book chapters

Total colouring
by C.M.H. de Figueiredo.
In:
L. W. Beineke, M. C. Golumbic, R. J. Wilson (eds.),
Topics in Algorithmic Graph Theory,
Encyclopedia of Mathematics and its Applications,
Cambridge University Press, 2021.

Even pairs in bullreducible graphs
by C.M.H. de Figueiredo, Frédéric Maffray
and
Cláudia R. Villela Maciel.
In:
L. RamirezAlfonsin and A. Bondy (eds.),
Trends in Mathematics, Birkhauser Verlag, 2006, pp. 179195.

Even pairs
by
H. Everett, C.M.H. de Figueiredo, C. Linhares Sales, F. Maffray, O. Porto,
B. Reed.
In:
L. RamirezAlfonsin and B.A. Reed (eds.),
Perfect Graphs, Wiley, 2001, pp. 6792.