On Edge-Colouring Indifference Graphs. - Celina M. H. de Figueiredo; João Meidanis; Célia Picinin de Mello (LATIN, 1995)

A Linear-Time Algorithm for Proper Interval Graph Recognition. - Celina M. H. de Figueiredo; João Meidanis; Célia Picinin de Mello (Inf. Process. Lett., 1995)

Path parity and perfection. - Hazel Everett; Celina M. H. de Figueiredo; Cláudia Linhares Sales; Frédéric Maffray; Oscar Porto; Bruce A. Reed (Discret. Math., 1997)

On the structure of bull-free perfect graphs. - Celina M. H. de Figueiredo; Frédéric Maffray; Oscar Porto (Graphs Comb., 1997)

The Splitting Number of the 4-Cube. - Luérbio Faria; Celina M. H. de Figueiredo; Candido Ferreira Xavier de Mendonça Neto (LATIN, 1998)

Splitting Number is NP-complete - Luérbio Faria; Celina M. H. de Figueiredo; Candido Ferreira Xavier de Mendonça Neto (WG, 1998)

The Homogeneous Set Sandwich Problem. - Márcia R. Cerioli; Hazel Everett; Celina M. H. de Figueiredo; Sulamita Klein (Inf. Process. Lett., 1998)

Optimal Node-Degree Bounds for the Complexity of Nonplanarity Parameters. - Celina M. H. de Figueiredo; Luérbio Faria; Candido Ferreira Xavier de Mendonça Neto (SODA, 1999)

Even and Odd Pairs in Comparability and in P4-comparability Graphs. - Celina M. H. de Figueiredo; John G. Gimbel; Célia Picinin de Mello; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 1999)

Linear-time Algorithms for Maximum Sets of Sources and sinks. - Celina M. H. de Figueiredo; John G. Gimbel; Célia Picinin de Mello; Jayme Luiz Szwarcfiter (Electron. Notes Discret. Math., 1999)

Total-Chromatic Number and Chromatic Index of Dually Chordal Graphs. - Celina M. H. de Figueiredo; João Meidanis; Célia Picinin de Mello (Inf. Process. Lett., 1999)

Finding Skew Partitions Efficiently. - Celina M. H. de Figueiredo; Sulamita Klein; Yoshiharu Kohayakawa; Bruce A. Reed (LATIN, 2000)

Edge Colouring Reduced Indifference Graphs. - Celina M. H. de Figueiredo; Célia Picinin de Mello; Carmen Ortiz (LATIN, 2000)

A class of ?-perfect graphs. - Celina M. H. de Figueiredo; Kristina Vuskovic (Discret. Math., 2000)

The graph sandwich problem for 1-join composition is NP-complete. - Celina M. H. de Figueiredo; Sulamita Klein; Kristina Vuskovic (Electron. Notes Discret. Math., 2000)

Recognition of quasi-Meyniel graphs. - Celina M. H. de Figueiredo; Kristina Vuskovic (Discret. Appl. Math., 2001)

On Tucker's proof of the strong perfect graph conjecture for (K4-e)-free graphs. - Celina M. H. de Figueiredo; Sylvain Gravier; Cláudia Linhares Sales (Discret. Math., 2001)

Stable marriages with restricted pairs. - Vânia M. Félix Dias; Guilherme Dias da Fonseca; Celina M. H. de Figueiredo; Jayme Luiz Szwarcfiter (Electron. Notes Discret. Math., 2001)

Bull-Reducible Berge Graphs are Perfect. - Hazel Everett; Celina M. H. de Figueiredo; Sulamita Klein; Bruce A. Reed (Electron. Notes Discret. Math., 2001)

On the complexity of the approximation of nonplanarity parameters for cubic graphs. - Luérbio Faria; Celina M. H. de Figueiredo; Candido Ferreira Xavier de Mendonça Neto (Electron. Notes Discret. Math., 2001)

On the Structure of Bull-Free Perfect Graphs, 2: the Weakly Chordal Case. - Celina M. H. de Figueiredo; Frédéric Maffray; Oscar Porto (Graphs Comb., 2001)

On the Complexity of (k, l)-Graph Sandwich Problems. - Simone Dantas; Celina M. H. de Figueiredo; Luérbio Faria (WG, 2002)

The splitting number and skewness of Cn x Cm. - Candido Ferreira Xavier de Mendonça Neto; Karl Schaffer; Erico F. Xavier; Jorge Stolfi; Luérbio Faria; Celina M. H. de Figueiredo (Ars Comb., 2002)

A note on transitive orientations with maximum sets of sources and sinks. - Celina M. H. de Figueiredo; John G. Gimbel; Célia Picinin de Mello; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2002)

