Computational complexity of edge modification problems in different classes of graphs. - Pablo Burzyn; Flavia Bonomo; Guillermo Durán (Electron. Notes Discret. Math., 2004)

Between coloring and list-coloring: mu-coloring. - Flavia Bonomo; Mariano Cecowski Palacio (Electron. Notes Discret. Math., 2005)

Partial characterizations of clique-perfect graphs. - Flavia Bonomo; Maria Chudnovsky; Guillermo Durán (Electron. Notes Discret. Math., 2005)

Characterization and recognition of Helly circular-arc clique-perfect graphs. - Flavia Bonomo; Guillermo Durán (Electron. Notes Discret. Math., 2005)

On clique-perfect and K-perfect graphs. - Flavia Bonomo; Guillermo Durán; Marina Groshaus; Jayme Luiz Szwarcfiter (Ars Comb., 2006)

NP-completeness results for edge modification problems. - Pablo Burzyn; Flavia Bonomo; Guillermo Durán (Discret. Appl. Math., 2006)

Self-clique Helly circular-arc graphs. - Flavia Bonomo (Discret. Math., 2006)

On Balanced Graphs. - Flavia Bonomo; Guillermo Durán; Min Chih Lin; Jayme Luiz Szwarcfiter (Math. Program., 2006)

Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs. - Flavia Bonomo; Maria Chudnovsky; Guillermo Durán (Discret. Appl. Math., 2008)

Minimum Sum Set Coloring on some Subclasses of Block Graphs. - Flavia Bonomo; Guillermo Durán; Javier Marenco; Mario Valencia-Pabon (CTW, 2009)

Exploring the complexity boundary between coloring and list-coloring. - Flavia Bonomo; Guillermo Durán; Javier Marenco (Ann. Oper. Res., 2009)

Partial characterizations of clique-perfect and coordinated graphs: Superclasses of triangle-free graphs. - Flavia Bonomo; Guillermo Durán; Francisco J. Soulignac; Gabriel Sueiro (Discret. Appl. Math., 2009)

Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs. - Flavia Bonomo; Maria Chudnovsky; Guillermo Durán (Discret. Math., 2009)

On coloring problems with local constraints. - Flavia Bonomo; Yuri Faenza; Gianpaolo Oriolo (Electron. Notes Discret. Math., 2009)

Minimum Sum Coloring of P4-sparse graphs. - Flavia Bonomo; Mario Valencia-Pabon (Electron. Notes Discret. Math., 2009)

On the b-Coloring of Cographs and P4-Sparse Graphs. - Flavia Bonomo; Guillermo Durán; Frédéric Maffray; Javier Marenco; Mario Valencia-Pabon (Graphs Comb., 2009)

Partial characterizations of circular-arc graphs. - Flavia Bonomo; Guillermo Durán; Luciano N. Grippo; Martín Darío Safe (J. Graph Theory, 2009)

Partial characterizations of coordinated graphs: line graphs and complements of forests. - Flavia Bonomo; Guillermo Durán; Francisco J. Soulignac; Gabriel Sueiro (Math. Methods Oper. Res., 2009)

Balancedness of some subclasses of circular-arc graphs. - Flavia Bonomo; Guillermo Durán; Martín Darío Safe; Annegret Katrin Wagler (Electron. Notes Discret. Math., 2010)

A primal algorithm for the minimum weight clique cover problem on a class of claw-free perfect graphs. - Flavia Bonomo; Gianpaolo Oriolo; Claudia Snels (CTW, 2011)

Between coloring and list-coloring: μ-coloring. - Flavia Bonomo; Mariano Cecowski Palacio (Ars Comb., 2011)

Partial characterizations of circle graphs. - Flavia Bonomo; Guillermo Durán; Luciano N. Grippo; Martín Darío Safe (Discret. Appl. Math., 2011)

Minimum sum set coloring of trees and line graphs of trees. - Flavia Bonomo; Guillermo Durán; Javier Marenco; Mario Valencia-Pabon (Discret. Appl. Math., 2011)

On the b-coloring of P4-tidy graphs. - Clara Inés Betancur Velasquez; Flavia Bonomo; Ivo Koch (Discret. Appl. Math., 2011)

LAGOS 2011 - VI Latin-American Algorithms, Graphs, and Optimization Symposium. - Flavia Bonomo; Thomas M. Liebling; Javier Marenco; Jayme Luiz Szwarcfiter; Mario Valencia-Pabon (Electron. Notes Discret. Math., 2011)

