Publications

• Book chapters
• Papers in refereed journals
• Papers in refereed conferences
• Papers submitted for publication

See also my list in Mathematical Reviews, my Lattes CV and my Google Scholar page.

Book chapters

• "Even pairs in bull-reducible graphs", by C.M.H. de Figueiredo, Frédéric Maffray and Cláudia R. Villela Maciel. In: L. Ramirez-Alfonsin and A. Bondy (Eds.), Trends in Mathematics, Birkhauser Verlag, 2006, pp. 179-195.
• "Even pairs", by H. Everett, C.M.H. de Figueiredo, C. Linhares Sales, F. Maffray, O. Porto, B. Reed. In: L. Ramirez-Alfonsin and B.A. Reed (Eds.), Perfect Graphs, Wiley, 2001, pp. 67-92.

Papers in refereed journals

• "The total chromatic number of split-indifference graphs", to appear in Discrete Mathematics (with Christiane Neme Campos, Raphael Machado, Célia Mello).
• "The P vs. NP-complete dichotomy of some challenging problems in graph theory", to appear in Discrete Applied Mathematics.
• "Complexity of colouring problems restricted to unichord-free and {square,unichord}-free graphs", to appear in Discrete Applied Mathematics (with Raphael Machado, Nicolas Trotignon).
• "Complexity separating classes for edge-colouring and total-colouring", Journal of the Brazilian Computer Society 17 (2011) 281-285 (with Raphael Machado).
• "Total-chromatic number of unichord-free graphs", Discrete Applied Mathematics 159 (2011) 1851-1864 (with Raphael Machado).
• "On the forbidden induced subgraph sandwich problem", Discrete Applied Mathematics 159 (2011) 1717-1725 (with Simone Dantas, Murilo V. G. Da Silva, Rafael B. Teixeira).
• "The chain graph sandwich problem", Annals of Operations Research 188 (2011) 133-139 (with Simone Dantas, Martin Charles Golumbic, Sulamita Klein, Frédéric Maffray).
• "A decomposition for total-colouring partial-grids and list-total-colouring outerplanar graphs", Networks 57 (2011) 261-269 (with Raphael Machado).
• "Complexity dichotomy on partial grid recognition", Theoretical Computer Science 412 (2011) 2370-2379 (with Vinícius Gusmão P. de Sá, Guilherme Fonseca, Raphael Machado).
• "Transitive orientations in bull-reducible Berge graphs", Discrete Applied Mathematics 159 (2011) 561-573 (with Frédéric Maffray, Cláudia R. Villela Maciel).
• "The external constraint 4 nonempty part sandwich problem", Discrete Applied Mathematics 159 (2011) 661-673 (with Rafael B. Teixeira, Simone Dantas).
• "Chromatic index of graphs with no cycle with a unique chord", Theoretical Computer Science 411 (2010) 1221-1234 (with Raphael Machado, Kristina Vuskovic).
• "Unitary toric classes, the reality and desire diagram, and sorting by transpositions", SIAM Journal on Discrete Mathematics 24 (2010) 792-807 (with Rodrigo Hausen, Luerbio Faria, Luis Antonio B. Kowada).
• "The polynomial dichotomy for three nonempty part sandwich problems", Discrete Applied Mathematics 158 (2010) 1286-1304 (with Rafael B. Teixeira, Simone Dantas).
• "2K2 vertex-set partition into nonemptyparts", Discrete Mathematics 310 (2010) 1259-1264 (with Simone Dantas, Elaine Eschen, Luerbio Faria, Sulamita Klein).
• "Decompositions for edge-coloring join graphs and cobipartite graphs", Discrete Applied Mathematics 158 (2010) 1336-1342 (with Raphael Machado).
• "On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs", Discrete Applied Mathematics 158 (2010) 1279-1285 (with Liliana Alcon, Luerbio Faria, Marisa Gutierrez).
• "Enclosing weighted points with an almost-unit ball", Information Processing Letters 109 (2009) 1216-1221 (with Guilherme Fonseca).
• "Hamiltonian paths in odd graphs", Applicable Analysis and Discrete Mathematics 3 (2009) 386-394 (with Luerbio Faria, Guilherme Fonseca, Leticia Rodrigues Bueno).
• "Skewness, splitting number and vertex deletion of some toroidal meshes", Ars Combinatoria 92 (2009) 53-65 (with Luerbio Faria, Candido F. Xavier de Mendonça Neto, Jorge Stolfi).
• "The complexity of clique graph recognition", Theoretical Computer Science 410 (2009) 2072-2083 (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) 45-52 (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) 145-161 (with Luerbio Faria, Ondrej Sykora, Imrich Vrto).
• "A new quantum algorithm to solve the minimum searching problem", International Journal of Quantum Information 6 (2008) 427-436 (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) 57-67 (with Luerbio Faria, R. Sritharan, Sulamita Klein).
• "On the generation of bicliques of a graph", Discrete Applied Mathematics 155 (2007) 1826-1832 (with Vania Dias, Jayme Szwarcfiter).
• "Cycles and asteroidal sets in loop graphs", Actas de la Academia Nacional de Ciencias, Argentina 13 (2007) 41-49 (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) 686-694 (with Liliana Alcon, Márcia R. Cerioli, João Meidanis and Marisa Gutierrez).
• "Reversible Karatsuba's Algorithm", Journal of Universal Computer Science 12 (2006) 499-511 (with Luis Antonio B. Kowada, Renato Portugal).
• "The pair completion algorithm for the homogeneous set sandwich problem", Information Processing Letters 98 (2006) 87-91 (with Claudson Bornstein, Vinicius G. P. de Sá).
• "On maximum planar induced subgraphs", Discrete Applied Mathematics 154 (2006) 1774-1782 (with Luerbio Faria, Sylvain Gravier, Candido F. Xavier de Mendonça Neto, Jorge Stolfi).
• "The sandwich problem for cutsets: clique cutset, k-star cutset", Discrete Applied Mathematics 154 (2006) 1791-1798 (with Rafael B. Teixeira).
• "Algorithms for the homogeneous set sandwich problem", Algorithmica 46 (2006) 149-180 (with Guilherme Fonseca, Vinicius G. P. de Sá, Jeremy Spinrad).
• "A characterization of P4-comparability graphs", Discrete Mathematics 306 (2006) 2461-2472 (with Chinh T. Hoang and Frédéric Maffray).
• "Extended skew partition problem", Discrete Mathematics 306 (2006) 2438-2449 (with Simone Dantas, Sylvain Gravier and Sulamita Klein).
• "Generating bicliques of a graph in lexicographic order", Theoretical Computer Science 337 (2005) 240-248 (with Vania Dias, Jayme Szwarcfiter).
• "The non planar vertex deletion of C_n x C_m", Ars Combinatoria 76 (2005) 3-28 (with Jorge Stolfi, Candido F. Xavier de Mendonça Neto, and Luerbio Faria).
• "The perfection and recognition of bull-reducible Berge graphs", RAIRO-Theoretical Informatics and Applications 39 (2005) 145-160 (with Hazel Everett, Sulamita Klein, Bruce Reed).
• "Finding H-partitions efficiently", RAIRO-Theoretical Informatics and Applications 39 (2005) 133-144 (with Simone Dantas, Sylvain Gravier and Sulamita Klein).
• "Note on the Homogeneous Set Sandwich Problem", Information Processing Letters 93 (2005) 75-81 (with Vinicius G. P. de Sá).
• "Optimizing bull-free perfect graphs", SIAM Journal on Discrete Mathematics 18 (2004) 226-240 (with Frédéric Maffray).
• "On decision and optimization (k,l)-graph sandwich problems", Discrete Applied Mathematics 143 (2004) 155-165 (with Luerbio Faria and Simone Dantas).
• "Stable skew partition problem", Discrete Applied Mathematics 143 (2004) 17-22 (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) 119-134 (with Luerbio Faria and Candido F. Xavier de Mendonça Neto).
• "Kinetic hanger", Information Processing Letters 89 (2004) 151-157 (with Guilherme Fonseca and Paulo C. P. Carvalho).
• "The stable marriage problem with restricted pairs", Theoretical Computer Science 306 (2003) 391-405 (with Vania Dias, Guilherme Fonseca and Jayme Szwarcfiter).
• "Decompositions for the edge colouring of reduced indifference graphs", Theoretical Computer Science 297 (2003) 145-155 (with João Meidanis, Célia Mello, and Carmen Ortiz).
• "Kinetic heap-ordered trees: tight analysis and improved algorithms", Information Processing Letters 85 (2003) 165-169 (with Guilherme Fonseca).
• "The graph sandwich problem for 1-join composition is NP-complete", Discrete Applied Mathematics 121 (2002) 73-82 (with Sulamita Klein and Kristina Vuskovic).
• "A note on transitive orientations with maximum sets of sources and sinks", Discrete Applied Mathematics 120 (2002) 91-95 (with Jayme Szwarcfiter, Célia Mello, and John Gimbel).
• "The splitting number and skewness of C_n x C_m", Ars Combinatoria 63 (2002) 193-205 (with Érico F. Xavier, Karl Schaffer, Jorge Stolfi, Candido F. Xavier de Mendonça Neto, and Luerbio Faria).
• "On the structure of bull-free perfect graphs, 2: the weakly triangulated case", Graphs and Combinatorics 17 (2001) 435-456 (with Frédéric Maffray and Oscar Porto).
• "Recognition of quasi-Meyniel graphs", Discrete Applied Mathematics 113 (2001) 255-260 (with Kristina Vuskovic).
• "On Tucker's proof of the Strong Perfect Graph Conjecture for (K₄ - e)-free graphs", Discrete Mathematics 232 1-3 (2001) 105-108 (with Sylvain Gravier and Cláudia Linhares Sales).
• "Splitting number is NP-complete", Discrete Applied Mathematics 108 (2001) 65-83 (with Luerbio Faria and Candido F. Xavier de Mendonça Neto).
• "Finding skew partitions efficiently", Journal of Algorithms 37 (2000) 505-521 (with Sulamita Klein, Yoshiharu Kohayakawa, and Bruce Reed).
• "On Eggleton and Guy conjectured upper bound for the crossing number of the n-cube", Mathematica Slovaca 50 (2000) 271-287 (with Luerbio Faria).
• "A class of beta-perfect graphs", Discrete Mathematics 216 (2000) 169-193 (with Kristina Vuskovic).
• "Local conditions for edge-coloring", Journal of Combinatorial Mathematics and Combinatorial Computing 32 (2000) 79-91 (with João Meidanis and Célia Mello).
• "Total chromatic number and chromatic index of dually chordal graphs", Information Processing Letters 70 (1999) 147-152 (with João Meidanis and Célia Mello).
• "Even and odd pairs in comparability and in P4-comparability graphs", Discrete Applied Mathematics 91 (1999) 293-297 (with Jayme Szwarcfiter, Célia Mello, and John Gimbel).
• "The homogeneous set sandwich problem", Information Processing Letters 67 (1998) 31-35 (with Hazel Everett, Sulamita Klein, and Márcia R. Cerioli).
• "Sources and sinks in comparability graphs", Order 14 (1997) 75-83 (with John Gimbel, Célia Mello, and Jayme Szwarcfiter).
• "On edge-colouring indifference graphs", Theoretical Computer Science 181 (1997) 91-106 (with João Meidanis and Célia Mello).
• "Path parity and perfection", Discrete Mathematics 165/166 (1997) 233-252 (with Hazel Everett, Frédéric Maffray, and Bruce Reed).
• "On the structure of bull-free perfect graphs", Graphs and Combinatorics 13 (1997) 31-55 (with Frédéric Maffray and Oscar Porto).
• "The NP-completeness of multi-partite cutset testing", Congressus Numerantium 119 (1996) 217-222 (with Sulamita Klein).
• "A linear-time algorithm for proper interval graph recognition", Information Processing Letters 56 (1995) 179-184 (with João Meidanis and Célia Mello).
• "A greedy method for edge-colouring odd maximum degree doubly chordal graphs", Congressus Numerantium 111 (1995) 170-176 (with João Meidanis and Célia Mello).
• "Split-indifference graphs", Investigación Operativa 3 (1993) 61-68 (with Célia Mello, Carmen Ortiz, and Mónica Villanueva).
• "On transitive orientations with prescribed sources and sinks", Congressus Numerantium 98 (1993) 191-198 (with Jayme Szwarcfiter and Célia Mello).
• "Ordens indiferença", Pesquisa Operacional 11 (1991) 43-47 (with Jayme Szwarcfiter, Sulamita Klein, and Célia Mello).

