The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Celina M. Herrera de Figueiredo: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Luerbio Faria, Celina M. Herrera de Figueiredo, Candido Ferreira Xavier de Mendonça Neto
    The Splitting Number of the 4-Cube. [Citation Graph (0, 0)][DBLP]
    LATIN, 1998, pp:141-150 [Conf]
  2. Celina M. Herrera de Figueiredo, Sulamita Klein, Yoshiharu Kohayakawa, Bruce A. Reed
    Finding Skew Partitions Efficiently. [Citation Graph (0, 0)][DBLP]
    LATIN, 2000, pp:163-172 [Conf]
  3. Celina M. Herrera de Figueiredo, João Meidanis, Célia Picinin de Mello
    On Edge-Colouring Indifference Graphs. [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:286-299 [Conf]
  4. Celina M. Herrera de Figueiredo, Célia Picinin de Mello, Carmen Ortiz
    Edge Colouring Reduced Indifference Graphs. [Citation Graph (0, 0)][DBLP]
    LATIN, 2000, pp:145-153 [Conf]
  5. Celina M. Herrera de Figueiredo, Luerbio Faria, Candido Ferreira Xavier de Mendonça Neto
    Optimal Node-Degree Bounds for the Complexity of Nonplanarity Parameters. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:887-888 [Conf]
  6. Hans L. Bodlaender, Celina M. Herrera de Figueiredo, Marisa Gutierrez, Ton Kloks, Rolf Niedermeier
    Simple Max-Cut for Split-Indifference Graphs and Graphs with Few P4's. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:87-99 [Conf]
  7. Celina M. Herrera de Figueiredo, Guilherme Dias da Fonseca, Vinícius G. P. de Sá, Jeremy Spinrad
    Faster Deterministic and Randomized Algorithms on the Homogeneous Set Sandwich Problem. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:243-252 [Conf]
  8. Liliana Alcón, Luerbio Faria, Celina M. Herrera de Figueiredo, Marisa Gutierrez
    Clique Graph Recognition Is NP-Complete. [Citation Graph (0, 0)][DBLP]
    WG, 2006, pp:269-277 [Conf]
  9. Luerbio Faria, Celina M. Herrera de Figueiredo, Candido Ferreira Xavier de Mendonça Neto
    Splitting Number is NP-complete [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:285-297 [Conf]
  10. Luerbio Faria, Celina M. Herrera de Figueiredo, Ondrej Sýkora, Imrich Vrto
    An Improved Upper Bound on the Crossing Number of the Hypercube. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:230-236 [Conf]
  11. Simone Dantas, Celina M. Herrera de Figueiredo, Luerbio Faria
    On the Complexity of (k, l)-Graph Sandwich Problems. [Citation Graph (0, 0)][DBLP]
    WG, 2002, pp:92-101 [Conf]
  12. Celina M. Herrera de Figueiredo, Guilherme Dias da Fonseca, Vinícius G. P. de Sá, Jeremy Spinrad
    Algorithms for the Homogeneous Set Sandwich Problem. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:46, n:2, pp:149-180 [Journal]
  13. Candido Ferreira Xavier de Mendonça Neto, Karl Schaffer, Erico F. Xavier, Jorge Stolfi, Luerbio Faria, Celina M. Herrera de Figueiredo
    The splitting number and skewness of Cn x Cm. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2002, v:63, n:, pp:- [Journal]
  14. Candido Ferreira Xavier de Mendonça Neto, Erico F. Xavier, Jorge Stolfi, Luerbio Faria, Celina M. Herrera de Figueiredo
    The non planar vertex deletion of Cn x Cm. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2005, v:76, n:, pp:- [Journal]
  15. Simone Dantas, Celina M. Herrera de Figueiredo, Luerbio Faria
    On decision and optimization (k, l)-graph sandwich problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:155-165 [Journal]
  16. Simone Dantas, Celina M. Herrera de Figueiredo, Sulamita Klein, Sylvain Gravier, Bruce A. Reed
    Stable skew partition problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:17-22 [Journal]
  17. Luerbio Faria, Celina M. Herrera de Figueiredo, Candido Ferreira Xavier de Mendonça Neto
    SPLITTING NUMBER is NP-complete. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:108, n:1-2, pp:65-83 [Journal]
  18. Luerbio Faria, Celina M. Herrera de Figueiredo, Candido Ferreira Xavier de Mendonça Neto
    On the complexity of the approximation of nonplanarity parameters for cubic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:141, n:1-3, pp:119-134 [Journal]
  19. Celina M. Herrera de Figueiredo, John G. Gimbel, Célia Picinin de Mello, Jayme Luiz Szwarcfiter
    A note on transitive orientations with maximum sets of sources and sinks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:91-95 [Journal]
  20. Celina M. Herrera de Figueiredo, John G. Gimbel, Célia Picinin de Mello, Jayme Luiz Szwarcfiter
    Even and Odd Pairs in Comparability and in P4-comparability Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:91, n:1-3, pp:293-297 [Journal]
  21. Celina M. Herrera de Figueiredo, Sulamita Klein, Kristina Vuskovic
    The graph sandwich problem for 1-join composition is NP-complete. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:121, n:1-3, pp:73-82 [Journal]
  22. Celina M. Herrera de Figueiredo, Kristina Vuskovic
    Recognition of quasi-Meyniel graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:113, n:2-3, pp:255-260 [Journal]
  23. Rafael B. Teixeira, Celina M. Herrera de Figueiredo
    The sandwich problem for cutsets: Clique cutset, k-star cutset. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:13, pp:1791-1798 [Journal]
  24. Luerbio Faria, Celina M. Herrera de Figueiredo, Sylvain Gravier, Candido Ferreira Xavier de Mendonça Neto, Jorge Stolfi
    On maximum planar induced subgraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:13, pp:1774-1782 [Journal]
  25. Liliana Alcón, Márcia R. Cerioli, Celina M. Herrera de Figueiredo, Marisa Gutierrez, João Meidanis
    Tree loop graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:6-7, pp:686-694 [Journal]
  26. Celina M. Herrera de Figueiredo, Sylvain Gravier, Cláudia Linhares Sales
    On Tucker's proof of the strong perfect graph conjecture for (K4-e)-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:232, n:1-3, pp:105-108 [Journal]
  27. Celina M. Herrera de Figueiredo, Kristina Vuskovic
    A class of ?-perfect graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:216, n:1-3, pp:169-193 [Journal]
  28. Celina M. Herrera de Figueiredo, Chính T. Hoàng, Frédéric Maffray
    A characterization of P4-comparability graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:19-20, pp:2461-2472 [Journal]
  29. Simone Dantas, Celina M. Herrera de Figueiredo, Sylvain Gravier, Sulamita Klein
    Extended skew partition problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:19-20, pp:2438-2449 [Journal]
  30. Celina M. Herrera de Figueiredo, Frédéric Maffray, Oscar Porto
    On the Structure of Bull-Free Perfect Graphs, 2: the Weakly Chordal Case. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2001, v:17, n:3, pp:435-456 [Journal]
  31. Claudson F. Bornstein, Celina M. Herrera de Figueiredo, Vinícius G. P. de Sá
    The Pair Completion algorithm for the Homogeneous Set Sandwich Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:98, n:3, pp:87-91 [Journal]
  32. Márcia R. Cerioli, Hazel Everett, Celina M. Herrera de Figueiredo, Sulamita Klein
    The Homogeneous Set Sandwich Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:67, n:1, pp:31-35 [Journal]
  33. Celina M. Herrera de Figueiredo, João Meidanis, Célia Picinin de Mello
    A Linear-Time Algorithm for Proper Interval Graph Recognition. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:56, n:3, pp:179-184 [Journal]
  34. Celina M. Herrera de Figueiredo, João Meidanis, Célia Picinin de Mello
    Total-Chromatic Number and Chromatic Index of Dually Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:70, n:3, pp:147-152 [Journal]
  35. Celina M. Herrera de Figueiredo, Vinícius G. P. de Sá
    Note on the Homogeneous Set Sandwich Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:93, n:2, pp:75-81 [Journal]
  36. Guilherme Dias da Fonseca, Celina M. Herrera de Figueiredo
    Kinetic heap-ordered trees: Tight analysis and improved algorithms. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:85, n:3, pp:165-169 [Journal]
  37. Guilherme Dias da Fonseca, Celina M. Herrera de Figueiredo, Paulo Cezar Pinto Carvalho
    Kinetic hanger. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:89, n:3, pp:151-157 [Journal]
  38. Celina M. Herrera de Figueiredo, Sulamita Klein, Yoshiharu Kohayakawa, Bruce A. Reed
    Finding Skew Partitions Efficiently. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:37, n:2, pp:505-521 [Journal]
  39. Luis Antonio Brasil Kowada, Renato Portugal, Celina M. Herrera de Figueiredo
    Reversible Karatsuba's Algorithm. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2006, v:12, n:5, pp:499-511 [Journal]
  40. Celina M. Herrera de Figueiredo, Frédéric Maffray
    Optimizing Bull-Free Perfect Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2004, v:18, n:2, pp:226-240 [Journal]
  41. Vânia M. F. Dias, Guilherme Dias da Fonseca, Celina M. Herrera de Figueiredo, Jayme Luiz Szwarcfiter
    The stable marriage problem with restricted pairs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:306, n:1-3, pp:391-405 [Journal]
  42. Vânia M. F. Dias, Celina M. Herrera de Figueiredo, Jayme Luiz Szwarcfiter
    Generating bicliques of a graph in lexicographic order. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:337, n:1-3, pp:240-248 [Journal]
  43. Celina M. Herrera de Figueiredo, João Meidanis, Célia Picinin de Mello
    On Edge-Colouring Indifference Graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:181, n:1, pp:91-106 [Journal]
  44. Celina M. Herrera de Figueiredo, João Meidanis, Célia Picinin de Mello, Carmen Ortiz
    Decompositions for the edge colouring of reduced indifference graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:297, pp:145-155 [Journal]
  45. Vânia M. F. Dias, Celina M. Herrera de Figueiredo, Jayme Luiz Szwarcfiter
    On the generation of bicliques of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:14, pp:1826-1832 [Journal]
  46. Hazel Everett, Celina M. Herrera de Figueiredo, Cláudia Linhares Sales, Frédéric Maffray, Oscar Porto, Bruce A. Reed
    Path parity and perfection. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:165, n:, pp:233-252 [Journal]
  47. Celina M. Herrera de Figueiredo, Luerbio Faria, Sulamita Klein, R. Sritharan
    On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:381, n:1-3, pp:57-67 [Journal]

  48. On the Toric Graph as a Tool to Handle the Problem of Sorting by Transpositions. [Citation Graph (, )][DBLP]


  49. Bounds on the Transposition Distance for Lonely Permutations. [Citation Graph (, )][DBLP]


  50. A decomposition for total-coloring graphs of maximum degree 3. [Citation Graph (, )][DBLP]


  51. NP-Completeness of Determining the Total Chromatic Number of Graphs that do not Contain a Cycle with a Unique Chord. [Citation Graph (, )][DBLP]


  52. Complexity dichotomy on partial grid recognition [Citation Graph (, )][DBLP]


  53. Preface. [Citation Graph (, )][DBLP]


  54. The polynomial dichotomy for three nonempty part sandwich problems. [Citation Graph (, )][DBLP]


  55. 2K2 vertex-set partition into nonempty parts. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002