default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElectronic 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 - Néstor E. Aguilera, Valeria A. Leoni:
Characterizations of Postman Sets. 5-10 - Liliana Alcón:
Clique-Critical Graphs. 11-15 - Liliana Alcón, Celina M. H. de Figueiredo, Márcia R. Cerioli, Marisa Gutierrez, João Meidanis:
Tree Loop Graphs. 17-23 - Gabriela R. Argiroffo, Silvia M. Bianchi, Graciela L. Nasini:
On a certain class of nonideal clutters. 25-30 - Juan Manuel Barrionuevo, Aureliano Calvo, Guillermo Durán, Fábio Protti:
New advances about a conjecture on Helly circle graphs. 31-36 - Ivo Blöchliger:
Color-blind Graphs and Suboptimal Colorings. 37-40 - Pablo Burzyn, Flavia Bonomo, Guillermo Durán:
Computational complexity of edge modification problems in different classes of graphs. 41-46 - C. N. Campos, Célia Picinin de Mello:
A result on the total colouring of powers of cycles. 47-52 - Héctor Cancela, Louis Petingi:
Domination Invariant of a Diameter Constrained Network Reliability Model. 53-58 - Héctor Cancela, Franco Robledo, Gerardo Rubino:
A GRASP algorithm with RNN based local search for designing a WAN access network. 59-65 - Alfredo Candia-Véjar, Hugo Bravo-Azlán:
Performance Analysis of Algorithms for the Steiner Problem in Directed Networks. 67-72 - Márcia R. Cerioli, Luérbio Faria, Talita 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 - Frédéric Chavanon, Eric Rémila:
Rhombus tilings: decomposition and space structure: (extended abstract). 81-87 - José R. Correa:
Near-Optimal Solutions to Two-Dimensional Bin Packing With 90 Degree Rotations. 89-95 - Maria Patricia Dobson, Marisa Gutierrez, Jayme Luiz Szwarcfiter:
Treelike Comparability Graphs. 97-102 - Guillermo Durán, Min Chih Lin, Sergio Mera, Jayme Luiz Szwarcfiter:
Clique-independent sets of Helly circular-arc graphs. 103-108 - Mariana S. Escalante, M. S. Montelar, Graciela L. Nasini:
On minimal N+- rank graphs. 109-114 - Mariana S. Escalante, Graciela L. Nasini, María del Carmen Varaldo:
Note on Lift-and-Project Ranks and Antiblocker Duality. 115-119 - Luérbio Faria, Celina M. H. 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 - Carlos Eduardo Ferreira, Fernando Mário de Oliveira Filho:
Some Formulations for the Group Steiner Tree Problem. 127-132 - Hans L. Fetter:
Multiple hamiltonian covers. 133-137 - Sylvain Gravier, Fábio Protti, Cláudia Linhares Sales:
On Clique-inverse graphs of Kp-free graphs. 139-143 - David Hartvigsen:
1-restricted Simple 2-matchings: (Extended Abstract). 145-149 - Gonzalo Hernández, Luis Salinas:
Large Scale Simulations of a Neural Network Model for the Graph Bisection Problem on Geometrically Connected Graphs. 151-156 - Benjamin Hiller, Sven Oliver Krumke, Jörg Rambau:
Reoptimization Gaps versus Model Errors in Online-Dispatching of Service Units for ADAC. 157-163 - Sulamita Klein, Noemi C. dos Santos, Jayme Luiz Szwarcfiter:
A representation for the modular-pairs of a cograph by modular decomposition. 165-169 - 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 - Javier Marenco, Annegret Wagler:
Combinatorial equivalence of Chromatic Scheduling Polytopes. 177-180 - Silvia Mazzeo, Irene Loiseau:
An Ant Colony Algorithm for the Capacitated Vehicle Routing. 181-186 - Carmen Ortiz, Mónica Villanueva-Ilufi:
Difficult Problems in Threshold Graphs. 187-192 - Lorena Pradenas, Fernando Peñailillo, Jacques A. Ferland:
Aggregate production planning problem. A new algorithm. 193-199 - Pablo A. Rey:
Eliminating redundant solutions of some symmetric combinatorial integer programs. 201-206 - Liliane R. B. Salgado, Yoshiko Wakabayashi:
Approximation Results on Balanced Connected Partitions of Graphs. 207-212 - Gautier Stauffer, Thomas M. Liebling:
The Winding Road towards a Characterization of the Stable Set Polytope for Claw-Free Graphs. 213-218 - Rafael B. Teixeira, Celina M. H. de Figueiredo:
The sandwich problem for cutsets. 219-225 - Sebastián Urrutia, Celso C. Ribeiro:
Minimizing Travels by Maximizing Breaks in Round Robin Tournament Schedules. 227-233
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-18 22:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
