Electronic Notes in Discrete Mathematics, Volume 18

Volume 18, December 2004

• Thomas M. Liebling, Guillermo Durán, Martín Matamala:
  Latin-American Conference on Combinatorics, Graphs and Applications: Santiago, CHILE August 16-20, 2004. 1-4
  Electronic Edition (link) BibTeX
• Néstor E. Aguilera, Valeria A. Leoni:
  Characterizations of Postman Sets. 5-10
  Electronic Edition (link) BibTeX
• Liliana Alcón:
  Clique-Critical Graphs. 11-15
  Electronic Edition (link) BibTeX
• Liliana Alcón, Celina M. Herrera de Figueiredo, Márcia R. Cerioli, Marisa Gutierrez, João Meidanis:
  Tree Loop Graphs. 17-23
  Electronic Edition (link) BibTeX
• Gabriela R. Argiroffo, Silvia M. Bianchi, Graciela L. Nasini:
  On a certain class of nonideal clutters. 25-30
  Electronic Edition (link) BibTeX
• Juan Manuel Barrionuevo, Aureliano Calvo, Guillermo Durán, Fábio Protti:
  New advances about a conjecture on Helly circle graphs. 31-36
  Electronic Edition (link) BibTeX
• Ivo Blöchliger:
  Color-blind Graphs and Suboptimal Colorings. 37-40
  Electronic Edition (link) BibTeX
• Pablo Burzyn, Flavia Bonomo, Guillermo Durán:
  Computational complexity of edge modification problems in different classes of graphs. 41-46
  Electronic Edition (link) BibTeX
• C. N. Campos, Célia Picinin de Mello:
  A result on the total colouring of powers of cycles. 47-52
  Electronic Edition (link) BibTeX
• Héctor Cancela, Louis Petingi:
  Domination Invariant of a Diameter Constrained Network Reliability Model. 53-58
  Electronic Edition (link) BibTeX
• Héctor Cancela, Franco Robledo, Gerardo Rubino:
  A GRASP algorithm with RNN based local search for designing a WAN access network. 59-65
  Electronic Edition (link) BibTeX
• Alfredo Candia-Véjar, Hugo Bravo-Azlán:
  Performance Analysis of Algorithms for the Steiner Problem in Directed Networks. 67-72
  Electronic Edition (link) BibTeX
• M. R. Cerioli, L. Faria, T. O. Ferreira, Fábio Protti:
  On minimum clique partition and maximum independent set on unit disk graphs and penny graphs: complexity and approximation. 73-79
  Electronic Edition (link) BibTeX
• Frédéric Chavanon, Eric Rémila:
  Rhombus tilings: decomposition and space structure: (extended abstract). 81-87
  Electronic Edition (link) BibTeX
• José R. Correa:
  Near-Optimal Solutions to Two-Dimensional Bin Packing With 90 Degree Rotations. 89-95
  Electronic Edition (link) BibTeX
• Maria Patricia Dobson, Marisa Gutierrez, Jayme Luiz Szwarcfiter:
  Treelike Comparability Graphs. 97-102
  Electronic Edition (link) BibTeX
• Guillermo Durán, Min Chih Lin, Sergio Mera, Jayme Luiz Szwarcfiter:
  Clique-independent sets of Helly circular-arc graphs. 103-108
  Electronic Edition (link) BibTeX
• Mariana S. Escalante, M. S. Montelar, Graciela L. Nasini:
  On minimal N₊- rank graphs. 109-114
  Electronic Edition (link) BibTeX
• Mariana S. Escalante, Graciela L. Nasini, M. C. Varaldo:
  Note on Lift-and-Project Ranks and Antiblocker Duality. 115-119
  Electronic Edition (link) BibTeX
• Luerbio Faria, Celina M. Herrera de Figueiredo, Sylvain Gravier, Candido F. X. Mendonça, Jorge Stolfi:
  Nonplanar vertex deletion: maximum degree thresholds for NP/Max SNP-hardness and a I-approximation for finding maximum planar induced subgraphs. 121-126
  Electronic Edition (link) BibTeX
• Carlos Eduardo Ferreira, Fernando M. de Oliveira Filho:
  Some Formulations for the Group Steiner Tree Problem. 127-132
  Electronic Edition (link) BibTeX
• Hans L. Fetter:
  Multiple hamiltonian covers. 133-137
  Electronic Edition (link) BibTeX
• Sylvain Gravier, Fábio Protti, Cláudia Linhares Sales:
  On Clique-inverse graphs of K_p-free graphs. 139-143
  Electronic Edition (link) BibTeX
• David Hartvigsen:
  1-restricted Simple 2-matchings: (Extended Abstract). 145-149
  Electronic Edition (link) BibTeX
• Gonzalo Hernández, Luis Salinas:
  Large Scale Simulations of a Neural Network Model for the Graph Bisection Problem on Geometrically Connected Graphs. 151-156
  Electronic Edition (link) BibTeX
• Benjamin Hiller, Sven Oliver Krumke, Jörg Rambau:
  Reoptimization Gaps versus Model Errors in Online-Dispatching of Service Units for ADAC. 157-163
  Electronic Edition (link) BibTeX
• Sulamita Klein, Noemi C. dos Santos, Jayme Luiz Szwarcfiter:
  A representation for the modular-pairs of a cograph by modular decomposition. 165-169
  Electronic Edition (link) BibTeX
• C. M. R. R. Lima, Marco César Goldbarg, Elizabeth Ferreira Gouvea Goldbarg:
  A Memetic Algorithm for the Heterogeneous Fleet Vehicle Routing Problem. 171-176
  Electronic Edition (link) BibTeX
• Javier Marenco, Annegret Wagler:
  Combinatorial equivalence of Chromatic Scheduling Polytopes. 177-180
  Electronic Edition (link) BibTeX
• Silvia Mazzeo, Irene Loiseau:
  An Ant Colony Algorithm for the Capacitated Vehicle Routing. 181-186
  Electronic Edition (link) BibTeX
• Carmen Ortiz, Mónica Villanueva-Ilufi:
  Difficult Problems in Threshold Graphs. 187-192
  Electronic Edition (link) BibTeX
• Lorena Pradenas, Fernando Peñailillo, Jacques A. Ferland:
  Aggregate production planning problem. A new algorithm. 193-199
  Electronic Edition (link) BibTeX
• Pablo A. Rey:
  Eliminating redundant solutions of some symmetric combinatorial integer programs. 201-206
  Electronic Edition (link) BibTeX
• Liliane R. B. Salgado, Yoshiko Wakabayashi:
  Approximation Results on Balanced Connected Partitions of Graphs. 207-212
  Electronic Edition (link) BibTeX
• Gautier Stauffer, Thomas M. Liebling:
  The Winding Road towards a Characterization of the Stable Set Polytope for Claw-Free Graphs. 213-218
  Electronic Edition (link) BibTeX
• Rafael B. Teixeira, Celina M. Herrera de Figueiredo:
  The sandwich problem for cutsets. 219-225
  Electronic Edition (link) BibTeX
• Sebastián Urrutia, Celso C. Ribeiro:
  Minimizing Travels by Maximizing Breaks in Round Robin Tournament Schedules. 227-233
  Electronic Edition (link) BibTeX