Obserwuj
Celina Miraglia Herrera de Figueiredo
Celina Miraglia Herrera de Figueiredo
Professor of Computer Science at COPPE, UFRJ
Zweryfikowany adres z cos.ufrj.br - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
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
821995
Finding skew partitions efficiently
CMH de Figueiredo, S Klein, Y Kohayakawa, BA Reed
Journal of Algorithms 37 (2), 505-521, 2000
742000
Generating bicliques of a graph in lexicographic order
VMF Dias, CMH De Figueiredo, JL Szwarcfiter
Theoretical Computer Science 337 (1-3), 240-248, 2005
572005
The homogeneous set sandwich problem
MR Cerioli, H Everett, CMH de Figueiredo, S Klein
Information Processing Letters 67 (1), 31-35, 1998
571998
The NP-completeness of multi-partite cutset testing
S Klein, CMH De Figueiredo
Congressus Numerantium, 217-222, 1996
551996
On the generation of bicliques of a graph
VMF Dias, CMH de Figueiredo, JL Szwarcfiter
Discrete Applied Mathematics 155 (14), 1826-1832, 2007
532007
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
532003
Splitting number is NP-complete
L Faria, CMH de Figueiredo, CFX Mendonça
Discrete Applied Mathematics 108 (1-2), 65-83, 2001
462001
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
452009
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
441999
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
392002
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
382010
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
382004
On the structure of bull-free perfect graphs
CMH de Figueiredo, F Maffray, O Porto
Graphs and Combinatorics 13 (1), 31-55, 1997
381997
Reversible karatsubas algorithm
R Portugal, CMH Figueiredo
Journal of Universal Computer Science 12 (5), 499-511, 2006
362006
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
352007
Edge-colouring and total-colouring chordless graphs
RCS Machado, CMH de Figueiredo, N Trotignon
Discrete Mathematics 313 (14), 1547-1552, 2013
342013
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
322000
Path parity and perfection
H Everett, CMH de Figueiredo, C Linhares-Sales, F Maffray, O Porto, ...
Discrete Mathematics 165, 233-252, 1997
321997
Finding H-partitions efficiently
S Dantas, CMH de Figueiredo, S Gravier, S Klein
RAIRO-Theoretical Informatics and Applications 39 (1), 133-144, 2005
312005
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20