Papers in refereed conferences

• "Clique-colouring and biclique-colouring unichord-free graphs", to appear in Proceedings of LATIN 2012, Lecture Notes in Computer Science (with Raphael Machado, Helio Macedo Filho).
• "Split clique graph complexity", Proceedings of WG 2011, Lecture Notes in Computer Science 6986 (2011) 11-22 (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) 42-49 (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, Latin-American Algorithms, Graphs and Optimization Symposium, Electronic Notes in Discrete Mathematics 37 (2011) 291-296 (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, Latin-American Algorithms, Graphs and Optimization Symposium, Electronic Notes in Discrete Mathematics 37 (2011) 45-50 (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) 35-46 (with Rodrigo Hausen, Luis Antonio B. Kowada).
• "Chromatic index of chordless graphs", Proceedings of CTW 2010 Cologne-Twente Workshop on Graphs and Combinatorial Optimization (with Raphael Machado and Nicolas Trotignon).
• "On breadth first search and graph diameter bounds", Proceedings of ALIO-INFORMS Joint International Meeting 2010 (with Raphael Machado).
• "Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges", Proceedings of ISCO 2010, International Symposium on Combinatorial Optimization, Electronic Notes in Discrete Mathematics 36 (2010) 391-398 (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) 671-678 (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).
• "Edge-Colouring Subject to Local Restrictions", Proceedings of Lagos 2009, Latin-American Algorithms, Graphs and Optimization Symposium (with Raphael Machado).
• "Skew partition sandwich problem is NP-complete", Proceedings of Lagos 2009, Latin-American Algorithms, Graphs and Optimization Symposium, Electronic Notes in Discrete Mathematics 35 (2009) 9-14 (with Rafael B. Teixeira, Simone Dantas).
• "NP-completeness of determining the total chromatic number of graphs that do not contain a cycle with a unique chord", Proceedings of Cologne-Twente Workshop on Graphs and Combinatorial Optimization 2009 (with Raphael Machado).
• "Edge-coloring 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) 79-91 (with Rodrigo Hausen, Luerbio Faria, Luis Antonio B. Kowada).
• "A decomposition for total-coloring graphs of maximum degree 3", Proceedings of Cologne-Twente Workshop 2008 (with Raphael Machado).
• "On maximizing clique, clique-Helly, and hereditary clique-Helly induced subgraphs", Proceedings of Lagos 2007, Latin-American Algorithms, Graphs and Optimization Symposium, Electronic Notes in Discrete Mathematics 30 (2008) 147-152 (with Liliana Alcon, Luerbio Faria, Marisa Gutierrez).
• "2K2 vertex-set partition into nonemptyparts", Proceedings of Lagos 2007, Latin-American Algorithms, Graphs and Optimization Symposium, Electronic Notes in Discrete Mathematics 30 (2008) 291-296 (with Simone Dantas, Elaine Eschen, Luerbio Faria, Sulamita Klein).
• "The polynomial dichotomy for three nonempty part sandwich problems", Proceedings of Lagos 2007, Latin-American Algorithms, Graphs and Optimization Symposium, Electronic Notes in Discrete Mathematics 30 (2008) 81-86 (with Rafael B. Teixeira, Simone Dantas).
• "Sufficient conditions for a graph to be edge-colorable with maximum degree colors", Proceedings of Lagos 2007, Latin-American Algorithms, Graphs and Optimization Symposium, Electronic Notes in Discrete Mathematics 30 (2008) 69-74 (with Raphael Machado).
• "Clique graph recognition is NP-complete", Proceedings of WG 2006, Lecture Notes in Computer Science 4271 (2006) 269-277 (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 179-183 (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 289-295 (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 17-23 (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 219-225 (2004) (with Rafael B. Teixeira).
• "Nonplanar vertex deletion: maximum degree thresholds for NP/Max SNP-hardness and a 3/4-approximation for finding maximum planar induced subgraphs", Proceedings of LACGA 2004, Electronic Notes in Discrete Mathematics 18 121-126 (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 123-127 (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) 243-252 (with Guilherme Fonseca, Vinicius G. P. de Sá, Jeremy Spinrad).
• "Simple max-cut for split-indifference graphs and graphs with few P4's", Proceedings of WEA 2004, Lecture Notes in Computer Science 3059 (2004) 87-99 (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) 230-236 (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) 92-101 (with Luerbio Faria and Simone Dantas).
• "Bull-reducible Berge graphs are perfect", Proceedings of Comb01, EuroConference on Combinatorics, Graph Theory and Applications, Electronic Notes in Discrete Mathematics 10 (2001) 1-3 (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) 1-4 (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) 1-4 (with Luerbio Faria and Candido F. Xavier de Mendonça Neto).
• "The graph sandwich problem for 1-join composition is NP-complete", Proceedings of 6th International Conference on Graph Theory, Electronic Notes in Discrete Mathematics 5 (2000) 89-92 (with Sulamita Klein and Kristina Vuskovic).
• "Edge colouring reduced indifference graphs", Proceedings of LATIN 2000, Lecture Notes in Computer Science 1776 (2000) 145-153 (with Célia Mello and Carmen Ortiz).
• "Finding skew partitions efficiently", Proceedings of LATIN 2000, Lecture Notes in Computer Science 1776 (2000) 163-172 (with Sulamita Klein, Yoshiharu Kohayakawa, and Bruce Reed).
• "Linear-time algorithms for maximum sets of sources and sinks", Proceedings of 6th Twente Workshop on Graphs and Combinatorial Optimization, Electronic Notes in Discrete Mathematics 3 230-234 (1999) (with John Gimbel, Célia Mello, and Jayme Szwarcfiter).
• "Optimal node-degree bounds for the complexity of nonplanarity parameters", Proceedings of SODA'99, Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (1999) 887-888 (with Luerbio Faria and Candido F. Xavier de Mendonça Neto).
• "Splitting number is NP-complete", Proceedings of WG'98, Lecture Notes in Computer Science 1517 (1998) 285-297 (with Luerbio Faria and Candido F. Xavier de Mendonça Neto).
• "The splitting number of the 4-cube", Proceedings of LATIN'98, Lecture Notes in Computer Science 1380 (1998) 141-150 (with Luerbio Faria and Candido F. Xavier de Mendonça Neto).
• "On the edge-colouring of split graphs", Proceedings of SEMISH 96, XXIII Seminário Integrado de Software e Hardware, 415-420 (with João Meidanis and Célia Mello).
• "Even pairs and bull-free perfect graphs", Proceedings of VII Quadrennial International Conference on the Theory and Applications of Graphs, Edited by Y. Alavi and A. Schwenk, Volume I, 391-401, Wiley Interscience, 1995.
• "On edge-colouring indifference graphs", Proceedings of LATIN'95, Lecture Notes in Computer Science 911 (1995) 286-299 (with João Meidanis and Célia Mello).

Papers submitted for publication

• "Split clique graph complexity", submitted to Theoretical Computer Science (with Liliana Alcon, Luerbio Faria, Marisa Gutierrez).
• "Biclique-colouring powers of cycles", submitted to Proceedings of ISCO 2012, Lecture Notes in Computer Science (with Helio Macedo Filho, Simone Dantas, Raphael Machado.).
• "The hunting of a snark with total chromatic number 5", submitted to Discrete Applied Mathematics (with Diana Sasaki, Simone Dantas, Myriam Preissmann).
• "Hamiltonian cycles in sparse Kneser graphs", submitted to Discrete Applied Mathematics (with Letícia R. Bueno, Luerbio Faria, Rodrigo Hausen).
• "Hamiltonian cycles in prefix transposition rearrangement graphs", submitted to Discrete Mathematics (with Caroline S. Reis, Luis A. B. Kowada, Letícia R. Bueno).
• "Edge-colouring and total-colouring chordless graphs", submitted to Discrete Applied Mathematics (with Raphael Machado, Nicolas Trotignon).
• "Skew partition sandwich problem is NP-complete", submitted to Discrete Applied Mathematics (with Rafael B. Teixeira, Simone Dantas).
• "Generating MAX3SAT random instances for a given optimum value", submitted to Discrete Applied Mathematics (with Luerbio Faria, Andre Guedes, Carlos Martinhon).