Fábio Protti

发表

On (k, ℓ)-Graph Sandwich Problems

Sulamita Klein, Fernanda Couto, Luérbio Faria, 2013, FAW-AAIM.

Complexity aspects of generalized Helly hypergraphs

Jayme Luiz Szwarcfiter, Mitre Costa Dourado, Fábio Protti, 2006, Inf. Process. Lett..

Some remarks on the geodetic number of a graph

Jayme Luiz Szwarcfiter, Dieter Rautenbach, Mitre Costa Dourado, 2010, Discret. Math..

An improved derandomized approximation algorithm for the max-controlled set problem

Fábio Protti, Carlos Alberto de Jesus Martinhon, 2011, RAIRO Theor. Informatics Appl..

Partitioning extended P4-laden graphs into cliques and stable sets

Sulamita Klein, Rudini Menezes Sampaio, Fábio Protti, 2012, Inf. Process. Lett..

Corrigendum to "Complexity analysis of P3-convexity problems on bounded-degree and planar graphs" [Theoret. Comput. Sci. 607 Part 1 (2015) 83-95]

Dieter Rautenbach, Fábio Protti, Uéverton dos Santos Souza, 2017, Theor. Comput. Sci..

Characterization and recognition of generalized clique-Helly graphs

Jayme Luiz Szwarcfiter, Mitre Costa Dourado, Fábio Protti, 2007, Discret. Appl. Math..

Applying Modular Decomposition to Parameterized Cluster Editing Problems

Jayme Luiz Szwarcfiter, Fábio Protti, Maise Dantas da Silva, 2008, Theory of Computing Systems.

New advances about a conjecture on Helly circle graphs

Guillermo Durán, Fábio Protti, Juan Manuel Barrionuevo, 2004, Electron. Notes Discret. Math..

Algorithmic aspects of Steiner convexity and enumeration of Steiner trees

Mitre Costa Dourado, Fábio Protti, Rodolfo Alves de Oliveira, 2014, Ann. Oper. Res..

Applying Modular Decomposition to Parameterized Bicluster Editing

Jayme Luiz Szwarcfiter, Fábio Protti, Maise Dantas da Silva, 2006, IWPEC.

On minimum clique partition and maximum independent set on unit disk graphs and penny graphs: complexity and approximation

Luérbio Faria, Fábio Protti, Márcia R. Cerioli, 2004, Electron. Notes Discret. Math..

A general framework for path convexities pdf

Mitre Costa Dourado, Fábio Protti, Loana Tito Nogueira, 2017, Journal of Combinatorial Optimization.

On the Relations between Acceptable Programs and Stratifiable Classes

Gerson Zaverucha, Fábio Protti, Gerson Zaverucha, 1998, SBIA.

Partition into cliques for cubic graphs: Planar case, complexity and approximation

Bruce A. Reed, Luérbio Faria, Fábio Protti, 2008, Discret. Appl. Math..

Exact and approximation algorithms for error-detecting even codes

Jayme Luiz Szwarcfiter, Fábio Protti, Paulo Eustáquio Duarte Pinto, 2012, Theor. Comput. Sci..

Tractability, hardness, and kernelization lower bound for and/or graph solution

Fábio Protti, Uéverton dos Santos Souza, 2017, Discret. Appl. Math..

Deadlock resolution in wait-for graphs by vertex/arc deletion

Fábio Protti, Uéverton dos Santos Souza, Alan Diêgo Aurélio Carneiro, 2019, J. Comb. Optim..

The Flood-It game parameterized by the vertex cover number

Michael R. Fellows, Frances A. Rosamond, Fábio Protti, 2015, Electron. Notes Discret. Math..

On Clique-inverse graphs of Kp-free graphs

Sylvain Gravier, Fábio Protti, Cláudia Linhares Sales, 2004, Electron. Notes Discret. Math..

Optimal Variability Selection in Product Line Engineering

Leonardo Gresta Paulino Murta, Fábio Protti, Uéverton dos Santos Souza, 2012, SEKE.

On Solving Manufacturing Cell Formation via Bicluster Editing pdf

Ivan C. Martins, Luidi Simonetti, Anand Subramanian, 2013, Eur. J. Oper. Res..

Characterization and recognition of P4-sparse graphs partitionable into k independent sets and l cliques

Sulamita Klein, Fábio Protti, Loana Tito Nogueira, 2011, Discret. Appl. Math..

Adaptive event sensing in networks of autonomous mobile agents pdf

Fábio Protti, Valmir Carneiro Barbosa, Rodrigo R. Esch, 2016, J. Netw. Comput. Appl..

On the computation of the hull number of a graph

Jayme Luiz Szwarcfiter, Mitre Costa Dourado, Jan Kratochvíl, 2009, Discret. Math..

A computational study of f-reversible processes on graphs