An Improved Upper Bound on the Crossing Number of the Hypercube. - Luérbio Faria; Celina M. H. de Figueiredo; Ondrej Sýkora; Imrich Vrto (WG, 2003)

Kinetic heap-ordered trees: Tight analysis and improved algorithms. - Guilherme Dias da Fonseca; Celina M. H. de Figueiredo (Inf. Process. Lett., 2003)

The stable marriage problem with restricted pairs. - Vânia M. Félix Dias; Guilherme Dias da Fonseca; Celina M. H. de Figueiredo; Jayme Luiz Szwarcfiter (Theor. Comput. Sci., 2003)

Decompositions for the edge colouring of reduced indifference graphs. - Celina M. H. de Figueiredo; João Meidanis; Célia Picinin de Mello; Carmen Ortiz (Theor. Comput. Sci., 2003)

On the Generation of Bicliques of a Graph. - Vânia M. Félix Dias; Celina M. H. de Figueiredo; Jayme Luiz Szwarcfiter (CTW, 2004)

Simple Max-Cut for Split-Indifference Graphs and Graphs with Few P4's. - Hans L. Bodlaender; Celina M. H. de Figueiredo; Marisa Gutierrez; Ton Kloks; Rolf Niedermeier (WEA, 2004)

Faster Deterministic and Randomized Algorithms on the Homogeneous Set Sandwich Problem. - Celina M. H. de Figueiredo; Guilherme Dias da Fonseca; Vinícius G. P. de Sá; Jeremy P. Spinrad (WEA, 2004)

On decision and optimization (k, l)-graph sandwich problems. - Simone Dantas; Celina M. H. de Figueiredo; Luérbio Faria (Discret. Appl. Math., 2004)

Stable skew partition problem. - Simone Dantas; Celina M. H. de Figueiredo; Sulamita Klein; Sylvain Gravier; Bruce A. Reed (Discret. Appl. Math., 2004)

Tree Loop Graphs. - Liliana Alcón; Celina M. H. de Figueiredo; Márcia R. Cerioli; Marisa Gutierrez; João Meidanis (Electron. Notes Discret. Math., 2004)

Nonplanar vertex deletion: maximum degree thresholds for NP/Max SNP-hardness and a I-approximation for finding maximum planar induced subgraphs. - Luérbio Faria; Celina M. H. de Figueiredo; Sylvain Gravier; Candido F. X. Mendonça; Jorge Stolfi (Electron. Notes Discret. Math., 2004)

The sandwich problem for cutsets. - Rafael B. Teixeira; Celina M. H. de Figueiredo (Electron. Notes Discret. Math., 2004)

Kinetic hanger. - Guilherme Dias da Fonseca; Celina M. H. de Figueiredo; Paulo Cezar Pinto Carvalho (Inf. Process. Lett., 2004)

Optimizing Bull-Free Perfect Graphs. - Celina M. H. de Figueiredo; Frédéric Maffray (SIAM J. Discret. Math., 2004)

The non planar vertex deletion of Cn x Cm. - Candido Ferreira Xavier de Mendonça Neto; Erico F. Xavier; Jorge Stolfi; Luérbio Faria; Celina M. H. de Figueiredo (Ars Comb., 2005)

Loop Graphs and Asteroidal Sets. - Liliana Alcón; Márcia R. Cerioli; Celina M. H. de Figueiredo; Marisa Gutierrez; João Meidanis (Electron. Notes Discret. Math., 2005)

Non loop graphs with induced cycles. - Liliana Alcón; Márcia R. Cerioli; Celina M. H. de Figueiredo; Marisa Gutierrez; João Meidanis (Electron. Notes Discret. Math., 2005)

Preface. - Paulo Feofiloff; Celina M. H. de Figueiredo; Yoshiko Wakabayashi (Electron. Notes Discret. Math., 2005)

Note on the Homogeneous Set Sandwich Problem. - Celina M. H. de Figueiredo; Vinícius G. P. de Sá (Inf. Process. Lett., 2005)

Finding H-partitions efficiently. - Simone Dantas; Celina M. H. de Figueiredo; Sylvain Gravier; Sulamita Klein (RAIRO Theor. Informatics Appl., 2005)

The perfection and recognition of bull-reducible Berge graphs. - Hazel Everett; Celina M. H. de Figueiredo; Sulamita Klein; Bruce A. Reed (RAIRO Theor. Informatics Appl., 2005)

Generating bicliques of a graph in lexicographic order. - Vânia M. Félix Dias; Celina M. H. de Figueiredo; Jayme Luiz Szwarcfiter (Theor. Comput. Sci., 2005)

