home   publicaciones   docencia   investigación   tesistas   transferencia   universidad   curriculum vitae   @   links 
         
  home  
    publicaciones  
    docencia  
 
  proyectos de
investigación
 
    tesistas  
    transferencia
de tecnología
 
 
  actuación
universitaria
 
    charlas  
    curriculum vitae  
    e-mail  
    links  
     
       
  Área de investigación | Research area  
  Teoría de Grafos | Graph Theory  
  Optimización Combinatoria | Combinatorial Optimization  
  Investigación Operativa | Operations Research  
       
       
  Trabajos publicados | Published papers  
  en revistas internacionales indexadas (ISI)  
       
  Bonomo F., Durán G., Maffray F., Marenco J. and Valencia Pabón M., "On the b-coloring of cographs and P_4-sparse graphs", Graphs and Combinatorics, en prensa.  
  [link] [PDF]  
     
  Bonomo F., Durán G., Grippo L.N. and Safe M.D., "Partial characterizations of circular-arc graphs", Journal of Graph Theory, en prensa.  
   [link] [PDF]  
     
  Bonomo F., Chudnovsky M. and Durán G., "Partial characterizations of clique-perfect graphs II: diamond-free and Helly circular-arc graphs", Discrete Mathematics, en prensa.  
   [link] [PDF]  
     
  Bonomo F., Durán G., Soulignac F. and Sueiro G., "Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs", Discrete Applied Mathematics, en prensa.  
    [link] [PDF]  
     
  Bonomo F., Durán G. and Marenco J., "Exploring the complexity boundary between coloring and list-coloring", Annals of Operations Research 169(1) (2009), 3-16.  
   [link] [PDF]  
     
  Bonomo F., Durán G., Soulignac F. and Sueiro G., "Partial characterizations of coordinated graphs: line graphs and complements of forests", Mathematical Methods of Operations Research 69(2) (2009), 251-270.  
  [link] [PDF]  
     
  Bonomo F., Chudnovsky M. and Durán G., "Partial characterizations of clique-perfect graphs I: subclasses of claw-free graphs", Discrete Applied Mathematics 156(7) (2008), 1058-1082.  
   [link] [PDF]  
     
  Durán G., Lin M., Mera S. and Szwarcfiter J., "Algorithms for finding clique-transversals of graphs", Annals of Operations Research 157(1) (2008), 37-45.  
  [link] [PDF]  
     
  Durán G., Guajardo M., Miranda J., Sauré D., Souyris S., Weintraub A., Wolf R., "Scheduling the Chilean Soccer League by Integer Programming", INTERFACES 37 (2007), 539-552.  
  [link] [PDF]  
     
    Bonomo F., Durán G. and Groshaus M., "Coordinated graphs and clique graphs of clique-Helly perfect graphs", Utilitas Mathematica 72 (2007), 175-191.  
  [PS]  
     
 

 

Burzyn P., Bonomo F. and Durán G., "NP-completeness results for edge modification problems", Discrete Applied Mathematics 154(13) (2006), 1824-1844.  
  [link] [PDF]  
     
 

 

Durán G., Lin M., Mera S. and Szwarcfiter J., "Algorithms for clique-independent sets on subclasses of circular-arc graphs", Discrete Applied Mathematics 154(13) (2006), 1783-1790.  
   [link] [PDF]  
     
 

 

Bonomo F., Durán G., Lin M. and Szwarcfiter J., "On Balanced Graphs", Mathematical Programming 105 (2006), 233-250.  
  [link] [PS]  
     
  Durán G., Gravano A., McConnell R., Spinrad J. and Tucker A., "Polynomial time recognition of unit circular-arc graphs", Journal of Algorithms 58 (2006), 67-78.  
  [link] [PS]  
     
 

 