Jayme Luiz Szwarcfiter, Mitre Costa Dourado, Fábio Protti, 2017, Discret. Appl. Math..

On generalized split graphs

Sulamita Klein, Pavol Hell, Fábio Protti, 2001, Electron. Notes Discret. Math..

List Partitions of Chordal Graphs

Sulamita Klein, Pavol Hell, Tomás Feder, 2004, LATIN.

Corrigendum to "Cycle transversals in perfect graphs and cographs" [Theoret. Comput. Sci. 469(2013) 15-23]

Sulamita Klein, Andreas Brandstädt, Fábio Protti, 2013, Theor. Comput. Sci..

An improved derandomized approximation algorithm for the max-controlled set problem

Fábio Protti, Carlos Alberto de Jesus Martinhon, F. Protti, 2004, RAIRO Theor. Informatics Appl..

Advances on the List Stubborn Problem

Celina M. H. de Figueiredo, Sulamita Klein, Simone Dantas, 2010, CATS.

Mixed unit interval graphs

Jayme Luiz Szwarcfiter, Dieter Rautenbach, Mitre Costa Dourado, 2012, Discret. Math..

Robust recoverable perfect matchings

Dieter Rautenbach, Mitre Costa Dourado, Fábio Protti, 2015, Networks.

Exact and Experimental Algorithms for a Huffman-Based Error Detecting Code

Jayme Luiz Szwarcfiter, Fábio Protti, Paulo Eustáquio Duarte Pinto, 2006, TAMC.

On the Convexity Number of Graphs

Jayme Luiz Szwarcfiter, Dieter Rautenbach, Mitre Costa Dourado, 2012, Graphs Comb..

Algorithmic Aspects of Monophonic Convexity

Jayme Luiz Szwarcfiter, Mitre Costa Dourado, Fábio Protti, 2008, Electron. Notes Discret. Math..

The predecessor-existence problem for k-reversible processes

Fábio Protti, Valmir Carneiro Barbosa, Leonardo I. L. Oliveira, 2015, Theor. Comput. Sci..

Computational aspects of the Helly property: a survey

Jayme Luiz Szwarcfiter, Mitre Costa Dourado, Fábio Protti, 2006, Journal of the Brazilian Computer Society.

V Latin-American Algorithms, Graphs, and Optimization Symposium - Gramado, Brazil, 2009

Carlos Eduardo Ferreira, Jayme Luiz Szwarcfiter, Fábio Protti, 2012, Discrete Applied Mathematics.

On Helly Hypergraphs with Variable Intersection Sizes

Jayme Luiz Szwarcfiter, Mitre Costa Dourado, Fábio Protti, 2014, Ars Comb..

A Novel Distributed Scheduling Algorithm for Resource Sharing Under Near-Heavy Load

Massimo De Gregorio, Fábio Protti, Felipe Maia Galvão França, 2004, OPODIS.

A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation

Luérbio Faria, Fábio Protti, Márcia R. Cerioli, 2011, RAIRO Theor. Informatics Appl..

Packing r-Cliques in Weighted Chordal Graphs

Sulamita Klein, Pavol Hell, Fábio Protti, 2005, Ann. Oper. Res..

Structured construction and simulation of nondeterministic stochastic activity networks pdf

Eber A. Schmitz, Fábio Protti, Valmir Carneiro Barbosa, 2006, Eur. J. Oper. Res..

Parameterized and/or graph solution

Fábio Protti, Uéverton dos Santos Souza, Maise Dantas da Silva, 2013, CTW.

Complexity of Geodetic Number Problem in Graphs with Maximum Degree 4

Dieter Rautenbach, Fábio Protti, Letícia Rodrigues Bueno, 2015, CTW.

Hybrid Metaheuristic for Bicluster Editing Problem

Luiz Satoru Ochi, Fábio Protti, Lucídio dos Anjos Formiga Cabral, 2012, Electron. Notes Discret. Math..

Clique cycle transversals in distance-hereditary graphs

Andreas Brandstädt, Simone Esposito, Fábio Protti, 2013, Electron. Notes Discret. Math..

Partitioning chordal graphs into independent sets and cliques

Sulamita Klein, Pavol Hell, Fábio Protti, 2004, Discret. Appl. Math..

A parallel hybrid metaheuristic for bicluster editing

Luiz Satoru Ochi, Fábio Protti, Lucídio dos Anjos Formiga Cabral, 2016, Int. Trans. Oper. Res..

Decycling a Graph by the Removal of a Matching: Characterizations for Special Classes pdf

Fábio Protti, Uéverton dos Santos Souza, F. Protti, 2017, ArXiv.

Parity codes

Jayme Luiz Szwarcfiter, Fábio Protti, Paulo Eustáquio Duarte Pinto, 2005, RAIRO Theor. Informatics Appl..

