Flavia Bonomo-Braberman

According to our database1, Flavia Bonomo-Braberman authored at least 76 papers between 2004 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Characterising circular-arc contact B0-VPG graphs.
Discret. Appl. Math., 2020

On some graph classes related to perfect graphs: A survey.
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

Fractional hypergraph isomorphism and fractional invariants.
CoRR, 2020

Forbidden induced subgraph characterization of circle graphs within split graphs.
CoRR, 2020

Precedence thinness in graphs.
CoRR, 2020

Thinness of product graphs.
CoRR, 2020

The generalized locally checkable problem in bounded treewidth graphs.
CoRR, 2020

A note on homomorphisms of Kneser hypergraphs.
Appl. Math. Comput., 2020

Linear-Time Algorithms for Eliminating Claws in Graphs.
Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

2019
On the thinness and proper thinness of a graph.
Discret. Appl. Math., 2019

Characterising circular-arc contact B<sub>0</sub>-VPG graphs.
CoRR, 2019

2018
k-tuple colorings of the Cartesian product of graphs.
Discret. Appl. Math., 2018

Domination parameters with number : Interrelations and algorithmic consequences.
Discret. Appl. Math., 2018

On some special classes of contact B<sup>0</sup>-VPG graphs.
CoRR, 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

Characterising Chordal Contact B_0 -VPG Graphs.
Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

2017
Vertex Intersection Graphs of Paths on a Grid: Characterization Within Block Graphs.
Graphs Comb., 2017

LAGOS 2017 - IX Latin and American Algorithms, Graphs, and Optimization Symposium.
Electron. Notes Discret. Math., 2017

Clique coloring B<sub>1</sub>-EPG graphs.
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
Graph classes with and without powers of bounded clique-width.
Discret. Appl. Math., 2016

2015
Complexity of the cluster deletion problem on subclasses of chordal graphs.
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

k-tuple chromatic number of the cartesian product of graphs.
Electron. Notes Discret. Math., 2015

On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid.
Electron. Notes Discret. Math., 2015

On probe co-bipartite and probe diamond-free graphs.
Discret. Math. Theor. Comput. Sci., 2015

b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs.
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

Clique-perfectness and balancedness of some graph classes.
Int. J. Comput. Math., 2014

On the Minimum Sum Coloring of P 4-Sparse Graphs.
Graphs Comb., 2014

Balancedness of subclasses of circular-arc graphs.
Discret. Math. Theor. Comput. Sci., 2014

Characterization of classical graph classes by weighted clique graphs.
Discret. Appl. Math., 2014

LAGOS'11: Sixth Latin American Algorithms, Graphs, and Optimization Symposium, Bariloche, Argentina - 2011.
Discret. Appl. Math., 2014

3-Colouring graphs without triangles or induced paths on seven vertices.
CoRR, 2014

Graphs of Power-Bounded Clique-Width.
CoRR, 2014

2013
A note on the Cornaz-Jost transformation to solve the graph coloring problem.
Inf. Process. Lett., 2013

Automatic Dwelling Segmentation of the Buenos Aires Province for the 2010 Argentinian Census.
Interfaces, 2013

Probe interval graphs and probe unit interval graphs on superclasses of cographs.
Discret. Math. Theor. Comput. Sci., 2013

Perfectness of clustered graphs.
Discret. Optim., 2013

Forbidden subgraphs and the König-Egerváry property.
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
An Application of the Traveling Tournament Problem: The Argentine Volleyball League.
Interfaces, 2012

Minimum Weighted Clique Cover on Strip-Composed Perfect Graphs.
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

On the <i>L</i>(2, 1)-labelling of block graphs.
Int. J. Comput. Math., 2011

LAGOS 2011 - VI Latin-American Algorithms, Graphs, and Optimization Symposium.
Electron. Notes Discret. Math., 2011

Clique-perfectness of complements of line graphs.
Electron. Notes Discret. Math., 2011

On the b-coloring of P<sub>4</sub>-tidy graphs.
Discret. Appl. Math., 2011

Minimum sum set coloring of trees and line graphs of trees.
Discret. Appl. Math., 2011

Partial characterizations of circle graphs.
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
Balancedness of some subclasses of circular-arc graphs.
Electron. Notes Discret. Math., 2010

2009
Partial characterizations of coordinated graphs: line graphs and complements of forests.
Math. Methods Oper. Res., 2009

On the b-Coloring of Cographs and <i>P</i><sub>4</sub>-Sparse Graphs.
Graphs Comb., 2009

Minimum Sum Coloring of P<sub>4</sub>-sparse graphs.
Electron. Notes Discret. Math., 2009

A polyhedral study of the maximum edge subgraph problem.
Electron. Notes Discret. Math., 2009

On coloring problems with local constraints.
Electron. Notes Discret. Math., 2009

On minimal forbidden subgraph characterizations of balanced graphs.
Electron. Notes Discret. Math., 2009

Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs.
Discret. Math., 2009

Minimum Sum Set Coloring on some Subclasses of Block Graphs.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008
Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs.
Electron. Notes Discret. Math., 2008

Partial Characterizations of Circular-Arc Graphs.
Electron. Notes Discret. Math., 2008

Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs.
Discret. Appl. Math., 2008

2006
On Balanced Graphs.
Math. Program., 2006

Exploring the complexity boundary between coloring and list-coloring.
Electron. Notes Discret. Math., 2006

Self-clique Helly circular-arc graphs.
Discret. Math., 2006

NP-completeness results for edge modification problems.
Discret. Appl. Math., 2006

On clique-perfect and K-perfect graphs.
Ars Comb., 2006

2005
Characterization and recognition of Helly circular-arc clique-perfect graphs.
Electron. Notes Discret. Math., 2005

Partial characterizations of clique-perfect graphs.
Electron. Notes Discret. Math., 2005

Between coloring and list-coloring: mu-coloring.
Electron. Notes Discret. Math., 2005

2004
Computational complexity of edge modification problems in different classes of graphs.
Electron. Notes Discret. Math., 2004


  Loading...