Artículos y Publicaciones

• NP-completeness results for edge modification problems

  2006, Discrete Applied Mathematics 154 (13), 1824-1844, 2006
  Citas: 99

  Ver detalle

• Three-coloring and list three-coloring of graphs without induced paths on seven vertices

  2018, Combinatorica 38 (4), 779-801, 2018
  Citas: 95

  Ver detalle

• A method for optimizing waste collection using mathematical programming: a Buenos Aires case study

  2012, Waste Management & Research 30 (3), 311-324, 2012
  Citas: 82

  Ver detalle

• On the b-Coloring of Cographs and P4-Sparse Graphs

  2009, Graphs and Combinatorics 25 (2), 153-167, 2009
  Citas: 82

  Ver detalle

• Exploring the complexity boundary between coloring and list-coloring

  2009, Annals of Operations Research 169 (1), 3-16, 2009
  Citas: 56

  Ver detalle

• Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem

  2011, Theoretical Computer Science 412 (45), 6261-6268, 2011
  Citas: 55

  Ver detalle

• An application of the traveling tournament problem: The Argentine volleyball league

  2012, Interfaces 42 (3), 245-259, 2012
  Citas: 49

  Ver detalle

• On balanced graphs

  2006, Mathematical programming 105, 233-250, 2006
  Citas: 45

  Ver detalle

• A framework for scheduling professional sports leagues

  2010, AIP Conference Proceedings 1285 (1), 14-28, 2010
  Citas: 34

  Ver detalle

• Analysis and models of bilateral investment treaties using a social networks approach

  2010, Physica A: Statistical Mechanics and its Applications 389 (17), 3661-3673, 2010
  Citas: 33

  Ver detalle

• A framework for a highly constrained sports scheduling problem

  2010, Proceedings of the international MultiConference of Engineers and Computer …, 2010
  Citas: 33

  Ver detalle

• On clique-perfect and K-perfect graphs

  2006, Ars combinatoria 80, 97-112, 2006
  Citas: 33

  Ver detalle

• Partial characterizations of clique-perfect graphs I: subclasses of claw-free graphs

  2008, Discrete Applied Mathematics 156 (7), 1058-1082, 2008
  Citas: 31

  Ver detalle

• On the b-coloring of P4-tidy graphs

  2011, Discrete Applied Mathematics 159 (1), 60-68, 2011
  Citas: 30

  Ver detalle

• Mathematical programming as a tool for virtual soccer coaches: a case study of a fantasy sport game

  2014, International Transactions in Operational Research 21 (3), 399-414, 2014
  Citas: 29

  Ver detalle

• Partial characterizations of circular‐arc graphs

  2009, Journal of Graph Theory 61 (4), 289-306, 2009
  Citas: 27

  Ver detalle

• Between coloring and list-coloring: μ-coloring

  2005, Electronic Notes in Discrete Mathematics, 117-123, 2005
  Citas: 25

  Ver detalle

• On the thinness and proper thinness of a graph

  2019, Discrete Applied Mathematics 261, 78-92, 2019
  Citas: 24

  Ver detalle

• Domination parameters with number 2: interrelations and algorithmic consequences

  2018, Discrete Applied Mathematics 235, 23-50, 2018
  Citas: 24

  Ver detalle

• Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs

  2009, Discrete Mathematics 309 (11), 3485-3499, 2009
  Citas: 24

  Ver detalle

• Scale-invariant transition probabilities in free word association trajectories

  2009, Frontiers in integrative neuroscience 3, 716, 2009
  Citas: 20

  Ver detalle

• Graph classes with and without powers of bounded clique-width

  2016, Discrete Applied Mathematics 199, 3-15, 2016
  Citas: 19

  Ver detalle

• Coordinated graphs and clique graphs of clique-Helly perfect graphs

  2007, Utilitas Mathematica 72, 175-192, 2007
  Citas: 19

  Ver detalle

• Self-clique Helly circular-arc graphs

  2006, Discrete Mathematics 306 (6), 595-597, 2006
  Citas: 18

  Ver detalle

• Minimum sum coloring of P4-sparse graphs

  2009, Electronic Notes in Discrete Mathematics 35, 293-298, 2009
  Citas: 17

  Ver detalle

• On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid

  2018, Discrete applied mathematics 234, 12-21, 2018
  Citas: 16

  Ver detalle

• A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to P4-sparse graphs

  2015, Information Processing Letters 115 (6-8), 600-603, 2015
  Citas: 16

  Ver detalle

• Forbidden subgraphs and the König–Egerváry property

  2013, Discrete Applied Mathematics 161 (16-17), 2380-2388, 2013
  Citas: 15

  Ver detalle

• Complexity of the cluster deletion problem on subclasses of chordal graphs

  2015, Theoretical Computer Science 600, 59-69, 2015
  Citas: 14

  Ver detalle

• On the Minimum Sum Coloring of P 4-Sparse Graphs

  2014, Graphs and Combinatorics 30, 303-314, 2014
  Citas: 14

  Ver detalle

• Clique coloring B1-EPG graphs

  2017, Discrete Mathematics 340 (5), 1008-1011, 2017
  Citas: 13

  Ver detalle

• Partial characterizations of clique-perfect and coordinated graphs: Superclasses of triangle-free graphs

  2009, Discrete applied mathematics 157 (17), 3511-3518, 2009
  Citas: 13

  Ver detalle

• Clique-perfectness of complements of line graphs

  2015, Discrete Applied Mathematics 186, 19-44, 2015
  Citas: 12

  Ver detalle

• Partial characterizations of circle graphs

  2011, Discrete applied mathematics 159 (16), 1699-1706, 2011
  Citas: 12

  Ver detalle

• Vertex intersection graphs of paths on a grid: characterization within block graphs

  2017, Graphs and Combinatorics 33 (4), 653-664, 2017
  Citas: 11

  Ver detalle

• Optimización de la Recolección de Residuos en la Zona Sur de la Ciudad de Buenos Aires

  2009, Revista Ingenierıa de Sistemas 23, 2009
  Citas: 11

  Ver detalle

• On coloring problems with local constraints

  2012, Discrete Mathematics 312 (12-13), 2027-2039, 2012
  Citas: 10

  Ver detalle

• Eratosthenes 2009/2010: An old experiment in modern times

  2011, Astronomy Education Review 10 (1), 010201, 2011
  Citas: 10

  Ver detalle

• On the L (2, 1)-labelling of block graphs

  2011, International Journal of Computer Mathematics 88 (3), 468-475, 2011
  Citas: 10

  Ver detalle

• Exploring the complexity boundary between coloring and list-coloring

  2006, Electronic Notes in Discrete Mathematics 25, 41-47, 2006
  Citas: 10

  Ver detalle

• 3-Colouring graphs without triangles or induced paths on seven vertices

  2014, arXiv preprint arXiv:1410.0040, 2014
  Citas: 8

  Ver detalle

• Perfectness of clustered graphs

  2013, Discrete Optimization 10 (4), 296-303, 2013
  Citas: 8

  Ver detalle

• On minimal forbidden subgraph characterizations of balanced graphs

  2009, Electronic Notes in Discrete Mathematics 35, 41-46, 2009
  Citas: 8

  Ver detalle

• Partial characterizations of coordinated graphs: line graphs and complements of forests

  2009, Mathematical Methods of Operations Research 69 (2), 251-270, 2009
  Citas: 8

  Ver detalle

• Partial characterizations of clique-perfect graphs.

  2005, Electron. Notes Discret. Math. 19, 95-101, 2005
  Citas: 8

  Ver detalle

• On subclasses and variations of perfect graphs

  2005, Departamento de Computación, FCEyN, Universidad de Buenos Aires, Buenos …, 2005
  Citas: 8

  Ver detalle

• Minimum weighted clique cover on strip-composed perfect graphs

  2012, International Workshop on Graph-Theoretic Concepts in Computer Science, 22-33, 2012
  Citas: 7

  Ver detalle

• On the (k, i)-coloring of cacti and complete graphs

  2018, Charles Babbage Institute, 2018
  Citas: 6

  Ver detalle

• A note on the Cornaz–Jost transformation to solve the graph coloring problem

  2013, Information Processing Letters 113 (18), 649-652, 2013
  Citas: 6

  Ver detalle

• A polyhedral study of the maximum edge subgraph problem

  2012, Discrete Applied Mathematics 160 (18), 2573-2590, 2012
  Citas: 6

  Ver detalle

• Minimum sum set coloring of trees and line graphs of trees

  2011, Discrete Applied Mathematics 159 (5), 288-294, 2011
  Citas: 6

  Ver detalle

• On the b-coloring of P4-tidy graphs

  2010, Manuscript, 2010
  Citas: 6

  Ver detalle

• -Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs

  2015, Algorithmica 73, 289-305, 2015
  Citas: 5

  Ver detalle

• Balancedness of some subclasses of circular-arc graphs

  2010, Electronic Notes in Discrete Mathematics 36, 1121-1128, 2010
  Citas: 5

  Ver detalle

• Optimización de la Recolección de Residuos en la Zona Sur de la Ciudad de Buenos Aires

  2009, Tesis de Grado. Universidad de Buenos Aires. Buenos Aires, Argentina, 2009
  Citas: 5

  Ver detalle

• An asymmetric multi-item auction with quantity discounts applied to Internet service procurement in Buenos Aires public schools

  2017, Annals of Operations Research 258, 569-585, 2017
  Citas: 4

  Ver detalle

• Characterization of classical graph classes by weighted clique graphs

  2014, Discrete Applied Mathematics 165, 83-95, 2014
  Citas: 4

  Ver detalle

• Computational complexity of classical problems for hereditary clique-helly graphs

  2004, Pesquisa operacional 24, 435-443, 2004
  Citas: 4

  Ver detalle

• Balancedness of subclasses of circular-arc graphs

  2014, Discrete Mathematics & Theoretical Computer Science 16 (Graph Theory), 2014
  Citas: 3

  Ver detalle

• Characterization and recognition of Helly circular-arc clique-perfect graphs

  2005, Electronic Notes in Discrete Mathematics 22, 147-150, 2005
  Citas: 3

  Ver detalle

• On some special classes of contact B0-VPG graphs

  2022, Discrete Applied Mathematics 308, 111-129, 2022
  Citas: 2

  Ver detalle

• k-tuple colorings of the Cartesian product of graphs

  2018, Discrete Applied Mathematics 245, 177-182, 2018
  Citas: 2

  Ver detalle

• Characterising Chordal Contact-VPG Graphs

  2018, International Symposium on Combinatorial Optimization, 89-100, 2018
  Citas: 2

  Ver detalle

• Three-colouring graphs without induced paths on seven vertices I: the triangle-free case

  2015, Manuscript, 2015
  Citas: 2

  Ver detalle

• Clique-perfectness and balancedness of some graph classes

  2014, International Journal of Computer Mathematics 91 (10), 2118-2141, 2014
  Citas: 2

  Ver detalle

• Probe interval graphs and probe unit interval graphs on superclasses of cographs

  2013, Discrete Mathematics & Theoretical Computer Science 15 (Graph Theory), 2013
  Citas: 2

  Ver detalle

• Automatic dwelling segmentation of the Buenos Aires Province for the 2010 Argentinian census

  2013, Interfaces 43 (4), 373-384, 2013
  Citas: 2

  Ver detalle

• Minimum clique cover in claw-free perfect graphs and the weak Edmonds-Johnson property

  2013, Integer Programming and Combinatorial Optimization: 16th International …, 2013
  Citas: 2

  Ver detalle

• Sistema de Información Geográfica como apoyo a las actividades del Censo Nacional de Población, Hogares y Viviendas 2010 de la provincia de Buenos Aires

  2011, V Jornadas de Vinculación Universidad-Industria (JUI 2011)(XL JAIIO, Córdoba …, 2011
  Citas: 2

  Ver detalle

• Computational complexity of edge modification problems in different classes of graphs

  2004, Electronic Notes in Discrete Mathematics 18, 41-46, 2004
  Citas: 2

  Ver detalle

• Graphs of power-bounded clique-width

  2014, arXiv preprint arXiv:1402.2135, 2014
  Citas: 1

  Ver detalle

• Programación Matemática para asesorar a un entrenador de fútbol: un juego de fantasía como caso de estudio

  2013, Universidad de Chile, 2013
  Citas: 1

  Ver detalle

• Segmentación automática de la Provincia de Buenos Aires para el Censo Nacional Argentino 2010

  2011, Revista Ingenierıa de Sistemas Volumen XXV, 2011
  Citas: 1

  Ver detalle

• On weighted clique graphs

  2011, X Simposio de Investigación Operativa (SIO 2011)(XL JAIIO, Córdoba, 29 de …, 2011
  Citas: 1

  Ver detalle

• Scheduling the Argentine volleyball league: A real-world application of the Traveling Tournament Problem with couples of teams

  2010, Submitted to Interfaces, 2010
  Citas: 1

  Ver detalle

• Minimum Sum Set Coloring on some Subclasses of Block Graphs.

  2009, CTW, 195-198, 2009
  Citas: 1

  Ver detalle

• Partial characterizations of circular-arc graphs

  2008, Electronic Notes in Discrete Mathematics 30, 45-50, 2008
  Citas: 1

  Ver detalle

• Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs

  2023, Elsevier Science, 2023
  Citas: 0

• Towards Operations Research for all, CLAIO 2018

  2022, Annals of Operations Research 316 (2), 723-728, 2022
  Citas: 0

• Precedence thinness in graphs

  2022, Elsevier Science, 2022
  Citas: 0

• Thinness of product graphs

  2022, Elsevier Science, 2022
  Citas: 0

• A new approach on locally checkable problems

  2022, Elsevier Science, 2022
  Citas: 0

• Minimum weighted clique cover on claw‐free perfect graphs

  2021, Journal of Graph Theory 96 (2), 231-268, 2021
  Citas: 0

• Forbidden induced subgraph characterization of circle graphs within split graphs

  2021, Elsevier Science, 2021
  Citas: 0

• On PVPG graphs: a subclass of vertex intersection graphs of paths on a grid

  2021, Sociedade Brasileira de Matemática, 2021
  Citas: 0

• Characterising circular-arc contact B0–VPG graphs

  2020, Elsevier Science, 2020
  Citas: 0

• Reconhecimento de Grafos Fino de Precedência

  2019, Anais do IV Encontro de Teoria da Computação, 2019
  Citas: 0

• LAGOS 2017–IX Latin and American Algorithms, Graphs, and Optimization Symposium

  2017, Electronic Notes in Discrete Mathematics 62, 1-2, 2017
  Citas: 0

• B1-EPG graphs are 4-clique colorable

  2017, VI Congreso de Matemática Aplicada, Computacional e Industrial (MACI …, 2017
  Citas: 0

• k-tuple chromatic number of the cartesian product of graphs

  2015, Electronic Notes in Discrete Mathematics 50, 243-248, 2015
  Citas: 0

• On probe 2-clique graphs and probe diamond-free graphs

  2015, Discrete Mathematics & Theoretical Computer Science 17 (Graph Theory), 2015
  Citas: 0

• A one-to-one correspondence between potential solutions ofthe cluster deletion problem and the minimum sum coloring problem, and its application to P4-sparse graphs

  2015, Elsevier, 2015
  Citas: 0

• On probe co-bipartite and probe diamond-free graphs

  2015, Discrete Mathematics and Theoretical Computer Science 17 (1), 187, 2015
  Citas: 0

• Automatic Dwelling Segmentation of the Buenos Aires Province for the 2010 Argentinian Census

  2014, Quality control and applied statistics 59 (1), 59-60, 2014
  Citas: 0

• LAGOS’11: Sixth Latin American Algorithms, Graphs, and Optimization Symposium, Bariloche, Argentina—2011

  2014, Discrete Applied Mathematics 164, 357-359, 2014
  Citas: 0

• Una licitación combinatorial aplicada a la provisión de Internet a las escuelas de Buenos Aires

  2013, Universidad de Chile, 2013
  Citas: 0

• On the Cornaz-Jost Transformation to Solve the Graph Coloring Problem.

  2012, CTW, 26-29, 2012
  Citas: 0

• A primal algorithm for the minimum weight clique cover problem on a class of claw-free perfect graphs.

  2011, CTW, 80-83, 2011
  Citas: 0

• LAGOS 2011–VI Latin-American Algorithms, Graphs, and Optimization Symposium

  2011, Electronic Notes in Discrete Mathematics, 1-2, 2011
  Citas: 0

• Decision, Risk, and Operations Working Papers Series

  2010,
  Citas: 0

• Sobre subclases y variantes de los grafos perfectos

  2005, Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales, 2005
  Citas: 0

• Eghawail, AM, 260

  ,
  Citas: 0

• Formulario para la presentación de Cursos de Posgrado/Doctorado–Res. CD2819/18-ANEXO

  ,
  Citas: 0

• Complexity of the cluster deletion problem on subclasses of chordal graphs and cographs

  ,
  Citas: 0

• Optimización de la recolección de residuos en San Carlos de Bariloche

  ,
  Citas: 0

• Clique coloración de los grafos B1-EPG

  , umaUNION, 163, 0
  Citas: 0

• On the Minimal Number of Convex Sets on the P3 and P convexities

  ,
  Citas: 0

• Complexity of the cluster deletion problem on chordal graphs, subclasses of chordal graphs, and cographs

  ,
  Citas: 0