Structured construction and simulation of nondeterministic stochastic activity networks

Eber A. Schmitz, Fábio Protti, Valmir Carneiro Barbosa, 2009, Eur. J. Oper. Res..

Clique cycle-transversals in distance-hereditary graphs pdf

Andreas Brandstädt, Simone Esposito, Fábio Protti, 2013, Discret. Appl. Math..

Deletion Graph Problems Based on Deadlock Resolution

Fábio Protti, Uéverton dos Santos Souza, Alan Diêgo Aurélio Carneiro, 2017, COCOON.

Decycling a graph by the removal of a matching: new algorithmic and structural aspects in some classes of graphs

Fábio Protti, Uéverton dos Santos Souza, F. Protti, 2017, Discret. Math. Theor. Comput. Sci..

ILP Formulations for Scheduling Ordered Tasks on a Bounded Number of Processors

Nelson Maculan, Fábio Protti, Manoel B. Campêlo, 2001, Electron. Notes Discret. Math..

Cycle transversals in bounded degree graphs

Sulamita Klein, Pavol Hell, Fábio Protti, 2009, Discret. Math. Theor. Comput. Sci..

On specifying boundary conditions for the graph sandwich problem

Sulamita Klein, Fernanda Couto, Luérbio Faria, 2013, CTW.

Efficient algorithms for cluster editing

Ivan C. Martins, Anand Subramanian, Luiz Satoru Ochi, 2016, J. Comb. Optim..

Fine-Grained Parameterized Complexity Analysis of Knot-Free Vertex Deletion - A Deadlock Resolution Graph Problem

Fábio Protti, Uéverton dos Santos Souza, Alan Diêgo Aurélio Carneiro, 2018, COCOON.

Parameterized mixed cluster editing via modular decomposition pdf

Jayme Luiz Szwarcfiter, Fábio Protti, Maise Dantas da Silva, 2015, ArXiv.

Towards a Novel Statistical Method for Generating Test Sets with a Given Coverage Probability

Antonio J. Alencar, Eber A. Schmitz, Fábio Protti, 2011, SEKE.

The Helly property on subfamilies of limited size

Jayme Luiz Szwarcfiter, Mitre Costa Dourado, Fábio Protti, 2005, Inf. Process. Lett..

An efficient heuristic for selecting active nodes in wireless sensor networks

Luci Pirmez, Flávia Coimbra Delicato, José Ferreira de Rezende, 2006, Comput. Networks.

On s-t paths and trails in edge-colored graphs

Jérôme Monnot, Laurent Gourvès, Fábio Protti, 2009, Electron. Notes Discret. Math..

Clique cycle transversals in graphs with few P4's

Sulamita Klein, Fábio Protti, Loana Tito Nogueira, 2013, Discret. Math. Theor. Comput. Sci..

Complexity analysis of P3-convexity problems on bounded-degree and planar graphs

Dieter Rautenbach, Fábio Protti, Uéverton dos Santos Souza, 2015, Theor. Comput. Sci..

Cycles in complementary prisms

Dieter Rautenbach, Fábio Protti, Dirk Meierling, 2015, Discret. Appl. Math..

Generating all the Steiner trees and computing Steiner intervals for a fixed number of terminals

Mitre Costa Dourado, Fábio Protti, Rodolfo Alves de Oliveira, 2009, Electron. Notes Discret. Math..

Matching Preclusion Number in Cartesian Product of Graphs and its Application to Interconnection Networks

Fábio Protti, Lilian Markenzon, Aline Ribeiro de Almeida, 2013, Ars Comb..

On the complete set packing and set partitioning polytopes: Properties and rank 1 facets

Fábio Protti, Artur Alves Pessoa, Eduardo Uchoa, 2018, Oper. Res. Lett..

A Huffman-Based Error Detecting Code

Jayme Luiz Szwarcfiter, Fábio Protti, Paulo Eustáquio Duarte Pinto, 2004, WEA.

On the geodetic iteration number of distance-hereditary graphs

Dieter Rautenbach, Mitre Costa Dourado, Fábio Protti, 2016, Discret. Math..

Algorithms, kernels and lower bounds for the Flood-It game parameterized by the vertex cover number

Michael R. Fellows, Frances A. Rosamond, Fábio Protti, 2018, Discret. Appl. Math..

Extending the geometric build-up algorithm for the molecular distance geometry problem

Carlile Lavor, Fábio Protti, Ricardo dos Santos Carvalho, 2008, Inf. Process. Lett..

An algorithmic analysis of Flood-it and Free-Flood-it on graph powers

Fábio Protti, Uéverton dos Santos Souza, Maise Dantas da Silva, 2014, Discret. Math. Theor. Comput. Sci..

Parameterized Complexity of Flood-Filling Games on Trees