On the L(2, 1)-labelling of block graphs. - Flavia Bonomo; Márcia R. Cerioli (Int. J. Comput. Math., 2011)

Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem. - Flavia Bonomo; Sara Mattia; Gianpaolo Oriolo (Theor. Comput. Sci., 2011)

On the Cornaz-Jost Transformation to Solve the Graph Coloring Problem. - Flavia Bonomo; Monia Giandomenico; Fabrizio Rossi (CTW, 2012)

Minimum Weighted Clique Cover on Strip-Composed Perfect Graphs. - Flavia Bonomo; Gianpaolo Oriolo; Claudia Snels (WG, 2012)

A polyhedral study of the maximum edge subgraph problem. - Flavia Bonomo; Javier Marenco; Daniela Sabán; Nicolás E. Stier Moses (Discret. Appl. Math., 2012)

An Application of the Traveling Tournament Problem: The Argentine Volleyball League. - Flavia Bonomo; Andrés Cardemil; Guillermo Durán; Javier Marenco; Daniela Sabán (Interfaces, 2012)

Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property. - Flavia Bonomo; Gianpaolo Oriolo; Claudia Snels; Gautier Stauffer (IPCO, 2013)

Forbidden subgraphs and the König-Egerváry property. - Flavia Bonomo; Mitre Costa Dourado; Guillermo Durán; Luérbio Faria; Luciano N. Grippo; Martín Darío Safe (Discret. Appl. Math., 2013)

On minimal forbidden subgraph characterizations of balanced graphs. - Flavia Bonomo; Guillermo Durán; Martín Darío Safe; Annegret Katrin Wagler (Discret. Appl. Math., 2013)

Perfectness of clustered graphs. - Flavia Bonomo; Denis Cornaz; Tínaz Ekim; Bernard Ries (Discret. Optim., 2013)

Probe interval graphs and probe unit interval graphs on superclasses of cographs. - Flavia Bonomo; Guillermo Durán; Luciano N. Grippo; Martín Darío Safe (Discret. Math. Theor. Comput. Sci., 2013)

Automatic Dwelling Segmentation of the Buenos Aires Province for the 2010 Argentinian Census. - Flavia Bonomo; Diego Delle Donne; Guillermo Durán; Javier Marenco (Interfaces, 2013)

A note on the Cornaz-Jost transformation to solve the graph coloring problem. - Flavia Bonomo; Monia Giandomenico; Fabrizio Rossi (Inf. Process. Lett., 2013)

Graphs of Power-Bounded Clique-Width. - Flavia Bonomo; Luciano N. Grippo; Martin Milanic; Martín Darío Safe (CoRR, 2014)

3-Colouring graphs without triangles or induced paths on seven vertices. - Flavia Bonomo; Oliver Schaudt; Maya Jakobine Stein (CoRR, 2014)

LAGOS'11: Sixth Latin American Algorithms, Graphs, and Optimization Symposium, Bariloche, Argentina - 2011. - Flavia Bonomo; Thomas M. Liebling; Javier Marenco; Jayme Luiz Szwarcfiter; Mario Valencia-Pabon (Discret. Appl. Math., 2014)

Characterization of classical graph classes by weighted clique graphs. - Flavia Bonomo; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2014)

Balancedness of subclasses of circular-arc graphs. - Flavia Bonomo; Guillermo Durán; Martín Darío Safe; Annegret Katrin Wagler (Discret. Math. Theor. Comput. Sci., 2014)

On the Minimum Sum Coloring of P 4-Sparse Graphs. - Flavia Bonomo; Mario Valencia-Pabon (Graphs Comb., 2014)

Clique-perfectness and balancedness of some graph classes. - Flavia Bonomo; Guillermo Durán; Martín Darío Safe; Annegret Katrin Wagler (Int. J. Comput. Math., 2014)

Mathematical programming as a tool for virtual soccer coaches: a case study of a fantasy sport game. - Flavia Bonomo; Guillermo Durán; Javier Marenco (Int. Trans. Oper. Res., 2014)

b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs. - Flavia Bonomo; Oliver Schaudt; Maya Stein; Mario Valencia-Pabon (Algorithmica, 2015)

Clique-perfectness of complements of line graphs. - Flavia Bonomo; Guillermo Durán; Martín Darío Safe; Annegret Katrin Wagler (Discret. Appl. Math., 2015)

