Publicaciones

Á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)

Durán G., "A survey of some Operations Research and Data Sciences Applications developed in the last 20 years at Argentinian and Chilean Universities", Annals of Operations Research 358 (2026), 871-893.
Durán G., Durán M., Faillace Mullen N. and Velázquez J., "An application of mathematical programming to a real case of the unrelated parallel machine problem", Annals of Operations Research 358 (2026), 815-843.
D'Aloisio C., Durán G. and Faillace Mullen N., "A solution approach to districting modification and route optimization in waste collection", Procedia Computer Science 273 (2025),169-176.
Álvarez A., Cataldo A., Durán G., Durán M., Galaz P., Monardo I. and Sauré D., "Data Science Approach to Simulating the FIFA World Cup Qatar 2022 at a Website in Tribute to Maradona", Computational Statistics 40 (2025) 2223-2247.
Durán G. Durán M., Farall A., García J., Parada D. and Salgado A., “Impact of the COVID-19 Vaccination Campaigns in Argentina during 2021: An Observational Quantification of the Death Probability for Confirmed Cases in Buenos Aires Province”, Heliyon (2024),10(5):e26310. doi: 10.1016/j.heliyon.2024.e26310.
Bertero F., Cerdeiro M., Durán G. and Faillace N., “Developing Optimization Tools for Municipal Solid Waste Collection in the Argentine city of Berazategui”, INFORMS Journal on Applied Analytics 53 (6) (2023), 451-464.
Bussolini L., Durán G. and Safe M., "Characterization of balanced graphs within claw-free graphs", Procedia Computer Science 223 (2023), 258-266.
Durán G., Pardal N. and Safe M.D., “2-Nested Matrices: Towards Understanding the Structure of Circle Graphs”, Graphs and Combinatorics 38 (4), 111 (2022).
Durán G., Guajardo M. and Zamorano G., “Mathematical models for rescheduling Ecuador’s 2020 professional football league season disrupted by COVID-19”, Society and Economy 44 (1) (2022), 360-377.
Bonomo-Braberman F., Durán G., Pardal N. and Safe M., “Forbidden induced subgraph characterization of circle graphs within split graphs”, Discrete Applied Mathematics 323 (2022), 43-75.
Aliaga F., Delle Donne D., Durán G. and Marenco J., “Drainage area optimization for unconventional petroleum fields using integer linear programming”, Annals of Operations Research 316 (2) (2022), 891-904.
Durán G., Guajardo M. and Guti´errez F., “Efficient Referee Assignment in Argentina’s Professional Basketball Leagues using Operations Research Methods”, Annals of Operations Research 316 (2) (2022), 1121-1139.
Arrar M., Belloli L., Bianco A., Boechi L., Castro R., Durán G., Etchenique R., Fernández N., Ferrer L., Garbervetsky D., Goldsmit R., Grillo Vidal C., Kamienkowski J., Laciana, P., Lanzarotti E.2, Lozano M., Maidana R., Mendiluce M., Minoldo S., Pepino L., Pecker-Marcosig E., Puerta E., Quiroga R., Solovey G., Valdora M., Zapatero, M., “Mathematical and computational initiatives from the University of Buenos Aires to contribute to decision-making in the context of Covid-19 in Argentina”, Science Reviews from the end of the world 2 (2) (2021), 6-40.
Durán G., Guajardo M., Gutiérrez F., Marenco J., Sauré D. and Zamorano G., “Scheduling the Main Professional Football League of Argentina”, INFORMS Journal on Applied Analytics 51 (5) (2021), 361-372.
Durán G., “Sports Scheduling and other Topics in Sports Analytics: A Survey with Special Reference to Latin America”, TOP 29 (2021), 125-155.
Durán G., Guajardo M., López A., Marenco J. and Zamorano G., “Scheduling Multiple Sports Leagues with Travel Distance Fairness: An Application to Argentinean Youth Football”, INFORMS Journal on Applied Analytics 51 (2) (2021), 136-149.
Delle Donne D., Di Tomaso V. and Durán G., “Optimizing Leaf Sweeping and Collection in the Argentine city of Trenque Lauquen”, Waste Management and Research 39 (2) (2021), 209-220.
Durán G., “Sports scheduling and other topics in sports analytics: a survey with special reference to Latin America”, TOP, en prensa (aceptado en 2020).
Delle Donne D., Di Tomaso V. and Durán G., “Optimizing Leaf Sweeping and Collection in the Argentine city of Trenque Lauquen”, Waste Management and Research, en prensa (aceptado en 2020).
Bonomo F., Durán G., Safe M.D., “On graph classes related to perfect graphs: A survey”, Discrete Applied Mathematics 281 (2020), 42-60.
Cea S., Durán G., Guajardo M, Sauré D., Siebert J. and Zamorano G., “An Analytics Approach to the FIFA Ranking Procedure and the World Cup Final Draw”, Annals of Operations Research 286 (2020), 119-146.
Durán G., Safe M., and Warnes X., “Neighborhood covering and independence on P4-tidy graphs and tree-cographs”, Annals of Operations Research 286 (2020), 55-86.
Pardal N., Durán G., Grippo L. and Safe M., “On nested and 2-nested graphs: two subclasses of graphs between threshold and split graphs”, Matemática Contemporânea 46 (2019), 119-128.
Durán G., Durán S., Marenco J., Mascialino F. and Rey P., “Scheduling Argentina’s Professional Basketball Leagues: A Variation on the Relaxed Travelling Tournament Problem”, European Journal of Operational Research 275(3) (2019), 1126-1138.
Durán G., Safe M., and Warnes X., “Neighborhood covering and independence on P4-tidy graphs and tree-cographs”, Annals of Operations Research 286 (2020), 55-86.
Durán G., Safe M., and Warnes X., “Neighborhood covering and independence on P4-tidy graphs and tree-cographs”, Annals of Operations Research, en prensa.
Durán G., Giormenti M., Guajardo M., Pinto P., Rey P. and Stier-Moses N., “Improving Access to Voting with Optimized Matchings”, Electoral Studies 51 (2018), 38-48.
Durán G., Fernández Slézak F., Grippo L., Oliveira F., and Szwarcfiter J.L., “Recognition and characterization of unit interval graphs with integer endpoints”, Discrete Applied Mathematics 245 (2018), 168-176.
Alcón L., Bonomo F., Durán G., Gutierrez M., Mazzoleni P., Ries B. and Valencia-Pabon M., “On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid”, Discrete Applied Mathematics 234 (10) (2018), 12-21.
Bonomo F., Durán G., Koch I. and Valencia-Pabon M., “On the (k,i)-coloring of cacti and complete graphs”, Ars Combinatoria 137 (2018), 317-333. [PDF]
Durán G., Guajardo M., and Sauré D., “Scheduling the South American Qualifiers to the 2018 FIFA World Cup by Integer Programming”, European Journal of Operational Research 262 (3) (2017), 1109-1115.
Braier G., Durán G., Marenco J. and Wesner F., “An integer programming approach to a real-world recyclable waste collection problem in Argentina”, Waste Management and Research 35 (5) (2017), 525-533.
Alarcón F., Durán G., Guajardo M., Miranda J., Ramírez L., Ramírez M., Sauré D., Siebert M., Souyris S., Weintraub A., Wolf-Yadlin R. and Zamorano G., “Operations Research Transforms Scheduling of Chilean Soccer Leagues and South American World Cup Qualifiers”, Interfaces 47 (1) (2017), 52-69.
Durán G., Rey P. and Wolff P., “Solving the Operating Room Scheduling Problem with Prioritized Lists of Patients” Annals of Operations Research 258 (2) (2017), 395-414. [PDF]
Bonomo F., Catalán J., Durán G., Epstein R., Guajardo M., Jawtuschenko A. and Marenco J., “An Asymmetric Multi-Item Auction with Quantity Discounts Applied to Internet Service Procurement in Buenos Aires Public Schools”, Annals of Operations Research 258 (2) (2017), 569-585. [PDF]
Bonomo F., Durán G. and Valencia-Pabon M., “Complexity of the cluster deletion problem on subclasses of chordal graphs”, Theoretical Computer Science 600, 2015, 289-305.
Bonomo F., de Figueiredo C.M.H., Durán G., Grippo L.N., Safe M.D. and Szwarcfiter J.L., “On probe 2-clique graphs and probe diamond-free graphs”, Discrete Mathematics and Theoretical Computer Science 17(1), 2015, 187-200.
Bonomo F., Durán G., Napoli A. and Valencia-Pabon M., “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”, Information Processing Letters 115(6-8), 2015, 600-603.
Bonomo F., Durán G., Safe M.D. and Wagler A.K., “Clique-perfectness of complements of line graphs”, Discrete Applied Mathematics 186, 2015, 19-44.
Bonomo F., Durán G., Safe M.D. and Wagler A.K., “Clique-perfectness and balancedness of some graph classes”, International Journal of Computer Mathematics 91(10), 2014, 2118-2141.
Bonomo F., Durán G., Safe M.D. and Wagler A.K., “Balancedness of some subclasses of circular-arc graphs”, Discrete Mathematics and Theoretical Computer Science 16(3), 2014, 1-22.
Bonomo F., Durán G. and Marenco J., “Mathematical Programming as a Tool for Virtual Soccer Coaches: A Case Study of a Fantasy Sport Game”, International Transactions in Operational Research 21(3), 2014, 399-414.
Alarcón F., Durán G. and Guajardo M., “Referee Assignment in the Chilean Football League using Integer Programming and Patterns”, International Transactions in Operational Research 21(3), 2014, 415-438.
Durán G., Grippo L.N. and Safe M.D., “Structural results on circular-arc graphs and circle graphs: a survey and the main open problems”, Discrete Applied Mathematics 164(2), 2014, 427-44.
Bonomo F., Costa Dourado M., Durán G., Faria L., Grippo L.N. and Safe M.D., “Forbidden subgraphs and the König-Egerváry property”, Discrete Applied Mathematics 161(16-17), 2013, 2380-2388.
Bonomo F., Durán G., Safe M.D. and Wagler A.K., “On minimal forbidden subgraph characterizations of balanced graphs”, Discrete Applied Mathematics 161(13-14), 2013, 1925-1942.
Bravo F., Durán G., Marenco J., Morán D., Pereira de Lucena A. and Weintraub A., “Mathematical Models for Optimizing Production Optimizing Production Chain Planning in Salmon Farming”, International Transactions in Operational Research 20(5), 2013, 731-766.
Romero G. , Durán G., Marenco J., and Weintraub A., “An approach for efficient ship routing”, International Transactions in Operational Research 20(6), 2013, 767-794.
Bonomo F., Durán G., Grippo L.N. and Safe M.D., “Probe interval graphs and probe unit interval graphs on superclasses of cographs”, Discrete Mathematics and Theoretical Computer Science 15(2), 2013, 177-194.
Bonomo F., Delle Donne D., Durán G and Marenco M., “Automatic Dwelling Segmentation of Buenos Aires Province for the 2010 Argentinian Census”, Interfaces 43(4), 2013, 373-384.
Cisternas F., Delle Donne D., Durán G., Polgatiz C., and Weintraub A., “Optimizing salmon farm cage net management using integer programming”, Journal of the Operational Research Society 64(2013), 735-747.
Bonomo F., Cardemil A., Durán G., Marenco J. and Saban D., “An application of the traveling tournament problem: The Argentine volleyball league”, Interfaces 42(3) (2012), 245-259.
Durán G., Guajardo M. and Wolf Yadlin R., “Operations Research Techniques for Scheduling Chile’s Second Division Soccer League”, Interfaces 42(3) (2012), 273-285.
Bonomo F., Durán G., Larumbe F. and Marenco J., “A Method for Optimizing Waste Collection Using Mathematical Programming: A Buenos Aires Case Study”, Waste Management & Research 30(3) (2012), 311-324.
Bonomo F., Durán G., Grippo L.N. and Safe M.D., “Partial characterizations of circle graphs”, Discrete Applied Mathematics 159(16) (2011), 1699-1706.
Durán G. Epstein R., Martinez C. and Zamorano G., , “Quantitative Methods for a New Configuration of Territorial Units in a Chilean Government Agency Tender Process”, Interfaces 41 (2011), 263-277.
Durán G. and Wolf Yadlin R., “A mathematical programming approach to applicant selection for a degree program based on affirmative action”, Interfaces 41 (2011), 278-288.
Bonomo F., Durán G., Marenco J. and Valencia-Pabon M., “Minimum sum set coloring of trees and line graphs of trees”, Discrete Applied Mathematics 159(5) (2011), 288-294.
Bonomo F., Durán G., Grippo L.N. and Safe M.D., “Partial characterizations of circular-arc graphs”, Journal of Graph Theory 61(4) (2009), 289-306.
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 157(17) (2009), 3511-3518.
Bonomo F., Chudnovsky M. and Durán G., “Partial characterizations of clique-perfect graphs II: diamond-free and Helly circular-arc graphs”, Discrete Mathematics 309(11) (2009), 3485-3499.
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 25(2) (2009), 153-167.
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.
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.
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.
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.
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.
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.
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.
Bonomo F., Durán G., Lin M. and Szwarcfiter J., “On Balanced Graphs”, Mathematical Programming 105 (2006), 233-250.
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.
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.
Durán G., Lin M. and Szwarcfiter J., “On clique-transversals and clique-independent sets”, Annals of Operations Research 116 (2002), 71-77.
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

