Flavia Bonomo-Braberman
Orcid: 0000-0002-9872-7528Affiliations:
- Universidad de Buenos Aires, Argentina
According to our database1,
Flavia Bonomo-Braberman
authored at least 90 papers
between 2004 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2025
Non-crossing <i>H</i>-graphs: a generalization of proper interval graphs admitting FPT algorithms.
CoRR, January, 2025
CoRR, January, 2025
2024
J. Comput. Syst. Sci., March, 2024
Int. Trans. Oper. Res., January, 2024
Thinness and its variations on some graph families and coloring graphs of bounded thinness.
RAIRO Oper. Res., 2024
Tasks People Prompt: A Taxonomy of LLM Downstream Tasks in Software Verification and Falsification Approaches.
CoRR, 2024
2023
Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs.
Discret. Appl. Math., November, 2023
2022
Discret. Appl. Math., 2022
2021
Theor. Comput. Sci., 2021
Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021
2020
Discret. Appl. Math., 2020
Preface: LAGOS 2017 - IX Latin and American Algorithms, Graphs and Optimization Symposium, C.I.R.M. - Marseille, France, 2017.
Discret. Appl. Math., 2020
2019
2018
Discret. Appl. Math., 2018
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid.
Discret. Appl. Math., 2018
Three-Coloring and List Three-Coloring of Graphs Without Induced Paths on Seven Vertices.
Comb., 2018
On the (k, i)-coloring of cacti and complete graphs.
Ars Comb., 2018
Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018
2017
Graphs Comb., 2017
Electron. Notes Discret. Math., 2017
An asymmetric multi-item auction with quantity discounts applied to Internet service procurement in Buenos Aires public schools.
Ann. Oper. Res., 2017
2016
Discret. Appl. Math., 2016
2015
Theor. Comput. Sci., 2015
A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to {k}-sparse graphs.
Inf. Process. Lett., 2015
Electron. Notes Discret. Math., 2015
Discret. Math. Theor. Comput. Sci., 2015
Algorithmica, 2015
2014
Mathematical programming as a tool for virtual soccer coaches: a case study of a fantasy sport game.
Int. Trans. Oper. Res., 2014
Int. J. Comput. Math., 2014
Discret. Math. Theor. Comput. Sci., 2014
Discret. Appl. Math., 2014
LAGOS'11: Sixth Latin American Algorithms, Graphs, and Optimization Symposium, Bariloche, Argentina - 2011.
Discret. Appl. Math., 2014
2013
Inf. Process. Lett., 2013
Automatic Dwelling Segmentation of the Buenos Aires Province for the 2010 Argentinian Census.
Interfaces, 2013
Discret. Math. Theor. Comput. Sci., 2013
Discret. Appl. Math., 2013
Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property.
Proceedings of the Integer Programming and Combinatorial Optimization, 2013
2012
Interfaces, 2012
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012
On the Cornaz-Jost Transformation to Solve the Graph Coloring Problem.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012
2011
Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem.
Theor. Comput. Sci., 2011
Electron. Notes Discret. Math., 2011
Discret. Appl. Math., 2011
Between coloring and list-coloring: μ-coloring.
Ars Comb., 2011
A primal algorithm for the minimum weight clique cover problem on a class of claw-free perfect graphs.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011
2010
Electron. Notes Discret. Math., 2010
2009
Partial characterizations of coordinated graphs: line graphs and complements of forests.
Math. Methods Oper. Res., 2009
Graphs Comb., 2009
Electron. Notes Discret. Math., 2009
Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs.
Discret. Math., 2009
Partial characterizations of clique-perfect and coordinated graphs: Superclasses of triangle-free graphs.
Discret. Appl. Math., 2009
Ann. Oper. Res., 2009
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009
2008
Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs.
Discret. Appl. Math., 2008
2006
On clique-perfect and K-perfect graphs.
Ars Comb., 2006
2005
Electron. Notes Discret. Math., 2005
Electron. Notes Discret. Math., 2005
Electron. Notes Discret. Math., 2005
2004
Computational complexity of edge modification problems in different classes of graphs.
Electron. Notes Discret. Math., 2004