On probe co-bipartite and probe diamond-free graphs. - Flavia Bonomo; Celina Miraglia Herrera de Figueiredo; Guillermo Alfredo Durán; Luciano Norberto Grippo; Martín Darío Safe; Jayme Luiz Szwarcfiter (Discret. Math. Theor. Comput. Sci., 2015)

k-tuple chromatic number of the cartesian product of graphs. - Flavia Bonomo; Ivo Koch; Pablo Daniel Torres; Mario Valencia-Pabon (Electron. Notes Discret. Math., 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. - Flavia Bonomo; Guillermo Durán; Amedeo Napoli; Mario Valencia-Pabon (Inf. Process. Lett., 2015)

Complexity of the cluster deletion problem on subclasses of chordal graphs. - Flavia Bonomo; Guillermo Durán; Mario Valencia-Pabon (Theor. Comput. Sci., 2015)

Graph classes with and without powers of bounded clique-width. - Flavia Bonomo; Luciano N. Grippo; Martin Milanic; Martín Darío Safe (Discret. Appl. Math., 2016)

An asymmetric multi-item auction with quantity discounts applied to Internet service procurement in Buenos Aires public schools. - Flavia Bonomo; Jaime Catalán; Guillermo Durán; Rafael Epstein; Mario Guajardo; Alexis Jawtuschenko; Javier Marenco (Ann. Oper. Res., 2017)

Clique coloring B1-EPG graphs. - Flavia Bonomo; María Pía Mazzoleni; Maya Stein (Discret. Math., 2017)

LAGOS 2017 - IX Latin and American Algorithms, Graphs, and Optimization Symposium. - Frédérique Bassino; Flavia Bonomo; Lionel Pournin; Mario Valencia-Pabon; Juan C. Vera 001 (Electron. Notes Discret. Math., 2017)

Vertex Intersection Graphs of Paths on a Grid: Characterization Within Block Graphs. - Liliana Alcón; Flavia Bonomo; María Pía Mazzoleni (Graphs Comb., 2017)

Characterising Chordal Contact B_0 -VPG Graphs. - Flavia Bonomo; María Pía Mazzoleni; Mariano Leonardo Rean; Bernard Ries (ISCO, 2018)

On the (k, i)-coloring of cacti and complete graphs. - Flavia Bonomo; Guillermo Durán; Ivo Koch; Mario Valencia-Pabon (Ars Comb., 2018)

Three-Coloring and List Three-Coloring of Graphs Without Induced Paths on Seven Vertices. - Flavia Bonomo; Maria Chudnovsky; Peter Maceli; Oliver Schaudt; Maya Stein; Mingxian Zhong (Comb., 2018)

On some special classes of contact B0-VPG graphs. - Flavia Bonomo; María Pía Mazzoleni; Mariano Leonardo Rean; Bernard Ries (CoRR, 2018)

On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid. - Liliana Alcón; Flavia Bonomo; Guillermo Durán; Marisa Gutierrez; María Pía Mazzoleni; Bernard Ries; Mario Valencia-Pabon (Discret. Appl. Math., 2018)

Domination parameters with number : Interrelations and algorithmic consequences. - Flavia Bonomo; Bostjan Bresar; Luciano N. Grippo; Martin Milanic; Martín Darío Safe (Discret. Appl. Math., 2018)

k-tuple colorings of the Cartesian product of graphs. - Flavia Bonomo; Ivo Koch; Pablo Daniel Torres; Mario Valencia-Pabon (Discret. Appl. Math., 2018)

Characterising circular-arc contact B0-VPG graphs. - Flavia Bonomo-Braberman; Esther Galby; Carolina Lucía Gonzalez (CoRR, 2019)

On the thinness and proper thinness of a graph. - Flavia Bonomo; Diego de Estrada (Discret. Appl. Math., 2019)

A note on homomorphisms of Kneser hypergraphs. - Flavia Bonomo-Braberman; Mitre Costa Dourado; Mario Valencia-Pabon; Juan C. Vera 001 (Appl. Math. Comput., 2020)

The generalized locally checkable problem in bounded treewidth graphs. - Flavia Bonomo-Braberman; Carolina Lucía Gonzalez (CoRR, 2020)

Fractional hypergraph isomorphism and fractional invariants. - Flavia Bonomo-Braberman; Dora Tilli (CoRR, 2020)

Preface: LAGOS 2017 - IX Latin and American Algorithms, Graphs and Optimization Symposium, C.I.R.M. - Marseille, France, 2017. - Frédérique Bassino; Flavia Bonomo-Braberman; Lionel Pournin; Mario Valencia-Pabon (Discret. Appl. Math., 2020)

On some graph classes related to perfect graphs: A survey. - Flavia Bonomo-Braberman; Guillermo Durán; Martín D. Safe; Annegret Katrin Wagler (Discret. Appl. Math., 2020)

Characterising circular-arc contact B0-VPG graphs. - Flavia Bonomo-Braberman; Esther Galby; Carolina Lucía Gonzalez (Discret. Appl. Math., 2020)

Intersection models for 2-thin and proper 2-thin graphs. - Flavia Bonomo-Braberman; Gastón Abel Brito (LAGOS, 2021)

Minimum weighted clique cover on claw-free perfect graphs. - Flavia Bonomo; Gianpaolo Oriolo; Claudia Snels (J. Graph Theory, 2021)

Better 3-coloring algorithms: Excluding a triangle and a seven vertex path. - Flavia Bonomo-Braberman; Maria Chudnovsky; Jan Goedgebeur; Peter Maceli; Oliver Schaudt; Maya Stein; Mingxian Zhong (Theor. Comput. Sci., 2021)

Towards Operations Research for all, CLAIO 2018. - Flavia Bonomo; Alejandro Cataldo; Antonio Mauttone; Erik Alex Papa Quiroz (Ann. Oper. Res., 2022)

On some special classes of contact B0-VPG graphs. - Flavia Bonomo-Braberman; María Pía Mazzoleni; Mariano Leonardo Rean; Bernard Ries (Discret. Appl. Math., 2022)

Thinness of product graphs. - Flavia Bonomo-Braberman; Carolina Lucía Gonzalez; Fabiano de Souza Oliveira; Moysés S. Sampaio Jr.; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2022)