Durán G., Guajardo M., Weintraub A. and Wolf R., “O.R. & Soccer: Scheduling the Chilean League by using mathematical programming”, OR/MS Today, April 2009, 42-47. [PDF]
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.
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)

Bonomo F., Catalán J., Durán G., Epstein R., Jawtuschenko A. and Marenco J., “Una licitación combinatorial aplicada a la provisión de Internet a las escuelas de Buenos Aires”, Revista Ingeniería de Sistemas 27, 2013, 9-30. [PDF]
Bonomo F., Durán G. and Marenco J., “Programación Matemática para asesorar a un entrenador de fútbol: un juego de fantasía como caso de estudio”, Revista Ingeniería de Sistemas 27, 2013, 109-130. [PDF]
Wolff P., Durán G. and Rey P., “Modelos de Programación Matemática para Asignación de Pabellones Quirúrgicos en Hospitales Públicos”, Revista Ingeniería de Sistemas 26, 2012, 23-48. [PDF]
Bonomo F., Delle Donne D., Durán G. and Marenco J., “Segmentación automática de la Provincia de Buenos Aires para el Censo Nacional Argentino 2010”, Revista Ingeniería de Sistemas 25, 2011, 29-45. [PDF]
Durán G., Guajardo M. and Wolf R., “Programación del Fixture de la Segunda División del Fútbol de Chile mediante Investigación de Operaciones”, Revista Ingeniería de Sistemas 24 (2010), 27-46. [PDF]
Alarcón F., Durán G. and Guajardo M., “Un modelo de asignación de árbitros para el torneo de fútbol Chileno y un enfoque de resolución en base a patrones”, Revista Ingeniería de Sistemas 23 (2009), 125-143. Obtuvo el primer lugar en la competencia al mejor trabajo en el VIII Congreso Chileno de Investigación Operativa (OPTIMA 2009). [PDF]
Bonomo F., Durán G., Larumbe F. and Marenco J., “Optimización de la recolección de residuos en la zona sur de la Ciudad de Buenos Aires”, Revista Ingeniería de Sistemas 23 (2009), 71-88. [PDF]
Cisternas F., Durán G., Polgatiz C., and Weintraub A., “Programación matemática para el uso eficiente de mallas de cultivo en una empresa salmonera”, Revista Ingeniería de Sistemas 23 (2009), 27-47. [PDF]
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.
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. [PS]

