Celina M. H. de Figueiredo
Orcid: 0000-0002-6393-0876Affiliations:
- Federal University of Rio de Janeiro, Brazil
According to our database1,
Celina M. H. de Figueiredo
authored at least 171 papers
between 1995 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on cos.ufrj.br
On csauthors.net:
Bibliography
2024
Int. Trans. Oper. Res., July, 2024
Discret. Comput. Geom., April, 2024
The hardness of recognising poorly matchable graphs and the hunting of the <i>d</i>-snark.
RAIRO Oper. Res., 2024
Proceedings of the LATIN 2024: Theoretical Informatics, 2024
2023
On total coloring the direct product of cycles and bipartite direct product of graphs.
Discret. Math., June, 2023
RAIRO Theor. Informatics Appl., 2023
Hyper-heuristics with Path Relinking applied to the Generalised Time-Dependent ATSP in air travel.
Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023
2022
Compositions, decompositions, and conformability for total coloring on power of cycle graphs.
Discret. Appl. Math., 2022
Discret. Appl. Math., 2022
Parameterized Algorithms for Steiner Tree and Dominating Set: Bounding the Leafage by the Vertex Leafage.
Proceedings of the WALCOM: Algorithms and Computation, 2022
2021
Theor. Comput. Sci., 2021
On undirected two-commodity integral flow, disjoint paths and strict terminal connection problems.
Networks, 2021
A reversible circuit synthesis algorithm with progressive increase of controls in generalized Toffoli gates.
J. Univers. Comput. Sci., 2021
Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021
Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021
2020
The graph tessellation cover number: Chromatic bounds, efficient algorithms and hardness.
Theor. Comput. Sci., 2020
J. Comput. Syst. Sci., 2020
Discret. Appl. Math., 2020
Discret. Appl. Math., 2020
2019
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019
On Nordhaus-Gaddum type inequalities for the game chromatic and game coloring numbers.
Discret. Math., 2019
On the embedding of cone graphs in the line with distinct distances between neighbors.
Discret. Appl. Math., 2019
2018
Discret. Appl. Math., 2018
Discret. Appl. Math., 2018
Algorithmica, 2018
The Graph Tessellation Cover Number: Extremal Bounds, Efficient Algorithms and Hardness.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018
2017
Shifting Coresets: Obtaining Linear-Time Approximations for Unit Disk Graphs and Other Geometric Intersection Graphs.
Int. J. Comput. Geom. Appl., 2017
Electron. Notes Discret. Math., 2017
Efficient Algorithms for Clique-Colouring and Biclique-Colouring Unichord-Free Graphs.
Algorithmica, 2017
2016
Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3.
Theor. Comput. Sci., 2016
The Same Upper Bound for Both: The 2-page and the Rectilinear Crossing Numbers of the <i>n</i>-Cube.
J. Graph Theory, 2016
Inf. Process. Lett., 2016
2015
J. Comput. Biol., 2015
A new reversible circuit synthesis algorithm based on cycle representations of permutations.
Electron. Notes Discret. Math., 2015
Electron. Notes Discret. Math., 2015
Discret. Math. Theor. Comput. Sci., 2015
Discret. Appl. Math., 2015
On the recognition of unit disk graphs and the Distance Geometry Problem with Ranges.
Discret. Appl. Math., 2015
Discret. Appl. Math., 2015
The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem.
Discret. Appl. Math., 2015
Timber Game with Caterpillars.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015
Sorting Separable Permutations by Restricted Multi-break Rearrangements.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015
2014
Theor. Comput. Sci., 2014
Complexity of colouring problems restricted to unichord-free and { square, unichord }-free graphs.
Discret. Appl. Math., 2014
Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014
2013
SIAM J. Discret. Math., 2013
On the 1.375-Approximation Algorithm for Sorting by Transpositions in O(n logn) Time.
Proceedings of the Advances in Bioinformatics and Computational Biology, 2013
The Same Upper Bound for Both: The 2-Page and the Rectilinear Crossing Numbers of the n-Cube.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013
On total coloring and equitable total coloring of cubic graphs with large girth.
Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013
2012
J. Braz. Comput. Soc., 2012
Discret. Appl. Math., 2012
CoRR, 2012
Proceedings of the Advances in Bioinformatics and Computational Biology, 2012
Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs.
Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 2012
Proceedings of the LATIN 2012: Theoretical Informatics, 2012
Biclique-colouring - Powers of Paths and Powers of Cycles.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012
Snarks with Total Chromatic Number 5.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012
2011
A decomposition for total-coloring partial-grids and list-total-coloring outerplanar graphs.
Networks, 2011
J. Braz. Comput. Soc., 2011
Proceedings of the Advances in Bioinformatics and Computational Biology, 2011
2010
Theor. Comput. Sci., 2010
Unitary Toric Classes, the Reality and Desire Diagram, and Sorting by Transpositions.
SIAM J. Discret. Math., 2010
Electron. Notes Discret. Math., 2010
Electron. Notes Discret. Math., 2010
Discret. Appl. Math., 2010
Discret. Appl. Math., 2010
Discret. Appl. Math., 2010
Proceedings of the Advances in Bioinformatics and Computational Biology, 2010
Chromatic Index of Chordless Graphs.
Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010
Proceedings of the Theory of Computing 2010, 2010
2009
Skewness, splitting number and vertex deletion of some toroidal meshes.
Ars Comb., 2009
NP-Completeness of Determining the Total Chromatic Number of Graphs that do not Contain a Cycle with a Unique Chord.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009
2008
J. Graph Theory, 2008
J. Braz. Comput. Soc., 2008
Electron. Notes Discret. Math., 2008
Electron. Notes Discret. Math., 2008
Proceedings of the Advances in Bioinformatics and Computational Biology, 2008
A decomposition for total-coloring graphs of maximum degree 3.
Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008
2007
On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs.
Theor. Comput. Sci., 2007
2006
Inf. Process. Lett., 2006
Discret. Appl. Math., 2006
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006
2005
RAIRO Theor. Informatics Appl., 2005
The non planar vertex deletion of Cn x Cm.
Ars Comb., 2005
2004
Nonplanar vertex deletion: maximum degree thresholds for NP/Max SNP-hardness and a <i>I</i>-approximation for finding maximum planar induced subgraphs.
Electron. Notes Discret. Math., 2004
Discret. Appl. Math., 2004
Discret. Appl. Math., 2004
Faster Deterministic and Randomized Algorithms on the Homogeneous Set Sandwich Problem.
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004
2003
Theor. Comput. Sci., 2003
Inf. Process. Lett., 2003
2002
Discret. Appl. Math., 2002
Discret. Appl. Math., 2002
The splitting number and skewness of C<sub>n</sub> x C<sub>m</sub>.
Ars Comb., 2002
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002
2001
Graphs Comb., 2001
On Tucker's proof of the strong perfect graph conjecture for (<i>K</i><sub>4</sub>-<i>e</i>)-free graphs.
Discret. Math., 2001
SPLITTING NUMBER is NP-complete.
Discret. Appl. Math., 2001
2000
Proceedings of the LATIN 2000: Theoretical Informatics, 2000
1999
Inf. Process. Lett., 1999
Electron. Notes Discret. Math., 1999
Discret. Appl. Math., 1999
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999
1998
Proceedings of the LATIN '98: Theoretical Informatics, 1998
1997
1995
Inf. Process. Lett., 1995