_________________________________________________________________________________________________________
Fábio
Protti: Publications
1.
On Helly
hypergraphs with variable intersection sizes.
Ars Combinatoria.
To appear (with M. C. Dourado, J.
L. Szwarcfiter).
2.
On the convexity number of
graphs.
Graphs and Combinatorics. To appear (with M. C. Dourado, D. Rautenbach, J. L. Szwarcfiter).
RAIRO-Theoretical
Informatics and Applications. 45:3
(2011) 331-346 (with M. R. Cerioli,
L. Faria, T. O. Ferreira).
4.
An improved derandomized approximation algorithm for the max-controlled
set problem.
RAIRO-Theoretical Informatics and Applications 45:2 (2011) 181-196 (with C. A. Martinhon).
5.
Cycle
transversals in bounded degree graphs.
Discrete Mathematics and
Theoretical Computer Science 13:1
(2011) 45-66 (with M. Groshaus, P. Hell, S. Klein, L.
T. Nogueira).
Discrete Applied Mathematics 159 (2011) 165-173 (with R. S. F. Bravo, S. Klein, L.
T. Nogueira).
7.
SUTIL - Network
selection based on utility function and integer linear programming.
Computer
Networks 54 (2010) 2117–2136 (with
Luci Pirmez, Jaime C. Carvalho Jr., Luiz F. R. C.
Carmo, Flávia C. Delicato, Paulo F. Pires, Marcos Pirmez).
8.
Complexity results
related to monophonic convexity.
Discrete Applied Mathematics 158 (2010) 1268-1274 (with M. C. Dourado,
J. L. Szwarcfiter).
9.
Some remarks on the
geodetic number of a graph.
Discrete Mathematics 310 (2010) 832-837 (with M. C. Dourado,
D. Rautenbach, J. L. Szwarcfiter).
10. On
the hull number of triangle-free graphs.
SIAM Jounal
on Discrete Mathematics
23 (2009) 2163-2172 (with M. C. Dourado, D. Rautenbach, J. L. Szwarcfiter).
11. On the computation of
the hull number of a graph.
Discrete Mathematics 309 (2009) 5668-5674 (with M. C. Dourado,
J. G. Gimbel, J. Kratochvil,
J. L. Szwarcfiter).
12. Complexity
aspects of the Helly property: graphs and hypergraphs.
The Electronic Journal of Combinatorics DS 17 (2009) 1-53 (with M. C. Dourado, J. L. Szwarcfiter).
13. Structured construction
and simulation of nondeterministic stochastic activity networks.
European Journal of Operational Research 198 (2009) 266-274 (with V. C. Barbosa, F. M. L.
Ferreira, D. V. Kling, E. Lopes, E. A. Schmitz).
14. Applying modular
decomposition to parameterized cluster editing problems.
Theory of Computing Systems 44 (2009) 91-104 (with M. Dantas
da Silva, J. L. Szwarcfiter).
15. Improved algorithms for
recognizing p-Helly and hereditary p-Helly hypergraphs.
Information Processing
Letters 108 (2008)
247-250 (with M. C. Dourado, M. Lin, J. L. Szwarcfiter).
16. Extending the geometric
build-up algorithm for the molecular distance geometry problem.
Information Processing
Letters 108 (2008)
234-237 (with R. S. Carvalho, C. C. Lavor).
17. Partition into cliques for
cubic graphs: planar case, complexity and an approximation algorithm.
Discrete Applied Mathematics 156 (2008) 2270-2278 (with M. R. Cerioli,
L. Faria, T. O. Ferreira, C. A. J. Martinhon, B. Reed).
18. On the strong p-Helly property.
Discrete Applied Mathematics 156 (2008) 1053-1057 (with M. C. Dourado,
J. L. Szwarcfiter).
19. Characterization and
recognition of generalized clique-Helly graphs.
Discrete Applied Mathematics 155 (2007) 2435-2443 (with M. C. Dourado,
J. L. Szwarcfiter).
20. An efficient heuristic
for selecting active nodes in wireless sensor networks.
Computer Networks 50, 18 (2006) 3701-3720 (with F. C. Delicato,
L. Pirmez, J. L. Rezende).
21. Computational
aspects of the Helly property: a survey.
Journal of the Brazilian Computer Society 12,1 (2006) 7-33 (with M. C.
Dourado, J. L. Szwarcfiter).
22. Complexity aspects of
generalized Helly hypergraphs.
Information Processing
Letters 99 (2006) 13-18
(with M. C. Dourado, J. L. Szwarcfiter).
23. List matrix partitions
of chordal graphs.
Theoretical Computer Science 349 (2005) 52-66 (with P. Hell, S. Klein, L. T. Nogueira).
24. Packing r-cliques in
weighted chordal graphs.
Annals of Operations
Research 138 (2005)
179-187 (with P. Hell, S. Klein, L. T. Nogueira).
25. Parity
codes.
RAIRO-Theoretical
Informatics and Applications
39 (2005) 263-278 (with P. E. D. Pinto, J. L. Szwarcfiter).
26. The Helly
property on subfamilies of limited size.
Information Processing Letters 93,2 (2005) 53-56 (with M.
C. Dourado, J. L. Szwarcfiter).
27. Optimal
grid representations.
Networks 44 (2004) 187-193 (with M. H. C. Fampa,
S. Klein, D. C. A. Rêgo).
28. Partitioning chordal graphs into independent sets and cliques.
Discrete Applied Mathematics 141 (2004) 185-194 (with P. Hell, S. Klein, L. T. Nogueira).
29. The
(p, q)-Helly property and its application to the family
of cliques of a graph.
Matemática
Contemporânea 25 (2003) 81-90 (with M. C. Dourado, J. L. Szwarcfiter).
30. On a conjecture
concerning Helly circle graphs.
Pesquisa
Operacional 23 (2003) 221-229 (with G. Durán, A. Gravano, M. Groshaus, J. L. Szwarcfiter).
31. On the Helly defect of a graph.
Journal of the Brazilian
Computer Society 7 (2002)
48-52 (with M. C. Dourado, J. L. Szwarcfiter).
32. Particionamento de grafos cordais
em conjuntos independentes e cliques.
Tendências
em Matemática Aplicada e Computacional 3 (2002) 147-155 (with P. Hell, S. Klein, L. T. Nogueira).
33. Clique-inverse
graphs of bipartite graphs.
Journal of Combinatorial Mathematics and Combinatorial
Computing
40 (2002) 193-203
(with J. L. Szwarcfiter).
34. On
clique graphs with linear size.
Congressus
Numerantium 143 (2000) 207-219 (with J. L. Szwarcfiter).
35. Clique-inverse
graphs of K_3-free and K_4-free graphs.
Journal of Graph Theory 35 (2000) 257-272 (with J. L. Szwarcfiter).
__________________________________________________________________________________________________________
Conferences (extended abstracts published in series)
36. New
Branch-and-Bound Algorithms for k-Cardinality Tree Problems.
LAGOS’11 - VI Latin-American
Graphs, Algorithms and Optimization Symposium.
Bariloche, Argentina, march-april
2011.
Electronic
Notes in Discrete Mathematics 37 (2011) 27-32 (with Y. Frota, L. Simonetti, C. C. de Souza).
37. On
s-t Paths and Trails in Edge-Colored Graphs.
LAGOS'09 - V Latin-American
Graphs, Algorithms and Optimization Symposium.
Gramado, Brazil, november
2009.
Eletronic Notes in Discrete Mathematics 35 (2009) 221-226 (with L. Gourvès,
A. Lyra, C. A. Martinhon,
J. Monnot).
38. Generating
All the Steiner Trees and Computing Steiner Intervals for a Fixed Number of
Terminals.
LAGOS'09 - V Latin-American
Graphs, Algorithms and Optimization Symposium.
Gramado, Brazil, november
2009.
Eletronic Notes in Discrete Mathematics 35 (2009) 323-328 (with M. C. Dourado,
R. A. Oliveira).
39. Cycle
Transversals in Bounded Degree Graphs.
LAGOS'09 - V Latin-American
Graphs, Algorithms and Optimization Symposium.
Gramado, Brazil, november
2009.
Eletronic Notes in Discrete Mathematics 35 (2009) 189-195 (with M. Groshaus,
P. Hell, S. Klein, L. T. Nogueira).
40. Exact and Experimental
Algorithms for a Huffman-Based Error Detecting Code.
TAMC'09 – 6th Annual
Conference on Theory and Applications of Models of Computation.
Chang
Sha, China, may 2009.
Lecture
Notes in Computer Science
5532 (2009) 311-324 (with P. E. D. Pinto, J. L. Szwarcfiter).
41. Algorithmic
Aspects of Monophonic Convexity.
LAGOS'07 - IV Latin-American
Graphs, Algorithms and Optimization Symposium.
Puerto
Varas, Chile, november
2007.
Eletronic Notes in Discrete Mathematics 30 (2008) 177-182 (with M. C. Dourado,
J. L. Szwarcfiter).
42. On the Computation of some Parameters Related to
Convexity of Graphs.
ICDM 2006 - International
Conference on Discrete Mathematics.
Bangalore,
India, december
2006.
RMS
Lecture Notes Series in Mathematics 7 (2006) 101-108 (with M. C. Dourado,
J. L. Szwarcfiter).
43. Applying
Modular Decomposition to Parameterized Bicluster
Editing.
IWPEC 2006 - The Second
International Workshop on Parameterized and Exact Computation.
Zürich,
Switzerland, september 2006.
Lecture
Notes in Computer Science
4169 (2006) 1-12 (with M. D. da Silva, J. L. Szwarcfiter).
44. The
Helly Property on Subhypergraphs.
GRACO'2005 - Brazilian
Symposium on Graphs, Algorithms and Combinatorics.
Angra dos Reis, Brazil,
april 2005.
Eletronic Notes in Discrete Mathematics 19 (2005) 71-77 (with M. C. Dourado,
J. L. Szwarcfiter).
45. Aplication-Driven
Node Management in Multihop Wireless Sensor Networks.
ICN 2005 - 4th International
Conference on Networking.
Reunion
Island, april 2005.
Lecture
Notes in Computer Science
3420 (2005) 569-576 (with F. C. Delicato, L. Pirmez, J. F. Rezende, L.
Rust).
46. A
Novel Distributed Scheduling Algorithm for Resource Sharing under
Near-heavy Load.
OPODIS 2004 - 8th Conference
on Principles of Distributed Systems.
Grenoble,
France, december 2004.
Lecture
Notes in Computer Science
3544 (2004) 431-442 (with D. Carvalho, F. M. G. França, M. De
Gregorio).
LACGA'2004 - Latin-American Conference on Combinatorics, Graphs and Applications.
Santiago,
Chile, august 2004.
Eletronic Notes in Discrete Mathematics 18 (2004) 73-79 (with M. R. Cerioli,
L. Faria, T. O. Ferreira).
48. New
Advances about a Conjecture on Helly Circle Graphs.
LACGA'2004 - Latin-American Conference on Combinatorics, Graphs and Applications.
Santiago,
Chile, august 2004.
Eletronic Notes in Discrete Mathematics 18 (2004) 31-36 (with J. M. Barrionuevo,
A. Calvo, G. Durán).
49. On
Clique-inverse Graphs of K_p-free Graphs.
LACGA'2004 - Latin-American Conference on Combinatorics, Graphs and Applications.
Santiago,
Chile, august 2004.
Eletronic Notes in Discrete Mathematics 18 (2004) 139-143 (with S. Gravier,
C. Linhares Sales).
50. Characterization and
Recognition of Generalized Clique-Helly Graphs.
WG'2004 - 30th International
Workshop on Graph-Theoretic Concepts in Computer Science.
Hölterhoff House, Bad Honeff, Germany,
june 2004.
Lecture
Notes in Computer Science
3353 (2004) 344-354 (with M. C. Dourado, J. L. Szwarcfiter).
51. A Huffman-based Error
Detecting Code.
WEA 2004 - III International
Workshop on Efficient and Experimental Algorithms.
Angra dos Reis, Brazil,
may 2004.
Lecture
Notes in Computer Science 3059 (2004) 446-457 (with P. E. D. Pinto, J. L. Szwarcfiter).
52. An Improved Derandomized Approximation Algorithm for the Max-Controlled
Set Problem.
WEA 2004 - III International
Workshop on Efficient and Experimental Algorithms.
Angra dos Reis, Brazil,
may 2004.
Lecture
Notes in Computer Science 3059 (2004), 341-355 (with C. A. Martinhon).
53. List Partitions of Chordal Graphs.
LATIN 2004 - Latin American Theoretical Informatics.
Buenos
Aires, Argentina, april
2004.
Lecture
Notes in Computer Science
2976 (2004) 100-108 (with T. Feder, P. Hell, S.
Klein, L. T. Nogueira).
54. On Generalized Split
Graphs.
GRACO'2001 - Brazilian
Symposium on Graphs, Algorithms and Combinatorics.
Fortaleza,
Brazil, march 2001.
Eletronic Notes in Discrete Mathematics 7 (2001) 98-101 (with P. Hell, S. Klein, L. T. Nogueira).
55. ILP Formulations for
Scheduling Ordered Tasks on a Bounded Number of Processors.
GRACO'2001 - Brazilian
Symposium on Graphs, Algorithms and Combinatorics.
Fortaleza,
Brazil, march 2001.
Eletronic Notes in Discrete Mathematics 7 (2001) 166-169 (with M. Campêlo,
R. Corrêa, N. Maculan).
56. On the
Relations between Acceptable Programs and Stratifiable
Classes.
SBIA'98 - 14th Brazilian
Symposium on Artificial Intelligence.
Porto
Alegre, Brazil, november
1998.
Lecture
Notes in Artificial Intelligence 1515 (1998) 141-150 (with G. Zaverucha).
57. Recognizing
Classes of Logic Programs.
WOLLIC'97 - 4th Workshop on
Logic, Language, Information and Computation.
Fortaleza,
Brazil, august 1997.
Logic
Journal of the IGPL 5 (1997) 913-915 (with G. Zaverucha).
58. On
Computing All Maximal Cliques Distributedly.
IRREGULAR'97 - 4th International Symposium
on Solving Irregularly Structured Problems in Parallel.
Paderborn,
Germany, june 1997.
Lecture
Notes in Computer Science
1253 (1997) 37-48 (with F. M. G. França, J. L. Szwarcfiter).
_______________________________________________________________________________________________________
Conferences (other papers in proceedings)
59. A Multi-Thread GRASP/VND for the Cluster Editing
Problem.
Proceedings of the CBIC 2011 - X Congresso Brasileiro de Inteligência
Computacional.
Fortaleza, CE, november
2011 (with L. Bastos, L. S. Ochi).
60. Partições
em Grafos: Teoria e Aplicações (Course
in Portuguese).
Proceedings of the XLIII SBPO - Simpósio Brasileiro de Pesquisa Operacional.
Ubatuba, SP, august 2011 (with S. Klein, L. T. Nogueira).
61. Partition of P_4-Laden Graphs into Independent Sets
and Cliques.
Proceedings of the XLIII SBPO - Simpósio Brasileiro de Pesquisa
Operacional.
Ubatuba, SP, august 2011 (with R. S. F.
Bravo, S. Klein, S. Nascimento, L. T. Nogueira, R. Sampaio).
62. Aplicações
de Grafos E/Ou.
Proceedings of the ERPO-NO 2011 - Encontro Regional de Pesquisa
Operacional do Norte.
Manaus, AM, may
2011 (with M. Dantas da Silva, U. S. Souza).
63. Partição
dos Grafos P_4-tidy em Conjuntos Independentes e Cliques.
Proceedings of the XLII SBPO - Simpósio Brasileiro de Pesquisa Operacional.
Bento
Gonçalves, RS, august-september
2010 (with R. S. F. Bravo, S. Klein, L. T. Nogueira).
64. On the Complexity of the Edge Guarding Problem.
Proceedings of the 26th
European Workshop on Computational Geometry - EuroCG
2010.
Dortmund,
Germany, march 2010 (with V. H. F. Batista, F. L. B. Ribeiro).
65. Advances on the List Stubborn Problem.
Proceedings of the 16th CATS - Computing: the
Australasian Theory Symposium.
Brisbane, Australia,
january 2010 (with S.
Dantas, L. Faria, C. M. H. de Figueiredo, S. Klein, L.
T. Nogueira, F. Protti).
66. Partitions of Cographs into
Independent Sets and Cliques.
Proceedings of the III
Taller Latinoamericano de Clanes
en Gráficas.
Guanajuato,
Mexico, october 2009 (with
R. S. F. Bravo, S. Klein, L. T. Nogueira).
67. Clique Decomposition and the Monophonic Hull Number of
a Graph.
Proceedings of the III
Taller Latinoamericano de Clanes
en Gráficas.
Guanajuato,
Mexico, october 2009 (with
M. C. Dourado, J. L. Szwarcfiter).
68. Caracterização
e Reconhecimento dos Cografos-(k,l).
Proceedings of the XLI SBPO - Simpósio Brasileiro de Pesquisa Operacional.
Porto Seguro, BA, september 2009 (with R. S. F.
Bravo, S. Klein, L. T. Nogueira).
69. Partição
Floresta-clique de Cografos.
Proceedings of the XL SBPO - Simpósio Brasileiro de Pesquisa Operacional.
João Pessoa, PB, september 2008 (with S. P. de
Brito, S. Klein, L. T. Nogueira).
70. On Detecting Deadlock in the Pi-Calculus.
Proeedings of Logic and Theory of Algorithms - Fourth Conference
on Computability in Europe 2008, CiE 2008.
University
of Athens, Greece, june
2008, pp. 35-44 (with T. Azevedo, M. Benevides, M. Sihman).
71. A Method for Stochastic Modeling of Software
Development Process in Constrained Resource Environments.
Proceedings of The IEEE Systems and Information
Engineering Design Symposium - SIEDS'08.
Charlottesville,
Virginia, april 2008, v. I, pp. 40-45 (with F. M. L. Ferreira, E. A. Schmitz, A. J. Alencar).
72. A Framework for Preparing Experimental Evaluation of
Rerouting Mechanisms.
Proceedings of the 10th IEEE
Computer Society International WORDS 2005.
(Workshop on Object-Oriented Real-Time
Dependable Systems)
Sedona,
Arizona, 2005, 10 pages (with
L. Pirmez, P. F. Pires, F. C. Delicato,
L. F. R. C. Carmo, et al.).
73. Uma
Abordagem Baseada em QoS
para Seleção de Nós Ativos em Redes de Sensores sem Fio.
Proceedings of the XXIII Simpósio Brasileiro de Redes de Computadores - SBRC 2005.
Fortaleza, CE, march
2005, pp. 367 – 380 (with F. Delicato,
L. Pirmez, J. L. Rezende, L. Rust).
74. Partitions and Extensions of Chordal
Graphs into Independent Sets and Cliques.
Proceedings of the Workshop do Concurso de Teses e Dissertações da SBC,
2004
(with S.
Klein, L. T. Nogueira).
75. Compactação
de Dados com Deteção de Erros.
Proceedings of the XXXV SBPO - Simpósio Brasileiro de Pesquisa Operacional.
Natal,
Brazil, november 2003,
TG-2462, 11 pages (with P. E. D. Pinto, J. L. Szwarcfiter).
76. Extensão-(0,L) e -(1,L) de Grafos Cordais.
Proceedings of the XXXV SBPO - Simpósio Brasileiro de Pesquisa Operacional.
Natal,
Brazil, november 2003,
TG-2494, 9 pages (with P. Hell, S. Klein, L. T. Nogueira).
77. A Randomized Rounding Procedure for a Large Class of
Instances of the Max-Controlled Set Problem.
Proceedings of the XXXV SBPO - Simpósio Brasileiro de Pesquisa Operacional.
Natal,
Brazil, november 2003,
OC-1660, 9 pages (with C. A. Martinhon).
78. Improved Lower Bounds for Scheduling Ordered Tasks on
a Bounded Number of Processors.
Proceedings of the XI CLAIO
- Latin-Iberian American Congress of Operations Research.
Concepción,
Chile, october 2002, A37-16
(with M. Campêlo, R. Corrêa,
N. Maculan).
79. Independent K_r's in Chordal Graphs.
Proceedings of the XI CLAIO
- Latin-Iberian American Congress of Operations Research.
Concepción,
Chile, october 2002, A23-03
(with P. Hell, S. Klein, L. T. Nogueira).