Guillermo Durán

According to our database1, Guillermo Durán authored at least 73 papers between 2001 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
On some graph classes related to perfect graphs: A survey.
Discret. Appl. Math., 2020

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

Neighborhood covering and independence on P<sub>4</sub>-tidy graphs and tree-cographs.
Ann. Oper. Res., 2020

An analytics approach to the FIFA ranking procedure and the World Cup final draw.
Ann. Oper. Res., 2020

2019
On nested and 2-nested graphs: two subclasses of graphs between threshold and split graphs.
CoRR, 2019

2018
Recognition and characterization of unit interval graphs with integer endpoints.
Discret. Appl. Math., 2018

Performance of epistasis detection methods in semi-simulated GWAS.
BMC Bioinform., 2018

On the (k, i)-coloring of cacti and complete graphs.
Ars Comb., 2018

2017
Operations Research Transforms the Scheduling of Chilean Soccer Leagues and South American World Cup Qualifiers.
Interfaces, 2017

Scheduling the South American Qualifiers to the 2018 FIFA World Cup by integer programming.
Eur. J. Oper. Res., 2017

Solving the operating room scheduling problem with prioritized lists of patients.
Ann. Oper. Res., 2017

An asymmetric multi-item auction with quantity discounts applied to Internet service procurement in Buenos Aires public schools.
Ann. Oper. Res., 2017

2016
Preface: LAGOS'13: Seventh Latin-American Algorithms, Graphs, and Optimization Symposium, Playa del Carmen, México - 2013.
Discret. Appl. Math., 2016

Neighborhood covering and independence on two superclasses of cographs.
CoRR, 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

On unit interval graphs with integer endpoints.
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

2014
Mathematical programming as a tool for virtual soccer coaches: a case study of a fantasy sport game.
Int. Trans. Oper. Res., 2014

Referee assignment in the Chilean football league using integer programming and patterns.
Int. Trans. Oper. Res., 2014

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

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

Structural results on circular-arc graphs and circle graphs: A survey and the main open problems.
Discret. Appl. Math., 2014

2013
Optimizing salmon farm cage net management using integer programming.
J. Oper. Res. Soc., 2013

An approach for efficient ship routing.
Int. Trans. Oper. Res., 2013

Mathematical models for optimizing production chain planning in salmon farming.
Int. Trans. Oper. Res., 2013

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

Forbidden induced subgraph characterizations of subclasses and variations of perfect graphs: A survey.
Electron. Notes Discret. Math., 2013

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

Forbidden subgraphs and the König-Egerváry property.
Discret. Appl. Math., 2013

2012
Operations Research Techniques for Scheduling Chile's Second Division Soccer League.
Interfaces, 2012

An Application of the Traveling Tournament Problem: The Argentine Volleyball League.
Interfaces, 2012

Integer Programming for Optimizing Salmon Farm Cage Net Use.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011
A Mathematical Programming Approach to Applicant Selection for a Degree Program Based on Affirmative Action.
Interfaces, 2011

Quantitative Methods for a New Configuration of Territorial Units in a Chilean Government Agency Tender Process.
Interfaces, 2011

Probe interval and probe unit interval graphs on superclasses of cographs.
Electron. Notes Discret. Math., 2011

Forbidden subgraphs and the Kőnig property.
Electron. Notes Discret. Math., 2011

Solving the segmentation problem for the 2010 Argentine census with integer programming.
Electron. Notes Discret. Math., 2011

Clique-perfectness of complements of line graphs.
Electron. Notes Discret. 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

2010
Balancedness of some subclasses of circular-arc graphs.
Electron. Notes Discret. Math., 2010

Traces from LAGOS'07: IV Latin American Algorithms, Graphs, and Optimization Symposium Puerto Varas - 2007.
Discret. Appl. 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

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
Preface.
Electron. Notes Discret. Math., 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

Algorithms for finding clique-transversals of graphs.
Ann. Oper. Res., 2008

2007
Scheduling the Chilean Soccer League by Integer Programming.
Interfaces, 2007

2006
On Balanced Graphs.
Math. Program., 2006

Polynomial time recognition of unit circular-arc graphs.
J. Algorithms, 2006

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

Algorithms for clique-independent sets on subclasses of circular-arc graphs.
Discret. Appl. Math., 2006

Traces of the Latin American Conference on Combinatorics, Graphs and Applications: A selection of papers from LACGA 2004, Santiago, Chile.
Discret. Appl. Math., 2006

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

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

A Branch-and-Cut Algorithm for Scheduling the Highly-Constrained Chilean Soccer Tournament.
Proceedings of the Practice and Theory of Automated Timetabling VI, 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

2004
Latin-American Conference on Combinatorics, Graphs and Applications: Santiago, CHILE August 16-20, 2004.
Electron. Notes Discret. Math., 2004

Clique-independent sets of Helly circular-arc graphs.
Electron. Notes Discret. Math., 2004

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

New advances about a conjecture on Helly circle graphs.
Electron. Notes Discret. Math., 2004

2003
Self-clique graphs and matrix permutations.
J. Graph Theory, 2003

2002
On Clique-Transversals and Clique-Independent Sets.
Ann. Oper. Res., 2002

2001
A sufficient condition for self-clique graphs.
Electron. Notes Discret. Math., 2001

Clique graphs of Helly circular arc graphs.
Ars Comb., 2001


  Loading...