Fábio Protti

According to our database1, Fábio Protti authored at least 109 papers between 1997 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2020
Vector Domination in split-indifference graphs.
Inf. Process. Lett., 2020

2019
Deadlock resolution in wait-for graphs by vertex/arc deletion.
J. Comb. Optim., 2019

Genome Rearrangements on Multigenomic Models: Applications of Graph Convexity Problems.
Journal of Computational Biology, 2019

New algorithms for the minimum coloring cut problem.
ITOR, 2019

P3-Hull Number of Graphs with Diameter Two.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

Width Parameterizations for Knot-Free Vertex Deletion on Digraphs.
Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019

A General Framework for Path Convexities.
Proceedings of the Algorithmic Aspects in Information and Management, 2019

2018
Cograph generation with linear delay.
Theor. Comput. Sci., 2018

On the complete set packing and set partitioning polytopes: Properties and rank 1 facets.
Oper. Res. Lett., 2018

A matheuristic for the cell formation problem.
Optimization Letters, 2018

On the hardness of finding the geodetic number of a subcubic graph.
Inf. Process. Lett., 2018

Closure of genomic sets: applications of graph convexity to genome rearrangement problems.
Electron. Notes Discret. Math., 2018

Decycling a graph by the removal of a matching: new algorithmic and structural aspects in some classes of graphs.
Discrete Mathematics & Theoretical Computer Science, 2018

A computational study of f-reversible processes on graphs.
Discret. Appl. Math., 2018

Algorithms, kernels and lower bounds for the Flood-It game parameterized by the vertex cover number.
Discret. Appl. Math., 2018

And/or-convexity: a graph convexity based on processes and deadlock models.
Annals OR, 2018

Fine-Grained Parameterized Complexity Analysis of Knot-Free Vertex Deletion - A Deadlock Resolution Graph Problem.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017
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., 2017

Tractability, hardness, and kernelization lower bound for and/or graph solution.
Discret. Appl. Math., 2017

Decycling a Graph by the Removal of a Matching: Characterizations for Special Classes.
CoRR, 2017

New algorithms for the Minimum Coloring Cut Problem.
CoRR, 2017

New heuristics for the Bicluster Editing Problem.
Annals OR, 2017

Deletion Graph Problems Based on Deadlock Resolution.
Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

2016
Efficient algorithms for cluster editing.
J. Comb. Optim., 2016

A parallel hybrid metaheuristic for bicluster editing.
ITOR, 2016

On solving manufacturing cell formation via Bicluster Editing.
Eur. J. Oper. Res., 2016

On the geodetic iteration number of distance-hereditary graphs.
Discret. Math., 2016

Deadlock models in distributed computation: foundations, design, and computational complexity.
Proceedings of the 31st Annual ACM Symposium on Applied Computing, 2016

2015
Complexity analysis of P3-convexity problems on bounded-degree and planar graphs.
Theor. Comput. Sci., 2015

The predecessor-existence problem for k-reversible processes.
Theor. Comput. Sci., 2015

Tractability and hardness of flood-filling games on trees.
Theor. Comput. Sci., 2015

Robust recoverable perfect matchings.
Networks, 2015

A hybrid iterated local search and variable neighborhood descent heuristic applied to the cell formation problem.
Expert Syst. Appl., 2015

The Flood-It game parameterized by the vertex cover number.
Electron. Notes Discret. Math., 2015

Cycles in complementary prisms.
Discret. Appl. Math., 2015

Parameterized mixed cluster editing via modular decomposition.
CoRR, 2015

Adaptive event sensing in networks of autonomous mobile agents.
CoRR, 2015

Complexity of Geodetic Number Problem in Graphs with Maximum Degree 4.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014
An algorithmic analysis of Flood-it and Free-Flood-it on graph powers.
Discrete Mathematics & Theoretical Computer Science, 2014

On Helly Hypergraphs with Variable Intersection Sizes.
Ars Comb., 2014

Algorithmic aspects of Steiner convexity and enumeration of Steiner trees.
Annals OR, 2014

On P 3-Convexity of Graphs with Bounded Degree.
Proceedings of the Algorithmic Aspects in Information and Management, 2014

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

Cycle transversals in perfect graphs and cographs.
Theor. Comput. Sci., 2013

Revisiting the complexity of and/or graph solution.
J. Comput. Syst. Sci., 2013

Clique cycle transversals in distance-hereditary graphs.
Electron. Notes Discret. Math., 2013

Clique cycle transversals in graphs with few P4's.
Discrete Mathematics & Theoretical Computer Science, 2013

An energy function and its application to the periodic behavior of k-reversible processes.
CoRR, 2013

Matching Preclusion Number in Cartesian Product of Graphs and its Application to Interconnection Networks.
Ars Comb., 2013

Parameterized and/or graph solution.
Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

On specifying boundary conditions for the graph sandwich problem.
Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

Parameterized Complexity of Flood-Filling Games on Trees.
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

On (k, ℓ)-Graph Sandwich Problems.
Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013

2012
Exact and approximation algorithms for error-detecting even codes.
Theor. Comput. Sci., 2012

Partitioning extended P4-laden graphs into cliques and stable sets.
Inf. Process. Lett., 2012

On the Convexity Number of Graphs.
Graphs and Combinatorics, 2012

