CTW 2008: Gargnano, Italy

Graph theory (I)

• Fedor V. Fomin, Saket Saurabh, Dimitrios M. Thilikos: Improving the gap of Erdös-Pósa property for minor-closed graph classes. 2-6
• Ping-Ying Tsai, Jung-Sheng Fu, Gen-Huey Chen: Fault-Free Hamiltonian Cycles in Pancake Graphs with Conditional Edge Faults. 7-10
• Ardeshir Dolati: Digraph Embedding on T_h. 11-14

Network design

• Alberto Caprara, Emiliano Traversi, Joerg Schweizer: An Application of Network Design with Orientation Constraints. 16-21
• Christian Schulte, Tim Nieberg: Classbased Detailed Routing in VLSI Design. 22-25
• Bernhard Fuchs, Anna Schulze: A Simple 3-Approximation of Minimum Manhattan Networks. 26-29

Coloring (I)

• Stefano Gualandi, Federico Malucelli: Exact Graph Coloring via Hybrid Approaches. 32-34
• Evangelos Bampas, Aris Pagourtzis, Katerina Potika: Maximum Profit Wavelength Assignment in WDM Rings. 35-38
• Andrea Abrardo, Paolo Detti, Gaia Nicosia, Andrea Pacifici, Mara Servilio: Cellular radio resource allocation problem. 39-42

Graph optimization (I)

• Tim Nieberg: A local approximation algorithm for maximum weight matching. 44-47
• Roberto Aringhieri, Chiara Braghin, Daniele Catanzaro: An Exact Approach for solving the Balanced Minimum Evolution Problem. 48-51
• Roberto Cordone, Gianluca Passeri: Heuristic and exact approaches to the Quadratic Minimum Spanning Tree Problem. 52-55

Polyhedra and formulations

• Rüdiger Stephan: On the cardinality constrained matroid polytope. 58-61
• Gordana Manic, Laura Bahiense, Cid C. de Souza: On the Facial Structure of the Common Edge Subgraph polytope. 62-65
• Leo Liberti: Reformulations in Mathematical Programming: Definitions. 66-70

On-line optimization and uncertainty

• Niklaus Eggenberg, Matteo Salani, Michel Bierlaire: UFO: Uncertainty Feature Optimization, an Implicit Paradigm for Problems with Noisy Data. 72-77
• Maria L. A. G. Cremers, Joaquim A. S. Gromicho, Willem K. Klein Haneveld, Maarten H. van der Vlerk: A dynamic service mechanic problem for a housing corporation. 78-81
• Johann Hurink, Jacob Jan Paulus: Special Cases of Online Parallel Job Scheduling. 82-85

Graph theory (II)

• Nikolaos Fountoulakis: Percolation on sparse random graphs with given degree sequence. 88-93
• Swan Dubois, Vassilis Giakoumakis, Cheikh Brahim Ould El Mounir: On co-distance hereditary graphs. 94-97
• Henning Fernau, Juan Alberto Rodríguez-Velazquez, Jose Maria Sigarreta: Global r-alliances and total domination. 98-101

Graph optimization (II)

• Victor F. Cavalcante, Cid C. de Souza: Exact Algorithms for the Vertex Separator Problem in Graphs. 104-107
• Çigdem Güler: Inverse Tension Problems. 108-111
• Edoardo Amaldi, Giulia Galbiati, Francesco Maffioli: On minimum reload cost paths, tours and flows. 112-115

Coloring (II)

• Raphael Machado, Celina M. Herrera de Figueiredo: A decomposition for total-coloring graphs of maximum degree 3. 118-122
• Sheila Morais de Almeida, Célia Picinin de Mello, Aurora Morgana: Using Latin Squares to Color Split Graphs. 123-126
• Katja Prnaver, Blaz Zmazek: On total chromatic number of direct product graphs. 127-130

Routing

• Giacomo Nannicini, Daniel Delling, Leo Liberti, Dominik Schultes: Bidirectional A^* on Time-dependent Graphs. 132-135
• Valentina Cacchiani, Albert Einstein Fernandez Muritiba, Marcos Negreiros, Paolo Toth: A Multi-start Heuristic Algorithm for the Generalized Traveling Salesman Problem. 136-138
• Shoshana Anily, Aharona Pfeffer: The Uncapacitated Swapping Problem. 139-142

Graph theory (III)

• Iztok Banic, Rija Erves, Janez Zerovnik: Edge fault-diameter of Cartesian graph bundles. 144-147
• Romain Ravaux: Decomposing trees with large diameter. 148-151
• Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern: On the Bi-enhancement of Chordal-bipartite Probe Graphs. 152-156

Column generation

• Edna A. Hoshino, Cid C. de Souza: Column Generation Algorithms for the Capacitated m-Ring-Star Problem. 158-161
• Edoardo Amaldi, Alberto Ceselli, Kanika Dhyani: Column Generation for the Minimum Hyperplanes Clustering Problem. 162-166
• Ilaria Vacca, Michel Bierlaire, Matteo Salani: Two-stage Column Generation in Container Terminal Management. 167-171

Mathematical programming

• Lilian Markenzon, Paulo Renato da Costa Pereira: A Compact Representation for Chordal Graphs. 174-176
• Céline Engelbeen, Samuel Fiorini: Constrained Decompositions of Integer Matrices and their Applications to Intensity Modulated Radiation Therapy. 177-180
• Alessandro Aloisio, Claudio Arbib, Fabrizio Marinelli: A Note on LP Relaxations for the 1D Cutting Stock Problem with Setup Costs. 181-183

Location

• Isabella Lari, Federica Ricca, Andrea Scozzari, Ronald I. Becker: Locating Median Paths on Connected Outerplanar Graphs. 186-188
• José Federico Vizcaino González, Christiano Lyra: Dynamic Programming for Optimization of Capacitor Allocation in Power Distribution Networks. 189-192
• Joachim Spoerhase, Hans-Christoph Wirth: Approximating (r, p)-Centroid on a Path. 193-195