Clique Graph Recognition Is NP-Complete. - Liliana Alcón; Luérbio Faria; Celina M. H. de Figueiredo; Marisa Gutierrez (WG, 2006)

Algorithms for the Homogeneous Set Sandwich Problem. - Celina M. H. de Figueiredo; Guilherme Dias da Fonseca; Vinícius G. P. de Sá; Jeremy P. Spinrad (Algorithmica, 2006)

On maximum planar induced subgraphs. - Luérbio Faria; Celina M. H. de Figueiredo; Sylvain Gravier; Candido Ferreira Xavier de Mendonça Neto; Jorge Stolfi (Discret. Appl. Math., 2006)

The sandwich problem for cutsets: Clique cutset, k-star cutset. - Rafael B. Teixeira; Celina M. H. de Figueiredo (Discret. Appl. Math., 2006)

Extended skew partition problem. - Simone Dantas; Celina M. H. de Figueiredo; Sylvain Gravier; Sulamita Klein (Discret. Math., 2006)

A characterization of P4-comparability graphs. - Celina M. H. de Figueiredo; Chính T. Hoàng; Frédéric Maffray (Discret. Math., 2006)

The Pair Completion algorithm for the Homogeneous Set Sandwich Problem. - Claudson F. Bornstein; Celina M. H. de Figueiredo; Vinícius G. P. de Sá (Inf. Process. Lett., 2006)

Reversible Karatsuba's Algorithm. - Luis Antonio Brasil Kowada; Renato Portugal; Celina M. H. de Figueiredo (J. Univers. Comput. Sci., 2006)

On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs. - Celina M. H. de Figueiredo; Luérbio Faria; Sulamita Klein; R. Sritharan (Theor. Comput. Sci., 2007)

A decomposition for total-coloring graphs of maximum degree 3. - Raphael Machado; Celina M. H. de Figueiredo (CTW, 2008)

On the Toric Graph as a Tool to Handle the Problem of Sorting by Transpositions. - Rodrigo de A. Hausen; Luérbio Faria; Celina M. H. de Figueiredo; Luis Antonio Brasil Kowada (BSB, 2008)

On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs. - Liliana Alcón; Luérbio Faria; Celina M. H. de Figueiredo; Marisa Gutierrez (Electron. Notes Discret. Math., 2008)

2K2 vertex-set partition into nonempty parts. - Simone Dantas; Elaine M. Eschen; Luérbio Faria; Celina M. H. de Figueiredo; Sulamita Klein (Electron. Notes Discret. Math., 2008)

Sufficient conditions for a graph to be edge-colorable with maximum degree colors. - Raphael C. S. Machado; Celina M. H. de Figueiredo (Electron. Notes Discret. Math., 2008)

The polynomial dichotomy for three nonempty part sandwich problems. - Rafael B. Teixeira; Simone Dantas; Celina M. H. de Figueiredo (Electron. Notes Discret. Math., 2008)

Helly Property, Clique Graphs, Complementary Graph Classes, and Sandwich Problems. - Mitre Costa Dourado; Priscila Petito; Rafael B. Teixeira; Celina M. H. de Figueiredo (J. Braz. Comput. Soc., 2008)

NP-Completeness of Determining the Total Chromatic Number of Graphs that do not Contain a Cycle with a Unique Chord. - Raphael Machado; Celina M. H. de Figueiredo (CTW, 2009)

Skewness, splitting number and vertex deletion of some toroidal meshes. - Candido Ferreira Xavier de Mendonça Neto; Ademir Aparecido Constantino; Erico F. Xavier; Jorge Stolfi; Luérbio Faria; Celina M. H. de Figueiredo (Ars Comb., 2009)

Skew partition sandwich problem is NP-complete. - Rafael B. Teixeira; Simone Dantas; Celina M. H. de Figueiredo (Electron. Notes Discret. Math., 2009)

Enclosing weighted points with an almost-unit ball. - Celina M. H. de Figueiredo; Guilherme Dias da Fonseca (Inf. Process. Lett., 2009)

The complexity of clique graph recognition. - Liliana Alcón; Luérbio Faria; Celina M. H. de Figueiredo; Marisa Gutierrez (Theor. Comput. Sci., 2009)

Advances on the List Stubborn Problem. - Simone Dantas; Luérbio Faria; Celina M. H. de Figueiredo; Sulamita Klein; Loana Tito Nogueira; Fábio Protti (CATS, 2010)

Chromatic Index of Chordless Graphs. - Raphael Machado; Celina M. H. de Figueiredo; Nicolas Trotignon (CTW, 2010)

