A linear-time algorithm for proper interval graph recognition CMH de Figueiredo, J Meidanis, CP de Mello Information Processing Letters 56 (3), 179-184, 1995 | 82 | 1995 |
Finding skew partitions efficiently CMH de Figueiredo, S Klein, Y Kohayakawa, BA Reed Journal of Algorithms 37 (2), 505-521, 2000 | 73 | 2000 |
Generating bicliques of a graph in lexicographic order VMF Dias, CMH De Figueiredo, JL Szwarcfiter Theoretical Computer Science 337 (1-3), 240-248, 2005 | 58 | 2005 |
The homogeneous set sandwich problem MR Cerioli, H Everett, CMH de Figueiredo, S Klein Information Processing Letters 67 (1), 31-35, 1998 | 58 | 1998 |
On the generation of bicliques of a graph VMF Dias, CMH de Figueiredo, JL Szwarcfiter Discrete Applied Mathematics 155 (14), 1826-1832, 2007 | 52 | 2007 |
The NP-completeness of multi-partite cutset testing S Klein, CMH De Figueiredo Congressus Numerantium, 217-222, 1996 | 50 | 1996 |
The stable marriage problem with restricted pairs VMF Dias, GD Da Fonseca, CMH De Figueiredo, JL Szwarcfiter Theoretical Computer Science 306 (1-3), 391-405, 2003 | 46 | 2003 |
The complexity of clique graph recognition L Alcón, L Faria, CMH de Figueiredo, M Gutierrez Theoretical Computer Science 410 (21-23), 2072-2083, 2009 | 45 | 2009 |
Total-chromatic number and chromatic index of dually chordal graphs CMH de Figueiredo, J Meidanis, CP de Mello Information processing letters 70 (3), 147-152, 1999 | 43 | 1999 |
Splitting number is NP-complete L Faria, CMH de Figueiredo, CFX Mendonça Discrete Applied Mathematics 108 (1-2), 65-83, 2001 | 41 | 2001 |
The graph sandwich problem for 1-join composition is NP-complete CMH de Figueiredo, S Klein, K Vušković Discrete applied mathematics 121 (1-3), 73-82, 2002 | 39 | 2002 |
On the structure of bull-free perfect graphs CMH de Figueiredo, F Maffray, O Porto Graphs and Combinatorics 13 (1), 31-55, 1997 | 39 | 1997 |
Chromatic index of graphs with no cycle with a unique chord RCS Machado, CMH de Figueiredo, K Vušković Theoretical computer science 411 (7-9), 1221-1234, 2010 | 38 | 2010 |
On decision and optimization (k, l)-graph sandwich problems S Dantas, CMH de Figueiredo, L Faria Discrete applied mathematics 143 (1-3), 155-165, 2004 | 37 | 2004 |
Reversible karatsubas algorithm R Portugal, CMH Figueiredo Journal of Universal Computer Science 12 (5), 499-511, 2006 | 36 | 2006 |
On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs CMH de Figueiredo, L Faria, S Klein, R Sritharan Theoretical Computer Science 381 (1-3), 57-67, 2007 | 34 | 2007 |
Edge-colouring and total-colouring chordless graphs RCS Machado, CMH de Figueiredo, N Trotignon Discrete mathematics 313 (14), 1547-1552, 2013 | 32 | 2013 |
Finding H-partitions efficiently S Dantas, CMH de Figueiredo, S Gravier, S Klein RAIRO-Theoretical Informatics and Applications 39 (1), 133-144, 2005 | 32 | 2005 |
Optimizing bull-free perfect graphs CMH de Figueiredo, F Maffray SIAM Journal on Discrete Mathematics 18 (2), 226-240, 2004 | 31 | 2004 |
On Eggleton and Guy's conjectured upper bound for the crossing number of the -cube L Faria, CMH de Figueiredo Mathematica Slovaca 50 (3), 271-287, 2000 | 31 | 2000 |