Celina M. H. de Figueiredo

ORCID

Publication Activity (10 Years)

Years Active: 1995-2024
Publications (10 Years): 53

Top Venues

Publications

Leandro M. Zatesko, Renato Carmo, André Luiz Pires Guedes, Raphael C. S. Machado, Celina M. H. de Figueiredo
-snark. RAIRO Oper. Res. 58 (3) (2024)
Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Fabiano de S. Oliveira, Ana Silva
Maximum Cut on Interval Graphs of Interval Count Four is NP-Complete. Discret. Comput. Geom. 71 (3) (2024)
Kathie Cameron, Aristotelis Chaniotis, Celina M. H. de Figueiredo, Sophie Spirkl
The sandwich problem for odd-hole-free and even-hole-free graphs. CoRR (2024)
Celina M. H. de Figueiredo, Elizabeth W. Karas, Claudia A. Sagastizábal
IFORS' Operational Research Hall of Fame: Clóvis Caesar Gonzaga. Int. Trans. Oper. Res. 31 (4) (2024)
Matheus Adauto, Viktoriya Bardenova, Mariana da Cruz, Celina M. H. de Figueiredo, Glenn Hurlbert, Diana Sasaki
Pebbling in Kneser Graphs. LATIN (2) (2024)
Ana Luísa C. Furtado, Miguel A. D. R. Palma, Simone Dantas, Celina M. H. de Figueiredo
On the degree of trees with game chromatic number 4. RAIRO Oper. Res. 57 (5) (2023)
Alexsander Andrade de Melo, Celina M. H. de Figueiredo, Uéverton S. Souza
On the computational difficulty of the terminal connection problem. RAIRO Theor. Informatics Appl. 57 (2023)
Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Fabiano de S. Oliveira, Ana Silva
MaxCut on permutation graphs is NP-complete. J. Graph Theory 104 (1) (2023)
Diane Castonguay, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada, Caroline Reis Patrão, Diana Sasaki
On total coloring the direct product of cycles and bipartite direct product of graphs. Discret. Math. 346 (6) (2023)
Celina M. H. de Figueiredo, Caroline Reis Patrão, Diana Sasaki, Mario Valencia-Pabon
On total and edge coloring some Kneser graphs. J. Comb. Optim. 44 (1) (2022)
Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Fabiano de S. Oliveira, Ana Silva
MaxCut on Permutation Graphs is NP-complete. CoRR (2022)
Mitre Costa Dourado, Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Mateus de Oliveira Oliveira, Uéverton S. Souza
Computing the zig-zag number of directed graphs. Discret. Appl. Math. 312 (2022)
Alesom Zorzi, Celina M. H. de Figueiredo, Raphael C. S. Machado, Leandro M. Zatesko, Uéverton S. Souza
Compositions, decompositions, and conformability for total coloring on power of cycle graphs. Discret. Appl. Math. 323 (2022)
Celina M. H. de Figueiredo, Raul Lopes, Alexsander Andrade de Melo, Ana Silva
Parameterized Algorithms for Steiner Tree and Dominating Set: Bounding the Leafage by the Vertex Leafage. WALCOM (2022)
Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Diana Sasaki, Ana Silva
Revising Johnson's table for the 21st century. Discret. Appl. Math. 323 (2022)
Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Celina M. H. de Figueiredo, Franklin L. Marquezino, Daniel Posner, Renato Portugal
Total tessellation cover: Bounds, hardness, and applications. Discret. Appl. Math. 323 (2022)
Alexsander Andrade de Melo, Celina M. H. de Figueiredo, Uéverton dos Santos Souza
On undirected two-commodity integral flow, disjoint paths and strict terminal connection problems. Networks 77 (4) (2021)
Alexsander Andrade de Melo, Celina M. H. de Figueiredo, Uéverton S. Souza
On the Terminal Connection Problem. SOFSEM (2021)
Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Diana Sasaki, Ana Silva
Revising Johnson's table for the 21st century. CoRR (2021)
Diane Castonguay, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada, Caroline Reis Patrão, Diana Sasaki
Most direct product of graphs are Type 1. CoRR (2021)
Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Fabiano de S. Oliveira, Ana Silva
Maximum Cut on Interval Graphs of Interval Count Four Is NP-Complete. MFCS (2021)
Diane Castonguay, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada, Caroline Reis Patrão, D. Sasaki, Mario Valencia-Pabon
On total coloring the direct product of complete graphs. LAGOS (2021)
Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada, Franklin L. Marquezino, Renato Portugal, Daniel Posner
A computational complexity comparative study of graph tessellation problems. Theor. Comput. Sci. 858 (2021)
Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada, Franklin L. Marquezino, Daniel Posner, Renato Portugal
The graph tessellation cover number: Chromatic bounds, efficient algorithms and hardness. Theor. Comput. Sci. 801 (2020)
Luís Felipe I. Cunha, Pedro Feijão, Vinícius Fernandes dos Santos, Luis Antonio Brasil Kowada, Celina M. H. de Figueiredo
On the computational complexity of closest genome problems. Discret. Appl. Math. 274 (2020)
Alexsander Andrade de Melo, Celina M. H. de Figueiredo, Uéverton S. Souza
A multivariate analysis of the strict terminal connection problem. J. Comput. Syst. Sci. 111 (2020)
Celina M. H. de Figueiredo
Complexity-separating graph classes for vertex, edge and total colouring. Discret. Appl. Math. 281 (2020)
Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Celina M. H. de Figueiredo, Franklin L. Marquezino, Daniel Posner, Renato Portugal
Total tessellation cover and quantum walk. CoRR (2020)
Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Fabiano de S. Oliveira, Ana Silva
Maximum cut on interval graphs of interval count five is NP-complete. CoRR (2020)
Ana Luísa Furtado, Simone Dantas, Celina M. H. de Figueiredo, Sylvain Gravier
On Caterpillars of Game Chromatic Number 4. LAGOS (2019)
Ana Luísa Furtado, Simone Dantas, Celina M. H. de Figueiredo, Sylvain Gravier
Timber game as a counting problem. Discret. Appl. Math. 261 (2019)
Rodrigo M. Zhou, Celina M. H. de Figueiredo, Raphael C. S. Machado, Vinícius Gusmão Pereira de Sá
On the embedding of cone graphs in the line with distinct distances between neighbors. Discret. Appl. Math. 256 (2019)
Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada, Franklin L. Marquezino, Renato Portugal, Daniel Posner
The Tessellation Cover Number of Good Tessellable Graphs. CoRR (2019)
Alesom Zorzi, Celina M. H. de Figueiredo, Raphael Machado, Uéverton S. Souza
Even-power of Cycles With Many Vertices are Type 1 Total Colorable. LAGOS (2019)
Clément Charpentier, Simone Dantas, Celina M. H. de Figueiredo, Ana Luísa Furtado, Sylvain Gravier
On Nordhaus-Gaddum type inequalities for the game chromatic and game coloring numbers. Discret. Math. 342 (5) (2019)
Simone Dantas, Celina M. H. de Figueiredo, Priscila Petito, Rafael B. Teixeira
A General Method for Forbidden Induced Subgraph Sandwich Problem NP-completeness. LAGOS (2019)
Hélio B. Macêdo Filho, Celina M. H. de Figueiredo, Z. Li, Raphael Machado
Using SPQR-trees to speed up recognition algorithms based on 2-cutsets. Discret. Appl. Math. 245 (2018)
Celina M. H. de Figueiredo, Sophie Spirkl
Sandwich and probe problems for excluding paths. Discret. Appl. Math. 251 (2018)
Maria Chudnovsky, Celina M. H. de Figueiredo, Sophie Spirkl
The Sandwich Problem for Decompositions and Almost Monotone Properties. Algorithmica 80 (12) (2018)
Simone Dantas, Luérbio Faria, Celina M. H. de Figueiredo, Rafael B. Teixeira
The partitioned probe problem: NP-complete versus polynomial dichotomy. Discret. Appl. Math. 234 (2018)
Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Tharso D. Fernandes, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada, Franklin L. Marquezino, Daniel Posner, Renato Portugal
The Graph Tessellation Cover Number: Extremal Bounds, Efficient Algorithms and Hardness. LATIN (2018)
Alexsander Andrade de Melo, Celina M. H. de Figueiredo, Uéverton S. Souza
Simple Undirected Two-Commodity Integral Flow with a Unitary Demand. Electron. Notes Discret. Math. 62 (2017)
Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Tharso D. Fernandes, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada, Franklin L. Marquezino, Daniel Posner, Renato Portugal
The graph tessellation cover number: extremal bounds, efficient algorithms and hardness. CoRR (2017)
Hélio B. Macêdo Filho, Raphael C. S. Machado, Celina M. H. de Figueiredo
Efficient Algorithms for Clique-Colouring and Biclique-Colouring Unichord-Free Graphs. Algorithmica 77 (3) (2017)
Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Tharso D. Fernandes, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada, Franklin L. Marquezino, Daniel Posner, Renato Portugal
The tessellation problem of quantum walks. CoRR (2017)
Hélio B. Macêdo Filho, Raphael C. S. Machado, Celina M. H. de Figueiredo
Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3. Theor. Comput. Sci. 618 (2016)
Luérbio Faria, Celina M. H. de Figueiredo, R. Bruce Richter, Imrich Vrt'o
-Cube. J. Graph Theory 83 (1) (2016)
Simone Dantas, Celina M. H. de Figueiredo, Giuseppe Mazzuoccolo, Myriam Preissmann, Vinícius Fernandes dos Santos, Diana Sasaki
On the total coloring of generalized Petersen graphs. Discret. Math. 339 (5) (2016)
Andréia C. S. Gusmão, Letícia Rodrigues Bueno, Rodrigo de A. Hausen, Celina M. H. de Figueiredo, Luérbio Faria
A note on the middle levels problem. Discret. Appl. Math. 210 (2016)
Simone Dantas, Celina M. H. de Figueiredo, Giuseppe Mazzuoccolo, Myriam Preissmann, Vinícius Fernandes dos Santos, Diana Sasaki
On the equitable total chromatic number of cubic graphs. Discret. Appl. Math. 209 (2016)
Simone Dantas, Luérbio Faria, Celina M. H. de Figueiredo, Rafael B. Teixeira
The (k, ℓ) unpartitioned probe problem NP-complete versus polynomial dichotomy. Inf. Process. Lett. 116 (4) (2016)
Emilio Vital Brazil, Celina M. H. de Figueiredo, Guilherme Dias da Fonseca, Diana Sasaki
The cost of perfection for matchings in graphs. Discret. Appl. Math. 210 (2016)
Raphael C. S. Machado, Celina M. H. de Figueiredo
Linear-time graph distance and diameter approximation. Int. Trans. Oper. Res. 23 (5) (2016)
Luís Felipe I. Cunha, Luis Antonio Brasil Kowada, Rodrigo de A. Hausen, Celina M. H. de Figueiredo
A Faster 1.375-Approximation Algorithm for Sorting by Transpositions*. J. Comput. Biol. 22 (11) (2015)
Celina M. H. de Figueiredo, Hélio B. Macêdo Filho, Z. Li, Raphael Carlos Santos Machado, Nicolas Trotignon
Using SPQR-trees to speed up algorithms based on 2-cutset decompositions. Electron. Notes Discret. Math. 50 (2015)
C. S. Reis, Luis Antonio Brasil Kowada, Letícia Rodrigues Bueno, A. C. Ribeiro, Celina M. H. de Figueiredo
Hamiltonian cycles in unitary prefix transposition rearrangement graphs. Discret. Appl. Math. 192 (2015)
Simone Dantas, Celina M. H. de Figueiredo, Frédéric Maffray, Rafael B. Teixeira
The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem. Discret. Appl. Math. 182 (2015)
Hélio B. Macêdo Filho, Simone Dantas, Raphael C. S. Machado, Celina M. H. de Figueiredo
Biclique-colouring verification complexity and biclique-colouring power graphs. Discret. Appl. Math. 192 (2015)
A. C. Ribeiro, Luis Antonio Brasil Kowada, Franklin L. Marquezino, Celina M. H. de Figueiredo
A new reversible circuit synthesis algorithm based on cycle representations of permutations. Electron. Notes Discret. Math. 50 (2015)
Luís Felipe I. Cunha, Luis Antonio Brasil Kowada, Celina M. H. de Figueiredo
Sorting Separable Permutations by Restricted Multi-break Rearrangements. CTW (2015)
Ana Luísa Furtado, Simone Dantas, Celina M. H. de Figueiredo, Sylvain Gravier
Timber Game with Caterpillars. CTW (2015)
Vinícius Gusmão Pereira de Sá, Celina M. H. de Figueiredo
Blind-friendly von Neumann's Heads or Tails. CoRR (2014)
Raphael C. S. Machado, Celina M. H. de Figueiredo, Nicolas Trotignon
Complexity of colouring problems restricted to unichord-free and { square, unichord }-free graphs. Discret. Appl. Math. 164 (2014)
Vinícius Gusmão Pereira de Sá, Celina M. H. de Figueiredo
Blind-friendly von Neumann's Heads or Tails. Am. Math. Mon. 121 (7) (2014)
Guilherme Dias da Fonseca, Celina M. H. de Figueiredo, Vinícius Gusmão Pereira de Sá, Raphael C. S. Machado
Efficient sub-5 approximations for minimum dominating sets in unit disk graphs. Theor. Comput. Sci. 540 (2014)
Guilherme Dias da Fonseca, Vinícius Gusmão Pereira de Sá, Celina M. H. de Figueiredo
Linear-Time Approximation Algorithms for Unit Disk Graphs. WAOA (2014)
Guilherme Dias da Fonseca, Vinícius Gusmão Pereira de Sá, Celina M. H. de Figueiredo
Linear-Time Approximation Algorithms for Unit Disk Graphs. CoRR (2014)
Luís Felipe I. Cunha, Luis Antonio Brasil Kowada, Rodrigo de A. Hausen, Celina M. H. de Figueiredo
A Faster 1.375-Approximation Algorithm for Sorting by Transpositions. WABI (2014)
Hélio B. Macêdo Filho, Raphael C. S. Machado, Celina M. H. de Figueiredo
Hierarchical Complexity of 2-Clique-Colouring Weakly Chordal Graphs and Perfect Graphs Having Cliques of Size at Least 3. LATIN (2014)
Diana Sasaki, Simone Dantas, Celina M. H. de Figueiredo, Myriam Preissmann
The hunting of a snark with total chromatic number 5. Discret. Appl. Math. 164 (2014)
Raphael C. S. Machado, Celina M. H. de Figueiredo, Nicolas Trotignon
Complexity of colouring problems restricted to unichord-free and \{square, unichord\}-free graphs. CoRR (2013)
Simone Dantas, Celina M. H. de Figueiredo, Giuseppe Mazzuoccolo, Myriam Preissmann, Vinícius Fernandes dos Santos, Diana Sasaki
On total coloring and equitable total coloring of cubic graphs with large girth. CTW (2013)
Hélio B. Macêdo Filho, Raphael C. S. Machado, Celina M. H. de Figueiredo
Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3. CoRR (2013)
Luérbio Faria, Celina M. H. de Figueiredo, R. Bruce Richter, Imrich Vrto
The Same Upper Bound for Both: The 2-Page and the Rectilinear Crossing Numbers of the n-Cube. WG (2013)
Raphael C. S. Machado, Celina M. H. de Figueiredo, Nicolas Trotignon
Edge-colouring and total-colouring chordless graphs. CoRR (2013)
Liliana Alcón, Luérbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez
Split clique graph complexity. Theor. Comput. Sci. 506 (2013)
Luís Felipe I. Cunha, Luis Antonio Brasil Kowada, Rodrigo de A. Hausen, Celina M. H. de Figueiredo
Advancing the Transposition Distance and Diameter through Lonely Permutations. SIAM J. Discret. Math. 27 (4) (2013)
Luís Felipe I. Cunha, Luis Antonio Brasil Kowada, Rodrigo de A. Hausen, Celina M. H. de Figueiredo
On the 1.375-Approximation Algorithm for Sorting by Transpositions in O(n logn) Time. BSB (2013)
Simone Dantas, Luérbio Faria, Celina M. H. de Figueiredo, Rafael B. Teixeira
The generalized split probe problem. Electron. Notes Discret. Math. 44 (2013)
Raphael C. S. Machado, Celina M. H. de Figueiredo, Nicolas Trotignon
Edge-colouring and total-colouring chordless graphs. Discret. Math. 313 (14) (2013)
C. N. Campos, Celina M. H. de Figueiredo, Raphael Machado, Célia Picinin de Mello
The total chromatic number of split-indifference graphs. Discret. Math. 312 (17) (2012)
Hélio B. Macêdo Filho, Simone Dantas, Raphael C. S. Machado, Celina M. H. de Figueiredo
Biclique-colouring - Powers of Paths and Powers of Cycles. CTW (2012)
Hélio B. Macêdo Filho, Raphael C. S. Machado, Celina M. H. de Figueiredo
Clique-Colouring and Biclique-Colouring Unichord-Free Graphs. LATIN (2012)
Celina M. H. de Figueiredo, Jayme Luiz Szwarcfiter
Graph theory and algorithms - Fourth Latin-American Workshop on Cliques in Graphs. J. Braz. Comput. Soc. 18 (2) (2012)
Guilherme Dias da Fonseca, Celina M. H. de Figueiredo, Vinícius G. P. de Sá, Raphael Machado
Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs. WAOA (2012)
Guilherme Dias da Fonseca, Celina M. H. de Figueiredo, Vinícius G. P. de Sá, Raphael Machado
Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs CoRR (2012)
Luís Felipe I. Cunha, Luis Antonio Brasil Kowada, Rodrigo de A. Hausen, Celina M. H. de Figueiredo
Transposition Diameter and Lonely Permutations. BSB (2012)
Emilio Vital Brazil, Guilherme Dias da Fonseca, Celina M. H. de Figueiredo
The Cost of Perfection for Matchings in Graphs CoRR (2012)
Celina M. H. de Figueiredo
The P versus NP-complete dichotomy of some challenging problems in graph theory. Discret. Appl. Math. 160 (18) (2012)
A. C. Ribeiro, Celina M. H. de Figueiredo, Franklin L. Marquezino, Luis Antonio Brasil Kowada
Cayley graphs and analysis of quantum cost for reversible circuit synthesis CoRR (2012)
Gunnar Brinkmann, Simone Dantas, Celina M. H. de Figueiredo, Myriam Preissmann, Diana Sasaki
Snarks with Total Chromatic Number 5. CTW (2012)
Hélio B. Macêdo Filho, Simone Dantas, Raphael C. S. Machado, Celina M. H. de Figueiredo
Biclique-colouring powers of paths and powers of cycles CoRR (2012)
Letícia Rodrigues Bueno, Celina M. H. de Figueiredo, Luérbio Faria, Candido F. X. Mendonça, Rodrigo de A. Hausen
Hamiltonian Cycles in Kneser Graphs for n=2k+2. Electron. Notes Discret. Math. 37 (2011)
Simone Dantas, Celina M. H. de Figueiredo, Murilo Vicente Gonçalves da Silva, Rafael B. Teixeira
On the forbidden induced subgraph sandwich problem. Discret. Appl. Math. 159 (16) (2011)
Raphael Machado, Celina M. H. de Figueiredo
Complexity separating classes for edge-colouring and total-colouring. J. Braz. Comput. Soc. 17 (4) (2011)
Rafael B. Teixeira, Simone Dantas, Celina M. H. de Figueiredo
The external constraint 4 nonempty part sandwich problem. Discret. Appl. Math. 159 (7) (2011)
Vinícius G. P. de Sá, Guilherme Dias da Fonseca, Raphael C. S. Machado, Celina M. H. de Figueiredo
Complexity dichotomy on partial grid recognition. Theor. Comput. Sci. 412 (22) (2011)
Simone Dantas, Celina M. H. de Figueiredo, Martin Charles Golumbic, Sulamita Klein, Frédéric Maffray
The chain graph sandwich problem. Ann. Oper. Res. 188 (1) (2011)
Diana Sasaki, Simone Dantas, Celina M. H. de Figueiredo
On Coloring Problems of Snark Families. Electron. Notes Discret. Math. 37 (2011)
Liliana Alcón, Luérbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez
Split Clique Graph Complexity. WG (2011)

Celina M. H. de Figueiredo.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Celina M. H. de Figueiredo