|
|
 |
 |
|
|
|
| |
Área
de investigación |
Research area |
|
| |
|
|
|
| |
|
Teoría
de Grafos | Graph Theory |
|
| |
|
Optimización
Combinatoria | Combinatorial Optimization |
|
| |
|
Complejidad Computacional |
Computational Complexity |
|
| |
|
Investigación Operativa
| Operations Research |
|
| |
|
|
|
| |
|
|
|
| |
Trabajos
completos | Full
papers |
|
| |
|
|
|
| |
 |
Bonomo
F., Costa Dourado M., Durán G., Faria L., Grippo L.N.
and Safe M.D., "Forbidden subgraphs and the König-Egerváry
property", Discrete Applied Mathematics, en prensa. |
|
| |
[link] [PDF] |
|
| |
|
|
| |
 |
Bonomo
F. and Szwarcfiter J.L., "Characterization of classical
graph classes by weighted clique graphs", Discrete Applied
Mathematics, en prensa. |
|
| |
[link] [PDF] |
|
| |
|
|
| |
 |
Bonomo
F., Durán G., Safe M.D. and Wagler A.K., "On minimal
forbidden subgraph characterizations of balanced graphs",
Discrete Applied Mathematics, en prensa. |
|
| |
[link] [PDF] |
|
| |
|
|
| |
 |
Bonomo
F., Delle Donne D., Durán G and Marenco M., "Automatic
Dwelling Segmentation of Buenos Aires Province for the 2010
Argentinian Census", Interfaces, en prensa. |
|
| |
[link]
[PDF] |
|
| |
|
|
| |
 |
Bonomo
F. and Valencia-Pabon M., "On the Minimum sum coloring
of P4-sparse graphs", Graphs and Combinatorics,
en prensa. |
|
| |
[link] [PDF] |
|
| |
|
|
| |
 |
Bonomo
F., Marenco J., Saban D. and Stier Moses N., "A polyhedral
study of the maximum edge subgraph problem", Discrete Applied
Mathematics 160(18), 2012, 2573-2590. |
|
| |
[link]
[PDF] |
|
| |
|
|
| |
 |
Bonomo
F., Cardemil A., Durán G., Marenco J. and Saban D., "An
application of the traveling tournament problem: The Argentine
volleyball league", Interfaces 42(3), 2012, 245-259. |
|
| |
[link]
[PDF] |
|
| |
|
|
| |
 |
Bonomo
F., Faenza Y and Oriolo G., "On coloring problems with
local constraints", Discrete Mathematics 312(12-13), 2012,
2027-2039. |
|
| |
[link]
[PDF] |
|
| |
|
|
| |
 |
Bonomo
F., Durán G., Larumbe F. and Marenco J., "A Method
for Optimizing Waste Collection Using Mathematical Programming:
A Buenos Aires Case Study", Waste Management & Research
30(3), 2012, 311-324. |
|
| |
[link] [PDF] |
|
| |
|
|
| |
 |
Bonomo
F., Delle Donne D., Durán G. and Marenco J., "Segmentación
automática de la Provincia de Buenos Aires para el Censo Nacional
Argentino 2010", Revista Ingeniería de Sistemas
25, 2011, 29-45. |
|
| |
[PDF] |
|
| |
|
|
| |
 |
Bonomo
F., Mattia S. and Oriolo G., "Bounded coloring of co-comparability
graphs and the pickup and delivery tour combination problem",
Theoretical Computer Science 412(45), 2011, 6261-6268. |
|
| |
[link] [PDF] |
|
| |
|
|
| |
 |
Bonomo
F., Durán G., Grippo L.N. and Safe M.D., "Partial
characterizations of circle graphs", Discrete Applied Mathematics
159(16), 2011, 1699-1706. |
|
| |
[link] [PDF] |
|
| |
|
|
| |
|
Bonomo
F. and Cecowski M., "Between coloring and list-coloring:
μ-coloring", Ars Combinatoria 99, 2011, 383-398. |
|
| |
[PDF] |
|
| |
|
|
| |
 |
