Fábio Protti
Fábio Protti
Associate Professor, Fluminense Federal University
Verified email at ic.uff.br - Homepage
Title
Cited by
Cited by
Year
On the computation of the hull number of a graph
MC Dourado, JG Gimbel, J Kratochvíl, F Protti, JL Szwarcfiter
Discrete Mathematics 309 (18), 5668-5674, 2009
1052009
Partitioning chordal graphs into independent sets and cliques
P Hell, S Klein, LT Nogueira, F Protti
Discrete Applied Mathematics 141 (1-3), 185-194, 2004
962004
Complexity results related to monophonic convexity
MC Dourado, F Protti, JL Szwarcfiter
Discrete Applied Mathematics 158 (12), 1268-1274, 2010
822010
Some remarks on the geodetic number of a graph
MC Dourado, F Protti, D Rautenbach, JL Szwarcfiter
Discrete Mathematics 310 (4), 832-837, 2010
732010
Applying modular decomposition to parameterized cluster editing problems
F Protti, MD Da Silva, JL Szwarcfiter
Theory of Computing Systems 44 (1), 91-104, 2009
722009
On the hull number of triangle-free graphs
MC Dourado, F Protti, D Rautenbach, JL Szwarcfiter
SIAM Journal on Discrete Mathematics 23 (4), 2163-2172, 2010
582010
An efficient heuristic for selecting active nodes in wireless sensor networks
F Delicato, F Protti, L Pirmez, JF de Rezende
Computer Networks 50 (18), 3701-3720, 2006
472006
List matrix partitions of chordal graphs
T Feder, P Hell, S Klein, LT Nogueira, F Protti
Theoretical Computer Science 349 (1), 52-66, 2005
462005
Partition into cliques for cubic graphs: Planar case, complexity and approximation
MR Cerioli, L Faria, TO Ferreira, CAJ Martinhon, F Protti, B Reed
Discrete Applied Mathematics 156 (12), 2270-2278, 2008
422008
On minimum clique partition and maximum independent set on unit disk graphs and penny graphs: complexity and approximation
MR Cerioli, L Faria, TO Ferreira, F Protti
Electronic Notes in Discrete Mathematics 18, 73-79, 2004
392004
On the convexity number of graphs
MC Dourado, F Protti, D Rautenbach, JL Szwarcfiter
Graphs and Combinatorics 28 (3), 333-345, 2012
332012
Complexity aspects of the Helly property: Graphs and hypergraphs
MC Dourado, F Protti, JL Szwarcfiter
The Electronic Journal of Combinatorics, DS17: Jun 12-2009, 2012
312012
Extending the geometric build-up algorithm for the molecular distance geometry problem
R dos Santos Carvalho, C Lavor, F Protti
Information Processing Letters 108 (4), 234-237, 2008
312008
Algorithmic aspects of monophonic convexity
MC Dourado, F Protti, JL Szwarcfiter
Electronic Notes in Discrete Mathematics 30, 177-182, 2008
312008
Sutil–network selection based on utility function and integer linear programming
L Pirmez, JC Carvalho Jr, FC Delicato, F Protti, LFRC Carmo, PF Pires, ...
Computer Networks 54 (13), 2117-2136, 2010
302010
Applying modular decomposition to parameterized bicluster editing
F Protti, MD da Silva, JL Szwarcfiter
International Workshop on Parameterized and Exact Computation, 1-12, 2006
272006
Characterization and recognition of P4-sparse graphs partitionable into k independent sets and ℓ cliques
RSF Bravo, S Klein, LT Nogueira, F Protti
Discrete Applied Mathematics 159 (4), 165-173, 2011
262011
Efficient algorithms for cluster editing
L Bastos, LS Ochi, F Protti, A Subramanian, IC Martins, RGS Pinheiro
Journal of Combinatorial Optimization 31 (1), 347-371, 2016
212016
Robust recoverable perfect matchings
MC Dourado, D Meierling, LD Penso, D Rautenbach, F Protti, ...
Networks 66 (3), 210-213, 2015
192015
Clique-inverse graphs of bipartite graphs
F Protti, JL Szwarcfiter
Relatório Técnico NCE, 2004
182004
The system can't perform the operation now. Try again later.
Articles 1–20