Laminar Tight Cuts in Matching Covered Graphs, Journal of Combinatorial Theory (B), 150, 177-194, 2021 (co-authorship with Guantao Chen, Xing Feng, Fuliang Lu and Lianzhu Zhang)

On essentially 4-edge-connected cubic bricks, The Electronic Journal of Combinatorics, 27(1), #P1.22, 2020
(co-authorship with Nishad Kothari, Marcelo Henriques de Carvalho and Charles H. C. Little)

On Two Unsolved Problems Concerning Matching Covered Graphs, SIAM J. Discrete Math., 32, 1478-1504, 2018
(co-authorship with Marcelo Henriques de Carvalho, Nishad Kothari and U. S. R. Murty)

On Tight Cuts in Matching Covered Graphs, Journal of Combinatorics, 9, 163-184, 2018
(co-authorship with Marcelo Henriques de Carvalho and U. S. R. Murty)

Thin Edges in Braces, Electronic Journal of Combinatorics, 22, paper #P4.14, 1-38, 2015
(co-authorship with Marcelo Henriques de Carvalho and U. S. R. Murty)

Hypohamiltonian Snarks Have a 5-Flow, Electronic Notes in Discrete Mathematics, 50, 199-204, 2015
(co-authorship with Breno Lima de Freitas and Cândida Nunes da Silva)

3-Flows and Combs, Journal of Graph Theory, 77, 260-277, 2014
(co-authorship with Cândida Nunes da Silva)

Snarks and Flow-Critical Graphs, Electronic Notes in Discrete Mathematics, 44, 299-305, 2013
(co-authorship with Cândida Nunes da Silva and Lissa Pesci)

A Characterization of PM-Compact Bipartite and Near-Bipartite Graphs, Discrete Mathematics, 313, 772-783, 2013
(co-authorship with Xiumei Wang, Yixun Lin, Marcelo H. Carvalho, G. Sanjith and C. H. C. Little)

On the Number of Perfect Matchings in a Bipartite Graph (technical report) , SIAM Journal on Discrete Mathematics, 27, 940-958, 2013
(co-authorship with Marcelo H. de Carvalho and U. S. R. Murty)

A Generalization of Little's Theorem on Pfaffian Graphs, Journal of Combinatorial Theory (B), 102, 1241-1266, 2012
(co-authorship with Marcelo H. de Carvalho and U. S. R. Murty)

Contributions of Jayme Luiz Szwarcfiter to Graph Theory and Computer Science, J. Braz. Comput. Soc., 18, 2012

Matching Signatures and Pfaffian Graphs, Discrete Mathematics, 311, 289-294, 2011
(co-authorship with Alberto Alexandre Assis Miranda)

A Lower Bound on the Number of Removable Ears of 1-Extendable Graphs, Discrete Mathematics, 310, 1123-1126, 2010
(co-authorship with Shaoui Zhai and XiaoFeng Guo)

Recognizing Near-Bipartite Pfaffian Graphs in Polynomial Time, Discrete Applied Mathematics, 158, 1275-1278, 2010
(co-authorship with Alberto A. A. Miranda)

How to Build a Brick, Discrete Mathematics, 306, 2383-2410, 2006
(co-authorship with M. H. de Carvalho and U. S. R. Murty)

A Pair of Forbidden Subgraphs and Perfect Matchings, Journal of Combinatorial Theory (B), 96, 315-324, 2006
(co-authorship with Shinya Fujita, Ken-Ichi Kawarabayashi, Katsuhiro Ota, Michael D. Plummer and Akira Saito)

Graphs with Independent Perfect Matchings, Journal of Graph Theory, 48, 19-50, 2005
(co-authorship with M. H. de Carvalho and U. S. R. Murty)

On the Number of Dissimilar Pfaffian Orientations of Graphs, Theoretical Informatics and Applications, 39, 93-113, 2005
(co-authorship with M. H. de Carvalho and U. S. R. Murty)

The Perfect Matching Polytope and Solid Bricks, Journal of Combinatorial Theory (B), 92, 319-324, 2004
(co-authorship with M. H. de Carvalho and U. S. R. Murty)

On a Conjecture of Lovász Concerning Bricks. I. The Characteristic of a Matching Covered Graph, Journal of Combinatorial Theory (B), 85, 94-136, 2002
(co-authorship with M. H. de Carvalho and U. S. R. Murty)

On a Conjecture of Lovász Concerning Bricks. II. Bricks of Finite Characteristic, Journal of Combinatorial Theory (B), 85, 137-180, 2002
(co-authorship with M. H. de Carvalho and U. S. R. Murty)

Optimal Ear Decompositions of Matching Covered Graphs and Bases for the Matching Lattice, Journal of Combinatorial Theory (B), 85, 59-93, 2002
(co-authorship with M. H. de Carvalho and U. S. R. Murty)

Ear Decompositions of Matching Covered Graphs, Combinatorica, 19, 151-174, 1999
(co-authorship with M. H. de Carvalho and U. S. R. Murty)

On Clique-Complete Graphs, Discrete Mathematics, 183, 247-254, 1998
(co-authorship with C. P. de Mello and J. L. Szwarcfiter)

On the Connection between the Undirected and the Acyclic Directed Two Disjoint Paths Problem, Ars Combinatoria, 47, 191-200, 1997
(co-authorship with M. C. M. T. Giglio)

An (l,u)-Transversal Theorem for Bipartite Graphs, Congressus Numerantium, 113, 247-256, 1996
(co-authorship with D. H. Younger)

Matching Covered Graphs and Subdivisions of K₄ and C₆‾‾, Journal of Combinatorial Theory (B), 66, 2, 263-268, 1996
(co-authorship with M. H. de Carvalho)

Application of Finite Automata in Debugging Natural Language Vocabularies, Journal of the Brazilian Computer Society, 1, 5-11, 1995
(co-authorship with T. Kowaltowski and J. Stolfi)     technical report

Minimization of Binary Finite Automata, Journal of the Brazilian Computer Society, 1, 36-42, 1995
(co-authorship with T. Kowaltowski and J. Stolfi)     technical report

Applications of Finite Automata Representing Large Vocabularies, Software: Practice and Experience, 25, 15-30, 1993
(co-authorship with T. Kowaltowski)     technical report

Superfluous Paths in Strong Digraphs, Discrete Math., 47, 267-273, 1983
(co-authorship with J. A. Ross)

Aspectos Teóricos da Computação (Theoretical Aspects of Computing) , IMPA, Projeto Euclides, 1979 (in Portuguese)
(co-authorship with Tomasz Kowaltowski, Imre Simon, Istvan Simon and Janos Simon)

Candidate Keys for Relations, J. of Computer and System Sciences, 17, 270-279, 1978
(co-authorship with S. L. Osborne)

A Minimax Theorem for Directed Graphs, J. of London Math. Soc., 17, 369-374, 1978
(co-authorship with D. H. Younger)