Bonomo
F., Durán G., Marenco J. and Valencia-Pabon M., "Minimum
sum set coloring of trees and line graphs of trees", Discrete
Applied Mathematics 159(5), 2011, 288-294. |
|
| |
[link] [PDF] |
|
| |
|
|
| |
|
Bonomo
F. and Cerioli M.R., "On the L(2,1)-labeling of block graphs",
International Journal of Computer Mathematics 88(3), 2011, 468-475. |
|
| |
[link] [PDF] |
|
| |
|
|
| |
 |
Betancur
Velasquez C., Bonomo F. and Koch I., "On the b-coloring
of P4-tidy graphs", Discrete Applied Mathematics
159(1), 2011, 60-68. |
|
| |
[link]
[PDF] |
|
| |
|
|
| |
|
Saban
D., Bonomo F. and Stier-Moses N., "Analysis and Models
of Bilateral Investment Treaties using a Social Networks Approach",
Physica A 389(17), 2010, 3661-3673. |
|
| |
[link] [PDF] |
|
| |
|
|
| |
 |
Bonomo
F., Durán G., Soulignac F. and Sueiro G., "Partial
characterizations of clique-perfect and coordinated graphs:
superclasses of triangle-free graphs", Discrete Applied
Mathematics 157(17), 2009, 3511-3518. |
|
| |
[link] [PDF] |
|
| |
|
|
| |
 |
Bonomo
F., Durán G., Larumbe F. and Marenco J., "Optimización
de la recolección de residuos en la zona sur de la Ciudad
de Buenos Aires", Revista Ingeniería de Sistemas
23, 2009, 71-88. |
|
| |
[PDF] |
|
| |
|
|
| |
 |
Elías
Costa M., Bonomo F. and Sigman M., "Scale-invariant transition
probabilities in free word association trajectories", Frontiers
in Integrative Neuroscience 3:19 (2009). |
|
| |
[link] |
|
| |
|
|
| |
 |
Bonomo
F., Durán G., Grippo L.N. and Safe M.D., "Partial
characterizations of circular-arc graphs", Journal of Graph
Theory 61(4), 2009, 289-306. |
|
| |
[link] [PDF] |
|
| |
|
|
| |
 |
Bonomo
F., Durán G., Maffray F., Marenco J. and Valencia-Pabon
M., "On the b-coloring of cographs and P4-sparse
graphs", Graphs and Combinatorics 25(2), 2009, 153-167. |
|
| |
[link] [PDF] |
|
| |
|
|
| |
 |
Bonomo
F., Chudnovsky M. and Durán G., "Partial characterizations
of clique-perfect graphs II: diamond-free and Helly circular-arc
graphs", Discrete Mathematics 309(11), 2009, 3485-3499. |
|
| |
[link] [PDF] |
|
| |
|
|
| |
 |
Bonomo
F., Durán G. and Marenco J., "Exploring the complexity
boundary between coloring and list-coloring", Annals of
Operations Research 169(1), 2009, 3-16. |
|
| |
[link] [PDF] |
|
| |
|
|
| |
 |
Bonomo
F., Durán G., Soulignac F. and Sueiro G., "Partial
characterizations of coordinated graphs: line graphs and complements
of forests", Mathematical Methods of Operations Research
69(2), 2009, 251-270. |
|
| |
[link] [PDF] |
|
| |
|
|
| |
|
Bonomo
F., Chudnovsky M. and Durán G., "Partial characterizations
of clique-perfect graphs I: subclasses of claw-free graphs",
Discrete Applied Mathematics 156(7), 2008, 1058-1082. |
|
| |
[link] [PDF] |
|
| |
|
|
| |
|
Bonomo
F., Durán G. and Groshaus M., "Coordinated graphs
and clique graphs of clique-Helly perfect graphs", Utilitas
Mathematica 72, 2007, 175-191. |
|
| |
[PDF] |
|
| |
|
|
| |
|
Burzyn
P., Bonomo F. and Durán G., "NP-completeness results
for edge modification problems", Discrete Applied Mathematics
154(13), 2006, 1824-1844. |
|
| |
[link] [PDF] |
|
| |
|
|
| |
|
Bonomo
F., "Self-clique Helly circular-arc graphs", Discrete
Mathematics 306(6), 2006, 595-597. |
|
| |
[link] [PDF] |
|
| |
|
|
| |
|
Bonomo
F., Durán G., Lin M. and Szwarcfiter J., "On Balanced
Graphs", Mathematical Programming 105, 2006, 233-250. |
|
| |
[link] [PDF] |
|
| |
|
|
| |
|
Bonomo
F., Durán G., Groshaus M. and Szwarcfiter J., "On
clique- perfect and K-perfect graphs", Ars Combinatoria
80, 2006, 97-112. |
|
| |
[PDF] |
|
| |
|
|
| |
|
Bonomo
F. and Durán G., "Computational complexity of classical
problems for hereditary clique-Helly graphs", Pesquisa
Operacional 24(3), 2004, 435-443. |
|
| |
[link]
[PDF] |
|
| |
|
|
| |
|
|
| |
Resúmenes
extendidos | Extended
abstracts |
|
| |
|
|
|
| |
 |
Bonomo
F., Oriolo G., Snels C. and Stauffer G., "Minimum clique
cover in claw-free perfect graphs and the weak Edmonds-Johnson
property", Lecture Notes in Computer Science 7801, 2013,
86-97. |
|
| |
[link] [PDF] |
|
| |
|
|
| |
 |
Bonomo
F., Oriolo G. and Snels C., "Minimum weighted clique cover
on strip-composed perfect graphs", Lecture Notes in Computer
Science 7551, 2012, 22-33. |
|
| |
[link] [PDF] |
|
| |
|
|
| |
 |
Bonomo
F., Giandomenico M. and Rossi F., "On the Cornaz-Jost transformation
to solve the graph coloring problem", in Proceedings of
the 11st Cologne-Twente Workshop on Graphs and Combinatorial
Optimization, Munich, Germany, pp. 26-29. |
|
| |
[PDF] |
|
| |
|
|
| |
 |
Bonomo
F., Durán G., Safe M.D. and Wagler A.K., "Clique-perfectness
of complements of line graphs", Electronic Notes in Discrete
Mathematics 37, 2011, 327-332. |
|
| |
[link]
[PDF] |
|
| |
|
|
| |
 |
Bonomo
F. and Szwarcfiter J.L., "On weighted clique graphs",
Matemática Contemporânea 39, 2010, 9-22. |
|
| |
[PDF] |
|
| |
|
|
| |
 |
Bonomo
F., Durán G., Safe M.D. and Wagler A.K., "Balancedness
of some subclasses of circular-arc graphs", Electronic
Notes in Discrete Mathematics 36, 2010, 1121-1128. |
|
| |
[link]
[PDF] |
|
| |
|
|
| |
 |
Nurmi
K., Goossens D., Bartsch T., Bonomo F., Briskorn D., Durán G.,
Kyngäs J., Marenco J., C. Ribeiro C., Spieksma F., Urrutia S.,
Wolf R., "A Framework for a Highly Constrained Sports Scheduling
Problem", in Proceedings of the International MultiConference
of Engineers and Computer Scientists (IMECS) 2010 Vol III, Hong
Kong, pp. 1991-1997. |
|
| |
[PDF] |
|
| |
|
|
| |
 |
Bonomo
F. and Valencia-Pabon M., "Minimum sum coloring of P_4-sparse
graphs", Electronic Notes in Discrete Mathematics 35, 2009,
293-298. |
|
| |
[link]
[PDF] |
|
| |
|
|
| |
 |
Bonomo
F., Faenza Y and Oriolo G., "On coloring problems with
local constraints", Electronic Notes in Discrete Mathematics
35, 2009, 215-220. |
|
| |
[link]
[PDF] |
|
| |
|
|
| |
 |
Bonomo
F., Marenco J., Saban D. and Stier Moses N., "A polyhedral
study of the maximum edge subgraph problem", Electronic
Notes in Discrete Mathematics 35, 2009, 197-202. |
|
| |
[link]
[PDF] |
|
| |
|
|
| |
 |
Bonomo
F., Durán G., Safe M.D. and Wagler A.K., "On minimal
forbidden subgraph characterizations of balanced graphs",
Electronic Notes in Discrete Mathematics 35, 2009, 41-46. |
|
| |
[link]
[PDF] |
|
| |
|
|
| |
 |
Bonomo
F., Burzyn A., Cardemil A., Durán G. and Marenco J., "An application
of the traveling tournament problem: The Argentine volleyball
league", In Michel Gendreau and Edmund K. Burke (Eds.), Proceedings
of the 7th International Conference on the Practice and Theory
of Automated Timetabling (PATAT), 2008. |
|
| |
[PDF] |
|
| |
|
|
| |
 |
Bonomo
F., Durán G., Grippo L.N. and Safe M.D., "Partial
characterizations of circular-arc graphs", Electronic Notes
in Discrete Mathematics 30, 2008, 45-50. |
|
| |
[link] [PDF] |
|
| |
|
|
| |
 |
Bonomo
F., Durán G., Soulignac F. and Sueiro G., "Partial
characterizations of clique-perfect and coordinated graphs:
superclasses of triangle-free graphs", Electronic Notes
in Discrete Mathematics 30, 2008, 51-56. |
|
| |
[link] [PDF] |
|
| |
|
|
| |
 |
Bonomo
F., Durán G. and Marenco J., "Exploring the complexity
boundary between coloring and list-coloring", Electronic
Notes in Discrete Mathematics 25, 2006, 41-47. |
|
| |
[link] [PDF] |
|
| |
|
|
| |
 |
Bonomo
F. and Durán G., "Characterization and recognition
of Helly circular-arc clique-perfect graphs", Electronic
Notes in Discrete Mathematics 22, 2005, 147-150. |
|
| |
[link] [PDF] |
|
| |
|
|
| |
|
Bonomo
F., Chudnovsky M. and Durán G., "Partial characterizations
of clique-perfect graphs", Electronic Notes in Discrete
Mathematics 19, 2005, 95-101. |
|
| |
[link] [PDF] |
|
| |
|
|
| |
|
Bonomo
F. and Cecowski M., "Between coloring and list-coloring:
μ-coloring", Electronic Notes in Discrete Mathematics
19, 2005, 117-123. |
|
| |
[link] [PDF] |
|
| |
|
|
| |
|
Burzyn
P., Bonomo F. and Durán G., "Computational complexity
of edge modification problems in different classes of graphs",
Electronic Notes in Discrete Mathematics 18, 2004, 41-46. |
|
| |
[link]
[PDF] |
|
| |
|
|
| |
|
|
| |
Capítulos
de libro | Book
chapters |
|
| |
|
|
|
| |
 |
Nurmi
K., Goossens D., Bartsch T., Bonomo F., Briskorn D., Durán
G., Kyngäs J., Marenco J., Ribeiro C.C., Spieksma F., Urrutia
S. and Wolf-Yadlin R., "A Framework for Scheduling Professional
Sports Leagues", in: Ao, S.-l., Katagiri, H., Xu, L., and
Chan, A.H.-S. (Eds.), IAENG Transactions on Engineering Technologies
Volume 5, Springer, USA, 2010, pp. 14-28. |
|
| |
[link]
[PDF] |
|
| |
|
|
| |
|
|
| |
|
|
| |
Tesis
de Doctorado | PhD.
Thesis |
|
| |
|
|
|
| |
|
Título:
"Sobre subclases y variantes de los grafos perfectos (On
subclasses and variations of perfect graphs)"
Director: Guillermo
Durán
Fecha de presentación: diciembre de 2005 |
|
| |
[PDF] |
|
| |
|
|
| |
|
|
|
| |
Tesis
de Licenciatura | Degree
Thesis |
|
| |
|
|
|
| |
|
Título:
"Sobre grafos balanceados y complejidad computacional de
problemas asociados a la teoría de grafos perfectos"
Director: Guillermo
Durán
Fecha de presentación: marzo de 2002 |
|
| |
[PDF] |
|
| |
|
|
| |
|
|
| |
Libros
| Books |
|
| |
|
|
|
| |
|
Bonomo F., D'Andrea
C., Laplagne S., Szew M., "Explorando la geometría
en los Clubes Cabri", editorial Red Olímpica, 1996. |
|
| |
[link] |
|
| |
|
|
| |
|
Bonomo F., Laplagne
S., Szew M., Tilli D., "Competencias entre
Clubes Cabri", editorial Red Olímpica, 1998. |
|
| |
|
|
|
| |
|
|
 |
|