Bounds on the Transposition Distance for Lonely Permutations. - Luis Antonio Brasil Kowada; Rodrigo de A. Hausen; Celina M. H. de Figueiredo (BSB, 2010)

Decompositions for edge-coloring join graphs and cobipartite graphs. - Raphael C. S. Machado; Celina M. H. de Figueiredo (Discret. Appl. Math., 2010)

2K2 vertex-set partition into nonempty parts. - Kathryn Cook; Simone Dantas; Elaine M. Eschen; Luérbio Faria; Celina M. H. de Figueiredo; Sulamita Klein (Discret. Math., 2010)

Total chromatic number of {square, unichord}-free graphs. - Raphael C. S. Machado; Celina M. H. de Figueiredo (Electron. Notes Discret. Math., 2010)

Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges. - Vinícius G. P. de Sá; Celina M. H. de Figueiredo; Guilherme Dias da Fonseca; Raphael Machado (Electron. Notes Discret. Math., 2010)

Unitary Toric Classes, the Reality and Desire Diagram, and Sorting by Transpositions. - Rodrigo de A. Hausen; Luérbio Faria; Celina M. H. de Figueiredo; Luis Antonio Brasil Kowada (SIAM J. Discret. Math., 2010)

Chromatic index of graphs with no cycle with a unique chord. - Raphael C. S. Machado; Celina M. H. de Figueiredo; Kristina Vuskovic (Theor. Comput. Sci., 2010)

Split Clique Graph Complexity. - Liliana Alcón; Luérbio Faria; Celina M. H. de Figueiredo; Marisa Gutierrez (WG, 2011)

Analysis and Implementation of Sorting by Transpositions Using Permutation Trees. - Marcelo P. Lopes; Marília D. V. Braga; Celina M. H. de Figueiredo; Rodrigo de A. Hausen; Luis Antonio Brasil Kowada (BSB, 2011)

The chain graph sandwich problem. - Simone Dantas; Celina M. H. de Figueiredo; Martin Charles Golumbic; Sulamita Klein; Frédéric Maffray (Ann. Oper. Res., 2011)

On the forbidden induced subgraph sandwich problem. - Simone Dantas; Celina M. H. de Figueiredo; Murilo Vicente Gonçalves da Silva; Rafael B. Teixeira (Discret. Appl. Math., 2011)

Transitive orientations in bull-reducible Berge graphs. - Celina M. H. de Figueiredo; Frédéric Maffray; Cláudia Villela Maciel (Discret. Appl. Math., 2011)

Total chromatic number of unichord-free graphs. - Raphael C. S. Machado; Celina M. H. de Figueiredo (Discret. Appl. Math., 2011)

The external constraint 4 nonempty part sandwich problem. - Rafael B. Teixeira; Simone Dantas; Celina M. H. de Figueiredo (Discret. Appl. Math., 2011)

Hamiltonian Cycles in Kneser Graphs for n=2k+2. - Letícia Rodrigues Bueno; Celina M. H. de Figueiredo; Luérbio Faria; Candido F. X. Mendonça; Rodrigo de A. Hausen (Electron. Notes Discret. Math., 2011)

On Coloring Problems of Snark Families. - Diana Sasaki; Simone Dantas; Celina M. H. de Figueiredo (Electron. Notes Discret. Math., 2011)

Complexity separating classes for edge-colouring and total-colouring. - Raphael Machado; Celina M. H. de Figueiredo (J. Braz. Comput. Soc., 2011)

A decomposition for total-coloring partial-grids and list-total-coloring outerplanar graphs. - Raphael C. S. Machado; Celina M. H. de Figueiredo (Networks, 2011)

Complexity dichotomy on partial grid recognition. - Vinícius G. P. de Sá; Guilherme Dias da Fonseca; Raphael C. S. Machado; Celina M. H. de Figueiredo (Theor. Comput. Sci., 2011)

Snarks with Total Chromatic Number 5. - Gunnar Brinkmann; Simone Dantas; Celina M. H. de Figueiredo; Myriam Preissmann; Diana Sasaki (CTW, 2012)

Biclique-colouring - Powers of Paths and Powers of Cycles. - Hélio B. Macêdo Filho; Simone Dantas; Raphael C. S. Machado; Celina M. H. de Figueiredo (CTW, 2012)

Clique-Colouring and Biclique-Colouring Unichord-Free Graphs. - Hélio B. Macêdo Filho; Raphael C. S. Machado; Celina M. H. de Figueiredo (LATIN, 2012)

Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs. - Guilherme Dias da Fonseca; Celina M. H. de Figueiredo; Vinícius G. P. de Sá; Raphael Machado (WAOA, 2012)

