Volgen
Fábio Protti
Fábio Protti
Full Professor, Fluminense Federal University
Geverifieerd e-mailadres voor ic.uff.br - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
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
1232009
Complexity results related to monophonic convexity
MC Dourado, F Protti, JL Szwarcfiter
Discrete Applied Mathematics 158 (12), 1268-1274, 2010
1152010
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
1042004
Some remarks on the geodetic number of a graph
MC Dourado, F Protti, D Rautenbach, JL Szwarcfiter
Discrete Mathematics 310 (4), 832-837, 2010
862010
Applying modular decomposition to parameterized cluster editing problems
F Protti, M Dantas da Silva, JL Szwarcfiter
Theory of Computing Systems 44, 91-104, 2009
792009
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
642010
List matrix partitions of chordal graphs
T Feder, P Hell, S Klein, LT Nogueira, F Protti
Theoretical Computer Science 349 (1), 52-66, 2005
552005
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
522006
Algorithmic aspects of monophonic convexity
MC Dourado, F Protti, JL Szwarcfiter
Electronic Notes in Discrete Mathematics 30, 177-182, 2008
512008
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
502008
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
402008
Complexity aspects of the Helly property: Graphs and hypergraphs
MC Dourado, F Protti, JL Szwarcfiter
The Electronic Journal of Combinatorics, DS17: Jun 2-2009, 2012
392012
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, 333-345, 2012
372012
Efficient algorithms for cluster editing
L Bastos, LS Ochi, F Protti, A Subramanian, IC Martins, RGS Pinheiro
Journal of Combinatorial Optimization 31, 347-371, 2016
342016
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
342010
Applying modular decomposition to parameterized bicluster editing
F Protti, MD da Silva, JL Szwarcfiter
Parameterized and Exact Computation: Second International Workshop, IWPEC …, 2006
302006
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
292011
A hybrid iterated local search and variable neighborhood descent heuristic applied to the cell formation problem
IC Martins, RGS Pinheiro, F Protti, LS Ochi
Expert Systems with Applications 42 (22), 8947-8955, 2015
262015
Complexity analysis of P3-convexity problems on bounded-degree and planar graphs
LD Penso, F Protti, D Rautenbach, U dos Santos Souza
Theoretical Computer Science 607, 83-95, 2015
212015
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20