Skip to content

Celina M. H. de Figueiredo

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

24

Venues

9

Active years

1995–2025

Best venue rank

A*

Where they publish

Papers

24 indexed papers, newest first.

YearVenueTitleAuthors
2025LAGOSType 1 and Type 2 Kochol superposition snarks.Rieli Arajo, Celina M. H. de Figueiredo, Diana Sasaki, Simone Dantas
2024LATINPebbling in Kneser Graphs.Matheus Adauto, Viktoriya Bardenova, Mariana da Cruz, Celina M. H. de Figueiredo, Glenn Hurlbert, Diana Sasaki
2023LAGOSHyper-heuristics with Path Relinking applied to the Generalised Time-Dependent ATSP in air travel.Matheus Simes, Laura Bahiense, Celina M. H. de Figueiredo
2022WALCOMParameterized Algorithms for Steiner Tree and Dominating Set: Bounding the Leafage by the Vertex Leafage.Celina M. H. de Figueiredo, Raul Lopes, Alexsander Andrade de Melo, Ana Silva
2021LAGOSOn total coloring the direct product of complete graphs.Diane Castonguay, Celina M. H. de Figueiredo, Luis A. B. Kowada, Caroline Reis Patro, Diana Sasaki, Mario Valencia-Pabon
2021MFCSMaximum Cut on Interval Graphs of Interval Count Four Is NP-Complete.Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Fabiano de S. Oliveira, Ana Silva
2021SOFSEMOn the Terminal Connection Problem.Alexsander Andrade de Melo, Celina M. H. de Figueiredo, Uverton S. Souza
2018LATINThe Graph Tessellation Cover Number: Extremal Bounds, Efficient Algorithms and Hardness.Alexandre Santiago de Abreu, Lus Felipe I. Cunha, Tharso D. Fernandes, Celina M. H. de Figueiredo, Luis A. B. Kowada, Franklin L. Marquezino, Daniel Posner, Renato Portugal
2014LATINHierarchical Complexity of 2-Clique-Colouring Weakly Chordal Graphs and Perfect Graphs Having Cliques of Size at Least 3.Hlio B. Macdo Filho, Raphael C. S. Machado, Celina M. H. de Figueiredo
2014WABIA Faster 1.375-Approximation Algorithm for Sorting by Transpositions.Lus Felipe I. Cunha, Luis Antonio Brasil Kowada, Rodrigo de A. Hausen, Celina M. H. de Figueiredo
2014WAOALinear-Time Approximation Algorithms for Unit Disk Graphs.Guilherme Dias da Fonseca, Vincius Gusmo Pereira de S, Celina M. H. de Figueiredo
2013WGThe Same Upper Bound for Both: The 2-Page and the Rectilinear Crossing Numbers of the n-Cube.Lurbio Faria, Celina M. H. de Figueiredo, R. Bruce Richter, Imrich Vrto
2012LATINClique-Colouring and Biclique-Colouring Unichord-Free Graphs.Hlio B. Macdo Filho, Raphael C. S. Machado, Celina M. H. de Figueiredo
2012WAOALinear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs.Guilherme Dias da Fonseca, Celina M. H. de Figueiredo, Vincius G. P. de S, Raphael Machado
2011WGSplit Clique Graph Complexity.Liliana Alcn, Lurbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez
2006WGClique Graph Recognition Is NP-Complete.Liliana Alcn, Lurbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez
2003WGAn Improved Upper Bound on the Crossing Number of the Hypercube.Lurbio Faria, Celina M. H. de Figueiredo, Ondrej Skora, Imrich Vrto
2002WGOn the Complexity of (k, l)-Graph Sandwich Problems.Simone Dantas, Celina M. H. de Figueiredo, Lurbio Faria
2000LATINFinding Skew Partitions Efficiently.Celina M. H. de Figueiredo, Sulamita Klein, Yoshiharu Kohayakawa, Bruce A. Reed
2000LATINEdge Colouring Reduced Indifference Graphs.Celina M. H. de Figueiredo, Clia Picinin de Mello, Carmen Ortiz
1999SODAOptimal Node-Degree Bounds for the Complexity of Nonplanarity Parameters.Celina M. H. de Figueiredo, Lurbio Faria, Candido Ferreira Xavier de Mendona Neto
1998LATINThe Splitting Number of the 4-Cube.Lurbio Faria, Celina M. H. de Figueiredo, Candido Ferreira Xavier de Mendona Neto
1998WGSplitting Number is NP-completeLurbio Faria, Celina M. H. de Figueiredo, Candido Ferreira Xavier de Mendona Neto
1995LATINOn Edge-Colouring Indifference Graphs.Celina M. H. de Figueiredo, Joo Meidanis, Clia Picinin de Mello