A new approach on locally checkable problems. - Flavia Bonomo-Braberman; Carolina Lucía Gonzalez (Discret. Appl. Math., 2022)

Forbidden induced subgraph characterization of circle graphs within split graphs. - Flavia Bonomo-Braberman; Guillermo Durán; Nina Pardal; Martín D. Safe (Discret. Appl. Math., 2022)

Precedence thinness in graphs. - Flavia Bonomo-Braberman; Fabiano de S. Oliveira; Moysés S. Sampaio Jr.; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2022)

Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs. - Flavia Bonomo-Braberman; Gastón Abel Brito (Discret. Appl. Math., 2023)

Tasks People Prompt: A Taxonomy of LLM Downstream Tasks in Software Verification and Falsification Approaches. - Víctor A. Braberman; Flavia Bonomo-Braberman; Yiannis Charalambous; Juan Gabriel Colonna; Lucas C. Cordeiro; Rosiane de Freitas (CoRR, 2024)

Optimality of DSatur algorithm on chordal graphs. - N. Yekezare; M. Zohrehbandian; M. Maghasedi; Flavia Bonomo-Braberman (Oper. Res. Lett., 2024)

Thinness and its variations on some graph families and coloring graphs of bounded thinness. - Flavia Bonomo-Braberman; Eric Brandwein; Fabiano de S. Oliveira; Moysés S. Sampaio Jr.; Agustín Sansone; Jayme Luiz Szwarcfiter (RAIRO Oper. Res., 2024)

Linear-time algorithms for eliminating claws in graphs. - Flavia Bonomo-Braberman; Julliano R. Nascimento; Fabiano de S. Oliveira; Uéverton S. Souza; Jayme Luiz Szwarcfiter (Int. Trans. Oper. Res., 2024)

Solving problems on generalized convex graphs via mim-width. - Flavia Bonomo-Braberman; Nick Brettell; Andrea Munaro; Daniël Paulusma (J. Comput. Syst. Sci., 2024)

Towards a Probabilistic Framework for Analyzing and Improving LLM-Enabled Software. - Juan Manuel Baldonado; Flavia Bonomo-Braberman; Víctor A. Braberman (ICSTW, 2025)

On the thinness of trees. - Flavia Bonomo-Braberman; Eric Brandwein; Carolina Lucía Gonzalez; Agustín Sansone (Discret. Appl. Math., 2025)

Non-crossing H-graphs: a generalization of proper interval graphs admitting FPT algorithms. - Flavia Bonomo-Braberman; Nick Brettell; Andrea Munaro; Daniël Paulusma (CoRR, 2025)

Trees with proper thinness 2. - Flavia Bonomo-Braberman; Ignacio Maqueda; Nina Pardal (CoRR, 2025)