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
- 2025
[j140]Matheus Adauto, Celina M. H. de Figueiredo, Glenn Hurlbert, Diana Sasaki
:
On the pebbling numbers of Flower, Blanuša and Watkins snarks. Discret. Appl. Math. 361: 336-346 (2025)- [j139]Kathie Cameron, Aristotelis Chaniotis, Celina M. H. de Figueiredo, Sophie Spirkl:
The sandwich problem for odd-hole-free and even-hole-free graphs. Discret. Math. 348(5): 114383 (2025) - 2024
- [j138]Liliana Alcón, Luérbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez, Sulamita Klein, Uéverton S. Souza, Rubens Sucupira:
Canonical cuts of path powers. Contributions Discret. Math. 19(3): 121-136 (2024) - [j137]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) - [j136]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) - [j135]Diane Castonguay, Celina M. H. de Figueiredo, Luis A. B. Kowada, Caroline Reis Patrão, Diana Sasaki, Mario Valencia-Pabon:
On the total chromatic number of the direct product of cycles and complete graphs. RAIRO Oper. Res. 58(2): 1609-1632 (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 A. B. 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 A. B. 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 A. B. 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 A. B. 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 A. B. 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 A. B. 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 A. B. 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 A. B. 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 A. B. 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 A. B. 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 A. B. 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]Raphael C. S. Machado, Celina M. H. de Figueiredo:
Total chromatic number of {square, unichord}-free graphs. Electron. Notes Discret. Math. 36: 671-678 (2010) - [j64]Rodrigo de A. Hausen, Luérbio Faria, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada:
Unitary Toric Classes, the Reality and Desire Diagram, and Sorting by Transpositions. SIAM J. Discret. Math. 24(3): 792-807 (2010) - [j63]Raphael C. S. Machado, Celina M. H. de Figueiredo, Kristina Vuskovic:
Chromatic index of graphs with no cycle with a unique chord. Theor. Comput. Sci. 411(7-9): 1221-1234 (2010) - [c18]Simone Dantas, Luérbio Faria, Celina M. H. de Figueiredo, Sulamita Klein, Loana Tito Nogueira, Fábio Protti:
Advances on the List Stubborn Problem. CATS 2010: 65-70 - [c17]Raphael Machado, Celina M. H. de Figueiredo, Nicolas Trotignon:
Chromatic Index of Chordless Graphs. CTW 2010: 51-54 - [c16]Luis Antonio Brasil Kowada, Rodrigo de A. Hausen, Celina M. H. de Figueiredo:
Bounds on the Transposition Distance for Lonely Permutations. BSB 2010: 35-46 - [i1]Vinícius G. P. de Sá, Guilherme Dias da Fonseca, Raphael Machado, Celina M. H. de Figueiredo:
Complexity dichotomy on partial grid recognition. CoRR abs/1006.3541 (2010)
2000 – 2009
- 2009
- [j62]Candido Ferreira Xavier de Mendonça Neto, Ademir Aparecido Constantino, Erico F. Xavier, Jorge Stolfi, Luérbio Faria, Celina M. H. de Figueiredo:
Skewness, splitting number and vertex deletion of some toroidal meshes. Ars Comb. 92 (2009) - [j61]Rafael B. Teixeira, Simone Dantas, Celina M. H. de Figueiredo:
Skew partition sandwich problem is NP-complete. Electron. Notes Discret. Math. 35: 9-14 (2009) - [j60]Celina M. H. de Figueiredo, Guilherme Dias da Fonseca:
Enclosing weighted points with an almost-unit ball. Inf. Process. Lett. 109(21-22): 1216-1221 (2009) - [j59]Liliana Alcón, Luérbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez:
The complexity of clique graph recognition. Theor. Comput. Sci. 410(21-23): 2072-2083 (2009) - [c15]Raphael Machado, Celina M. H. de Figueiredo:
NP-Completeness of Determining the Total Chromatic Number of Graphs that do not Contain a Cycle with a Unique Chord. CTW 2009: 55-59 - 2008
- [j58]Paulo Feofiloff, Celina M. H. de Figueiredo, Yoshiko Wakabayashi:
Preface. Discret. Appl. Math. 156(7): 985 (2008) - [j57]Raphael C. S. Machado, Celina M. H. de Figueiredo:
Sufficient conditions for a graph to be edge-colorable with maximum degree colors. Electron. Notes Discret. Math. 30: 69-74 (2008) - [j56]Rafael B. Teixeira, Simone Dantas, Celina M. H. de Figueiredo:
The polynomial dichotomy for three nonempty part sandwich problems. Electron. Notes Discret. Math. 30: 81-86 (2008) - [j55]Liliana Alcón, Luérbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez:
On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs. Electron. Notes Discret. Math. 30: 147-152 (2008) - [j54]Simone Dantas, Elaine M. Eschen, Luérbio Faria, Celina M. H. de Figueiredo, Sulamita Klein:
2K2 vertex-set partition into nonempty parts. Electron. Notes Discret. Math. 30: 291-296 (2008) - [j53]Mitre Costa Dourado, Priscila Petito, Rafael B. Teixeira, Celina M. H. de Figueiredo:
Helly Property, Clique Graphs, Complementary Graph Classes, and Sandwich Problems. J. Braz. Comput. Soc. 14(2): 45-52 (2008) - [j52]Luérbio Faria, Celina M. H. de Figueiredo, Ondrej Sýkora, Imrich Vrto:
An improved upper bound on the crossing number of the hypercube. J. Graph Theory 59(2): 145-161 (2008) - [c14]Raphael Machado, Celina M. H. de Figueiredo:
A decomposition for total-coloring graphs of maximum degree 3. CTW 2008: 118-122 - [c13]Rodrigo de A. Hausen, Luérbio Faria, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada:
On the Toric Graph as a Tool to Handle the Problem of Sorting by Transpositions. BSB 2008: 79-91 - 2007
- [j51]Liliana Alcón, Márcia R. Cerioli, Celina M. H. de Figueiredo, Marisa Gutierrez, João Meidanis:
Tree loop graphs. Discret. Appl. Math. 155(6-7): 686-694 (2007) - [j50]Vânia M. Félix Dias, Celina M. H. de Figueiredo, Jayme Luiz Szwarcfiter:
On the generation of bicliques of a graph. Discret. Appl. Math. 155(14): 1826-1832 (2007) - [j49]Celina M. H. de Figueiredo, Luérbio Faria, Sulamita Klein, R. Sritharan:
On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs. Theor. Comput. Sci. 381(1-3): 57-67 (2007) - 2006
- [j48]Celina M. H. de Figueiredo, Guilherme Dias da Fonseca, Vinícius G. P. de Sá, Jeremy P. Spinrad:
Algorithms for the Homogeneous Set Sandwich Problem. Algorithmica 46(2): 149-180 (2006) - [j47]Luérbio Faria, Celina M. H. de Figueiredo, Sylvain Gravier, Candido Ferreira Xavier de Mendonça Neto, Jorge Stolfi:
On maximum planar induced subgraphs. Discret. Appl. Math. 154(13): 1774-1782 (2006) - [j46]Rafael B. Teixeira, Celina M. H. de Figueiredo:
The sandwich problem for cutsets: Clique cutset, k-star cutset. Discret. Appl. Math. 154(13): 1791-1798 (2006) - [j45]Simone Dantas, Celina M. H. de Figueiredo, Sylvain Gravier, Sulamita Klein:
Extended skew partition problem. Discret. Math. 306(19-20): 2438-2449 (2006) - [j44]Celina M. H. de Figueiredo, Chính T. Hoàng, Frédéric Maffray:
A characterization of P4-comparability graphs. Discret. Math. 306(19-20): 2461-2472 (2006) - [j43]Claudson F. Bornstein, Celina M. H. de Figueiredo, Vinícius G. P. de Sá:
The Pair Completion algorithm for the Homogeneous Set Sandwich Problem. Inf. Process. Lett. 98(3): 87-91 (2006) - [j42]Luis Antonio Brasil Kowada, Renato Portugal, Celina M. H. de Figueiredo:
Reversible Karatsuba's Algorithm. J. Univers. Comput. Sci. 12(5): 499-511 (2006) - [c12]Liliana Alcón, Luérbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez:
Clique Graph Recognition Is NP-Complete. WG 2006: 269-277 - 2005
- [j41]Candido Ferreira Xavier de Mendonça Neto, Erico F. Xavier, Jorge Stolfi, Luérbio Faria, Celina M. H. de Figueiredo:
The non planar vertex deletion of Cn x Cm. Ars Comb. 76 (2005) - [j40]Paulo Feofiloff, Celina M. H. de Figueiredo, Yoshiko Wakabayashi:
Preface. Electron. Notes Discret. Math. 19: 1-7 (2005) - [j39]Liliana Alcón, Márcia R. Cerioli, Celina M. H. de Figueiredo, Marisa Gutierrez, João Meidanis:
Non loop graphs with induced cycles. Electron. Notes Discret. Math. 19: 289-295 (2005) - [j38]Liliana Alcón, Márcia R. Cerioli, Celina M. H. de Figueiredo, Marisa Gutierrez, João Meidanis:
Loop Graphs and Asteroidal Sets. Electron. Notes Discret. Math. 22: 179-183 (2005) - [j37]Celina M. H. de Figueiredo, Vinícius G. P. de Sá:
Note on the Homogeneous Set Sandwich Problem. Inf. Process. Lett. 93(2): 75-81 (2005) - [j36]Simone Dantas, Celina M. H. de Figueiredo, Sylvain Gravier, Sulamita Klein:
Finding H-partitions efficiently. RAIRO Theor. Informatics Appl. 39(1): 133-144 (2005) - [j35]Hazel Everett, Celina M. H. de Figueiredo, Sulamita Klein, Bruce A. Reed:
The perfection and recognition of bull-reducible Berge graphs. RAIRO Theor. Informatics Appl. 39(1): 145-160 (2005) - [j34]Vânia M. Félix Dias, Celina M. H. de Figueiredo, Jayme Luiz Szwarcfiter:
Generating bicliques of a graph in lexicographic order. Theor. Comput. Sci. 337(1-3): 240-248 (2005) - 2004
- [j33]Luérbio Faria, Celina M. H. de Figueiredo, Candido Ferreira Xavier de Mendonça Neto:
On the complexity of the approximation of nonplanarity parameters for cubic graphs. Discret. Appl. Math. 141(1-3): 119-134 (2004) - [j32]Simone Dantas, Celina M. H. de Figueiredo, Sulamita Klein, Sylvain Gravier, Bruce A. Reed:
Stable skew partition problem. Discret. Appl. Math. 143(1-3): 17-22 (2004) - [j31]Simone Dantas, Celina M. H. de Figueiredo, Luérbio Faria:
On decision and optimization (k, l)-graph sandwich problems. Discret. Appl. Math. 143(1-3): 155-165 (2004) - [j30]Vânia M. Félix Dias, Celina M. H. de Figueiredo, Jayme Luiz Szwarcfiter:
On the generation of bicliques of a graph. Electron. Notes Discret. Math. 17: 123-127 (2004) - [j29]Liliana Alcón, Celina M. H. de Figueiredo, Márcia R. Cerioli, Marisa Gutierrez, João Meidanis:
Tree Loop Graphs. Electron. Notes Discret. Math. 18: 17-23 (2004) - [j28]Luérbio Faria, Celina M. H. de Figueiredo, Sylvain Gravier, Candido F. X. Mendonça, Jorge Stolfi:
Nonplanar vertex deletion: maximum degree thresholds for NP/Max SNP-hardness and a I-approximation for finding maximum planar induced subgraphs. Electron. Notes Discret. Math. 18: 121-126 (2004) - [j27]Rafael B. Teixeira, Celina M. H. de Figueiredo:
The sandwich problem for cutsets. Electron. Notes Discret. Math. 18: 219-225 (2004) - [j26]Guilherme Dias da Fonseca, Celina M. H. de Figueiredo, Paulo Cezar Pinto Carvalho:
Kinetic hanger. Inf. Process. Lett. 89(3): 151-157 (2004) - [j25]Celina M. H. de Figueiredo, Frédéric Maffray:
Optimizing Bull-Free Perfect Graphs. SIAM J. Discret. Math. 18(2): 226-240 (2004) - [c11]Vânia M. Félix Dias, Celina M. H. de Figueiredo, Jayme Luiz Szwarcfiter:
On the Generation of Bicliques of a Graph. CTW 2004: 109-113 - [c10]Hans L. Bodlaender, Celina M. H. de Figueiredo, Marisa Gutierrez, Ton Kloks, Rolf Niedermeier:
Simple Max-Cut for Split-Indifference Graphs and Graphs with Few P4's. WEA 2004: 87-99 - [c9]Celina M. H. de Figueiredo, Guilherme Dias da Fonseca, Vinícius G. P. de Sá, Jeremy P. Spinrad:
Faster Deterministic and Randomized Algorithms on the Homogeneous Set Sandwich Problem. WEA 2004: 243-252 - 2003
- [j24]Guilherme Dias da Fonseca, Celina M. H. de Figueiredo:
Kinetic heap-ordered trees: Tight analysis and improved algorithms. Inf. Process. Lett. 85(3): 165-169 (2003) - [j23]Celina M. H. de Figueiredo, João Meidanis, Célia Picinin de Mello, Carmen Ortiz:
Decompositions for the edge colouring of reduced indifference graphs. Theor. Comput. Sci. 297(1-3): 145-155 (2003) - [j22]Vânia M. Félix Dias, Guilherme Dias da Fonseca, Celina M. H. de Figueiredo, Jayme Luiz Szwarcfiter:
The stable marriage problem with restricted pairs. Theor. Comput. Sci. 306(1-3): 391-405 (2003) - [c8]Luérbio Faria, Celina M. H. de Figueiredo, Ondrej Sýkora, Imrich Vrto:
An Improved Upper Bound on the Crossing Number of the Hypercube. WG 2003: 230-236 - 2002
- [j21]Candido Ferreira Xavier de Mendonça Neto, Karl Schaffer, Erico F. Xavier, Jorge Stolfi, Luérbio Faria, Celina M. H. de Figueiredo:
The splitting number and skewness of Cn x Cm. Ars Comb. 63 (2002) - [j20]Celina M. H. de Figueiredo, John G. Gimbel, Célia Picinin de Mello, Jayme Luiz Szwarcfiter:
A note on transitive orientations with maximum sets of sources and sinks. Discret. Appl. Math. 120(1-3): 91-95 (2002) - [j19]Celina M. H. de Figueiredo, Sulamita Klein, Kristina Vuskovic:
The graph sandwich problem for 1-join composition is NP-complete. Discret. Appl. Math. 121(1-3): 73-82 (2002) - [c7]Simone Dantas, Celina M. H. de Figueiredo, Luérbio Faria:
On the Complexity of (k, l)-Graph Sandwich Problems. WG 2002: 92-101 - 2001
- [j18]Luérbio Faria, Celina M. H. de Figueiredo, Candido Ferreira Xavier de Mendonça Neto:
SPLITTING NUMBER is NP-complete. Discret. Appl. Math. 108(1-2): 65-83 (2001) - [j17]Celina M. H. de Figueiredo, Kristina Vuskovic:
Recognition of quasi-Meyniel graphs. Discret. Appl. Math. 113(2-3): 255-260 (2001) - [j16]Celina M. H. de Figueiredo, Sylvain Gravier, Cláudia Linhares Sales:
On Tucker's proof of the strong perfect graph conjecture for (K4-e)-free graphs. Discret. Math. 232(1-3): 105-108 (2001) - [j15]Vânia M. Félix Dias, Guilherme Dias da Fonseca, Celina M. H. de Figueiredo, Jayme Luiz Szwarcfiter:
Stable marriages with restricted pairs. Electron. Notes Discret. Math. 7: 14-17 (2001) - [j14]Luérbio Faria, Celina M. H. de Figueiredo, Candido Ferreira Xavier de Mendonça Neto:
On the complexity of the approximation of nonplanarity parameters for cubic graphs. Electron. Notes Discret. Math. 7: 18-21 (2001) - [j13]Hazel Everett, Celina M. H. de Figueiredo, Sulamita Klein, Bruce A. Reed:
Bull-Reducible Berge Graphs are Perfect. Electron. Notes Discret. Math. 10: 93-95 (2001) - [j12]Celina M. H. de Figueiredo, Frédéric Maffray, Oscar Porto:
On the Structure of Bull-Free Perfect Graphs, 2: the Weakly Chordal Case. Graphs Comb. 17(3): 435-456 (2001) - 2000
- [j11]Celina M. H. de Figueiredo, Kristina Vuskovic:
A class of ?-perfect graphs. Discret. Math. 216(1-3): 169-193 (2000) - [j10]Celina M. H. de Figueiredo, Sulamita Klein, Kristina Vuskovic:
The graph sandwich problem for 1-join composition is NP-complete. Electron. Notes Discret. Math. 5: 89-92 (2000) - [j9]Celina M. H. de Figueiredo, Sulamita Klein, Yoshiharu Kohayakawa, Bruce A. Reed:
Finding Skew Partitions Efficiently. J. Algorithms 37(2): 505-521 (2000) - [c6]Celina M. H. de Figueiredo, Célia Picinin de Mello, Carmen Ortiz:
Edge Colouring Reduced Indifference Graphs. LATIN 2000: 145-153 - [c5]Celina M. H. de Figueiredo, Sulamita Klein, Yoshiharu Kohayakawa, Bruce A. Reed:
Finding Skew Partitions Efficiently. LATIN 2000: 163-172
1990 – 1999
- 1999
- [j8]Celina M. H. de Figueiredo, John G. Gimbel, Célia Picinin de Mello, Jayme Luiz Szwarcfiter:
Even and Odd Pairs in Comparability and in P4-comparability Graphs. Discret. Appl. Math. 91(1-3): 293-297 (1999) - [j7]Celina M. H. de Figueiredo, John G. Gimbel, Célia Picinin de Mello, Jayme Luiz Szwarcfiter:
Linear-time Algorithms for Maximum Sets of Sources and sinks. Electron. Notes Discret. Math. 3: 230-234 (1999) - [j6]Celina M. H. de Figueiredo, João Meidanis, Célia Picinin de Mello:
Total-Chromatic Number and Chromatic Index of Dually Chordal Graphs. Inf. Process. Lett. 70(3): 147-152 (1999) - [c4]Celina M. H. de Figueiredo, Luérbio Faria, Candido Ferreira Xavier de Mendonça Neto:
Optimal Node-Degree Bounds for the Complexity of Nonplanarity Parameters. SODA 1999: 887-888 - 1998
- [j5]Márcia R. Cerioli, Hazel Everett, Celina M. H. de Figueiredo, Sulamita Klein:
The Homogeneous Set Sandwich Problem. Inf. Process. Lett. 67(1): 31-35 (1998) - [c3]Luérbio Faria, Celina M. H. de Figueiredo, Candido Ferreira Xavier de Mendonça Neto:
The Splitting Number of the 4-Cube. LATIN 1998: 141-150 - [c2]Luérbio Faria, Celina M. H. de Figueiredo, Candido Ferreira Xavier de Mendonça Neto:
Splitting Number is NP-complete. WG 1998: 285-297 - 1997
- [j4]Hazel Everett, Celina M. H. de Figueiredo, Cláudia Linhares Sales, Frédéric Maffray, Oscar Porto, Bruce A. Reed:
Path parity and perfection. Discret. Math. 165-166: 233-252 (1997) - [j3]Celina M. H. de Figueiredo, Frédéric Maffray, Oscar Porto:
On the structure of bull-free perfect graphs. Graphs Comb. 13(1): 31-55 (1997) - [j2]Celina M. H. de Figueiredo, João Meidanis, Célia Picinin de Mello:
On Edge-Colouring Indifference Graphs. Theor. Comput. Sci. 181(1): 91-106 (1997) - 1995
- [j1]Celina M. H. de Figueiredo, João Meidanis, Célia Picinin de Mello:
A Linear-Time Algorithm for Proper Interval Graph Recognition. Inf. Process. Lett. 56(3): 179-184 (1995) - [c1]Celina M. H. de Figueiredo, João Meidanis, Célia Picinin de Mello:
On Edge-Colouring Indifference Graphs. LATIN 1995: 286-299
Coauthor Index
Luis A. B. Kowada
aka: Luis Antonio Brasil Kowada
aka: Luis Antonio Brasil Kowada
Franklin L. Marquezino
aka: Franklin de Lima Marquezino
aka: Franklin de Lima Marquezino
Vinícius G. P. de Sá
aka: Vinícius Gusmão Pereira de Sá
aka: Vinícius Gusmão Pereira de Sá
Uéverton S. Souza
aka: Uéverton dos Santos Souza
aka: Uéverton dos Santos Souza
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-22 01:11 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
