Fábio Protti
Orcid: 0000-0001-9924-0079Affiliations:
- Fluminense Federal University, Brazil
According to our database1,
Fábio Protti
authored at least 127 papers
between 1997 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
On csauthors.net:
Bibliography
2025
Discret. Appl. Math., 2025
Appl. Math. Comput., 2025
2024
Theor. Comput. Sci., 2024
Proceedings of the LATIN 2024: Theoretical Informatics, 2024
2023
Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2023
2022
On knot-free vertex deletion: Fine-grained parameterized complexity analysis of a deadlock resolution graph problem.
Theor. Comput. Sci., 2022
Discret. Appl. Math., 2022
2021
2020
Future Internet, 2020
2019
Genome Rearrangements on Multigenomic Models: Applications of Graph Convexity Problems.
J. Comput. Biol., 2019
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019
Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019
2018
On the complete set packing and set partitioning polytopes: Properties and rank 1 facets.
Oper. Res. Lett., 2018
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.
Discret. Math. Theor. Comput. Sci., 2018
Discret. Appl. Math., 2018
Algorithms, kernels and lower bounds for the Flood-It game parameterized by the vertex cover number.
Discret. Appl. Math., 2018
Ann. Oper. Res., 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 P<sub>3</sub>-convexity problems on bounded-degree and planar graphs" [Theoret. Comput. Sci. 607 Part 1 (2015) 83-95].
Theor. Comput. Sci., 2017
Discret. Appl. Math., 2017
Decycling a Graph by the Removal of a Matching: Characterizations for Special Classes.
CoRR, 2017
Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017
2016
J. Netw. Comput. Appl., 2016
Eur. J. Oper. Res., 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 P<sub>3</sub>-convexity problems on bounded-degree and planar graphs.
Theor. Comput. Sci., 2015
Theor. Comput. Sci., 2015
A hybrid iterated local search and variable neighborhood descent heuristic applied to the cell formation problem.
Expert Syst. Appl., 2015
Electron. Notes Discret. Math., 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
Discret. Math. Theor. Comput. Sci., 2014
On Helly Hypergraphs with Variable Intersection Sizes.
Ars Comb., 2014
Ann. Oper. Res., 2014
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
Discret. Math. Theor. Comput. Sci., 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
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013
Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013
2012
Theor. Comput. Sci., 2012
Inf. Process. Lett., 2012
Electron. Notes 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
RAIRO Theor. Informatics Appl., 2011
A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation.
RAIRO Theor. Informatics Appl., 2011
Electron. Notes Discret. Math., 2011
Characterization and recognition of P<sub>4</sub>-sparse graphs partitionable into k independent sets and <i>l</i> 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
Comput. Networks, 2010
Proceedings of the Theory of Computing 2010, 2010
2009
Theory Comput. Syst., 2009
Structured construction and simulation of nondeterministic stochastic activity networks.
Eur. J. Oper. Res., 2009
Generating all the Steiner trees and computing Steiner intervals for a fixed number of terminals.
Electron. Notes Discret. Math., 2009
Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009
2008
Extending the geometric build-up algorithm for the molecular distance geometry problem.
Inf. Process. Lett., 2008
Discret. Appl. Math., 2008
2007
Discret. Appl. Math., 2007
2006
Comput. Networks, 2006
Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006
2005
Proceedings of the Networking, 2005
2004
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
Electron. Notes Discret. Math., 2004
Discret. Appl. Math., 2004
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004
Proceedings of the Principles of Distributed Systems, 8th International Conference, 2004
Proceedings of the LATIN 2004: Theoretical Informatics, 2004
2001
On the helly defect of a graph.
J. Braz. Comput. Soc., 2001
Electron. Notes Discret. Math., 2001
2000
Clique-inverse graphs of <i>K</i><sub>3</sub>-free and <i>K</i><sub>4</sub>-free graphs.
J. Graph Theory, 2000
1998
Proceedings of the Advances in Artificial Intelligence, 1998
1997
Proceedings of the Solving Irregularly Structured Problems in Parallel, 1997