default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFábio Protti
Person information
- affiliation: Fluminense Federal University, Brazil
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j96]Júlio Araújo, Mitre Costa Dourado
, Fábio Protti, Rudini Menezes Sampaio:
The iteration time and the general position number in graph convexities. Appl. Math. Comput. 487: 129084 (2025)- [j95]Mitre Costa Dourado, Marisa Gutierrez, Fábio Protti, Rudini Menezes Sampaio, Silvia B. Tondato:
Characterizations of graph classes via convex geometries: A survey. Discret. Appl. Math. 360: 246-257 (2025) - 2024
- [j94]Mitre Costa Dourado, Marisa Gutierrez, Fábio Protti, Silvia B. Tondato:
Computing the hull and interval numbers in the weakly toll convexity. Theor. Comput. Sci. 996: 114501 (2024) - [c24]Luís Cunha, Gabriel L. Duarte, Fábio Protti, Loana Tito Nogueira, Uéverton S. Souza:
Induced Tree Covering and the Generalized Yutsis Property. LATIN (2) 2024: 147-161 - 2023
- [j93]Marcos V. N. Bedo, João V. S. Leite, Rodolfo Alves de Oliveira, Fábio Protti:
Geodetic convexity and kneser graphs. Appl. Math. Comput. 449: 127964 (2023) - [j92]Marisa Gutierrez, Fábio Protti, Silvia B. Tondato:
Convex geometries over induced paths with bounded length. Discret. Math. 346(1): 113133 (2023) - [c23]Braully Rocha da Silva, Erika Morais Martins Coelho, Hebert Coelho da Coelho, Fábio Protti:
A Greedy Heuristic for Majority Target Set Selection in Social Networks. ASONAM 2023: 419-426 - [i22]Mitre Costa Dourado, Marisa Gutierrez, Fábio Protti, Silvia B. Tondato:
Computing the hull and interval numbers in the weakly toll convexity. CoRR abs/2303.07414 (2023) - [i21]Fábio Protti, João Vinicius C. Thompson:
All-path convexity: Combinatorial and complexity aspects. CoRR abs/2303.18029 (2023) - [i20]Júlio Araújo, Mitre Costa Dourado, Fábio Protti, Rudini M. Sampaio:
The general position number and the iteration time in the P3 convexity. CoRR abs/2305.00467 (2023) - 2022
- [j91]Átila A. Jones, Fábio Protti, Renata R. Del-Vecchio:
Edge clique partition in (k, ℓ)-graphs. Discret. Appl. Math. 306: 89-97 (2022) - [j90]Márcia R. Cappelle, Erika M. M. Coelho, Hebert Coelho, Braully R. Silva, Uéverton S. Souza, Fábio Protti:
P3-convexity on graphs with diameter two: Computing hull and interval numbers. Discret. Appl. Math. 321: 368-378 (2022) - [j89]João Vinicius C. Thompson, Loana Tito Nogueira, Fábio Protti, Raquel S. F. Bravo, Mitre Costa Dourado, Uéverton S. Souza:
A general framework for path convexities. J. Comb. Optim. 43(5): 994-1009 (2022) - [j88]Alan Diêgo Aurélio Carneiro, Fábio Protti, Uéverton dos Santos Souza:
On knot-free vertex deletion: Fine-grained parameterized complexity analysis of a deadlock resolution graph problem. Theor. Comput. Sci. 909: 97-109 (2022) - [i19]Marcos V. N. Bedo, João V. S. Leite, Rodolfo Alves de Oliveira, Fábio Protti:
Geodetic convexity and Kneser graphs. CoRR abs/2203.03406 (2022) - [i18]Mitre Costa Dourado, Fábio Protti, Rudini Menezes Sampaio:
Characterizations of graph classes via convex geometries: A survey. CoRR abs/2203.15878 (2022) - [i17]Mitre Costa Dourado, Marisa Gutierrez, Fábio Protti, Silvia B. Tondato:
Weakly toll convexity and proper interval graphs. CoRR abs/2203.17056 (2022) - 2021
- [j87]Gilberto Farias de Sousa Filho, Teobaldo Bulhões, Lucídio dos Anjos F. Cabral, Luiz Satoru Ochi, Fábio Protti, Rian G. S. Pinheiro:
The biclique partitioning polytope. Discret. Appl. Math. 301: 118-130 (2021) - [j86]Felipe C. Fragoso, Gilberto Farias de Sousa Filho, Fábio Protti:
Declawing a graph: polyhedra and Branch-and-Cut algorithms. J. Comb. Optim. 42(1): 85-124 (2021) - 2020
- [j85]Thays A. Oliveira, Yuri B. Gabrich, Helena Ramalhinho, Miquel Oliver, Miri Weiss-Cohen, Luiz S. Ochi, Serigne Gueye, Fábio Protti, Alysson A. Pinto, Diógenes V. M. Ferreira, Igor Machado Coelho, Vitor Nazário Coelho:
Mobility, Citizens, Innovation and Technology in Digital and Smart Cities. Future Internet 12(2): 22 (2020) - [j84]Rodrigo Lamblet Mafort, Fábio Protti:
Vector Domination in split-indifference graphs. Inf. Process. Lett. 155 (2020) - [j83]Liliana Alcón, Sylvain Gravier, Cláudia Linhares Sales, Fábio Protti, Gabriela Ravenna:
On clique-inverse graphs of graphs with bounded clique number. J. Graph Theory 94(4): 531-538 (2020)
2010 – 2019
- 2019
- [j82]Augusto Bordini, Fábio Protti, Thiago Gouveia da Silva, Gilberto Farias de Sousa Filho:
New algorithms for the minimum coloring cut problem. Int. Trans. Oper. Res. 26(5): 1868-1883 (2019) - [j81]Luís Felipe I. Cunha, Fábio Protti:
Genome Rearrangements on Multigenomic Models: Applications of Graph Convexity Problems. J. Comput. Biol. 26(11): 1214-1222 (2019) - [j80]Alan Diêgo Aurélio Carneiro, Fábio Protti, Uéverton S. Souza:
Deadlock resolution in wait-for graphs by vertex/arc deletion. J. Comb. Optim. 37(2): 546-562 (2019) - [c22]João Vinicius C. Thompson, Loana Tito Nogueira, Fábio Protti, Raquel S. F. Bravo, Mitre Costa Dourado, Uéverton S. Souza:
A General Framework for Path Convexities. AAIM 2019: 272-283 - [c21]Stéphane Bessy, Marin Bougeret, Alan Diêgo A. Carneiro, Fábio Protti, Uéverton S. Souza:
Width Parameterizations for Knot-Free Vertex Deletion on Digraphs. IPEC 2019: 2:1-2:16 - [c20]Márcia R. Cappelle, Erika M. M. Coelho, Hebert Coelho, Braully R. Silva, Fábio Protti, Uéverton S. Souza:
P3-Hull Number of Graphs with Diameter Two. LAGOS 2019: 309-320 - [i16]Stéphane Bessy, Marin Bougeret, Alan Diêgo A. Carneiro, Fábio Protti, Uéverton S. Souza:
Width Parameterizations for Knot-free Vertex Deletion on Digraphs. CoRR abs/1910.01783 (2019) - 2018
- [j79]Carlos Vinícius G. C. Lima, Fábio Protti, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
And/or-convexity: a graph convexity based on processes and deadlock models. Ann. Oper. Res. 264(1-2): 267-286 (2018) - [j78]Carlos Vinícius G. C. Lima, Leonardo I. L. Oliveira, Valmir C. Barbosa, Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter:
A computational study of f-reversible processes on graphs. Discret. Appl. Math. 245: 77-93 (2018) - [j77]Michael R. Fellows, Fábio Protti, Frances A. Rosamond, Maise Dantas da Silva, Uéverton S. Souza:
Algorithms, kernels and lower bounds for the Flood-It game parameterized by the vertex cover number. Discret. Appl. Math. 245: 94-100 (2018) - [j76]Fábio Protti, Uéverton S. Souza:
Decycling a graph by the removal of a matching: new algorithmic and structural aspects in some classes of graphs. Discret. Math. Theor. Comput. Sci. 20(2) (2018) - [j75]Luís Felipe I. Cunha, Fábio Protti:
Closure of genomic sets: applications of graph convexity to genome rearrangement problems. Electron. Notes Discret. Math. 69: 285-292 (2018) - [j74]Letícia Rodrigues Bueno, Lucia Draque Penso, Fábio Protti, Victor R. Ramos, Dieter Rautenbach, Uéverton S. Souza:
On the hardness of finding the geodetic number of a subcubic graph. Inf. Process. Lett. 135: 22-27 (2018) - [j73]Rian Gabriel S. Pinheiro, Ivan C. Martins, Fábio Protti, Luiz Satoru Ochi:
A matheuristic for the cell formation problem. Optim. Lett. 12(2): 335-346 (2018) - [j72]Teobaldo Bulhões, Artur Alves Pessoa, Fábio Protti, Eduardo Uchoa:
On the complete set packing and set partitioning polytopes: Properties and rank 1 facets. Oper. Res. Lett. 46(4): 389-392 (2018) - [j71]Átila A. Jones, Fábio Protti, Renata R. Del-Vecchio:
Cograph generation with linear delay. Theor. Comput. Sci. 713: 1-10 (2018) - [c19]Alan Diêgo Aurélio Carneiro, Fábio Protti, Uéverton S. Souza:
Fine-Grained Parameterized Complexity Analysis of Knot-Free Vertex Deletion - A Deadlock Resolution Graph Problem. COCOON 2018: 84-95 - 2017
- [j70]Gilberto Farias de Sousa Filho, Teobaldo L. Bulhões Júnior, Lucídio dos Anjos F. Cabral, Luiz Satoru Ochi, Fábio Protti:
New heuristics for the Bicluster Editing Problem. Ann. Oper. Res. 258(2): 781-814 (2017) - [j69]Uéverton dos Santos Souza, Fábio Protti:
Tractability, hardness, and kernelization lower bound for and/or graph solution. Discret. Appl. Math. 232: 125-133 (2017) - [j68]Lucia Draque Penso, Fábio Protti, Dieter Rautenbach, Uéverton dos Santos Souza:
Corrigendum to "Complexity analysis of P3-convexity problems on bounded-degree and planar graphs" [Theoret. Comput. Sci. 607 Part 1 (2015) 83-95]. Theor. Comput. Sci. 704: 92-93 (2017) - [c18]Alan Diêgo Aurélio Carneiro, Fábio Protti, Uéverton S. Souza:
Deletion Graph Problems Based on Deadlock Resolution. COCOON 2017: 75-86 - [i15]João Vinicius C. Thompson, Loana Tito Nogueira, Fábio Protti, Raquel S. F. Bravo, Mitre Costa Dourado, Uéverton S. Souza:
A general framework for path convexities. CoRR abs/1702.06112 (2017) - [i14]Augusto Bordini, Fábio Protti:
New algorithms for the Minimum Coloring Cut Problem. CoRR abs/1703.09258 (2017) - [i13]Fábio Protti, Uéverton S. Souza:
Decycling a Graph by the Removal of a Matching: Characterizations for Special Classes. CoRR abs/1707.02473 (2017) - 2016
- [j67]Andreas Brandstädt, Simone Esposito, Loana Tito Nogueira, Fábio Protti:
Clique cycle-transversals in distance-hereditary graphs. Discret. Appl. Math. 210: 38-44 (2016) - [j66]Mitre Costa Dourado, Rodolfo Alves de Oliveira, Fábio Protti, Dieter Rautenbach:
On the geodetic iteration number of distance-hereditary graphs. Discret. Math. 339(2): 489-498 (2016) - [j65]Rian G. S. Pinheiro, Ivan C. Martins, Fábio Protti, Luiz S. Ochi, Luidi Gelabert Simonetti, Anand Subramanian:
On solving manufacturing cell formation via Bicluster Editing. Eur. J. Oper. Res. 254(3): 769-779 (2016) - [j64]Gilberto Farias de Sousa Filho, Teobaldo L. Bulhões Júnior, Lucídio dos Anjos F. Cabral, Luiz Satoru Ochi, Fábio Protti:
A parallel hybrid metaheuristic for bicluster editing. Int. Trans. Oper. Res. 23(3): 409-431 (2016) - [j63]Lucas de O. Bastos, Luiz Satoru Ochi, Fábio Protti, Anand Subramanian, Ivan César Martins, Rian Gabriel S. Pinheiro:
Efficient algorithms for cluster editing. J. Comb. Optim. 31(1): 347-371 (2016) - [j62]Rodrigo R. Esch, Fábio Protti, Valmir C. Barbosa:
Adaptive event sensing in networks of autonomous mobile agents. J. Netw. Comput. Appl. 71: 118-129 (2016) - [c17]Valmir Carneiro Barbosa, Alan Diêgo A. Carneiro, Fábio Protti, Uéverton S. Souza:
Deadlock models in distributed computation: foundations, design, and computational complexity. SAC 2016: 538-541 - [i12]Átila A. Jones, Fábio Protti, Renata R. Del-Vecchio:
Cograph generation with linear delay. CoRR abs/1612.05827 (2016) - 2015
- [j61]Dirk Meierling, Fábio Protti, Dieter Rautenbach, Aline Ribeiro de Almeida:
Cycles in complementary prisms. Discret. Appl. Math. 193: 180-186 (2015) - [j60]Uéverton dos Santos Souza, Frances A. Rosamond, Michael R. Fellows, Fábio Protti, Maise Dantas da Silva:
The Flood-It game parameterized by the vertex cover number. Electron. Notes Discret. Math. 50: 35-40 (2015) - [j59]Ivan C. Martins, Rian G. S. Pinheiro, Fábio Protti, Luiz Satoru Ochi:
A hybrid iterated local search and variable neighborhood descent heuristic applied to the cell formation problem. Expert Syst. Appl. 42(22): 8947-8955 (2015) - [j58]Mitre Costa Dourado, Dirk Meierling, Lucia Draque Penso, Dieter Rautenbach, Fábio Protti, Aline Ribeiro de Almeida:
Robust recoverable perfect matchings. Networks 66(3): 210-213 (2015) - [j57]Leonardo I. L. Oliveira, Valmir Carneiro Barbosa, Fábio Protti:
The predecessor-existence problem for k-reversible processes. Theor. Comput. Sci. 562: 406-418 (2015) - [j56]Michael R. Fellows, Uéverton dos Santos Souza, Fábio Protti, Maise Dantas da Silva:
Tractability and hardness of flood-filling games on trees. Theor. Comput. Sci. 576: 102-116 (2015) - [j55]Lucia Draque Penso, Fábio Protti, Dieter Rautenbach, Uéverton dos Santos Souza:
Complexity analysis of P3-convexity problems on bounded-degree and planar graphs. Theor. Comput. Sci. 607: 83-95 (2015) - [i11]Uéverton S. Souza, Letícia Rodrigues Bueno, Lucia Draque Penso, Dieter Rautenbach, Fábio Protti:
Complexity of Geodetic Number Problem in Graphs with Maximum Degree 4. CTW 2015: 197-200 - [i10]Maise Dantas da Silva, Fábio Protti, Jayme Luiz Szwarcfiter:
Parameterized mixed cluster editing via modular decomposition. CoRR abs/1506.00944 (2015) - [i9]Rodrigo R. Esch, Fábio Protti, Valmir Carneiro Barbosa:
Adaptive event sensing in networks of autonomous mobile agents. CoRR abs/1506.01310 (2015) - 2014
- [j54]Mitre Costa Dourado, Rodolfo Alves de Oliveira, Fábio Protti:
Algorithmic aspects of Steiner convexity and enumeration of Steiner trees. Ann. Oper. Res. 223(1): 155-171 (2014) - [j53]Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter:
On Helly Hypergraphs with Variable Intersection Sizes. Ars Comb. 114: 185-191 (2014) - [j52]Uéverton S. Souza, Fábio Protti, Maise Dantas da Silva:
An algorithmic analysis of Flood-it and Free-Flood-it on graph powers. Discret. Math. Theor. Comput. Sci. 16(3): 279-290 (2014) - [c16]Lucia Draque Penso, Fábio Protti, Dieter Rautenbach, Uéverton S. Souza:
On P 3-Convexity of Graphs with Bounded Degree. AAIM 2014: 263-274 - 2013
- [j51]Aline Ribeiro de Almeida, Fábio Protti, Lilian Markenzon:
Matching Preclusion Number in Cartesian Product of Graphs and its Application to Interconnection Networks. Ars Comb. 112: 193-204 (2013) - [j50]Raquel S. F. Bravo, Sulamita Klein, Loana Tito Nogueira, Fábio Protti:
Clique cycle transversals in graphs with few P4's. Discret. Math. Theor. Comput. Sci. 15(3): 13-20 (2013) - [j49]Andreas Brandstädt, Simone Esposito, Loana Tito Nogueira, Fábio Protti:
Clique cycle transversals in distance-hereditary graphs. Electron. Notes Discret. Math. 44: 15-21 (2013) - [j48]Uéverton dos Santos Souza, Fábio Protti, Maise Dantas da Silva:
Revisiting the complexity of and/or graph solution. J. Comput. Syst. Sci. 79(7): 1156-1163 (2013) - [j47]Andreas Brandstädt, Synara Brito, Sulamita Klein, Loana Tito Nogueira, Fábio Protti:
Cycle transversals in perfect graphs and cographs. Theor. Comput. Sci. 469: 15-23 (2013) - [j46]Andreas Brandstädt, Synara Brito, Sulamita Klein, Loana Tito Nogueira, Fábio Protti:
Corrigendum to "Cycle transversals in perfect graphs and cographs" [Theoret. Comput. Sci. 469(2013) 15-23]. Theor. Comput. Sci. 487: 103-105 (2013) - [c15]Fernanda Couto, Luérbio Faria, Sulamita Klein, Fábio Protti, Loana Tito Nogueira:
On (k, ℓ)-Graph Sandwich Problems. FAW-AAIM 2013: 187-197 - [c14]Uéverton dos Santos Souza, Fábio Protti, Maise Dantas da Silva:
Parameterized Complexity of Flood-Filling Games on Trees. COCOON 2013: 531-542 - [i8]Fernanda Couto, Luérbio Faria, Sulamita Klein, Loana Tito Nogueira, Fábio Protti:
On specifying boundary conditions for the graph sandwich problem. CTW 2013: 63-66 - [i7]Uéverton dos Santos Souza, Fábio Protti, Maise Dantas da Silva:
Parameterized and/or graph solution. CTW 2013: 205-208 - [i6]Andreas Brandstädt, Simone Esposito, Loana Tito Nogueira, Fábio Protti:
Clique cycle-transversals in distance-hereditary graphs. CoRR abs/1302.1402 (2013) - [i5]Leonardo I. L. Oliveira, Valmir Carneiro Barbosa, Fábio Protti:
The predecessor-existence problem for k-reversible processes. CoRR abs/1307.7259 (2013) - [i4]Leonardo I. L. Oliveira, Valmir Carneiro Barbosa, Fábio Protti:
An energy function and its application to the periodic behavior of k-reversible processes. CoRR abs/1311.6126 (2013) - [i3]Rian G. S. Pinheiro, Ivan C. Martins, Fábio Protti, Luiz S. Ochi, Luidi Simonetti, Anand Subramanian:
On Solving Manufacturing Cell Formation via Bicluster Editing. CoRR abs/1312.3288 (2013) - 2012
- [j45]Carlos Eduardo Ferreira, Fábio Protti, Jayme Luiz Szwarcfiter:
V Latin-American Algorithms, Graphs, and Optimization Symposium - Gramado, Brazil, 2009. Discret. Appl. Math. 160(18): 2499-2501 (2012) - [j44]Mitre Costa Dourado, Van Bang Le, Fábio Protti, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Mixed unit interval graphs. Discret. Math. 312(22): 3357-3363 (2012) - [j43]Gilberto Farias de Sousa Filho, Lucídio dos Anjos F. Cabral, Luiz Satoru Ochi, Fábio Protti:
Hybrid Metaheuristic for Bicluster Editing Problem. Electron. Notes Discret. Math. 39: 35-42 (2012) - [j42]Mitre Costa Dourado, Fábio Protti, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
On the Convexity Number of Graphs. Graphs Comb. 28(3): 333-345 (2012) - [j41]Raquel S. F. Bravo, Sulamita Klein, Loana Tito Nogueira, Fábio Protti, Rudini Menezes Sampaio:
Partitioning extended P4-laden graphs into cliques and stable sets. Inf. Process. Lett. 112(21): 829-834 (2012) - [j40]Paulo Eustáquio Duarte Pinto, Fábio Protti, Jayme Luiz Szwarcfiter:
Exact and approximation algorithms for error-detecting even codes. Theor. Comput. Sci. 440-441: 60-72 (2012) - [c13]Rafael Pinto Medeiros, Uéverton dos Santos Souza, Fábio Protti, Leonardo Gresta Paulino Murta:
Optimal Variability Selection in Product Line Engineering. SEKE 2012: 635-640 - [i2]Maise Dantas da Silva, Fábio Protti, Uéverton dos Santos Souza:
Revisiting the Complexity of And/Or Graph Solution. CoRR abs/1203.3249 (2012) - 2011
- [j39]Raquel S. F. Bravo, Sulamita Klein, Loana Tito Nogueira, Fábio Protti:
Characterization and recognition of P4-sparse graphs partitionable into k independent sets and l cliques. Discret. Appl. Math. 159(4): 165-173 (2011) - [j38]Marina Groshaus, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti:
Cycle transversals in bounded degree graphs. Discret. Math. Theor. Comput. Sci. 13(1): 45-66 (2011) - [j37]Luidi Simonetti, Fábio Protti, Yuri Frota, Cid C. de Souza:
New branch-and-bound algorithms for k-cardinality tree problems. Electron. Notes Discret. Math. 37: 27-32 (2011) - [j36]Carlos A. J. Martinhon, Fábio Protti:
An improved derandomized approximation algorithm for the max-controlled set problem. RAIRO Theor. Informatics Appl. 45(2): 181-196 (2011) - [j35]Márcia R. Cerioli, Luérbio Faria, Talita O. Ferreira, Fábio Protti:
A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation. RAIRO Theor. Informatics Appl. 45(3): 331-346 (2011) - [c12]Cristiane Selem Ferreira Neves, Eber Assis Schmitz, Fábio Protti, Antonio Juarez Alencar:
Towards a Novel Statistical Method for Generating Test Sets with a Given Coverage Probability. SEKE 2011: 06-07 - 2010
- [j34]Luci Pirmez, Jaime Cesar de Carvalho Jr., Flávia Coimbra Delicato, Fábio Protti, Luiz Fernando Rust C. Carmo, Paulo F. Pires, Marcos Pirmez:
SUTIL - Network selection based on utility function and integer linear programming. Comput. Networks 54(13): 2117-2136 (2010) - [j33]Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter:
Complexity results related to monophonic convexity. Discret. Appl. Math. 158(12): 1268-1274 (2010) - [j32]Mitre Costa Dourado, Fábio Protti, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Some remarks on the geodetic number of a graph. Discret. Math. 310(4): 832-837 (2010) - [j31]Mitre Costa Dourado, Fábio Protti, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
On the Hull Number of Triangle-Free Graphs. SIAM J. Discret. Math. 23(4): 2163-2172 (2010) - [c11]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
2000 – 2009
- 2009
- [j30]Mitre Costa Dourado, John G. Gimbel, Jan Kratochvíl, Fábio Protti, Jayme Luiz Szwarcfiter:
On the computation of the hull number of a graph. Discret. Math. 309(18): 5668-5674 (2009) - [j29]Thomas M. Liebling, Jayme Luiz Szwarcfiter, Carlos Eduardo Ferreira, Fábio Protti:
Preface. Electron. Notes Discret. Math. 35: 1-2 (2009) - [j28]Marina Groshaus, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti:
Cycle transversals in bounded degree graphs. Electron. Notes Discret. Math. 35: 189-195 (2009) - [j27]Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot, Fábio Protti:
On s-t paths and trails in edge-colored graphs. Electron. Notes Discret. Math. 35: 221-226 (2009) - [j26]Mitre Costa Dourado, Rodolfo Alves de Oliveira, Fábio Protti:
Generating all the Steiner trees and computing Steiner intervals for a fixed number of terminals. Electron. Notes Discret. Math. 35: 323-328 (2009) - [j25]Valmir Carneiro Barbosa, Fernando M. L. Ferreira, Daniel V. Kling, Eduardo Lopes, Fábio Protti, Eber A. Schmitz:
Structured construction and simulation of nondeterministic stochastic activity networks. Eur. J. Oper. Res. 198(1): 266-274 (2009) - [j24]Fábio Protti, Maise Dantas da Silva, Jayme Luiz Szwarcfiter:
Applying Modular Decomposition to Parameterized Cluster Editing Problems. Theory Comput. Syst. 44(1): 91-104 (2009) - [c10]Paulo Eustáquio Duarte Pinto, Fábio Protti, Jayme Luiz Szwarcfiter:
Exact and Experimental Algorithms for a Huffman-Based Error Detecting Code. TAMC 2009: 311-324 - 2008
- [j23]Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter:
On the strong p-Helly property. Discret. Appl. Math. 156(7): 1053-1057 (2008) - [j22]Márcia R. Cerioli, Luérbio Faria, Talita O. Ferreira, Carlos A. J. Martinhon, Fábio Protti, Bruce A. Reed:
Partition into cliques for cubic graphs: Planar case, complexity and approximation. Discret. Appl. Math. 156(12): 2270-2278 (2008) - [j21]Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter:
Algorithmic Aspects of Monophonic Convexity. Electron. Notes Discret. Math. 30: 177-182 (2008) - [j20]Ricardo dos Santos Carvalho, Carlile Lavor, Fábio Protti:
Extending the geometric build-up algorithm for the molecular distance geometry problem. Inf. Process. Lett. 108(4): 234-237 (2008) - [j19]Mitre Costa Dourado, Min Chih Lin, Fábio Protti, Jayme Luiz Szwarcfiter:
Improved algorithms for recognizing p. Inf. Process. Lett. 108(4): 247-250 (2008) - 2007
- [j18]Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter:
Characterization and recognition of generalized clique-Helly graphs. Discret. Appl. Math. 155(18): 2435-2443 (2007) - 2006
- [j17]Flávia Coimbra Delicato, Fábio Protti, Luci Pirmez, José Ferreira de Rezende:
An efficient heuristic for selecting active nodes in wireless sensor networks. Comput. Networks 50(18): 3701-3720 (2006) - [j16]Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter:
Complexity aspects of generalized Helly hypergraphs. Inf. Process. Lett. 99(1): 13-18 (2006) - [j15]Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter:
Computational Aspects of the Helly Property: a Survey. J. Braz. Comput. Soc. 12(1): 7-33 (2006) - [c9]Fábio Protti, Maise Dantas da Silva, Jayme Luiz Szwarcfiter:
Applying Modular Decomposition to Parameterized Bicluster Editing. IWPEC 2006: 1-12 - [i1]Valmir Carneiro Barbosa, Fernando M. L. Ferreira, Daniel V. Kling, Eduardo Lopes, Fábio Protti, Eber A. Schmitz:
On simulating nondeterministic stochastic activity networks. CoRR abs/cs/0612140 (2006) - 2005
- [j14]Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti:
Packing r-Cliques in Weighted Chordal Graphs. Ann. Oper. Res. 138(1): 179-187 (2005) - [j13]Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter:
The Helly property on subhypergraphs. Electron. Notes Discret. Math. 19: 71-77 (2005) - [j12]Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter:
The Helly property on subfamilies of limited size. Inf. Process. Lett. 93(2): 53-56 (2005) - [j11]Paulo Eustáquio Duarte Pinto, Fábio Protti, Jayme Luiz Szwarcfiter:
Parity codes. RAIRO Theor. Informatics Appl. 39(1): 263-278 (2005) - [j10]Tomás Feder, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti:
List matrix partitions of chordal graphs. Theor. Comput. Sci. 349(1): 52-66 (2005) - [c8]Flávia Coimbra Delicato, Fábio Protti, José Ferreira de Rezende, Luiz F. Rust da Costa Carmo, Luci Pirmez:
Application-Driven Node Management in Multihop Wireless Sensor Networks. ICN (1) 2005: 569-576 - 2004
- [j9]Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti:
Partitioning chordal graphs into independent sets and cliques. Discret. Appl. Math. 141(1-3): 185-194 (2004) - [j8]Juan Manuel Barrionuevo, Aureliano Calvo, Guillermo Durán, Fábio Protti:
New advances about a conjecture on Helly circle graphs. Electron. Notes Discret. Math. 18: 31-36 (2004) - [j7]Márcia R. Cerioli, Luérbio Faria, Talita O. Ferreira, Fábio Protti:
On minimum clique partition and maximum independent set on unit disk graphs and penny graphs: complexity and approximation. Electron. Notes Discret. Math. 18: 73-79 (2004) - [j6]Sylvain Gravier, Fábio Protti, Cláudia Linhares Sales:
On Clique-inverse graphs of Kp-free graphs. Electron. Notes Discret. Math. 18: 139-143 (2004) - [j5]Marcia Helena Costa Fampa, Sulamita Klein, Fábio Protti, Debora Cristina Alves Rêgo:
Optimal grid representations. Networks 44(3): 187-193 (2004) - [c7]Tomás Feder, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti:
List Partitions of Chordal Graphs. LATIN 2004: 100-108 - [c6]Diego Moreira de Araujo Carvalho, Fábio Protti, Massimo De Gregorio, Felipe M. G. França:
A Novel Distributed Scheduling Algorithm for Resource Sharing Under Near-Heavy Load. OPODIS 2004: 431-442 - [c5]Carlos A. J. Martinhon, Fábio Protti:
An Improved Derandomized Approximation Algorithm for the Max-Controlled Set Problem. WEA 2004: 341-355 - [c4]Paulo Eustáquio Duarte Pinto, Fábio Protti, Jayme Luiz Szwarcfiter:
A Huffman-Based Error Detecting Code. WEA 2004: 446-457 - [c3]Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter:
Characterization and Recognition of Generalized Clique-Helly Graphs. WG 2004: 344-354 - 2001
- [j4]Pavol Hell, Sulamita Klein, Fábio Protti, Loana Tito Nogueira:
On generalized split graphs. Electron. Notes Discret. Math. 7: 98-101 (2001) - [j3]Manoel B. Campêlo, Ricardo C. Corrêa, Nelson Maculan, Fábio Protti:
ILP Formulations for Scheduling Ordered Tasks on a Bounded Number of Processors. Electron. Notes Discret. Math. 7: 166-169 (2001) - [j2]Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter:
On the helly defect of a graph. J. Braz. Comput. Soc. 7(3): 48-52 (2001) - 2000
- [j1]Fábio Protti, Jayme Luiz Szwarcfiter:
Clique-inverse graphs of K3-free and K4-free graphs. J. Graph Theory 35(4): 257-272 (2000)
1990 – 1999
- 1998
- [c2]Fábio Protti, Gerson Zaverucha:
On the Relations between Acceptable Programs and Stratifiable Classes. SBIA 1998: 141-150 - 1997
- [c1]Fábio Protti, Felipe M. G. França, Jayme Luiz Szwarcfiter:
On Computing All Maximal Cliques Distributedly. IRREGULAR 1997: 37-48
Coauthor Index
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 2024-11-07 21:31 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:
