default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFlavia Bonomo-Braberman
Flavia Bonomo
Person information
- affiliation: Universidad de Buenos Aires, Argentina
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j81]Flavia Bonomo-Braberman, Julliano R. Nascimento
, Fabiano de S. Oliveira, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
Linear-time algorithms for eliminating claws in graphs. Int. Trans. Oper. Res. 31(1): 296-315 (2024)- [j80]Flavia Bonomo-Braberman, Nick Brettell, Andrea Munaro, Daniël Paulusma:
Solving problems on generalized convex graphs via mim-width. J. Comput. Syst. Sci. 140: 103493 (2024) - [j79]N. Yekezare, M. Zohrehbandian, M. Maghasedi, Flavia Bonomo-Braberman:
Optimality of DSatur algorithm on chordal graphs. Oper. Res. Lett. 57: 107185 (2024) - [j78]Flavia Bonomo-Braberman, Eric Brandwein, Fabiano de S. Oliveira, Moysés S. Sampaio Jr., Agustín Sansone, Jayme Luiz Szwarcfiter:
Thinness and its variations on some graph families and coloring graphs of bounded thinness. RAIRO Oper. Res. 58(2): 1681-1702 (2024) - [i15]Víctor A. Braberman, Flavia Bonomo-Braberman, Yiannis Charalambous, Juan Gabriel Colonna, Lucas C. Cordeiro, Rosiane de Freitas:
Tasks People Prompt: A Taxonomy of LLM Downstream Tasks in Software Verification and Falsification Approaches. CoRR abs/2404.09384 (2024) - 2023
- [j77]Flavia Bonomo-Braberman, Gastón Abel Brito:
Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs. Discret. Appl. Math. 339: 53-77 (2023) - [i14]Flavia Bonomo-Braberman, Eric Brandwein, Fabiano de S. Oliveira, Moysés S. Sampaio Jr., Agustín Sansone, Jayme Luiz Szwarcfiter:
Thinness and its variations on some graph families and coloring graphs of bounded thinness. CoRR abs/2303.06070 (2023) - 2022
- [j76]Flavia Bonomo, Alejandro Cataldo, Antonio Mauttone, Erik Alex Papa Quiroz:
Towards Operations Research for all, CLAIO 2018. Ann. Oper. Res. 316(2): 723-728 (2022) - [j75]Flavia Bonomo-Braberman, María Pía Mazzoleni, Mariano Leonardo Rean, Bernard Ries:
On some special classes of contact B0-VPG graphs. Discret. Appl. Math. 308: 111-129 (2022) - [j74]Flavia Bonomo-Braberman, Carolina Lucía Gonzalez, Fabiano de Souza Oliveira, Moysés S. Sampaio Jr., Jayme Luiz Szwarcfiter:
Thinness of product graphs. Discret. Appl. Math. 312: 52-71 (2022) - [j73]Flavia Bonomo-Braberman, Carolina Lucía Gonzalez:
A new approach on locally checkable problems. Discret. Appl. Math. 314: 53-80 (2022) - [j72]Flavia Bonomo-Braberman, Guillermo Durán, Nina Pardal, Martín D. Safe:
Forbidden induced subgraph characterization of circle graphs within split graphs. Discret. Appl. Math. 323: 43-75 (2022) - [j71]Flavia Bonomo-Braberman, Fabiano de S. Oliveira, Moysés S. Sampaio Jr., Jayme Luiz Szwarcfiter:
Precedence thinness in graphs. Discret. Appl. Math. 323: 76-95 (2022) - [c13]Flavia Bonomo-Braberman, Eric Brandwein, Carolina Lucía Gonzalez, Agustín Sansone:
On the Thinness of Trees. ISCO 2022: 189-200 - 2021
- [j70]Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels:
Minimum weighted clique cover on claw-free perfect graphs. J. Graph Theory 96(2): 231-268 (2021) - [j69]Flavia Bonomo-Braberman, Maria Chudnovsky, Jan Goedgebeur, Peter Maceli, Oliver Schaudt, Maya Stein, Mingxian Zhong:
Better 3-coloring algorithms: Excluding a triangle and a seven vertex path. Theor. Comput. Sci. 850: 98-115 (2021) - [c12]Flavia Bonomo-Braberman, Gastón Abel Brito:
Intersection models for 2-thin and proper 2-thin graphs. LAGOS 2021: 221-229 - [c11]Flavia Bonomo-Braberman, Nick Brettell, Andrea Munaro, Daniël Paulusma:
Solving Problems on Generalized Convex Graphs via Mim-Width. WADS 2021: 200-214 - [i13]Flavia Bonomo-Braberman, Gastón Abel Brito:
Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs. CoRR abs/2104.03937 (2021) - 2020
- [j68]Flavia Bonomo-Braberman, Mitre Costa Dourado, Mario Valencia-Pabon, Juan C. Vera:
A note on homomorphisms of Kneser hypergraphs. Appl. Math. Comput. 366 (2020) - [j67]Frédérique Bassino, Flavia Bonomo-Braberman, Lionel Pournin, Mario Valencia-Pabon:
Preface: LAGOS 2017 - IX Latin and American Algorithms, Graphs and Optimization Symposium, C.I.R.M. - Marseille, France, 2017. Discret. Appl. Math. 281: 1 (2020) - [j66]Flavia Bonomo-Braberman, Guillermo Durán, Martín D. Safe, Annegret Katrin Wagler:
On some graph classes related to perfect graphs: A survey. Discret. Appl. Math. 281: 42-60 (2020) - [j65]Flavia Bonomo-Braberman, Esther Galby, Carolina Lucía Gonzalez:
Characterising circular-arc contact B0-VPG graphs. Discret. Appl. Math. 283: 435-443 (2020) - [c10]Flavia Bonomo-Braberman, Julliano R. Nascimento, Fabiano de S. Oliveira, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
Linear-Time Algorithms for Eliminating Claws in Graphs. COCOON 2020: 14-26 - [i12]Flavia Bonomo-Braberman, Julliano R. Nascimento, Fabiano de S. Oliveira, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
Linear-time Algorithms for Eliminating Claws in Graphs. CoRR abs/2004.05672 (2020) - [i11]Flavia Bonomo-Braberman, Carolina Lucía Gonzalez:
The generalized locally checkable problem in bounded treewidth graphs. CoRR abs/2006.00681 (2020) - [i10]Flavia Bonomo-Braberman, Carolina Lucía Gonzalez, Fabiano de S. Oliveira, Moysés S. Sampaio Jr., Jayme Luiz Szwarcfiter:
Thinness of product graphs. CoRR abs/2006.16887 (2020) - [i9]Flavia Bonomo-Braberman, Fabiano de S. Oliveira, Moysés S. Sampaio Jr., Jayme Luiz Szwarcfiter:
Precedence thinness in graphs. CoRR abs/2006.16991 (2020) - [i8]Flavia Bonomo-Braberman, Guillermo Alfredo Durán, Nina Pardal, Martín D. Safe:
Forbidden induced subgraph characterization of circle graphs within split graphs. CoRR abs/2007.00570 (2020) - [i7]Flavia Bonomo-Braberman, Dora Tilli:
Fractional hypergraph isomorphism and fractional invariants. CoRR abs/2008.08499 (2020)
2010 – 2019
- 2019
- [j64]Flavia Bonomo, Diego de Estrada:
On the thinness and proper thinness of a graph. Discret. Appl. Math. 261: 78-92 (2019) - [i6]Flavia Bonomo-Braberman, Esther Galby, Carolina Lucía Gonzalez:
Characterising circular-arc contact B0-VPG graphs. CoRR abs/1909.06231 (2019) - 2018
- [j63]Flavia Bonomo, Guillermo Durán, Ivo Koch, Mario Valencia-Pabon:
On the (k, i)-coloring of cacti and complete graphs. Ars Comb. 137: 317-333 (2018) - [j62]Flavia Bonomo, Maria Chudnovsky, Peter Maceli, Oliver Schaudt, Maya Stein, Mingxian Zhong:
Three-Coloring and List Three-Coloring of Graphs Without Induced Paths on Seven Vertices. Comb. 38(4): 779-801 (2018) - [j61]Liliana Alcón, Flavia Bonomo, Guillermo Durán, Marisa Gutierrez, María Pía Mazzoleni, Bernard Ries, Mario Valencia-Pabon:
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid. Discret. Appl. Math. 234: 12-21 (2018) - [j60]Flavia Bonomo, Bostjan Bresar, Luciano N. Grippo, Martin Milanic, Martín Darío Safe:
Domination parameters with number : Interrelations and algorithmic consequences. Discret. Appl. Math. 235: 23-50 (2018) - [j59]Flavia Bonomo, Ivo Koch, Pablo Daniel Torres, Mario Valencia-Pabon:
k-tuple colorings of the Cartesian product of graphs. Discret. Appl. Math. 245: 177-182 (2018) - [c9]Flavia Bonomo, María Pía Mazzoleni, Mariano Leonardo Rean, Bernard Ries:
Characterising Chordal Contact B_0 -VPG Graphs. ISCO 2018: 89-100 - [i5]Flavia Bonomo, María Pía Mazzoleni, Mariano Leonardo Rean, Bernard Ries:
On some special classes of contact B0-VPG graphs. CoRR abs/1807.07372 (2018) - 2017
- [j58]Flavia Bonomo, Jaime Catalán, Guillermo Durán, Rafael Epstein, Mario Guajardo, Alexis Jawtuschenko, Javier Marenco:
An asymmetric multi-item auction with quantity discounts applied to Internet service procurement in Buenos Aires public schools. Ann. Oper. Res. 258(2): 569-585 (2017) - [j57]Flavia Bonomo, María Pía Mazzoleni, Maya Stein:
Clique coloring B1-EPG graphs. Discret. Math. 340(5): 1008-1011 (2017) - [j56]Frédérique Bassino, Flavia Bonomo, Lionel Pournin, Mario Valencia-Pabon, Juan C. Vera:
LAGOS 2017 - IX Latin and American Algorithms, Graphs, and Optimization Symposium. Electron. Notes Discret. Math. 62: 1-2 (2017) - [j55]Liliana Alcón, Flavia Bonomo, María Pía Mazzoleni:
Vertex Intersection Graphs of Paths on a Grid: Characterization Within Block Graphs. Graphs Comb. 33(4): 653-664 (2017) - [i4]Flavia Bonomo, Diego de Estrada:
On the thinness and proper thinness of a graph. CoRR abs/1704.00379 (2017) - 2016
- [j54]Flavia Bonomo, Luciano N. Grippo, Martin Milanic, Martín Darío Safe:
Graph classes with and without powers of bounded clique-width. Discret. Appl. Math. 199: 3-15 (2016) - 2015
- [j53]Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon:
b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs. Algorithmica 73(2): 289-305 (2015) - [j52]Flavia Bonomo, Guillermo Durán, Martín Darío Safe, Annegret Katrin Wagler:
Clique-perfectness of complements of line graphs. Discret. Appl. Math. 186: 19-44 (2015) - [j51]Flavia Bonomo, Celina Miraglia Herrera de Figueiredo, Guillermo Alfredo Durán, Luciano Norberto Grippo, Martín Darío Safe, Jayme Luiz Szwarcfiter:
On probe co-bipartite and probe diamond-free graphs. Discret. Math. Theor. Comput. Sci. 17(1): 187-200 (2015) - [j50]Flavia Bonomo, Ivo Koch, Pablo Daniel Torres, Mario Valencia-Pabon:
k-tuple chromatic number of the cartesian product of graphs. Electron. Notes Discret. Math. 50: 243-248 (2015) - [j49]Liliana Alcón, Flavia Bonomo, Guillermo Durán, Marisa Gutierrez, María Pía Mazzoleni, Bernard Ries, Mario Valencia-Pabon:
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid. Electron. Notes Discret. Math. 50: 249-254 (2015) - [j48]Flavia Bonomo, Guillermo Durán, Amedeo Napoli, Mario Valencia-Pabon:
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. 115(6-8): 600-603 (2015) - [j47]Flavia Bonomo, Guillermo Durán, Mario Valencia-Pabon:
Complexity of the cluster deletion problem on subclasses of chordal graphs. Theor. Comput. Sci. 600: 59-69 (2015) - 2014
- [j46]Flavia Bonomo, Thomas M. Liebling, Javier Marenco, Jayme Luiz Szwarcfiter, Mario Valencia-Pabon:
LAGOS'11: Sixth Latin American Algorithms, Graphs, and Optimization Symposium, Bariloche, Argentina - 2011. Discret. Appl. Math. 164: 357-359 (2014) - [j45]Flavia Bonomo, Jayme Luiz Szwarcfiter:
Characterization of classical graph classes by weighted clique graphs. Discret. Appl. Math. 165: 83-95 (2014) - [j44]Flavia Bonomo, Guillermo Durán, Martín Darío Safe, Annegret Katrin Wagler:
Balancedness of subclasses of circular-arc graphs. Discret. Math. Theor. Comput. Sci. 16(3): 1-22 (2014) - [j43]Flavia Bonomo, Mario Valencia-Pabon:
On the Minimum Sum Coloring of P 4-Sparse Graphs. Graphs Comb. 30(2): 303-314 (2014) - [j42]Flavia Bonomo, Guillermo Durán, Martín Darío Safe, Annegret Katrin Wagler:
Clique-perfectness and balancedness of some graph classes. Int. J. Comput. Math. 91(10): 2118-2141 (2014) - [j41]Flavia Bonomo, Guillermo Durán, Javier Marenco:
Mathematical programming as a tool for virtual soccer coaches: a case study of a fantasy sport game. Int. Trans. Oper. Res. 21(3): 399-414 (2014) - [c8]Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon:
b-Coloring is NP-Hard on Co-Bipartite Graphs and Polytime Solvable on Tree-Cographs. ISCO 2014: 100-111 - [i3]Flavia Bonomo, Luciano N. Grippo, Martin Milanic, Martín Darío Safe:
Graphs of Power-Bounded Clique-Width. CoRR abs/1402.2135 (2014) - [i2]Flavia Bonomo, Oliver Schaudt, Maya Jakobine Stein:
3-Colouring graphs without triangles or induced paths on seven vertices. CoRR abs/1410.0040 (2014) - 2013
- [j40]Flavia Bonomo, Guillermo Durán, Martín Darío Safe, Annegret Katrin Wagler:
On minimal forbidden subgraph characterizations of balanced graphs. Discret. Appl. Math. 161(13-14): 1925-1942 (2013) - [j39]Flavia Bonomo, Mitre Costa Dourado, Guillermo Durán, Luérbio Faria, Luciano N. Grippo, Martín Darío Safe:
Forbidden subgraphs and the König-Egerváry property. Discret. Appl. Math. 161(16-17): 2380-2388 (2013) - [j38]Flavia Bonomo, Denis Cornaz, Tínaz Ekim, Bernard Ries:
Perfectness of clustered graphs. Discret. Optim. 10(4): 296-303 (2013) - [j37]Flavia Bonomo, Guillermo Durán, Luciano N. Grippo, Martín Darío Safe:
Probe interval graphs and probe unit interval graphs on superclasses of cographs. Discret. Math. Theor. Comput. Sci. 15(2): 177-194 (2013) - [j36]Flavia Bonomo, Diego Delle Donne, Guillermo Durán, Javier Marenco:
Automatic Dwelling Segmentation of the Buenos Aires Province for the 2010 Argentinian Census. Interfaces 43(4): 373-384 (2013) - [j35]Flavia Bonomo, Monia Giandomenico, Fabrizio Rossi:
A note on the Cornaz-Jost transformation to solve the graph coloring problem. Inf. Process. Lett. 113(18): 649-652 (2013) - [c7]Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels, Gautier Stauffer:
Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property. IPCO 2013: 86-97 - [i1]Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon:
b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs. CoRR abs/1310.8313 (2013) - 2012
- [j34]Flavia Bonomo, Javier Marenco, Daniela Sabán, Nicolás E. Stier Moses:
A polyhedral study of the maximum edge subgraph problem. Discret. Appl. Math. 160(18): 2573-2590 (2012) - [j33]Flavia Bonomo, Yuri Faenza, Gianpaolo Oriolo:
On coloring problems with local constraints. Discret. Math. 312(12-13): 2027-2039 (2012) - [j32]Flavia Bonomo, Andrés Cardemil, Guillermo Durán, Javier Marenco, Daniela Sabán:
An Application of the Traveling Tournament Problem: The Argentine Volleyball League. Interfaces 42(3): 245-259 (2012) - [c6]Flavia Bonomo, Monia Giandomenico, Fabrizio Rossi:
On the Cornaz-Jost Transformation to Solve the Graph Coloring Problem. CTW 2012: 26-29 - [c5]Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels:
Minimum Weighted Clique Cover on Strip-Composed Perfect Graphs. WG 2012: 22-33 - 2011
- [j31]Flavia Bonomo, Mariano Cecowski Palacio:
Between coloring and list-coloring: μ-coloring. Ars Comb. 99: 383-398 (2011) - [j30]Clara Inés Betancur Velasquez, Flavia Bonomo, Ivo Koch:
On the b-coloring of P4-tidy graphs. Discret. Appl. Math. 159(1): 60-68 (2011) - [j29]Flavia Bonomo, Guillermo Durán, Javier Marenco, Mario Valencia-Pabon:
Minimum sum set coloring of trees and line graphs of trees. Discret. Appl. Math. 159(5): 288-294 (2011) - [j28]Flavia Bonomo, Guillermo Durán, Luciano N. Grippo, Martín Darío Safe:
Partial characterizations of circle graphs. Discret. Appl. Math. 159(16): 1699-1706 (2011) - [j27]Flavia Bonomo, Thomas M. Liebling, Javier Marenco, Jayme Luiz Szwarcfiter, Mario Valencia-Pabon:
LAGOS 2011 - VI Latin-American Algorithms, Graphs, and Optimization Symposium. Electron. Notes Discret. Math. 37: 1-2 (2011) - [j26]Flavia Bonomo, Guillermo Durán, Martín Darío Safe, Annegret Katrin Wagler:
Clique-perfectness of complements of line graphs. Electron. Notes Discret. Math. 37: 327-332 (2011) - [j25]Flavia Bonomo, Márcia R. Cerioli:
On the L(2, 1)-labelling of block graphs. Int. J. Comput. Math. 88(3): 468-475 (2011) - [j24]Flavia Bonomo, Sara Mattia, Gianpaolo Oriolo:
Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem. Theor. Comput. Sci. 412(45): 6261-6268 (2011) - [c4]Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels:
A primal algorithm for the minimum weight clique cover problem on a class of claw-free perfect graphs. CTW 2011: 80-83 - [c3]Flavia Bonomo, Jayme Luiz Szwarcfiter:
Characterization of classical graph classes by weighted clique graphs. CTW 2011: 84-87 - 2010
- [j23]Flavia Bonomo, Guillermo Durán, Martín Darío Safe, Annegret Katrin Wagler:
Balancedness of some subclasses of circular-arc graphs. Electron. Notes Discret. Math. 36: 1121-1128 (2010)
2000 – 2009
- 2009
- [j22]Flavia Bonomo, Guillermo Durán, Javier Marenco:
Exploring the complexity boundary between coloring and list-coloring. Ann. Oper. Res. 169(1): 3-16 (2009) - [j21]Flavia Bonomo, Guillermo Durán, Francisco J. Soulignac, Gabriel Sueiro:
Partial characterizations of clique-perfect and coordinated graphs: Superclasses of triangle-free graphs. Discret. Appl. Math. 157(17): 3511-3518 (2009) - [j20]Flavia Bonomo, Maria Chudnovsky, Guillermo Durán:
Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs. Discret. Math. 309(11): 3485-3499 (2009) - [j19]Flavia Bonomo, Guillermo Durán, Martín Darío Safe, Annegret Katrin Wagler:
On minimal forbidden subgraph characterizations of balanced graphs. Electron. Notes Discret. Math. 35: 41-46 (2009) - [j18]Flavia Bonomo, Javier Marenco, Daniela Sabán, Nicolás Stier Moses:
A polyhedral study of the maximum edge subgraph problem. Electron. Notes Discret. Math. 35: 197-202 (2009) - [j17]Flavia Bonomo, Yuri Faenza, Gianpaolo Oriolo:
On coloring problems with local constraints. Electron. Notes Discret. Math. 35: 215-220 (2009) - [j16]Flavia Bonomo, Mario Valencia-Pabon:
Minimum Sum Coloring of P4-sparse graphs. Electron. Notes Discret. Math. 35: 293-298 (2009) - [j15]Flavia Bonomo, Guillermo Durán, Frédéric Maffray, Javier Marenco, Mario Valencia-Pabon:
On the b-Coloring of Cographs and P4-Sparse Graphs. Graphs Comb. 25(2): 153-167 (2009) - [j14]Flavia Bonomo, Guillermo Durán, Luciano N. Grippo, Martín Darío Safe:
Partial characterizations of circular-arc graphs. J. Graph Theory 61(4): 289-306 (2009) - [j13]Flavia Bonomo, Guillermo Durán, Francisco J. Soulignac, Gabriel Sueiro:
Partial characterizations of coordinated graphs: line graphs and complements of forests. Math. Methods Oper. Res. 69(2): 251-270 (2009) - [c2]Flavia Bonomo, Guillermo Durán, Javier Marenco, Mario Valencia-Pabon:
Minimum Sum Set Coloring on some Subclasses of Block Graphs. CTW 2009: 195-198 - [c1]Flavia Bonomo, Guillermo Durán, Luciano N. Grippo, Martín Darío Safe:
Partial Characterizations of Circle Graphs. CTW 2009: 281-284 - 2008
- [j12]Flavia Bonomo, Maria Chudnovsky, Guillermo Durán:
Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs. Discret. Appl. Math. 156(7): 1058-1082 (2008) - [j11]Flavia Bonomo, Guillermo Durán, Luciano N. Grippo, Martín Darío Safe:
Partial Characterizations of Circular-Arc Graphs. Electron. Notes Discret. Math. 30: 45-50 (2008) - [j10]Flavia Bonomo, Guillermo Durán, Francisco J. Soulignac, Gabriel Sueiro:
Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs. Electron. Notes Discret. Math. 30: 51-56 (2008) - 2006
- [j9]Flavia Bonomo, Guillermo Durán, Marina Groshaus, Jayme Luiz Szwarcfiter:
On clique-perfect and K-perfect graphs. Ars Comb. 80 (2006) - [j8]Pablo Burzyn, Flavia Bonomo, Guillermo Durán:
NP-completeness results for edge modification problems. Discret. Appl. Math. 154(13): 1824-1844 (2006) - [j7]Flavia Bonomo:
Self-clique Helly circular-arc graphs. Discret. Math. 306(6): 595-597 (2006) - [j6]Flavia Bonomo, Guillermo Durán, Javier Marenco:
Exploring the complexity boundary between coloring and list-coloring. Electron. Notes Discret. Math. 25: 41-47 (2006) - [j5]Flavia Bonomo, Guillermo Durán, Min Chih Lin, Jayme Luiz Szwarcfiter:
On Balanced Graphs. Math. Program. 105(2-3): 233-250 (2006) - 2005
- [j4]Flavia Bonomo, Maria Chudnovsky, Guillermo Durán:
Partial characterizations of clique-perfect graphs. Electron. Notes Discret. Math. 19: 95-101 (2005) - [j3]Flavia Bonomo, Mariano Cecowski Palacio:
Between coloring and list-coloring: mu-coloring. Electron. Notes Discret. Math. 19: 117-123 (2005) - [j2]Flavia Bonomo, Guillermo Durán:
Characterization and recognition of Helly circular-arc clique-perfect graphs. Electron. Notes Discret. Math. 22: 147-150 (2005) - 2004
- [j1]Pablo Burzyn, Flavia Bonomo, Guillermo Durán:
Computational complexity of edge modification problems in different classes of graphs. Electron. Notes Discret. Math. 18: 41-46 (2004)
Coauthor Index
Guillermo Durán
aka: Guillermo Alfredo Durán
aka: Guillermo Alfredo Durán
Luciano N. Grippo
aka: Luciano Norberto Grippo
aka: Luciano Norberto Grippo
Fabiano de S. Oliveira
aka: Fabiano de Souza Oliveira
aka: Fabiano de Souza Oliveira
Martín Darío Safe
aka: Martín D. Safe
aka: Martín D. Safe
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:55 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