Hybrid Metaheuristic for Bicluster Editing Problem.
Electron. Notes Discret. Math., 2012

Mixed unit interval graphs.
Discret. Math., 2012

V Latin-American Algorithms, Graphs, and Optimization Symposium - Gramado, Brazil, 2009.
Discret. Appl. Math., 2012

Optimal Variability Selection in Product Line Engineering.
Proceedings of the 24th International Conference on Software Engineering & Knowledge Engineering (SEKE'2012), 2012

2011
An improved derandomized approximation algorithm for the max-controlled set problem.
RAIRO - Theor. Inf. and Applic., 2011

A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation.
RAIRO - Theor. Inf. and Applic., 2011

New branch-and-bound algorithms for k-cardinality tree problems.
Electron. Notes Discret. Math., 2011

Characterization and recognition of P4-sparse graphs partitionable into k independent sets and l cliques.
Discret. Appl. Math., 2011

Towards a Novel Statistical Method for Generating Test Sets with a Given Coverage Probability.
Proceedings of the 23rd International Conference on Software Engineering & Knowledge Engineering (SEKE'2011), 2011

2010
On the Hull Number of Triangle-Free Graphs.
SIAM J. Discrete Math., 2010

Some remarks on the geodetic number of a graph.
Discret. Math., 2010

Complexity results related to monophonic convexity.
Discret. Appl. Math., 2010

SUTIL - Network selection based on utility function and integer linear programming.
Comput. Networks, 2010

Advances on the List Stubborn Problem.
Proceedings of the Theory of Computing 2010, 2010

2009
Applying Modular Decomposition to Parameterized Cluster Editing Problems.
Theory Comput. Syst., 2009

Structured construction and simulation of nondeterministic stochastic activity networks.
Eur. J. Oper. Res., 2009

Preface.
Electron. Notes Discret. Math., 2009

Cycle transversals in bounded degree graphs.
Electron. Notes Discret. Math., 2009

On s-t paths and trails in edge-colored graphs.
Electron. Notes Discret. Math., 2009

Generating all the Steiner trees and computing Steiner intervals for a fixed number of terminals.
Electron. Notes Discret. Math., 2009

On the computation of the hull number of a graph.
Discret. Math., 2009

Exact and Experimental Algorithms for a Huffman-Based Error Detecting Code.
Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

2008
Improved algorithms for recognizing p.
Inf. Process. Lett., 2008

Extending the geometric build-up algorithm for the molecular distance geometry problem.
Inf. Process. Lett., 2008

Algorithmic Aspects of Monophonic Convexity.
Electron. Notes Discret. Math., 2008

On the strong p-Helly property.
Discret. Appl. Math., 2008

Partition into cliques for cubic graphs: Planar case, complexity and approximation.
Discret. Appl. Math., 2008

2007
Characterization and recognition of generalized clique-Helly graphs.
Discret. Appl. Math., 2007

2006
Computational Aspects of the Helly Property: a Survey.
J. Braz. Comp. Soc., 2006

Complexity aspects of generalized Helly hypergraphs.
Inf. Process. Lett., 2006

On simulating nondeterministic stochastic activity networks
CoRR, 2006

An efficient heuristic for selecting active nodes in wireless sensor networks.
Comput. Networks, 2006

Applying Modular Decomposition to Parameterized Bicluster Editing.
Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006

2005
List matrix partitions of chordal graphs.
Theor. Comput. Sci., 2005

Parity codes.
ITA, 2005

The Helly property on subfamilies of limited size.
Inf. Process. Lett., 2005

The Helly property on subhypergraphs.
Electron. Notes Discret. Math., 2005

Packing r-Cliques in Weighted Chordal Graphs.
Annals OR, 2005

Application-Driven Node Management in Multihop Wireless Sensor Networks.
Proceedings of the Networking, 2005

2004
Optimal grid representations.
Networks, 2004

On Clique-inverse graphs of Kp-free graphs.
Electron. Notes Discret. Math., 2004

On minimum clique partition and maximum independent set on unit disk graphs and penny graphs: complexity and approximation.
Electron. Notes Discret. Math., 2004

New advances about a conjecture on Helly circle graphs.
Electron. Notes Discret. Math., 2004

Partitioning chordal graphs into independent sets and cliques.
Discret. Appl. Math., 2004

A Huffman-Based Error Detecting Code.
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

A Novel Distributed Scheduling Algorithm for Resource Sharing Under Near-Heavy Load.
Proceedings of the Principles of Distributed Systems, 8th International Conference, 2004

List Partitions of Chordal Graphs.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

2001
On the helly defect of a graph.
J. Braz. Comp. Soc., 2001

On generalized split graphs.
Electron. Notes Discret. Math., 2001

ILP Formulations for Scheduling Ordered Tasks on a Bounded Number of Processors.
Electron. Notes Discret. Math., 2001

2000
Clique-inverse graphs of K3-free and K4-free graphs.
Journal of Graph Theory, 2000

1998
On the Relations between Acceptable Programs and Stratifiable Classes.
Proceedings of the Advances in Artificial Intelligence, 1998

1997
On Computing All Maximal Cliques Distributedly.
Proceedings of the Solving Irregularly Structured Problems in Parallel, 1997


  Loading...