Guillermo Durán

From MaRDI portal
Person:324799

Available identifiers

zbMath Open duran.guillermo-alfredoMaRDI QIDQ324799

List of research outcomes

PublicationDate of PublicationType
Forbidden induced subgraph characterization of circle graphs within split graphs2022-11-02Paper
Drainage area maximization in unconventional hydrocarbon fields with integer linear programming techniques2022-09-26Paper
2-nested matrices: towards understanding the structure of circle graphs2022-07-08Paper
Sports scheduling and other topics in sports analytics: a survey with special reference to Latin America2021-05-05Paper
On some graph classes related to perfect graphs: a survey2020-05-29Paper
Neighborhood covering and independence on \(P_4\)-tidy graphs and tree-cographs2020-05-11Paper
An analytics approach to the FIFA ranking procedure and the World Cup final draw2020-05-11Paper
On nested and 2-nested graphs: two subclasses of graphs between threshold and split graphs2019-06-27Paper
Scheduling Argentina's professional basketball leagues: a variation on the travelling tournament problem2019-02-11Paper
https://portal.mardi4nfdi.de/entity/Q45681752018-06-15Paper
Recognition and characterization of unit interval graphs with integer endpoints2018-05-24Paper
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid2017-12-20Paper
Solving the operating room scheduling problem with prioritized lists of patients2017-12-15Paper
An asymmetric multi-item auction with quantity discounts applied to Internet service procurement in Buenos Aires public schools2017-12-15Paper
Scheduling the South American qualifiers to the 2018 FIFA world cup by integer programming2017-12-06Paper
On unit interval graphs with integer endpoints2016-10-17Paper
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid2016-10-17Paper
Complexity of the cluster deletion problem on subclasses of chordal graphs2015-09-16Paper
Clique-perfectness of complements of line graphs2015-05-22Paper
A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to \(P_4\)-sparse graphs2015-05-21Paper
https://portal.mardi4nfdi.de/entity/Q52492362015-04-30Paper
Clique-perfectness and balancedness of some graph classes2014-11-28Paper
https://portal.mardi4nfdi.de/entity/Q51677202014-07-01Paper
Mathematical programming as a tool for virtual soccer coaches: a case study of a fantasy sport game2014-06-20Paper
Referee assignment in the Chilean football league using integer programming and patterns2014-06-20Paper
Structural results on circular-arc graphs and circle graphs: a survey and the main open problems2014-05-05Paper
On minimal forbidden subgraph characterizations of balanced graphs2014-04-22Paper
Forbidden subgraphs and the König-Egerváry property2014-04-10Paper
https://portal.mardi4nfdi.de/entity/Q57473962014-02-14Paper
An approach for efficient ship routing2013-11-29Paper
Mathematical models for optimizing production chain planning in salmon farming2013-11-14Paper
https://portal.mardi4nfdi.de/entity/Q28615422013-11-08Paper
Solving the segmentation problem for the 2010 Argentine census with integer programming2013-07-23Paper
Forbidden subgraphs and the Kőnig property2013-07-23Paper
Probe interval and probe unit interval graphs on superclasses of cographs2013-07-23Paper
Clique-perfectness of complements of line graphs2013-07-23Paper
On minimal forbidden subgraph characterizations of balanced graphs2013-07-19Paper
https://portal.mardi4nfdi.de/entity/Q49257952013-06-12Paper
Partial characterizations of circle graphs2011-10-27Paper
Minimum sum set coloring of trees and line graphs of trees2011-03-10Paper
Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs2010-04-28Paper
Partial characterizations of circular-arc graphs2009-12-18Paper
On the b-coloring of cographs and \(P_{4}\)-sparse graphs2009-12-09Paper
Exploring the complexity boundary between coloring and list-coloring2009-09-03Paper
Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs2009-06-19Paper
Partial characterizations of coordinated graphs: Line graphs and complements of forests2009-04-27Paper
Algorithms for finding clique-transversals of graphs2008-09-03Paper
Partial Characterizations of Circular-Arc Graphs2008-06-05Paper
Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs2008-06-05Paper
Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs2008-04-16Paper
https://portal.mardi4nfdi.de/entity/Q35951142007-08-10Paper
Characterization and recognition of Helly circular-arc clique-perfect graphs2007-05-29Paper
https://portal.mardi4nfdi.de/entity/Q34396682007-05-29Paper
Exploring the complexity boundary between coloring and list-coloring2007-05-29Paper
https://portal.mardi4nfdi.de/entity/Q34286692007-03-29Paper
Algorithms for clique-independent sets on subclasses of circular-arc graphs2006-08-17Paper
NP-completeness results for edge modification problems2006-08-17Paper
Polynomial time recognition of unit circular-arc graphs2006-04-28Paper
On balanced graphs2006-01-13Paper
https://portal.mardi4nfdi.de/entity/Q57084852005-11-18Paper
https://portal.mardi4nfdi.de/entity/Q57084872005-11-18Paper
https://portal.mardi4nfdi.de/entity/Q57084962005-11-18Paper
https://portal.mardi4nfdi.de/entity/Q54614442005-07-26Paper
https://portal.mardi4nfdi.de/entity/Q48103702004-09-06Paper
Self‐clique graphs and matrix permutations2004-02-03Paper
https://portal.mardi4nfdi.de/entity/Q44308922003-10-13Paper
https://portal.mardi4nfdi.de/entity/Q44058102003-07-24Paper
On clique-transversals and clique-independent sets2003-01-27Paper
https://portal.mardi4nfdi.de/entity/Q27166842002-01-02Paper
https://portal.mardi4nfdi.de/entity/Q27415012001-10-24Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Guillermo Durán