Fábio Protti, Uéverton dos Santos Souza, Maise Dantas da Silva, 2013, COCOON.

On the helly defect of a graph

Jayme Luiz Szwarcfiter, Mitre Costa Dourado, Fábio Protti, 2001, J. Braz. Comput. Soc..

Tractability and hardness of flood-filling games on trees

Michael R. Fellows, Fábio Protti, Uéverton dos Santos Souza, 2015, Theor. Comput. Sci..

New branch-and-bound algorithms for k-cardinality tree problems

Cid C. de Souza, Luidi Simonetti, Yuri Frota, 2011, Electron. Notes Discret. Math..

Cograph generation with linear delay

Fábio Protti, Renata R. Del-Vecchio, Átila A. Jones, 2018, Theor. Comput. Sci..

A MULTI-THREAD GRASP/VND FOR THE CLUSTER EDITING PROBLEM

Luiz Satoru Ochi, Fábio Protti, L. de O. Bastos, 2016 .

Closure of genomic sets: applications of graph convexity to genome rearrangement problems

Fábio Protti, Luís Felipe I. Cunha, 2018, Electron. Notes Discret. Math..

Complexity results related to monophonic convexity

Jayme Luiz Szwarcfiter, Mitre Costa Dourado, Fábio Protti, 2010, Discret. Appl. Math..

The Helly property on subhypergraphs

Jayme Luiz Szwarcfiter, Mitre Costa Dourado, Fábio Protti, 2005, Electron. Notes Discret. Math..

Cycle transversals in perfect graphs and cographs

Sulamita Klein, Andreas Brandstädt, Fábio Protti, 2013, Theor. Comput. Sci..

Data Compression and Error Detection Integration

Jayme Luiz Szwarcfiter, Fábio Protti, Paulo Eustáquio Duarte Pinto, 2003 .

On the hardness of finding the geodetic number of a subcubic graph

Dieter Rautenbach, Fábio Protti, Letícia Rodrigues Bueno, 2018, Inf. Process. Lett..

And/or-convexity: a graph convexity based on processes and deadlock models

Jayme Luiz Szwarcfiter, Dieter Rautenbach, Fábio Protti, 2018, Ann. Oper. Res..

On the strong p-Helly property

Jayme Luiz Szwarcfiter, Mitre Costa Dourado, Fábio Protti, 2008, Discret. Appl. Math..

Characterization and recognition of generalized clique-Helly graphs

Jayme Luiz Szwarcfiter, Mitre Costa Dourado, Fábio Protti, 2004, Discret. Appl. Math..

Application-Driven Node Management in Multihop Wireless Sensor Networks

Luci Pirmez, Luiz Fernando Rust da Costa Carmo, Flávia Coimbra Delicato, 2005, ICN.

On the Hull Number of Triangle-Free Graphs

Jayme Luiz Szwarcfiter, Dieter Rautenbach, Mitre Costa Dourado, 2010, SIAM J. Discret. Math..

SUTIL - Network selection based on utility function and integer linear programming

Paulo F. Pires, Luci Pirmez, Luiz Fernando Rust da Costa Carmo, 2010, Comput. Networks.

Deadlock models in distributed computation: foundations, design, and computational complexity

Fábio Protti, Valmir Carneiro Barbosa, Uéverton dos Santos Souza, 2016, SAC.

Optimal grid representations

Sulamita Klein, Fábio Protti, Marcia Helena Costa Fampa, 2004, Networks.

A hybrid iterated local search and variable neighborhood descent heuristic applied to the cell formation problem

Ivan C. Martins, Luiz Satoru Ochi, Fábio Protti, 2015, Expert Syst. Appl..

A matheuristic for the cell formation problem

Ivan C. Martins, Luiz Satoru Ochi, Fábio Protti, 2018, Optim. Lett..

Declawing a graph: polyhedra and Branch-and-Cut algorithms

Fábio Protti, Gilberto Farias de Sousa Filho, Felipe C. Fragoso, 2021, Journal of Combinatorial Optimization.

The biclique partitioning polytope

Luiz Satoru Ochi, Fábio Protti, Lucídio dos Anjos Formiga Cabral, 2021, Discret. Appl. Math..

Clique-inverse graphs of K 3 -free and K 4 -free graphs

Jayme Luiz Szwarcfiter, Fábio Protti, F. Protti, 2000 .

Clique‐inverse graphs of K3‐free and K4‐free graphs

Jayme Luiz Szwarcfiter, Fábio Protti, F. Protti, 2000 .

Improved Algorithms for Recognizing p-Helly and Hereditary p-Helly Hypergraphs Mitre

Min Chih Lin, Jayme L. Szwarcfiter, Fábio Protti, 2008 .

On a conjecture concerning helly circle graphs

Jayme Luiz Szwarcfiter, Guillermo Durán, Fábio Protti, 2003 .