default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCTW 2008: Gargnano, Italy
- Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, gargano, Italy, 13-15 May, 2008. University of Milan 2008
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. CTW 2008: 2-6 - Ping-Ying Tsai, Jung-Sheng Fu, Gen-Huey Chen:
Fault-Free Hamiltonian Cycles in Pancake Graphs with Conditional Edge Faults. CTW 2008: 7-10 - Ardeshir Dolati:
Digraph Embedding on Th. CTW 2008: 11-14
Network design
- Alberto Caprara, Emiliano Traversi, Joerg Schweizer:
An Application of Network Design with Orientation Constraints. CTW 2008: 16-21 - Christian Schulte, Tim Nieberg:
Classbased Detailed Routing in VLSI Design. CTW 2008: 22-25 - Bernhard Fuchs, Anna Schulze:
A Simple 3-Approximation of Minimum Manhattan Networks. CTW 2008: 26-29
Coloring (I)
- Stefano Gualandi, Federico Malucelli:
Exact Graph Coloring via Hybrid Approaches. CTW 2008: 32-34 - Evangelos Bampas, Aris Pagourtzis, Katerina Potika:
Maximum Profit Wavelength Assignment in WDM Rings. CTW 2008: 35-38 - Andrea Abrardo, Paolo Detti, Gaia Nicosia, Andrea Pacifici, Mara Servilio:
Cellular radio resource allocation problem. CTW 2008: 39-42
Graph optimization (I)
- Tim Nieberg:
A local approximation algorithm for maximum weight matching. CTW 2008: 44-47 - Roberto Aringhieri, Chiara Braghin, Daniele Catanzaro:
An Exact Approach for solving the Balanced Minimum Evolution Problem. CTW 2008: 48-51 - Roberto Cordone, Gianluca Passeri:
Heuristic and exact approaches to the Quadratic Minimum Spanning Tree Problem. CTW 2008: 52-55
Polyhedra and formulations
- Rüdiger Stephan:
On the cardinality constrained matroid polytope. CTW 2008: 58-61 - Gordana Manic, Laura Bahiense, Cid C. de Souza:
On the Facial Structure of the Common Edge Subgraph polytope. CTW 2008: 62-65 - Leo Liberti:
Reformulations in Mathematical Programming: Definitions. CTW 2008: 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. CTW 2008: 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. CTW 2008: 78-81 - Johann L. Hurink, Jacob Jan Paulus:
Special Cases of Online Parallel Job Scheduling. CTW 2008: 82-85
Graph theory (II)
- Nikolaos Fountoulakis:
Percolation on sparse random graphs with given degree sequence. CTW 2008: 88-93 - Swan Dubois, Vassilis Giakoumakis, Cheikh Brahim Ould El Mounir:
On co-distance hereditary graphs. CTW 2008: 94-97 - Henning Fernau, Juan Alberto Rodríguez-Velázquez, José María Sigarreta:
Global r-alliances and total domination. CTW 2008: 98-101
Graph optimization (II)
- Victor F. Cavalcante, Cid C. de Souza:
Exact Algorithms for the Vertex Separator Problem in Graphs. CTW 2008: 104-107 - Çigdem Güler:
Inverse Tension Problems. CTW 2008: 108-111 - Edoardo Amaldi, Giulia Galbiati, Francesco Maffioli:
On minimum reload cost paths, tours and flows. CTW 2008: 112-115
Coloring (II)
- Raphael Machado, Celina M. H. de Figueiredo:
A decomposition for total-coloring graphs of maximum degree 3. CTW 2008: 118-122 - Sheila Morais de Almeida, Célia Picinin de Mello, Aurora Morgana:
Using Latin Squares to Color Split Graphs. CTW 2008: 123-126 - Katja Prnaver, Blaz Zmazek:
On total chromatic number of direct product graphs. CTW 2008: 127-130
Routing
- Giacomo Nannicini, Daniel Delling, Leo Liberti, Dominik Schultes:
Bidirectional A* on Time-dependent Graphs. CTW 2008: 132-135 - Valentina Cacchiani, Albert Einstein Fernandes Muritiba, Marcos Negreiros, Paolo Toth:
A Multi-start Heuristic Algorithm for the Generalized Traveling Salesman Problem. CTW 2008: 136-138 - Shoshana Anily, Aharona Pfeffer:
The Uncapacitated Swapping Problem. CTW 2008: 139-142
Graph theory (III)
- Iztok Banic, Rija Erves, Janez Zerovnik:
Edge fault-diameter of Cartesian graph bundles. CTW 2008: 144-147 - Romain Ravaux:
Decomposing trees with large diameter. CTW 2008: 148-151 - Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
On the Bi-enhancement of Chordal-bipartite Probe Graphs. CTW 2008: 152-156
Column generation
- Edna Ayako Hoshino, Cid C. de Souza:
Column Generation Algorithms for the Capacitated m-Ring-Star Problem. CTW 2008: 158-161 - Edoardo Amaldi, Alberto Ceselli, Kanika Dhyani:
Column Generation for the Minimum Hyperplanes Clustering Problem. CTW 2008: 162-166 - Ilaria Vacca, Michel Bierlaire, Matteo Salani:
Two-stage Column Generation in Container Terminal Management. CTW 2008: 167-171
Mathematical programming
- Lilian Markenzon, Paulo Renato da Costa Pereira:
A Compact Representation for Chordal Graphs. CTW 2008: 174-176 - Céline Engelbeen, Samuel Fiorini:
Constrained Decompositions of Integer Matrices and their Applications to Intensity Modulated Radiation Therapy. CTW 2008: 177-180 - Alessandro Aloisio, Claudio Arbib, Fabrizio Marinelli:
A Note on LP Relaxations for the 1D Cutting Stock Problem with Setup Costs. CTW 2008: 181-183
Location
- Isabella Lari, Federica Ricca, Andrea Scozzari, Ronald I. Becker:
Locating Median Paths on Connected Outerplanar Graphs. CTW 2008: 186-188 - José Federico Vizcaino González, Christiano Lyra:
Dynamic Programming for Optimization of Capacitor Allocation in Power Distribution Networks. CTW 2008: 189-192 - Joachim Spoerhase, Hans-Christoph Wirth:
Approximating (r, p)-Centroid on a Path. CTW 2008: 193-195
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-02-20 19:47 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:
