Flavia Bonomo-Braberman
Flavia Bonomo-Braberman
Altri nomiFlavia Bonomo
Associate Professor of Computer Science Department, School of Sciences, University of Buenos Aires
Email verificata su - Home page
Citata da
Citata da
NP-completeness results for edge modification problems
P Burzyn, F Bonomo, G Durán
Discrete Applied Mathematics 154 (13), 1824-1844, 2006
Three-coloring and list three-coloring of graphs without induced paths on seven vertices
F Bonomo, M Chudnovsky, P Maceli, O Schaudt, M Stein, M Zhong
Combinatorica 38 (4), 779-801, 2018
A method for optimizing waste collection using mathematical programming: a Buenos Aires case study
F Bonomo, G Durán, F Larumbe, J Marenco
Waste Management & Research 30 (3), 311-324, 2012
On the b-Coloring of Cographs and P4-Sparse Graphs
F Bonomo, G Durán, F Maffray, J Marenco, M Valencia-Pabon
Graphs and Combinatorics 25 (2), 153-167, 2009
Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
F Bonomo, S Mattia, G Oriolo
Theoretical Computer Science 412 (45), 6261-6268, 2011
Exploring the complexity boundary between coloring and list-coloring
F Bonomo, G Durán, J Marenco
Annals of Operations Research 169 (1), 3-16, 2009
An application of the traveling tournament problem: The Argentine volleyball league
F Bonomo, A Cardemil, G Durán, J Marenco, D Sabán
Interfaces 42 (3), 245-259, 2012
On balanced graphs
F Bonomo, G Durán, MC Lin, JL Szwarcfiter
Mathematical programming 105, 233-250, 2006
A framework for scheduling professional sports leagues
K Nurmi, D Goossens, T Bartsch, F Bonomo, D Briskorn, G Duran, ...
AIP Conference Proceedings 1285 (1), 14-28, 2010
Analysis and models of bilateral investment treaties using a social networks approach
D Saban, F Bonomo, NE Stier-Moses
Physica A: Statistical Mechanics and its Applications 389 (17), 3661-3673, 2010
A framework for a highly constrained sports scheduling problem
K Nurmi, D Goossens, T Bartsch, F Bonomo, D Briskorn, G Duran, ...
Proceedings of the international MultiConference of Engineers and Computer …, 2010
On clique-perfect and K-perfect graphs
F Bonomo, G Durán, M Groshaus, JL Szwarcfiter
Ars combinatoria 80, 97-112, 2006
Partial characterizations of clique-perfect graphs I: subclasses of claw-free graphs
F Bonomo, M Chudnovsky, G Durán
Discrete Applied Mathematics 156 (7), 1058-1082, 2008
Mathematical programming as a tool for virtual soccer coaches: a case study of a fantasy sport game
F Bonomo, G Duran, J Marenco
International Transactions in Operational Research 21 (3), 399-414, 2014
On the b-coloring of P4-tidy graphs
CIB Velasquez, F Bonomo, I Koch
Discrete Applied Mathematics 159 (1), 60-68, 2011
Partial characterizations of circular‐arc graphs
F Bonomo, G Durán, LN Grippo, MD Safe
Journal of Graph Theory 61 (4), 289-306, 2009
On the thinness and proper thinness of a graph
F Bonomo, D de Estrada
Discrete Applied Mathematics 261, 78-92, 2019
Between coloring and list-coloring: μ-coloring
F Bonomo, M Cecowski
Electronic Notes in Discrete Mathematics, 117-123, 2005
Domination parameters with number 2: interrelations and algorithmic consequences
F Bonomo, B Brešar, LN Grippo, M Milanič, MD Safe
Discrete Applied Mathematics 235, 23-50, 2018
Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
F Bonomo, M Chudnovsky, G Durán
Discrete Mathematics 309 (11), 3485-3499, 2009
Il sistema al momento non puň eseguire l'operazione. Riprova piů tardi.
Articoli 1–20