Bonomo F., Durán G., Groshaus M. and Szwarcfiter J., "On clique- perfect and K-perfect graphs", Ars Combinatoria 80 (2006), 97-112.  
  [PS]  
     
  Bondy A., Durán G., Lin M. and Szwarcfiter J., "Self-clique graphs and matrix permutations", Journal of Graph Theory 44 (3) (2003), 178-192.  
  [link] [PS]  
     
  Durán G., Lin M. and Szwarcfiter J., "On clique-transversals and clique-independent sets", Annals of Operations Research 116 (2002), 71-77.  
  [link] [PS]  
     
  Durán G. and Lin M., "Clique graphs of Helly circular-arc graphs", Ars Combinatoria 60 (2001), 255-271.  
  [PDF]  
     
  en revistas internacionales no indexadas  
     
  Noronha T.F., Ribeiro C.C., Durán G., Souyris S. and Weintraub A., "A branch-and-cut algorithm for scheduling the highly-constrained Chilean soccer tournament", Lecture Notes in Computer Science 3867 (2007), 174-186.  
  [link] [PDF]  
     
  Gravano A. and Durán G., "The intersection between some subclasses of circular-arc and circle graphs", Congressus Numerantium 159 (2002), 183-192.  
  [PS]  
     
  Czemerinski H., Durán G. and Gravano A., "Bouchet Graphs: A Generalization of Circle Graphs", Congressus Numerantium 155 (2002), 95-108.  
  [PS]  
     
  Durán G. and Lin M., "On some subclasses of circular-arc graphs", Congressus Numerantium 146 (2000), 201-212.  
  [PDF]  
     
  en revistas regionales (con referato internacional)  
     
       
  Zamorano G., Durán G. and Weitraub A., "Métodos cuantitativos para una nueva configuración de Unidades Territoriales en licitaciones de JUNAEB", Revista Ingeniería de Sistemas 22 (2008), 87-114.  
  [PDF]  
     
  Durán G. and Wolf R., "Programación Matemática para seleccionar los aspirantes a un Magíster con criterios de equidad regional, socio-económica y de género", Revista Ingeniería de Sistemas 21 (2007), 31-45.  
  [PDF]  
     
  Durán G., Guajardo M., and Sauré D., "Tecnologías modernas de gestión para la programación del fútbol chileno", Trend Management 8 (2006), 118-122.  
  [PDF] [tablas]  
     
  Durán G., Guajardo M., Miranda J., Sauré D., Souyris S., Weintraub A., Carmash A., Chaigneau F., "Programación matemática aplicada al fixture de la primera división del fútbol chileno", Revista Ingeniería de Sistemas 19 (2005), 29-48.  
  [PDF]  
     
  Bonomo F. and Durán G., "Computational complexity of classical problems for hereditary clique-Helly graphs", Pesquisa Operacional 24 (3) (2004), 435-443.  
  [link] [PDF]  
     
  Cardemil A. and Durán G., "Un algoritmo tabú search para el traveling tournment problem", Revista Ingeniería de Sistemas 18 (1) (2004) 95-115.  
  [PDF]  
     
  Durán G., "Some new results on circle graphs", Matemática Contemporânea 25 (2003), 91-106.  
  [PS]  
     
  Durán G., Gravano A., Groshaus M., Protti F. and Szwarcfiter J., "On a conjecture concerning Helly circle graphs", Pesquisa Operacional 23 (1) (2003), 221-229.  
  [link] [PS]  
     
  en actas de congresos internacionales (con referato)  
     
  Bonomo F., Burzyn A., Cardemil A., Durán G. and Marenco J., "An application of the traveling tournament problem: The Argentine volleyball league", The 7th International Conference on the Practice and Theory of Automated Timetabling, PATAT (2008).  
  [PDF]  
     
  Bonomo F., Durán G., Grippo L.N. and Safe M.D., "Partial characterizations of circular-arc graphs", Electronic Notes in Discrete Mathematics 30 (2008), 45-50.  
   [link] [PDF]  
     
  Bonomo F., Durán G., Soulignac F. and Sueiro G., "Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs", Electronic Notes in Discrete Mathematics 30 (2008), 51-56.  
   [link] [PDF]  
     
  Durán G., Noronha T., Ribeiro C., Souyris S., Weintraub A., "Branch-and-cut for a real-life highly constrained soccer tournament scheduling problem", The 6th International Conference on the Practice and Theory of Automated Timetabling, PATAT (2006), 398-401.  
  [PDF]  
     
  Bonomo F., Durán G. and Marenco J., "Exploring the complexity boundary between coloring and list-coloring", Electronic Notes in Discrete Mathematics 25 (2006), 41-47.  
  [link] [PDF]  
     
  Bonomo F. and Durán G., "Characterization and recognition of Helly circular-arc clique-perfect graphs", Electronic Notes in Discrete Mathematics 22 (2005), 147-150.  
  [link] [PDF]  
     
  Bonomo F., Chudnovsky M. and Durán G., "Partial characterizations of clique-perfect graphs", Electronic Notes in Discrete Mathematics 19 (2005), 95-101.  
  [link] [PDF]  
     
  Durán G., Lin M., Mera S. and Szwarcfiter J., "Clique-independent sets of Helly circular-arc graphs", Electronic Notes in Discrete Mathematics 18 (2004), 103-108.  
  [link] [PS]  
     
  Burzyn P., Bonomo F. and Durán G., "Computational complexity of edge modification problems in different classes of graphs", Electronic Notes in Discrete Mathematics 18 (2004), 41-46.  
  [link] [PS]  
     
  Barrionuevo J., Calvo A., Durán G. and Protti F., "New advances about a conjecture on Helly circle graphs", Electronic Notes in Discrete Mathematics 18 (2004), 31-36.  
  [link] [PS]  
     
  Bondy A., Durán G., Lin M. and Szwarcfiter J., "A sufficient condition for self-clique graphs", Electronic Notes in Discrete Mathematic, Volume 7 (2001).  
  [link] [PS]  
     
     
  Capítulos de libros | Book chapters  
     
  Coll P., Durán G. and Moscato P., "On worst-case and comparative analysis as a design principles for efficient recombination operators: A graph coloring case study", en "New Ideas in Optimization" publicado por McGraw-Hill en 1999 (ISBN 0-07-709506-5), Capítulo 18, páginas 279-292.  
  [PDF]  
     
     
  Trabajos enviados | Submitted papers  
     
  Durán G. and Wolf Yadlin R., "A mathematical programming approach to applicant selection for a degree program based on gender, regional origin and socioeconomic criteria", enviado a INTERFACES (2009).  
  [PDF]  
     
     
     
  Tesis Doctoral | PhD Thesis  
     
  Título: Sobre grafos intersección de arcos y cuerdas en un círculo
Director: Jayme L. Szwarcfiter (Universidad Federal de Rio de Janeiro)
Fecha de presentación: Mayo de 2000
 
  [PS]  
     
     
  Tesis Doctorales de miembros del grupo | PhD Thesis  
     
  Título: Chromatic Scheduling Polytopes coming from the Bandwidth Allocation Problem in Point-to-Multipoint Radio Access Systems
Autor: Javier L. Marenco
Directores: Martin Grötschel y Annegret Wagler (ZIB, Berlin)
Fecha de presentación: Abril de 2005
 
  [PDF]  
     
  Título: Sobre subclases y variantes de los grafos perfectos
Autor: Flavia Bonomo
Director: Guillermo Durán
Fecha de presentación: Diciembre de 2005
 
  [PDF]