Transposition Diameter and Lonely Permutations. - Luís Felipe I. Cunha; Luis Antonio Brasil Kowada; Rodrigo de A. Hausen; Celina M. H. de Figueiredo (BSB, 2012)

The Cost of Perfection for Matchings in Graphs - Emilio Vital Brazil; Guilherme Dias da Fonseca; Celina M. H. de Figueiredo (CoRR, 2012)

Cayley graphs and analysis of quantum cost for reversible circuit synthesis - A. C. Ribeiro; Celina M. H. de Figueiredo; Franklin L. Marquezino; Luis A. B. Kowada (CoRR, 2012)

The P versus NP-complete dichotomy of some challenging problems in graph theory. - Celina M. H. de Figueiredo (Discret. Appl. Math., 2012)

The total chromatic number of split-indifference graphs. - C. N. Campos; Celina M. H. de Figueiredo; Raphael Machado; Célia Picinin de Mello (Discret. Math., 2012)

Graph theory and algorithms - Fourth Latin-American Workshop on Cliques in Graphs. - Celina M. H. de Figueiredo; Jayme Luiz Szwarcfiter (J. Braz. Comput. Soc., 2012)

On total coloring and equitable total coloring of cubic graphs with large girth. - Simone Dantas; Celina M. H. de Figueiredo; Giuseppe Mazzuoccolo; Myriam Preissmann; Vinícius Fernandes dos Santos; Diana Sasaki (CTW, 2013)

The Same Upper Bound for Both: The 2-Page and the Rectilinear Crossing Numbers of the n-Cube. - Luérbio Faria; Celina M. H. de Figueiredo; R. Bruce Richter; Imrich Vrto (WG, 2013)

On the 1.375-Approximation Algorithm for Sorting by Transpositions in O(n logn) Time. - Luís Felipe I. Cunha; Luis Antonio Brasil Kowada; Rodrigo de A. Hausen; Celina M. H. de Figueiredo (BSB, 2013)

Edge-colouring and total-colouring chordless graphs. - Raphael C. S. Machado; Celina M. H. de Figueiredo; Nicolas Trotignon (Discret. Math., 2013)

The generalized split probe problem. - Simone Dantas; Luérbio Faria; Celina M. H. de Figueiredo; Rafael B. Teixeira (Electron. Notes Discret. Math., 2013)

Advancing the Transposition Distance and Diameter through Lonely Permutations. - Luís Felipe I. Cunha; Luis Antonio Brasil Kowada; Rodrigo de A. Hausen; Celina M. H. de Figueiredo (SIAM J. Discret. Math., 2013)

Hierarchical Complexity of 2-Clique-Colouring Weakly Chordal Graphs and Perfect Graphs Having Cliques of Size at Least 3. - Hélio B. Macêdo Filho; Raphael C. S. Machado; Celina M. H. de Figueiredo (LATIN, 2014)

A Faster 1.375-Approximation Algorithm for Sorting by Transpositions. - Luís Felipe I. Cunha; Luis Antonio Brasil Kowada; Rodrigo de A. Hausen; Celina M. H. de Figueiredo (WABI, 2014)

Linear-Time Approximation Algorithms for Unit Disk Graphs. - Guilherme Dias da Fonseca; Vinícius Gusmão Pereira de Sá; Celina M. H. de Figueiredo (WAOA, 2014)

Complexity of colouring problems restricted to unichord-free and { square, unichord }-free graphs. - Raphael C. S. Machado; Celina M. H. de Figueiredo; Nicolas Trotignon (Discret. Appl. Math., 2014)

The hunting of a snark with total chromatic number 5. - Diana Sasaki; Simone Dantas; Celina M. H. de Figueiredo; Myriam Preissmann (Discret. Appl. Math., 2014)

Blind-friendly von Neumann's Heads or Tails. - Vinícius Gusmão Pereira de Sá; Celina M. H. de Figueiredo (Am. Math. Mon., 2014)

Efficient sub-5 approximations for minimum dominating sets in unit disk graphs. - Guilherme Dias da Fonseca; Celina M. H. de Figueiredo; Vinícius Gusmão Pereira de Sá; Raphael C. S. Machado (Theor. Comput. Sci., 2014)

Sorting Separable Permutations by Restricted Multi-break Rearrangements. - Luís Felipe I. Cunha; Luis Antonio Brasil Kowada; Celina M. H. de Figueiredo (CTW, 2015)

Timber Game with Caterpillars. - Ana Luísa C. Furtado; Simone Dantas; Celina M. H. de Figueiredo; Sylvain Gravier (CTW, 2015)

The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem. - Simone Dantas; Celina M. H. de Figueiredo; Frédéric Maffray; Rafael B. Teixeira (Discret. Appl. Math., 2015)