En actas de congresos internacionales (con referato)

Bonomo F., Durán G., Safe M.D. and Wagler A.K., “Clique-perfectness of complements of line graphs”, Electronic Notes in Discrete Mathematics 37 (2011), 327-332.
Nurmi K., Goossens D., Bartsch T., Bonomo F., Briskorn D., Durán G., Kyngäs J., Marenco J., C. Ribeiro C., Spieksma F., Urrutia S., Wolf R., “A Framework for a Highly Constrained Sports Scheduling Problem”, in Proceedings of the International MultiConference of Engineers and Computer Scientists (IMECS) 2010 Vol III, Hong Kong, pp. 1991-1997. [PDF]
Bonomo F., Durán G., Safe M.D. and Wagler A.K., “Balancedness of some subclasses of circular-arc graphs”, Electronic Notes in Discrete Mathematics 36 (2010), 1121-1128.
Bonomo F., Durán G., Safe M.D. and Wagler A.K., “On minimal forbidden subgraph characterizations of balanced graphs”, Electronic Notes in Discrete Mathematics 35 (2009), 41-46.
Bonomo F., Burzyn A., Cardemil A., Durán G. and Marenco J., “An application of the traveling tournament problem: The Argentine volleyball league”, In Michel Gendreau and Edmund K. Burke (Eds.), Proceedings of 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.
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.
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.
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.
Bonomo F., Chudnovsky M. and Durán G., “Partial characterizations of clique-perfect graphs”, Electronic Notes in Discrete Mathematics 19 (2005), 95-101.
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.
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.
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.
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).

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]

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]

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
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]