default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCelina M. H. de Figueiredo
Celina Miraglia Herrera de Figueiredo
Person information
- affiliation: Federal University of Rio de Janeiro, Brazil
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j136]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): 893-917 (2024)- [j135]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): 2796-2798 (2024) - [j134]Leandro M. Zatesko, Renato Carmo, André Luiz Pires Guedes, Raphael C. S. Machado, Celina M. H. de Figueiredo:
The hardness of recognising poorly matchable graphs and the hunting of the d-snark. RAIRO Oper. Res. 58(3): 2055-2073 (2024) - [c40]Matheus Adauto, Viktoriya Bardenova, Mariana da Cruz, Celina M. H. de Figueiredo, Glenn Hurlbert, Diana Sasaki:
Pebbling in Kneser Graphs. LATIN (2) 2024: 46-60 - [i22]Kathie Cameron, Aristotelis Chaniotis, Celina M. H. de Figueiredo, Sophie Spirkl:
The sandwich problem for odd-hole-free and even-hole-free graphs. CoRR abs/2404.10888 (2024) - 2023
- [j133]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): 113340 (2023) - [j132]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: 3 (2023) - [j131]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): 5-16 (2023) - [j130]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): 2757-2767 (2023) - [c39]Matheus Simões, Laura Bahiense, Celina M. H. de Figueiredo:
Hyper-heuristics with Path Relinking applied to the Generalised Time-Dependent ATSP in air travel. LAGOS 2023: 35-42 - 2022
- [j129]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: 86-105 (2022) - [j128]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: 149-161 (2022) - [j127]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: 184-200 (2022) - [j126]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: 349-363 (2022) - [j125]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): 119-135 (2022) - [c38]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: 251-262 - [i21]Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Fabiano de S. Oliveira, Ana Silva:
MaxCut on Permutation Graphs is NP-complete. CoRR abs/2202.13955 (2022) - 2021
- [j124]Edinelço Dalcumune, Luis Antonio Brasil Kowada, André da Cunha Ribeiro, Celina Miraglia Herrera de Figueiredo, Franklin de Lima Marquezino:
A reversible circuit synthesis algorithm with progressive increase of controls in generalized Toffoli gates. J. Univers. Comput. Sci. 27(6): 544-563 (2021) - [j123]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): 559-571 (2021) - [j122]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: 81-89 (2021) - [c37]Diane Castonguay, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada, Caroline Reis Patrão, Diana Sasaki, Mario Valencia-Pabon:
On total coloring the direct product of complete graphs. LAGOS 2021: 306-314 - [c36]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: 38:1-38:15 - [c35]Alexsander Andrade de Melo, Celina M. H. de Figueiredo, Uéverton S. Souza:
On the Terminal Connection Problem. SOFSEM 2021: 278-292 - [i20]Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Diana Sasaki, Ana Silva:
Revising Johnson's table for the 21st century. CoRR abs/2104.14395 (2021) - [i19]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 abs/2110.14453 (2021) - 2020
- [j121]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: 26-34 (2020) - [j120]Celina M. H. de Figueiredo:
Complexity-separating graph classes for vertex, edge and total colouring. Discret. Appl. Math. 281: 162-171 (2020) - [j119]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: 22-41 (2020) - [j118]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: 175-191 (2020) - [i18]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 abs/2002.08992 (2020) - [i17]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 abs/2012.09804 (2020)
2010 – 2019
- 2019
- [j117]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: 157-162 (2019) - [j116]Ana Luísa C. Furtado, Simone Dantas, Celina M. H. de Figueiredo, Sylvain Gravier:
Timber game as a counting problem. Discret. Appl. Math. 261: 193-202 (2019) - [j115]Clément Charpentier, Simone Dantas, Celina M. H. de Figueiredo, Ana Luísa C. Furtado, Sylvain Gravier:
On Nordhaus-Gaddum type inequalities for the game chromatic and game coloring numbers. Discret. Math. 342(5): 1318-1324 (2019) - [c34]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: 393-400 - [c33]Ana Luísa C. Furtado, Simone Dantas, Celina M. H. de Figueiredo, Sylvain Gravier:
On Caterpillars of Game Chromatic Number 4. LAGOS 2019: 461-472 - [c32]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: 747-758 - [i16]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 abs/1908.10844 (2019) - 2018
- [j114]Maria Chudnovsky, Celina M. H. de Figueiredo, Sophie Spirkl:
The Sandwich Problem for Decompositions and Almost Monotone Properties. Algorithmica 80(12): 3618-3645 (2018) - [j113]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: 67-75 (2018) - [j112]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: 101-108 (2018) - [j111]Celina M. H. de Figueiredo, Sophie Spirkl:
Sandwich and probe problems for excluding paths. Discret. Appl. Math. 251: 146-154 (2018) - [c31]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: 1-13 - 2017
- [j110]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): 786-814 (2017) - [j109]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: 279-284 (2017) - [j108]Guilherme Dias da Fonseca, Vinícius Gusmão Pereira de Sá, Celina Miraglia Herrera de Figueiredo:
Shifting Coresets: Obtaining Linear-Time Approximations for Unit Disk Graphs and Other Geometric Intersection Graphs. Int. J. Comput. Geom. Appl. 27(4): 255-276 (2017) - [i15]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 abs/1705.09014 (2017) - [i14]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 abs/1712.07476 (2017) - 2016
- [j107]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: 84-91 (2016) - [j106]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: 112-122 (2016) - [j105]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: 290-296 (2016) - [j104]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): 1471-1475 (2016) - [j103]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): 294-298 (2016) - [j102]Raphael C. S. Machado, Celina M. H. de Figueiredo:
Linear-time graph distance and diameter approximation. Int. Trans. Oper. Res. 23(5): 843-851 (2016) - [j101]Luérbio Faria, Celina M. H. de Figueiredo, R. Bruce Richter, Imrich Vrt'o:
The Same Upper Bound for Both: The 2-page and the Rectilinear Crossing Numbers of the n-Cube. J. Graph Theory 83(1): 19-33 (2016) - [j100]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: 122-134 (2016) - 2015
- [j99]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: 15-24 (2015) - [j98]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: 65-76 (2015) - [j97]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: 82-86 (2015) - [j96]Guilherme Dias da Fonseca, Vinícius Gusmão Pereira de Sá, Raphael Carlos Santos Machado, Celina Miraglia Herrera de Figueiredo:
On the recognition of unit disk graphs and the Distance Geometry Problem with Ranges. Discret. Appl. Math. 197: 3-19 (2015) - [j95]Flavia Bonomo, Celina Miraglia Herrera de Figueiredo, Guillermo Alfredo Durán, Luciano Norberto Grippo, Martín Darío Safe, Jayme Luiz Szwarcfiter:
On probe co-bipartite and probe diamond-free graphs. Discret. Math. Theor. Comput. Sci. 17(1): 187-200 (2015) - [j94]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: 169-174 (2015) - [j93]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: 187-192 (2015) - [j92]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): 1044-1056 (2015) - [i13]Ana Luísa C. Furtado, Simone Dantas, Celina M. H. de Figueiredo, Sylvain Gravier:
Timber Game with Caterpillars. CTW 2015: 93-96 - [i12]Luís Felipe I. Cunha, Luis Antonio Brasil Kowada, Celina M. H. de Figueiredo:
Sorting Separable Permutations by Restricted Multi-break Rearrangements. CTW 2015: 145-148 - 2014
- [j91]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: 191-199 (2014) - [j90]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: 470-481 (2014) - [j89]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): 600-609 (2014) - [j88]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: 70-81 (2014) - [c30]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: 13-23 - [c29]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: 26-37 - [c28]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: 132-143 - [i11]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 abs/1402.4722 (2014) - [i10]Vinícius Gusmão Pereira de Sá, Celina M. H. de Figueiredo:
Blind-friendly von Neumann's Heads or Tails. CoRR abs/1403.2092 (2014) - 2013
- [j87]Raphael C. S. Machado, Celina M. H. de Figueiredo, Nicolas Trotignon:
Edge-colouring and total-colouring chordless graphs. Discret. Math. 313(14): 1547-1552 (2013) - [j86]Simone Dantas, Luérbio Faria, Celina M. H. de Figueiredo, Rafael B. Teixeira:
The generalized split probe problem. Electron. Notes Discret. Math. 44: 39-45 (2013) - [j85]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): 1682-1709 (2013) - [j84]Liliana Alcón, Luérbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez:
Split clique graph complexity. Theor. Comput. Sci. 506: 29-42 (2013) - [c27]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: 249-260 - [c26]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: 126-135 - [i9]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: 79-83 - [i8]Raphael C. S. Machado, Celina M. H. de Figueiredo, Nicolas Trotignon:
Edge-colouring and total-colouring chordless graphs. CoRR abs/1309.1842 (2013) - [i7]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 abs/1309.2749 (2013) - [i6]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 abs/1312.2086 (2013) - 2012
- [j83]Celina M. H. de Figueiredo:
The P versus NP-complete dichotomy of some challenging problems in graph theory. Discret. Appl. Math. 160(18): 2681-2693 (2012) - [j82]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): 2690-2693 (2012) - [j81]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): 83-84 (2012) - [c25]Gunnar Brinkmann, Simone Dantas, Celina M. H. de Figueiredo, Myriam Preissmann, Diana Sasaki:
Snarks with Total Chromatic Number 5. CTW 2012: 40-43 - [c24]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: 134-138 - [c23]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: 530-541 - [c22]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: 82-92 - [c21]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: 1-12 - [i5]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 abs/1203.2543 (2012) - [i4]Emilio Vital Brazil, Guilherme Dias da Fonseca, Celina M. H. de Figueiredo:
The Cost of Perfection for Matchings in Graphs. CoRR abs/1204.2727 (2012) - [i3]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 abs/1204.3488 (2012) - [i2]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 abs/1209.3275 (2012) - 2011
- [j80]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): 133-139 (2011) - [j79]Celina M. H. de Figueiredo, Frédéric Maffray, Cláudia Villela Maciel:
Transitive orientations in bull-reducible Berge graphs. Discret. Appl. Math. 159(7): 561-573 (2011) - [j78]Rafael B. Teixeira, Simone Dantas, Celina M. H. de Figueiredo:
The external constraint 4 nonempty part sandwich problem. Discret. Appl. Math. 159(7): 661-673 (2011) - [j77]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): 1717-1725 (2011) - [j76]Raphael C. S. Machado, Celina M. H. de Figueiredo:
Total chromatic number of unichord-free graphs. Discret. Appl. Math. 159(16): 1851-1864 (2011) - [j75]Diana Sasaki, Simone Dantas, Celina M. H. de Figueiredo:
On Coloring Problems of Snark Families. Electron. Notes Discret. Math. 37: 45-50 (2011) - [j74]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: 291-296 (2011) - [j73]Raphael Machado, Celina M. H. de Figueiredo:
Complexity separating classes for edge-colouring and total-colouring. J. Braz. Comput. Soc. 17(4): 281-285 (2011) - [j72]Raphael C. S. Machado, Celina M. H. de Figueiredo:
A decomposition for total-coloring partial-grids and list-total-coloring outerplanar graphs. Networks 57(3): 261-269 (2011) - [j71]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): 2370-2379 (2011) - [c20]Liliana Alcón, Luérbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez:
Split Clique Graph Complexity. WG 2011: 11-22 - [c19]Marcelo P. Lopes, Marília D. V. Braga, Celina M. H. de Figueiredo, Rodrigo de A. Hausen, Luis Antonio Brasil Kowada:
Analysis and Implementation of Sorting by Transpositions Using Permutation Trees. BSB 2011: 42-49 - 2010
- [j70]Liliana Alcón, Luérbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez:
On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs. Discret. Appl. Math. 158(12): 1279-1285 (2010) - [j69]Rafael B. Teixeira, Simone Dantas, Celina M. H. de Figueiredo:
The polynomial dichotomy for three nonempty part sandwich problems. Discret. Appl. Math. 158(12): 1286-1304 (2010) - [j68]Raphael C. S. Machado, Celina M. H. de Figueiredo:
Decompositions for edge-coloring join graphs and cobipartite graphs. Discret. Appl. Math. 158(12): 1336-1342 (2010) - [j67]Kathryn Cook, Simone Dantas, Elaine M. Eschen, Luérbio Faria, Celina M. H. de Figueiredo, Sulamita Klein:
2K2 vertex-set partition into nonempty parts. Discret. Math. 310(6-7): 1259-1264 (2010) - [j66]Vinícius G. P. de Sá, Celina M. H. de Figueiredo, Guilherme Dias da Fonseca, Raphael Machado:
Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges. Electron. Notes Discret. Math. 36: 391-398 (2010) - [j65]