Biclique-colouring verification complexity and biclique-colouring power graphs. - Hélio B. Macêdo Filho; Simone Dantas; Raphael C. S. Machado; Celina M. H. de Figueiredo (Discret. Appl. Math., 2015)

On the recognition of unit disk graphs and the Distance Geometry Problem with Ranges. - Guilherme Dias da Fonseca; Vinícius Gusmão Pereira de Sá; Raphael Carlos Santos Machado; Celina Miraglia Herrera de Figueiredo (Discret. Appl. Math., 2015)

Hamiltonian cycles in unitary prefix transposition rearrangement graphs. - C. S. Reis; Luis A. B. Kowada; Letícia Rodrigues Bueno; A. C. Ribeiro; Celina M. H. de Figueiredo (Discret. Appl. Math., 2015)

On probe co-bipartite and probe diamond-free graphs. - Flavia Bonomo; Celina Miraglia Herrera de Figueiredo; Guillermo Alfredo Durán; Luciano Norberto Grippo; Martín Darío Safe; Jayme Luiz Szwarcfiter (Discret. Math. Theor. Comput. Sci., 2015)

Using SPQR-trees to speed up algorithms based on 2-cutset decompositions. - Celina M. H. de Figueiredo; Hélio B. Macêdo Filho; Z. Li; Raphael Carlos Santos Machado; Nicolas Trotignon (Electron. Notes Discret. Math., 2015)

A new reversible circuit synthesis algorithm based on cycle representations of permutations. - A. C. Ribeiro; Luis A. B. Kowada; Franklin L. Marquezino; Celina M. H. de Figueiredo (Electron. Notes Discret. Math., 2015)

The cost of perfection for matchings in graphs. - Emilio Vital Brazil; Celina M. H. de Figueiredo; Guilherme Dias da Fonseca; Diana Sasaki (Discret. Appl. Math., 2016)

On the equitable total chromatic number of cubic graphs. - Simone Dantas; Celina M. H. de Figueiredo; Giuseppe Mazzuoccolo; Myriam Preissmann; Vinícius Fernandes dos Santos; Diana Sasaki (Discret. Appl. Math., 2016)

A note on the middle levels problem. - Andréia C. S. Gusmão; Letícia Rodrigues Bueno; Rodrigo de A. Hausen; Celina M. H. de Figueiredo; Luérbio Faria (Discret. Appl. Math., 2016)

On the total coloring of generalized Petersen graphs. - Simone Dantas; Celina M. H. de Figueiredo; Giuseppe Mazzuoccolo; Myriam Preissmann; Vinícius Fernandes dos Santos; Diana Sasaki (Discret. Math., 2016)

The (k, ℓ) unpartitioned probe problem NP-complete versus polynomial dichotomy. - Simone Dantas; Luérbio Faria; Celina M. H. de Figueiredo; Rafael B. Teixeira (Inf. Process. Lett., 2016)

Linear-time graph distance and diameter approximation. - Raphael C. S. Machado; Celina M. H. de Figueiredo (Int. Trans. Oper. Res., 2016)

The Same Upper Bound for Both: The 2-page and the Rectilinear Crossing Numbers of the n-Cube. - Luérbio Faria; Celina M. H. de Figueiredo; R. Bruce Richter; Imrich Vrt'o (J. Graph Theory, 2016)

Efficient Algorithms for Clique-Colouring and Biclique-Colouring Unichord-Free Graphs. - Hélio B. Macêdo Filho; Raphael C. S. Machado; Celina M. H. de Figueiredo (Algorithmica, 2017)

The tessellation problem of quantum walks. - 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 (CoRR, 2017)

Simple Undirected Two-Commodity Integral Flow with a Unitary Demand. - Alexsander Andrade de Melo; Celina M. H. de Figueiredo; Uéverton S. Souza (Electron. Notes Discret. Math., 2017)

Shifting Coresets: Obtaining Linear-Time Approximations for Unit Disk Graphs and Other Geometric Intersection Graphs. - Guilherme Dias da Fonseca; Vinícius Gusmão Pereira de Sá; Celina Miraglia Herrera de Figueiredo (Int. J. Comput. Geom. Appl., 2017)

The Graph Tessellation Cover Number: Extremal Bounds, Efficient Algorithms and Hardness. - 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 (LATIN, 2018)

The Sandwich Problem for Decompositions and Almost Monotone Properties. - Maria Chudnovsky; Celina M. H. de Figueiredo; Sophie Spirkl (Algorithmica, 2018)

The partitioned probe problem: NP-complete versus polynomial dichotomy. - Simone Dantas; Luérbio Faria; Celina M. H. de Figueiredo; Rafael B. Teixeira (Discret. Appl. Math., 2018)

