Celina Miraglia Herrera de Figueiredo

Instituição:

Universidade Federal do Rio de Janeiro

Centro:

Centro de Tecnologia

Unidade:

Coordenação dos Programas de Pós-Graduação de Engenharia

Departamento:

Programa de Engenharia de Sistemas/COPPE

ORCID:

https://orcid.org/0000-0002-6393-0876


Formação:

  • University of Waterloo

    | Pós-Doutorado | 1995 - 1996

  • Universidade Federal do Rio de Janeiro

    Engenharia de Sistemas e Computação | Doutorado | 1987 - 1991

  • University of Manchester

    Mathematics | Mestrado | 1985 - 1987

  • Pontifícia Universidade Católica do Rio de Janeiro

    Matemática | Mestrado | 1983 - 1984

  • Pontifícia Universidade Católica do Rio de Janeiro

    Bacharelado em Matemática | Graduação | 1979 - 1982
Laboratórios:
Nenhum laboratório cadastrado
Nuvens de Palavras:
Artigos:
Nenhum artigo cadastrado
Eventos:

(42.86% eventos com DOI)

Titulo DOI Ano
Pebbling in Kneser Graphs 2024
Hyper-heuristics with Path Relinking applied to the Generalised Time-Dependent ATSP in air travel 2023
Parameterized algorithms for Steiner Tree and Dominating Set: bounding the leafage by the vertex leafage 2022
On the Terminal Connection Problem 2021
Maximum cut on interval graphs of interval count four is NP-complete 10.4230/LIPIcs.MFCS.2021.38 2021
On total coloring the direct product of complete graphs 2021
On the chromatic index of complementary prisms 2019
Even-power of cycles with many vertices are Type 1 total colorable 2019
On caterpillars of game chromatic number 4 2019
A general method for forbidden induced sandwich problem NP-completeness 2019
The Graph Tessellation Cover Number: Extremal Bounds, Efficient Algorithms and Hardness 2018
Simple Undirected Two-Commodity Integral Flow with a Unitary Demand 2017
Linear-Time Approximation Algorithms for Unit Disk Graphs 2015
A new reversible circuit synthesis algorithm based on cycle representations of permutations 2015
Using SPQR-trees to speed up algorithms based on 2-cutset decompositions 2015
Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3 2014
A Faster 1.375-Approximation Algorithm for Sorting by Transpositions 2014
Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs 2013
On the 1.375-Approximation Algorithm for Sorting by Transpositions in O(n logn) 2013
The generalized split probe problem 2013
The same upper bound for both: the 2-page and the rectilinear crossing numbers of the n-cube 2013
Clique-colouring and biclique-colouring unichord-free graphs 10.1007/978-3-642-29344-3_45 2012
Transposition diameter and lonely permutations 2012
Biclique-colouring powers of paths and powers of cycles 2012
Snarks with total chromatic number 5 2012
Split clique graph complexity 10.1007/978-3-642-25870-1_3 2011
Hamiltonian Cycles in Kneser Graphs for n=2k+2 10.1016/j.endm.2011.05.050 2011
On coloring problems of snark families 10.1016/j.endm.2011.05.009 2011
Analysis and Implementation of Sorting by Transpositions using Permutation Trees 10.1007/978-3-642-22825-4_6 2011
Advances on the List Stubborn Problem 2010
Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges 10.1016/j.endm.2010.05.050 2010
Total chromatic number of {square,unichord}-free graphs 10.1016/j.endm.2010.05.085 2010
Bounds on the transposition distance for lonely permutations 10.1007/978-3-642-15060-9_4 2010
NP-completeness of determining the total chromatic number of graphs that do not contain a cycle with a unique chord 2009
Skew partition sandwich problem is NP-complete 10.1016/j.endm.2009.11.003 2009
2K2 vertex-set partition into nonemptyparts 10.1016/j.endm.2008.01.050 2008
The polynomial dichotomy for three nonempty part sandwich problems 10.1016/j.endm.2008.01.015 2008
Sufficient conditions for a graph to be edge-colorable with maximum degree colors 10.1016/j.endm.2008.01.013 2008
On the toric graph as a tool to handle the problem of sorting by transpositions 10.1007/978-3-540-85557-6_8 2008
A decomposition for total-coloring graphs of maximum degree 3 2008
The external constraint 4 nonempty part sandwich problem 2008
Edge-coloring graphs with no cycle with a unique chord 2008
On maximizing clique, clique-Helly, and hereditary clique-Helly induced subgraphs 10.1016/j.endm.2008.01.026 2008
Aplicação do Algoritmo de Grover para Problemas NP-Completos 2007
Clique graph recognition is NP-complete 10.1007/11917496_24 2006
Non loop graphs with induced cycles 10.1016/j.endm.2005.05.039 2005
Loop graphs and asteroidal sets 10.1016/j.endm.2005.06.038 2005
On the generation of bicliques of a graph 10.1016/j.endm.2004.03.025 2004
Faster deterministic and randomized algorithms on the Homogeneous Set Sandwich Problem 10.1007/b97914 2004
Simple max-cut for split-indifference graphs and graphs with few P_4's 10.1007/b97914 2004
The sandwich problem for cutsets 10.1016/j.endm.2004.06.035 2004
Nonplanar vertex deletion: maximum degree thresholds for NP/Max SNP-hardness and a 3/4-approx for finding maximum planar induced subgraphs 10.1016/j.endm.2004.06.019 2004
Tree Loop Graphs 10.1016/j.endm.2004.06.003 2004
An improved upper bound on the crossing number of the hypercube 10.1007/b93953 2003
On the Complexity of (k,l)-Graph Sandwich Problems 2002
On the complexity of the approximation of nonplanarity parameters for cubic graphs 10.1016/S1571-0653(04)00214-8 2001
Stable marriages with restricted pairs 10.1016/S1571-0653(04)00213-6 2001
Bull-reducible Berge graphs are perfect 2001
Edge colouring reduced indifference graphs 10.1007/10719839 2000
Finding skew partitions efficiently 10.1007/10719839 2000
The graph sandwich problem for 1-join composition is NP-complete 10.1016/S1571-0653(05)80133-7 2000
Optimal node-degree bounds for the complexity of nonplanarity parameters 1999
Linear-time algorithms for maximum sets of sources and sinks 10.1016/S1571-0653(05)80062-9 1999
Splitting number is NP-complete 1998
The splitting number of the 4--cube 10.1007/BFb0054304 1998
On the edge-colouring of split graphs 1996
On Edge-colouring indifference graphs 10.1007/3-540-59175-3 1995
Even pairs and bull-free perfect graphs 1995
Reconhecimento de Bons Grafos 1992
Maximal Cliques On Split-Indifference Graphs 1992
Sobre Cortes Bipartidos Completos 1992
Perfect Graphs And Computational Complexity 1992
Decomposition Theorems On Perfect Graphs 1991
Even Pairs And Bull-Free Perfect Graphs 1991
Perfect Graphs And The Skew-Partition Conjecture 1991
Grafos Split-Indiferenca 1990
Grafos Perfeitos - Historia e Perspectivas. 1988
Publicações:
Minha Rede: