Obserwuj
Fábio Protti
Fábio Protti
Full Professor, Fluminense Federal University
Zweryfikowany adres z ic.uff.br - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Complexity results related to monophonic convexity
MC Dourado, F Protti, JL Szwarcfiter
Discrete Applied Mathematics 158 (12), 1268-1274, 2010
1362010
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
1352009
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
1022010
Applying modular decomposition to parameterized cluster editing problems
F Protti, M Dantas da Silva, JL Szwarcfiter
Theory of Computing Systems 44, 91-104, 2009
892009
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
682010
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
652008
Algorithmic aspects of monophonic convexity
MC Dourado, F Protti, JL Szwarcfiter
Electronic Notes in Discrete Mathematics 30, 177-182, 2008
582008
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
562006
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
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
472016
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
442008
On the convexity number of graphs
MC Dourado, F Protti, D Rautenbach, JL Szwarcfiter
Graphs and Combinatorics 28, 333-345, 2012
412012
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
412004
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
402012
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
382010
Applying modular decomposition to parameterized bicluster editing
F Protti, MD da Silva, JL Szwarcfiter
Parameterized and Exact Computation: Second International Workshop, IWPEC …, 2006
352006
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
332015
Mobility, citizens, innovation and technology in digital and smart cities
TA Oliveira, YB Gabrich, H Ramalhinho, M Oliver, MW Cohen, LS Ochi, ...
Future Internet 12 (2), 22, 2020
322020
Mixed unit interval graphs
MC Dourado, F Protti, D Rautenbach, JL Szwarcfiter
Discrete Mathematics 312 (22), 3357-3363, 2012
322012
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20