Sandwich and probe problems for excluding paths. - Celina M. H. de Figueiredo; Sophie Spirkl (Discret. Appl. Math., 2018)

Using SPQR-trees to speed up recognition algorithms based on 2-cutsets. - Hélio B. Macêdo Filho; Celina M. H. de Figueiredo; Z. Li; Raphael Machado (Discret. Appl. Math., 2018)

The Tessellation Cover Number of Good Tessellable Graphs. - 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 (CoRR, 2019)

Timber game as a counting problem. - Ana Luísa C. Furtado; Simone Dantas; Celina M. H. de Figueiredo; Sylvain Gravier (Discret. Appl. Math., 2019)

On the embedding of cone graphs in the line with distinct distances between neighbors. - Rodrigo M. Zhou; Celina M. H. de Figueiredo; Raphael C. S. Machado; Vinícius Gusmão Pereira de Sá (Discret. Appl. Math., 2019)

On Nordhaus-Gaddum type inequalities for the game chromatic and game coloring numbers. - Clément Charpentier; Simone Dantas; Celina M. H. de Figueiredo; Ana Luísa C. Furtado; Sylvain Gravier (Discret. Math., 2019)

A General Method for Forbidden Induced Subgraph Sandwich Problem NP-completeness. - Simone Dantas; Celina M. H. de Figueiredo; Priscila Petito; Rafael B. Teixeira (LAGOS, 2019)

On Caterpillars of Game Chromatic Number 4. - Ana Luísa C. Furtado; Simone Dantas; Celina M. H. de Figueiredo; Sylvain Gravier (LAGOS, 2019)

Even-power of Cycles With Many Vertices are Type 1 Total Colorable. - Alesom Zorzi; Celina M. H. de Figueiredo; Raphael Machado; Uéverton S. Souza (LAGOS, 2019)

Total tessellation cover and quantum walk. - Alexandre Santiago de Abreu; Luís Felipe I. Cunha; Celina M. H. de Figueiredo; Franklin L. Marquezino; Daniel Posner; Renato Portugal (CoRR, 2020)

Maximum cut on interval graphs of interval count five is NP-complete. - Celina M. H. de Figueiredo; Alexsander Andrade de Melo; Fabiano de S. Oliveira; Ana Silva 001 (CoRR, 2020)

On the computational complexity of closest genome problems. - Luís Felipe I. Cunha; Pedro Feijão; Vinícius Fernandes dos Santos; Luis Antonio Brasil Kowada; Celina M. H. de Figueiredo (Discret. Appl. Math., 2020)

Complexity-separating graph classes for vertex, edge and total colouring. - Celina M. H. de Figueiredo (Discret. Appl. Math., 2020)

A multivariate analysis of the strict terminal connection problem. - Alexsander Andrade de Melo; Celina M. H. de Figueiredo; Uéverton S. Souza (J. Comput. Syst. Sci., 2020)

The graph tessellation cover number: Chromatic bounds, efficient algorithms and hardness. - 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 (Theor. Comput. Sci., 2020)

On total coloring the direct product of complete graphs. - Diane Castonguay; Celina M. H. de Figueiredo; Luis A. B. Kowada; Caroline Reis Patrão; Diana Sasaki; Mario Valencia-Pabon (LAGOS, 2021)

Maximum 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 001 (MFCS, 2021)

On the Terminal Connection Problem. - Alexsander Andrade de Melo; Celina M. H. de Figueiredo; Uéverton S. Souza (SOFSEM, 2021)

Most direct product of graphs are Type 1. - Diane Castonguay; Celina M. H. de Figueiredo; Luis Antonio Brasil Kowada; Caroline Reis Patrão; Diana Sasaki (CoRR, 2021)

A reversible circuit synthesis algorithm with progressive increase of controls in generalized Toffoli gates. - Edinelço Dalcumune; Luis Antonio Brasil Kowada; André da Cunha Ribeiro; Celina Miraglia Herrera de Figueiredo; Franklin de Lima Marquezino (J. Univers. Comput. Sci., 2021)

On undirected two-commodity integral flow, disjoint paths and strict terminal connection problems. - Alexsander Andrade de Melo; Celina M. H. de Figueiredo; Uéverton dos Santos Souza (Networks, 2021)

A computational complexity comparative study of graph tessellation problems. - 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 (Theor. Comput. Sci., 2021)

Parameterized Algorithms for Steiner Tree and Dominating Set: Bounding the Leafage by the Vertex Leafage. - Celina M. H. de Figueiredo; Raul Lopes 001; Alexsander Andrade de Melo; Ana Silva 001 (WALCOM, 2022)

