Celina M. H. de Figueiredo

202 papers A* 1B 18C 16Journal 158Unranked 9
YearRankTypeTitle / Venue / Authors
2026 J jnl
The AVD-total chromatic number of fullerene molecular graphs.
Discret. Math. Theor. Comput. Sci.
Mariana da Cruz, Diana Sasaki, Mauro Nigro, Celina M. H. de Figueiredo
2025 J jnl
A Weight Function Lemma Heuristic for Graph Pebbling.
CoRR
Guilherme Adamatti Bridi, Franklin L. Marquezino, Celina M. H. de Figueiredo
2025 J jnl
On the pebbling numbers of Flower, Blanuša and Watkins snarks.
Discret. Appl. Math.
Matheus Adauto, Celina M. H. de Figueiredo, Glenn Hurlbert, Diana Sasaki
2025 J jnl
The sandwich problem for odd-hole-free and even-hole-free graphs.
Discret. Math.
Kathie Cameron, Aristotelis Chaniotis, Celina M. H. de Figueiredo, Sophie Spirkl
2025 C conf
Type 1 and Type 2 Kochol superposition snarks.
LAGOS
Rieli Araújo, Celina M. H. de Figueiredo, Diana Sasaki, Simone Dantas
2024 J jnl
Canonical cuts of path powers.
Contributions Discret. Math.
Liliana Alcón, Luérbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez, Sulamita Klein, Uéverton S. Souza, Rubens Sucupira
2024 J jnl
IFORS' Operational Research Hall of Fame: Clóvis Caesar Gonzaga.
Int. Trans. Oper. Res.
Celina M. H. de Figueiredo, Elizabeth W. Karas, Claudia A. Sagastizábal
2024 J jnl
Maximum Cut on Interval Graphs of Interval Count Four is NP-Complete.
Discret. Comput. Geom.
Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Fabiano de S. Oliveira, Ana Silva
2024 J jnl
On the total chromatic number of the direct product of cycles and complete graphs.
RAIRO Oper. Res.
Diane Castonguay, Celina M. H. de Figueiredo, Luis A. B. Kowada, Caroline Reis Patrão, Diana Sasaki, Mario Valencia-Pabon
2024 J jnl
Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs.
Networks
Celina M. H. de Figueiredo, Raul Lopes, Alexsander Andrade de Melo, Ana Silva
2024 — conf
Pebbling in Kneser Graphs.
LATIN (2)
Matheus Adauto, Viktoriya Bardenova, Mariana da Cruz, Celina M. H. de Figueiredo, Glenn Hurlbert, Diana Sasaki
2024 J jnl
The hardness of recognising poorly matchable graphs and the hunting of the
RAIRO Oper. Res.
Leandro M. Zatesko, Renato Carmo, André Luiz Pires Guedes, Raphael C. S. Machado, Celina M. H. de Figueiredo
2024 J jnl
The sandwich problem for odd-hole-free and even-hole-free graphs.
CoRR
Kathie Cameron, Aristotelis Chaniotis, Celina M. H. de Figueiredo, Sophie Spirkl
2023 C conf
Hyper-heuristics with Path Relinking applied to the Generalised Time-Dependent ATSP in air travel.
LAGOS
Matheus Simões, Laura Bahiense, Celina M. H. de Figueiredo
2023 J jnl
MaxCut on permutation graphs is NP-complete.
J. Graph Theory
Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Fabiano de S. Oliveira, Ana Silva
2023 J jnl
On the computational difficulty of the terminal connection problem.
RAIRO Theor. Informatics Appl.
Alexsander Andrade de Melo, Celina M. H. de Figueiredo, Uéverton S. Souza
2023 J jnl
On the degree of trees with game chromatic number 4.
RAIRO Oper. Res.
Ana Luísa C. Furtado, Miguel A. D. R. Palma, Simone Dantas, Celina M. H. de Figueiredo
2023 J jnl
On total coloring the direct product of cycles and bipartite direct product of graphs.
Discret. Math.
Diane Castonguay, Celina M. H. de Figueiredo, Luis A. B. Kowada, Caroline Reis Patrão, Diana Sasaki
2022 J jnl
Compositions, decompositions, and conformability for total coloring on power of cycle graphs.
Discret. Appl. Math.
Alesom Zorzi, Celina M. H. de Figueiredo, Raphael C. S. Machado, Leandro M. Zatesko, Uéverton S. Souza
2022 J jnl
Computing the zig-zag number of directed graphs.
Discret. Appl. Math.
Mitre Costa Dourado, Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Mateus de Oliveira Oliveira, Uéverton S. Souza
2022 J jnl
MaxCut on Permutation Graphs is NP-complete.
CoRR
Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Fabiano de S. Oliveira, Ana Silva
2022 J jnl
On total and edge coloring some Kneser graphs.
J. Comb. Optim.
Celina M. H. de Figueiredo, Caroline Reis Patrão, Diana Sasaki, Mario Valencia-Pabon
2022 B conf
Parameterized Algorithms for Steiner Tree and Dominating Set: Bounding the Leafage by the Vertex Leafage.
WALCOM
Celina M. H. de Figueiredo, Raul Lopes, Alexsander Andrade de Melo, Ana Silva
2022 J jnl
Revising Johnson's table for the 21st century.
Discret. Appl. Math.
Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Diana Sasaki, Ana Silva
2022 J jnl
Total tessellation cover: Bounds, hardness, and applications.
Discret. Appl. Math.
Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Celina M. H. de Figueiredo, Franklin L. Marquezino, Daniel Posner, Renato Portugal
2021 J jnl
A computational complexity comparative study of graph tessellation problems.
Theor. Comput. Sci.
Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Celina M. H. de Figueiredo, Luis A. B. Kowada, Franklin L. Marquezino, Renato Portugal, Daniel Posner
2021 B conf
Maximum Cut on Interval Graphs of Interval Count Four Is NP-Complete.
MFCS
Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Fabiano de S. Oliveira, Ana Silva
2021 J jnl
Most direct product of graphs are Type 1.
CoRR
Diane Castonguay, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada, Caroline Reis Patrão, Diana Sasaki
2021 B conf
On the Terminal Connection Problem.
SOFSEM
Alexsander Andrade de Melo, Celina M. H. de Figueiredo, Uéverton S. Souza
2021 C conf
On total coloring the direct product of complete graphs.
LAGOS
Diane Castonguay, Celina M. H. de Figueiredo, Luis A. B. Kowada, Caroline Reis Patrão, Diana Sasaki, Mario Valencia-Pabon
2021 J jnl
On undirected two-commodity integral flow, disjoint paths and strict terminal connection problems.
Networks
Alexsander Andrade de Melo, Celina M. H. de Figueiredo, Uéverton dos Santos Souza
2021 J jnl
Revising Johnson's table for the 21st century.
CoRR
Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Diana Sasaki, Ana Silva
2020 J jnl
A multivariate analysis of the strict terminal connection problem.
J. Comput. Syst. Sci.
Alexsander Andrade de Melo, Celina M. H. de Figueiredo, Uéverton S. Souza
2020 J jnl
Complexity-separating graph classes for vertex, edge and total colouring.
Discret. Appl. Math.
Celina M. H. de Figueiredo
2020 J jnl
Maximum cut on interval graphs of interval count five is NP-complete.
CoRR
Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Fabiano de S. Oliveira, Ana Silva
2020 J jnl
On the computational complexity of closest genome problems.
Discret. Appl. Math.
Luís Felipe I. Cunha, Pedro Feijão, Vinícius Fernandes dos Santos, Luis Antonio Brasil Kowada, Celina M. H. de Figueiredo
2020 J jnl
The graph tessellation cover number: Chromatic bounds, efficient algorithms and hardness.
Theor. Comput. Sci.
Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Celina M. H. de Figueiredo, Luis A. B. Kowada, Franklin L. Marquezino, Daniel Posner, Renato Portugal
2020 J jnl
Total tessellation cover and quantum walk.
CoRR
Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Celina M. H. de Figueiredo, Franklin L. Marquezino, Daniel Posner, Renato Portugal
2019 C conf
A General Method for Forbidden Induced Subgraph Sandwich Problem NP-completeness.
LAGOS
Simone Dantas, Celina M. H. de Figueiredo, Priscila Petito, Rafael B. Teixeira
2019 C conf
Even-power of Cycles With Many Vertices are Type 1 Total Colorable.
LAGOS
Alesom Zorzi, Celina M. H. de Figueiredo, Raphael Machado, Uéverton S. Souza
2019 C conf
On Caterpillars of Game Chromatic Number 4.
LAGOS
Ana Luísa C. Furtado, Simone Dantas, Celina M. H. de Figueiredo, Sylvain Gravier
2019 J jnl
On Nordhaus-Gaddum type inequalities for the game chromatic and game coloring numbers.
Discret. Math.
Clément Charpentier, Simone Dantas, Celina M. H. de Figueiredo, Ana Luísa C. Furtado, Sylvain Gravier
2019 J jnl
On the embedding of cone graphs in the line with distinct distances between neighbors.
Discret. Appl. Math.
Rodrigo M. Zhou, Celina M. H. de Figueiredo, Raphael C. S. Machado, Vinícius Gusmão Pereira de Sá
2019 J jnl
The Tessellation Cover Number of Good Tessellable Graphs.
CoRR
Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Celina M. H. de Figueiredo, Luis A. B. Kowada, Franklin L. Marquezino, Renato Portugal, Daniel Posner
2019 J jnl
Timber game as a counting problem.
Discret. Appl. Math.
Ana Luísa C. Furtado, Simone Dantas, Celina M. H. de Figueiredo, Sylvain Gravier
2018 J jnl
Sandwich and probe problems for excluding paths.
Discret. Appl. Math.
Celina M. H. de Figueiredo, Sophie Spirkl
2018 B conf
The Graph Tessellation Cover Number: Extremal Bounds, Efficient Algorithms and Hardness.
LATIN
Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Tharso D. Fernandes, Celina M. H. de Figueiredo, Luis A. B. Kowada, Franklin L. Marquezino, Daniel Posner, Renato Portugal
2018 J jnl
The Sandwich Problem for Decompositions and Almost Monotone Properties.
Algorithmica
Maria Chudnovsky, Celina M. H. de Figueiredo, Sophie Spirkl
2018 J jnl
The partitioned probe problem: NP-complete versus polynomial dichotomy.
Discret. Appl. Math.
Simone Dantas, Luérbio Faria, Celina M. H. de Figueiredo, Rafael B. Teixeira
2018 J jnl
Using SPQR-trees to speed up recognition algorithms based on 2-cutsets.
Discret. Appl. Math.
Hélio B. Macêdo Filho, Celina M. H. de Figueiredo, Z. Li, Raphael Machado
2017 J jnl
Efficient Algorithms for Clique-Colouring and Biclique-Colouring Unichord-Free Graphs.
Algorithmica
Hélio B. Macêdo Filho, Raphael C. S. Machado, Celina M. H. de Figueiredo
2017 J jnl
Simple Undirected Two-Commodity Integral Flow with a Unitary Demand.
Electron. Notes Discret. Math.
Alexsander Andrade de Melo, Celina M. H. de Figueiredo, Uéverton S. Souza
2017 J jnl
The graph tessellation cover number: extremal bounds, efficient algorithms and hardness.
CoRR
Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Tharso D. Fernandes, Celina M. H. de Figueiredo, Luis A. B. Kowada, Franklin L. Marquezino, Daniel Posner, Renato Portugal
2017 J jnl
The tessellation problem of quantum walks.
CoRR
Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Tharso D. Fernandes, Celina M. H. de Figueiredo, Luis A. B. Kowada, Franklin L. Marquezino, Daniel Posner, Renato Portugal
2016 J jnl
A note on the middle levels problem.
Discret. Appl. Math.
Andréia C. S. Gusmão, Letícia Rodrigues Bueno, Rodrigo de A. Hausen, Celina M. H. de Figueiredo, Luérbio Faria
2016 J jnl
Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3.
Theor. Comput. Sci.
Hélio B. Macêdo Filho, Raphael C. S. Machado, Celina M. H. de Figueiredo
2016 J jnl
Linear-time graph distance and diameter approximation.
Int. Trans. Oper. Res.
Raphael C. S. Machado, Celina M. H. de Figueiredo
2016 J jnl
On the equitable total chromatic number of cubic graphs.
Discret. Appl. Math.
Simone Dantas, Celina M. H. de Figueiredo, Giuseppe Mazzuoccolo, Myriam Preissmann, Vinícius Fernandes dos Santos, Diana Sasaki
2016 J jnl
On the total coloring of generalized Petersen graphs.
Discret. Math.
Simone Dantas, Celina M. H. de Figueiredo, Giuseppe Mazzuoccolo, Myriam Preissmann, Vinícius Fernandes dos Santos, Diana Sasaki
2016 J jnl
The (k, ℓ) unpartitioned probe problem NP-complete versus polynomial dichotomy.
Inf. Process. Lett.
Simone Dantas, Luérbio Faria, Celina M. H. de Figueiredo, Rafael B. Teixeira
2016 J jnl
The Same Upper Bound for Both: The 2-page and the Rectilinear Crossing Numbers of the
J. Graph Theory
Luérbio Faria, Celina M. H. de Figueiredo, R. Bruce Richter, Imrich Vrt'o
2016 J jnl
The cost of perfection for matchings in graphs.
Discret. Appl. Math.
Emilio Vital Brazil, Celina M. H. de Figueiredo, Guilherme Dias da Fonseca, Diana Sasaki
2015 J jnl
A Faster 1.375-Approximation Algorithm for Sorting by Transpositions*.
J. Comput. Biol.
Luís Felipe I. Cunha, Luis Antonio Brasil Kowada, Rodrigo de A. Hausen, Celina M. H. de Figueiredo
2015 J jnl
A new reversible circuit synthesis algorithm based on cycle representations of permutations.
Electron. Notes Discret. Math.
A. C. Ribeiro, Luis A. B. Kowada, Franklin L. Marquezino, Celina M. H. de Figueiredo
2015 J jnl
Biclique-colouring verification complexity and biclique-colouring power graphs.
Discret. Appl. Math.
Hélio B. Macêdo Filho, Simone Dantas, Raphael C. S. Machado, Celina M. H. de Figueiredo
2015 J jnl
Hamiltonian cycles in unitary prefix transposition rearrangement graphs.
Discret. Appl. Math.
C. S. Reis, Luis A. B. Kowada, Letícia Rodrigues Bueno, A. C. Ribeiro, Celina M. H. de Figueiredo
2015 C conf
Sorting Separable Permutations by Restricted Multi-break Rearrangements.
CTW
Luís Felipe I. Cunha, Luis Antonio Brasil Kowada, Celina M. H. de Figueiredo
2015 J jnl
The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem.
Discret. Appl. Math.
Simone Dantas, Celina M. H. de Figueiredo, Frédéric Maffray, Rafael B. Teixeira
2015 C conf
Timber Game with Caterpillars.
CTW
Ana Luísa C. Furtado, Simone Dantas, Celina M. H. de Figueiredo, Sylvain Gravier
2015 J jnl
Using SPQR-trees to speed up algorithms based on 2-cutset decompositions.
Electron. Notes Discret. Math.
Celina M. H. de Figueiredo, Hélio B. Macêdo Filho, Zhentao Li, Raphael Carlos Santos Machado, Nicolas Trotignon
2014 C conf
A Faster 1.375-Approximation Algorithm for Sorting by Transpositions.
WABI
Luís Felipe I. Cunha, Luis Antonio Brasil Kowada, Rodrigo de A. Hausen, Celina M. H. de Figueiredo
2014 J jnl
Blind-friendly von Neumann's Heads or Tails.
CoRR
Vinícius Gusmão Pereira de Sá, Celina M. H. de Figueiredo
2014 J jnl
Blind-friendly von Neumann's Heads or Tails.
Am. Math. Mon.
Vinícius Gusmão Pereira de Sá, Celina M. H. de Figueiredo
2014 J jnl
Complexity of colouring problems restricted to unichord-free and { square, unichord }-free graphs.
Discret. Appl. Math.
Raphael C. S. Machado, Celina M. H. de Figueiredo, Nicolas Trotignon
2014 J jnl
Efficient sub-5 approximations for minimum dominating sets in unit disk graphs.
Theor. Comput. Sci.
Guilherme Dias da Fonseca, Celina M. H. de Figueiredo, Vinícius Gusmão Pereira de Sá, Raphael C. S. Machado
2014 B conf
Hierarchical Complexity of 2-Clique-Colouring Weakly Chordal Graphs and Perfect Graphs Having Cliques of Size at Least 3.
LATIN
Hélio B. Macêdo Filho, Raphael C. S. Machado, Celina M. H. de Figueiredo
2014 B conf
Linear-Time Approximation Algorithms for Unit Disk Graphs.
WAOA
Guilherme Dias da Fonseca, Vinícius Gusmão Pereira de Sá, Celina M. H. de Figueiredo
2014 J jnl
Linear-Time Approximation Algorithms for Unit Disk Graphs.
CoRR
Guilherme Dias da Fonseca, Vinícius Gusmão Pereira de Sá, Celina M. H. de Figueiredo
2014 J jnl
The hunting of a snark with total chromatic number 5.
Discret. Appl. Math.
Diana Sasaki, Simone Dantas, Celina M. H. de Figueiredo, Myriam Preissmann
2013 J jnl
Advancing the Transposition Distance and Diameter through Lonely Permutations.
SIAM J. Discret. Math.
Luís Felipe I. Cunha, Luis Antonio Brasil Kowada, Rodrigo de A. Hausen, Celina M. H. de Figueiredo
2013 J jnl
Complexity of colouring problems restricted to unichord-free and \{square, unichord\}-free graphs.
CoRR
Raphael C. S. Machado, Celina M. H. de Figueiredo, Nicolas Trotignon
2013 J jnl
Edge-colouring and total-colouring chordless graphs.
CoRR
Raphael C. S. Machado, Celina M. H. de Figueiredo, Nicolas Trotignon
2013 J jnl
Edge-colouring and total-colouring chordless graphs.
Discret. Math.
Raphael C. S. Machado, Celina M. H. de Figueiredo, Nicolas Trotignon
2013 J jnl
Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3.
CoRR
Hélio B. Macêdo Filho, Raphael C. S. Machado, Celina M. H. de Figueiredo
2013 — conf
On the 1.375-Approximation Algorithm for Sorting by Transpositions in O(n logn) Time.
BSB
Luís Felipe I. Cunha, Luis Antonio Brasil Kowada, Rodrigo de A. Hausen, Celina M. H. de Figueiredo
2013 C conf
On total coloring and equitable total coloring of cubic graphs with large girth.
CTW
Simone Dantas, Celina M. H. de Figueiredo, Giuseppe Mazzuoccolo, Myriam Preissmann, Vinícius Fernandes dos Santos, Diana Sasaki
2013 J jnl
Split clique graph complexity.
Theor. Comput. Sci.
Liliana Alcón, Luérbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez
2013 B conf
The Same Upper Bound for Both: The 2-Page and the Rectilinear Crossing Numbers of the n-Cube.
WG
Luérbio Faria, Celina M. H. de Figueiredo, R. Bruce Richter, Imrich Vrto
2013 J jnl
The generalized split probe problem.
Electron. Notes Discret. Math.
Simone Dantas, Luérbio Faria, Celina M. H. de Figueiredo, Rafael B. Teixeira
2012 C conf
Biclique-colouring - Powers of Paths and Powers of Cycles.
CTW
Hélio B. Macêdo Filho, Simone Dantas, Raphael C. S. Machado, Celina M. H. de Figueiredo
2012 J jnl
Biclique-colouring powers of paths and powers of cycles
CoRR
Hélio B. Macêdo Filho, Simone Dantas, Raphael C. S. Machado, Celina M. H. de Figueiredo
2012 J jnl
Cayley graphs and analysis of quantum cost for reversible circuit synthesis
CoRR
A. C. Ribeiro, Celina M. H. de Figueiredo, Franklin L. Marquezino, Luis A. B. Kowada
2012 B conf
Clique-Colouring and Biclique-Colouring Unichord-Free Graphs.
LATIN
Hélio B. Macêdo Filho, Raphael C. S. Machado, Celina M. H. de Figueiredo
2012 J jnl
Graph theory and algorithms - Fourth Latin-American Workshop on Cliques in Graphs.
J. Braz. Comput. Soc.
Celina M. H. de Figueiredo, Jayme Luiz Szwarcfiter
2012 J jnl
Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs
CoRR
Guilherme Dias da Fonseca, Celina M. H. de Figueiredo, Vinícius G. P. de Sá, Raphael Machado
2012 B conf
Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs.
WAOA
Guilherme Dias da Fonseca, Celina M. H. de Figueiredo, Vinícius G. P. de Sá, Raphael Machado
2012 C conf
Snarks with Total Chromatic Number 5.
CTW
Gunnar Brinkmann, Simone Dantas, Celina M. H. de Figueiredo, Myriam Preissmann, Diana Sasaki
2012 J jnl
The Cost of Perfection for Matchings in Graphs
CoRR
Emilio Vital Brazil, Guilherme Dias da Fonseca, Celina M. H. de Figueiredo
2012 J jnl
The P versus NP-complete dichotomy of some challenging problems in graph theory.
Discret. Appl. Math.
Celina M. H. de Figueiredo
2012 J jnl
The total chromatic number of split-indifference graphs.
Discret. Math.
C. N. Campos, Celina M. H. de Figueiredo, Raphael Machado, Célia Picinin de Mello
2012 — conf
Transposition Diameter and Lonely Permutations.
BSB
Luís Felipe I. Cunha, Luis Antonio Brasil Kowada, Rodrigo de A. Hausen, Celina M. H. de Figueiredo
2011 J jnl
A decomposition for total-coloring partial-grids and list-total-coloring outerplanar graphs.
Networks
Raphael C. S. Machado, Celina M. H. de Figueiredo
2011 — conf
Analysis and Implementation of Sorting by Transpositions Using Permutation Trees.
BSB
Marcelo P. Lopes, Marília D. V. Braga, Celina M. H. de Figueiredo, Rodrigo de A. Hausen, Luis Antonio Brasil Kowada
2011 J jnl
Complexity dichotomy on partial grid recognition.
Theor. Comput. Sci.
Vinícius G. P. de Sá, Guilherme Dias da Fonseca, Raphael C. S. Machado, Celina M. H. de Figueiredo
2011 J jnl
Complexity separating classes for edge-colouring and total-colouring.
J. Braz. Comput. Soc.
Raphael Machado, Celina M. H. de Figueiredo
2011 J jnl
Hamiltonian Cycles in Kneser Graphs for n=2k+2.
Electron. Notes Discret. Math.
Letícia Rodrigues Bueno, Celina M. H. de Figueiredo, Luérbio Faria, Candido F. X. Mendonça, Rodrigo de A. Hausen
2011 J jnl
On Coloring Problems of Snark Families.
Electron. Notes Discret. Math.
Diana Sasaki, Simone Dantas, Celina M. H. de Figueiredo
2011 J jnl
On the forbidden induced subgraph sandwich problem.
Discret. Appl. Math.
Simone Dantas, Celina M. H. de Figueiredo, Murilo Vicente Gonçalves da Silva, Rafael B. Teixeira
2011 B conf
Split Clique Graph Complexity.
WG
Liliana Alcón, Luérbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez
2011 J jnl
The chain graph sandwich problem.
Ann. Oper. Res.
Simone Dantas, Celina M. H. de Figueiredo, Martin Charles Golumbic, Sulamita Klein, Frédéric Maffray
2011 J jnl
The external constraint 4 nonempty part sandwich problem.
Discret. Appl. Math.
Rafael B. Teixeira, Simone Dantas, Celina M. H. de Figueiredo
2011 J jnl
Total chromatic number of unichord-free graphs.
Discret. Appl. Math.
Raphael C. S. Machado, Celina M. H. de Figueiredo
2011 J jnl
Transitive orientations in bull-reducible Berge graphs.
Discret. Appl. Math.
Celina M. H. de Figueiredo, Frédéric Maffray, Cláudia Villela Maciel
2010 J jnl
2K
Discret. Math.
Kathryn Cook, Simone Dantas, Elaine M. Eschen, Luérbio Faria, Celina M. H. de Figueiredo, Sulamita Klein
2010 — conf
Advances on the List Stubborn Problem.
CATS
Simone Dantas, Luérbio Faria, Celina M. H. de Figueiredo, Sulamita Klein, Loana Tito Nogueira, Fábio Protti
2010 — conf
Bounds on the Transposition Distance for Lonely Permutations.
BSB
Luis Antonio Brasil Kowada, Rodrigo de A. Hausen, Celina M. H. de Figueiredo
2010 C conf
Chromatic Index of Chordless Graphs.
CTW
Raphael Machado, Celina M. H. de Figueiredo, Nicolas Trotignon
2010 J jnl
Chromatic index of graphs with no cycle with a unique chord.
Theor. Comput. Sci.
Raphael C. S. Machado, Celina M. H. de Figueiredo, Kristina Vuskovic
2010 J jnl
Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges.
Electron. Notes Discret. Math.
Vinícius G. P. de Sá, Celina M. H. de Figueiredo, Guilherme Dias da Fonseca, Raphael Machado
2010 J jnl
Complexity dichotomy on partial grid recognition
CoRR
Vinícius G. P. de Sá, Guilherme Dias da Fonseca, Raphael Machado, Celina M. H. de Figueiredo
2010 J jnl
Decompositions for edge-coloring join graphs and cobipartite graphs.
Discret. Appl. Math.
Raphael C. S. Machado, Celina M. H. de Figueiredo
2010 J jnl
On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs.
Discret. Appl. Math.
Liliana Alcón, Luérbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez
2010 J jnl
The polynomial dichotomy for three nonempty part sandwich problems.
Discret. Appl. Math.
Rafael B. Teixeira, Simone Dantas, Celina M. H. de Figueiredo
2010 J jnl
Total chromatic number of {square, unichord}-free graphs.
Electron. Notes Discret. Math.
Raphael C. S. Machado, Celina M. H. de Figueiredo
2010 J jnl
Unitary Toric Classes, the Reality and Desire Diagram, and Sorting by Transpositions.
SIAM J. Discret. Math.
Rodrigo de A. Hausen, Luérbio Faria, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada
2009 J jnl
Enclosing weighted points with an almost-unit ball.
Inf. Process. Lett.
Celina M. H. de Figueiredo, Guilherme Dias da Fonseca
2009 C conf
NP-Completeness of Determining the Total Chromatic Number of Graphs that do not Contain a Cycle with a Unique Chord.
CTW
Raphael Machado, Celina M. H. de Figueiredo
2009 J jnl
Skew partition sandwich problem is NP-complete.
Electron. Notes Discret. Math.
Rafael B. Teixeira, Simone Dantas, Celina M. H. de Figueiredo
2009 J jnl
Skewness, splitting number and vertex deletion of some toroidal meshes.
Ars Comb.
Candido Ferreira Xavier de Mendonça Neto, Ademir Aparecido Constantino, Erico F. Xavier, Jorge Stolfi, Luérbio Faria, Celina M. H. de Figueiredo
2009 J jnl
The complexity of clique graph recognition.
Theor. Comput. Sci.
Liliana Alcón, Luérbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez
2008 J jnl
2K
Electron. Notes Discret. Math.
Simone Dantas, Elaine M. Eschen, Luérbio Faria, Celina M. H. de Figueiredo, Sulamita Klein
2008 C conf
A decomposition for total-coloring graphs of maximum degree 3.
CTW
Raphael Machado, Celina M. H. de Figueiredo
2008 J jnl
An improved upper bound on the crossing number of the hypercube.
J. Graph Theory
Luérbio Faria, Celina M. H. de Figueiredo, Ondrej Sýkora, Imrich Vrto
2008 J jnl
Helly Property, Clique Graphs, Complementary Graph Classes, and Sandwich Problems.
J. Braz. Comput. Soc.
Mitre Costa Dourado, Priscila Petito, Rafael B. Teixeira, Celina M. H. de Figueiredo
2008 J jnl
On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs.
Electron. Notes Discret. Math.
Liliana Alcón, Luérbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez
2008 — conf
On the Toric Graph as a Tool to Handle the Problem of Sorting by Transpositions.
BSB
Rodrigo de A. Hausen, Luérbio Faria, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada
2008 J jnl
Preface.
Discret. Appl. Math.
Paulo Feofiloff, Celina M. H. de Figueiredo, Yoshiko Wakabayashi
2008 J jnl
Sufficient conditions for a graph to be edge-colorable with maximum degree colors.
Electron. Notes Discret. Math.
Raphael C. S. Machado, Celina M. H. de Figueiredo
2008 J jnl
The polynomial dichotomy for three nonempty part sandwich problems.
Electron. Notes Discret. Math.
Rafael B. Teixeira, Simone Dantas, Celina M. H. de Figueiredo
2007 J jnl
On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs.
Theor. Comput. Sci.
Celina M. H. de Figueiredo, Luérbio Faria, Sulamita Klein, R. Sritharan
2007 J jnl
On the generation of bicliques of a graph.
Discret. Appl. Math.
Vânia M. Félix Dias, Celina M. H. de Figueiredo, Jayme Luiz Szwarcfiter
2007 J jnl
Tree loop graphs.
Discret. Appl. Math.
Liliana Alcón, Márcia R. Cerioli, Celina M. H. de Figueiredo, Marisa Gutierrez, João Meidanis
2006 J jnl
A characterization of P
Discret. Math.
Celina M. H. de Figueiredo, Chính T. Hoàng, Frédéric Maffray
2006 J jnl
Algorithms for the Homogeneous Set Sandwich Problem.
Algorithmica
Celina M. H. de Figueiredo, Guilherme Dias da Fonseca, Vinícius G. P. de Sá, Jeremy P. Spinrad
2006 B conf
Clique Graph Recognition Is NP-Complete.
WG
Liliana Alcón, Luérbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez
2006 J jnl
Extended skew partition problem.
Discret. Math.
Simone Dantas, Celina M. H. de Figueiredo, Sylvain Gravier, Sulamita Klein
2006 J jnl
On maximum planar induced subgraphs.
Discret. Appl. Math.
Luérbio Faria, Celina M. H. de Figueiredo, Sylvain Gravier, Candido Ferreira Xavier de Mendonça Neto, Jorge Stolfi
2006 J jnl
Reversible Karatsuba's Algorithm.
J. Univers. Comput. Sci.
Luis Antonio Brasil Kowada, Renato Portugal, Celina M. H. de Figueiredo
2006 J jnl
The Pair Completion algorithm for the Homogeneous Set Sandwich Problem.
Inf. Process. Lett.
Claudson F. Bornstein, Celina M. H. de Figueiredo, Vinícius G. P. de Sá
2006 J jnl
The sandwich problem for cutsets: Clique cutset, k-star cutset.
Discret. Appl. Math.
Rafael B. Teixeira, Celina M. H. de Figueiredo
2005 J jnl
Finding H-partitions efficiently.
RAIRO Theor. Informatics Appl.
Simone Dantas, Celina M. H. de Figueiredo, Sylvain Gravier, Sulamita Klein
2005 J jnl
Generating bicliques of a graph in lexicographic order.
Theor. Comput. Sci.
Vânia M. Félix Dias, Celina M. H. de Figueiredo, Jayme Luiz Szwarcfiter
2005 J jnl
Loop Graphs and Asteroidal Sets.
Electron. Notes Discret. Math.
Liliana Alcón, Márcia R. Cerioli, Celina M. H. de Figueiredo, Marisa Gutierrez, João Meidanis
2005 J jnl
Non loop graphs with induced cycles.
Electron. Notes Discret. Math.
Liliana Alcón, Márcia R. Cerioli, Celina M. H. de Figueiredo, Marisa Gutierrez, João Meidanis
2005 J jnl
Note on the Homogeneous Set Sandwich Problem.
Inf. Process. Lett.
Celina M. H. de Figueiredo, Vinícius G. P. de Sá
2005 J jnl
Preface.
Electron. Notes Discret. Math.
Paulo Feofiloff, Celina M. H. de Figueiredo, Yoshiko Wakabayashi
2005 J jnl
The non planar vertex deletion of Cn x Cm.
Ars Comb.
Candido Ferreira Xavier de Mendonça Neto, Erico F. Xavier, Jorge Stolfi, Luérbio Faria, Celina M. H. de Figueiredo
2005 J jnl
The perfection and recognition of bull-reducible Berge graphs.
RAIRO Theor. Informatics Appl.
Hazel Everett, Celina M. H. de Figueiredo, Sulamita Klein, Bruce A. Reed
2004 — conf
Faster Deterministic and Randomized Algorithms on the Homogeneous Set Sandwich Problem.
WEA
Celina M. H. de Figueiredo, Guilherme Dias da Fonseca, Vinícius G. P. de Sá, Jeremy P. Spinrad
2004 J jnl
Kinetic hanger.
Inf. Process. Lett.
Guilherme Dias da Fonseca, Celina M. H. de Figueiredo, Paulo Cezar Pinto Carvalho
2004 J jnl
Nonplanar vertex deletion: maximum degree thresholds for NP/Max SNP-hardness and a
Electron. Notes Discret. Math.
Luérbio Faria, Celina M. H. de Figueiredo, Sylvain Gravier, Candido F. X. Mendonça, Jorge Stolfi
2004 J jnl
On decision and optimization (
Discret. Appl. Math.
Simone Dantas, Celina M. H. de Figueiredo, Luérbio Faria
2004 C conf
On the Generation of Bicliques of a Graph.
CTW
Vânia M. Félix Dias, Celina M. H. de Figueiredo, Jayme Luiz Szwarcfiter
2004 J jnl
On the complexity of the approximation of nonplanarity parameters for cubic graphs.
Discret. Appl. Math.
Luérbio Faria, Celina M. H. de Figueiredo, Candido Ferreira Xavier de Mendonça Neto
2004 J jnl
On the generation of bicliques of a graph.
Electron. Notes Discret. Math.
Vânia M. Félix Dias, Celina M. H. de Figueiredo, Jayme Luiz Szwarcfiter
2004 J jnl
Optimizing Bull-Free Perfect Graphs.
SIAM J. Discret. Math.
Celina M. H. de Figueiredo, Frédéric Maffray
2004 — conf
Simple Max-Cut for Split-Indifference Graphs and Graphs with Few P
WEA
Hans L. Bodlaender, Celina M. H. de Figueiredo, Marisa Gutierrez, Ton Kloks, Rolf Niedermeier
2004 J jnl
Stable skew partition problem.
Discret. Appl. Math.
Simone Dantas, Celina M. H. de Figueiredo, Sulamita Klein, Sylvain Gravier, Bruce A. Reed
2004 J jnl
The sandwich problem for cutsets.
Electron. Notes Discret. Math.
Rafael B. Teixeira, Celina M. H. de Figueiredo
2004 J jnl
Tree Loop Graphs.
Electron. Notes Discret. Math.
Liliana Alcón, Celina M. H. de Figueiredo, Márcia R. Cerioli, Marisa Gutierrez, João Meidanis
2003 B conf
An Improved Upper Bound on the Crossing Number of the Hypercube.
WG
Luérbio Faria, Celina M. H. de Figueiredo, Ondrej Sýkora, Imrich Vrto
2003 J jnl
Decompositions for the edge colouring of reduced indifference graphs.
Theor. Comput. Sci.
Celina M. H. de Figueiredo, João Meidanis, Célia Picinin de Mello, Carmen Ortiz
2003 J jnl
Kinetic heap-ordered trees: Tight analysis and improved algorithms.
Inf. Process. Lett.
Guilherme Dias da Fonseca, Celina M. H. de Figueiredo
2003 J jnl
The stable marriage problem with restricted pairs.
Theor. Comput. Sci.
Vânia M. Félix Dias, Guilherme Dias da Fonseca, Celina M. H. de Figueiredo, Jayme Luiz Szwarcfiter
2002 J jnl
A note on transitive orientations with maximum sets of sources and sinks.
Discret. Appl. Math.
Celina M. H. de Figueiredo, John G. Gimbel, Célia Picinin de Mello, Jayme Luiz Szwarcfiter
2002 B conf
On the Complexity of (k, l)-Graph Sandwich Problems.
WG
Simone Dantas, Celina M. H. de Figueiredo, Luérbio Faria
2002 J jnl
The graph sandwich problem for 1-join composition is NP-complete.
Discret. Appl. Math.
Celina M. H. de Figueiredo, Sulamita Klein, Kristina Vuskovic
2002 J jnl
The splitting number and skewness of C
Ars Comb.
Candido Ferreira Xavier de Mendonça Neto, Karl Schaffer, Erico F. Xavier, Jorge Stolfi, Luérbio Faria, Celina M. H. de Figueiredo
2001 J jnl
Bull-Reducible Berge Graphs are Perfect.
Electron. Notes Discret. Math.
Hazel Everett, Celina M. H. de Figueiredo, Sulamita Klein, Bruce A. Reed
2001 J jnl
On Tucker's proof of the strong perfect graph conjecture for (
Discret. Math.
Celina M. H. de Figueiredo, Sylvain Gravier, Cláudia Linhares Sales
2001 J jnl
On the Structure of Bull-Free Perfect Graphs, 2: the Weakly Chordal Case.
Graphs Comb.
Celina M. H. de Figueiredo, Frédéric Maffray, Oscar Porto
2001 J jnl
On the complexity of the approximation of nonplanarity parameters for cubic graphs.
Electron. Notes Discret. Math.
Luérbio Faria, Celina M. H. de Figueiredo, Candido Ferreira Xavier de Mendonça Neto
2001 J jnl
Recognition of quasi-Meyniel graphs.
Discret. Appl. Math.
Celina M. H. de Figueiredo, Kristina Vuskovic
2001 J jnl
SPLITTING NUMBER is NP-complete.
Discret. Appl. Math.
Luérbio Faria, Celina M. H. de Figueiredo, Candido Ferreira Xavier de Mendonça Neto
2001 J jnl
Stable marriages with restricted pairs.
Electron. Notes Discret. Math.
Vânia M. Félix Dias, Guilherme Dias da Fonseca, Celina M. H. de Figueiredo, Jayme Luiz Szwarcfiter
2000 J jnl
A class of ?-perfect graphs.
Discret. Math.
Celina M. H. de Figueiredo, Kristina Vuskovic
2000 B conf
Edge Colouring Reduced Indifference Graphs.
LATIN
Celina M. H. de Figueiredo, Célia Picinin de Mello, Carmen Ortiz
2000 B conf
Finding Skew Partitions Efficiently.
LATIN
Celina M. H. de Figueiredo, Sulamita Klein, Yoshiharu Kohayakawa, Bruce A. Reed
2000 J jnl
Finding Skew Partitions Efficiently.
J. Algorithms
Celina M. H. de Figueiredo, Sulamita Klein, Yoshiharu Kohayakawa, Bruce A. Reed
2000 J jnl
The graph sandwich problem for 1-join composition is NP-complete.
Electron. Notes Discret. Math.
Celina M. H. de Figueiredo, Sulamita Klein, Kristina Vuskovic
1999 J jnl
Even and Odd Pairs in Comparability and in P4-comparability Graphs.
Discret. Appl. Math.
Celina M. H. de Figueiredo, John G. Gimbel, Célia Picinin de Mello, Jayme Luiz Szwarcfiter
1999 J jnl
Linear-time Algorithms for Maximum Sets of Sources and sinks.
Electron. Notes Discret. Math.
Celina M. H. de Figueiredo, John G. Gimbel, Célia Picinin de Mello, Jayme Luiz Szwarcfiter
1999 A* conf
Optimal Node-Degree Bounds for the Complexity of Nonplanarity Parameters.
SODA
Celina M. H. de Figueiredo, Luérbio Faria, Candido Ferreira Xavier de Mendonça Neto
1999 J jnl
Total-Chromatic Number and Chromatic Index of Dually Chordal Graphs.
Inf. Process. Lett.
Celina M. H. de Figueiredo, João Meidanis, Célia Picinin de Mello
1998 B conf
Splitting Number is NP-complete
WG
Luérbio Faria, Celina M. H. de Figueiredo, Candido Ferreira Xavier de Mendonça Neto
1998 J jnl
The Homogeneous Set Sandwich Problem.
Inf. Process. Lett.
Márcia R. Cerioli, Hazel Everett, Celina M. H. de Figueiredo, Sulamita Klein
1998 B conf
The Splitting Number of the 4-Cube.
LATIN
Luérbio Faria, Celina M. H. de Figueiredo, Candido Ferreira Xavier de Mendonça Neto
1997 J jnl
On Edge-Colouring Indifference Graphs.
Theor. Comput. Sci.
Celina M. H. de Figueiredo, João Meidanis, Célia Picinin de Mello
1997 J jnl
On the structure of bull-free perfect graphs.
Graphs Comb.
Celina M. H. de Figueiredo, Frédéric Maffray, Oscar Porto
1997 J jnl
Path parity and perfection.
Discret. Math.
Hazel Everett, Celina M. H. de Figueiredo, Cláudia Linhares Sales, Frédéric Maffray, Oscar Porto, Bruce A. Reed
1995 J jnl
A Linear-Time Algorithm for Proper Interval Graph Recognition.
Inf. Process. Lett.
Celina M. H. de Figueiredo, João Meidanis, Célia Picinin de Mello
1995 B conf
On Edge-Colouring Indifference Graphs.
LATIN
Celina M. H. de Figueiredo, João Meidanis, Célia Picinin de Mello