Total tessellation cover: Bounds, hardness, and applications. - Alexandre Santiago de Abreu; Luís Felipe I. Cunha; Celina M. H. de Figueiredo; Franklin L. Marquezino; Daniel Posner; Renato Portugal (Discret. Appl. Math., 2022)

Computing the zig-zag number of directed graphs. - Mitre Costa Dourado; Celina M. H. de Figueiredo; Alexsander Andrade de Melo; Mateus de Oliveira Oliveira; Uéverton S. Souza (Discret. Appl. Math., 2022)

Revising Johnson's table for the 21st century. - Celina M. H. de Figueiredo; Alexsander Andrade de Melo; Diana Sasaki; Ana Silva 001 (Discret. Appl. Math., 2022)

Compositions, decompositions, and conformability for total coloring on power of cycle graphs. - Alesom Zorzi; Celina M. H. de Figueiredo; Raphael C. S. Machado; Leandro M. Zatesko; Uéverton S. Souza (Discret. Appl. Math., 2022)

On total and edge coloring some Kneser graphs. - Celina M. H. de Figueiredo; Caroline Reis Patrão; Diana Sasaki; Mario Valencia-Pabon (J. Comb. Optim., 2022)

Hyper-heuristics with Path Relinking applied to the Generalised Time-Dependent ATSP in air travel. - Matheus Simões; Laura Bahiense; Celina M. H. de Figueiredo (LAGOS, 2023)

On the computational difficulty of the terminal connection problem. - Alexsander Andrade de Melo; Celina M. H. de Figueiredo; Uéverton S. Souza (RAIRO Theor. Informatics Appl., 2023)

On the degree of trees with game chromatic number 4. - Ana Luísa C. Furtado; Miguel A. D. R. Palma; Simone Dantas; Celina M. H. de Figueiredo (RAIRO Oper. Res., 2023)

On total coloring the direct product of cycles and bipartite direct product of graphs. - Diane Castonguay; Celina M. H. de Figueiredo; Luis A. B. Kowada; Caroline Reis Patrão; Diana Sasaki (Discret. Math., 2023)

MaxCut on permutation graphs is NP-complete. - Celina M. H. de Figueiredo; Alexsander Andrade de Melo; Fabiano de S. Oliveira; Ana Silva 001 (J. Graph Theory, 2023)

Pebbling in Kneser Graphs. - Matheus Adauto; Viktoriya Bardenova; Mariana da Cruz; Celina M. H. de Figueiredo; Glenn Hurlbert; Diana Sasaki (LATIN (2), 2024)

Canonical cuts of path powers. - Liliana Alcón; Luérbio Faria; Celina M. H. de Figueiredo; Marisa Gutierrez; Sulamita Klein; Uéverton S. Souza; Rubens Sucupira (Contributions Discret. Math., 2024)

Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs. - Celina M. H. de Figueiredo; Raul Lopes 001; Alexsander Andrade de Melo; Ana Silva 001 (Networks, 2024)

On the total chromatic number of the direct product of cycles and complete graphs. - Diane Castonguay; Celina M. H. de Figueiredo; Luis A. B. Kowada; Caroline Reis Patrão; Diana Sasaki; Mario Valencia-Pabon (RAIRO Oper. Res., 2024)

The hardness of recognising poorly matchable graphs and the hunting of the d-snark. - Leandro M. Zatesko; Renato Carmo; André Luiz Pires Guedes; Raphael C. S. Machado; Celina M. H. de Figueiredo (RAIRO Oper. Res., 2024)

IFORS' Operational Research Hall of Fame: Clóvis Caesar Gonzaga. - Celina M. H. de Figueiredo; Elizabeth W. Karas; Claudia A. Sagastizábal (Int. Trans. Oper. Res., 2024)

On the pebbling numbers of Flower, Blanuša and Watkins snarks. - Matheus Adauto; Celina M. H. de Figueiredo; Glenn Hurlbert; Diana Sasaki (Discret. Appl. Math., 2025)

The sandwich problem for odd-hole-free and even-hole-free graphs. - Kathie Cameron; Aristotelis Chaniotis; Celina M. H. de Figueiredo; Sophie Spirkl (Discret. Math., 2025)

A Weight Function Lemma Heuristic for Graph Pebbling. - Guilherme Adamatti Bridi; Franklin L. Marquezino; Celina M. H. de Figueiredo (CoRR, 2025)

The only Class 0 Flower snark is the smallest. - Guilherme Adamatti Bridi; André Luis Alves Martins; Franklin de Lima Marquezino; Celina Miraglia Herrera de Figueiredo (CoRR, 2025)