Abstract is missing.
- Improving the gap of Erdös-Pósa property for minor-closed graph classesFedor V. Fomin, Saket Saurabh, Dimitrios M. Thilikos. 2-6
- Fault-Free Hamiltonian Cycles in Pancake Graphs with Conditional Edge FaultsPing-Ying Tsai, Jung-Sheng Fu, Gen-Huey Chen. 7-10
- Digraph Embedding on T::::::h::::::Ardeshir Dolati. 11-14
- An Application of Network Design with Orientation ConstraintsAlberto Caprara, Emiliano Traversi, Joerg Schweizer. 16-21
- Classbased Detailed Routing in VLSI DesignChristian Schulte 0002, Tim Nieberg. 22-25
- A Simple 3-Approximation of Minimum Manhattan NetworksBernhard Fuchs, Anna Schulze. 26-29
- Exact Graph Coloring via Hybrid ApproachesStefano Gualandi, Federico Malucelli. 32-34
- Maximum Profit Wavelength Assignment in WDM RingsEvangelos Bampas, Aris Pagourtzis, Katerina Potika. 35-38
- Cellular radio resource allocation problemAndrea Abrardo, Paolo Detti, Gaia Nicosia, Andrea Pacifici, Mara Servilio. 39-42
- A local approximation algorithm for maximum weight matchingTim Nieberg. 44-47
- An Exact Approach for solving the Balanced Minimum Evolution ProblemRoberto Aringhieri, Chiara Braghin, Daniele Catanzaro. 48-51
- Heuristic and exact approaches to the Quadratic Minimum Spanning Tree ProblemRoberto Cordone, Gianluca Passeri. 52-55
- On the cardinality constrained matroid polytopeRüdiger Stephan. 58-61
- On the Facial Structure of the Common Edge Subgraph polytopeGordana Manic, Laura Bahiense, Cid C. de Souza. 62-65
- Reformulations in Mathematical Programming: DefinitionsLeo Liberti. 66-70
- UFO: Uncertainty Feature Optimization, an Implicit Paradigm for Problems with Noisy DataNiklaus Eggenberg, Matteo Salani, Michel Bierlaire. 72-77
- A dynamic service mechanic problem for a housing corporationMaria L. A. G. Cremers, Joaquim A. S. Gromicho, Willem K. Klein Haneveld, Maarten H. van der Vlerk. 78-81
- Special Cases of Online Parallel Job SchedulingJohann Hurink, Jacob Jan Paulus. 82-85
- Percolation on sparse random graphs with given degree sequenceNikolaos Fountoulakis. 88-93
- On co-distance hereditary graphsSwan Dubois, Vassilis Giakoumakis, Cheikh Brahim Ould El Mounir. 94-97
- Global ::::r::::-alliances and total dominationHenning Fernau, Juan Alberto Rodríguez-Velazquez, Jose Maria Sigarreta. 98-101
- Exact Algorithms for the Vertex Separator Problem in GraphsVictor F. Cavalcante, Cid C. de Souza. 104-107
- Inverse Tension ProblemsÇigdem Güler. 108-111
- On minimum reload cost paths, tours and flowsEdoardo Amaldi, Giulia Galbiati, Francesco Maffioli. 112-115
- A decomposition for total-coloring graphs of maximum degree 3Raphael Machado, Celina M. Herrera de Figueiredo. 118-122
- Using Latin Squares to Color Split GraphsSheila Morais de Almeida, Célia Picinin de Mello, Aurora Morgana. 123-126
- On total chromatic number of direct product graphsKatja Prnaver, Blaz Zmazek. 127-130
- Bidirectional ::::A:::::::*::: on Time-dependent GraphsGiacomo Nannicini, Daniel Delling, Leo Liberti, Dominik Schultes. 132-135
- A Multi-start Heuristic Algorithm for the Generalized Traveling Salesman ProblemValentina Cacchiani, Albert Einstein Fernandez Muritiba, Marcos Negreiros, Paolo Toth. 136-138
- The Uncapacitated Swapping ProblemShoshana Anily, Aharona Pfeffer. 139-142
- Edge fault-diameter of Cartesian graph bundlesIztok Banic, Rija Erves, Janez Zerovnik. 144-147
- Decomposing trees with large diameterRomain Ravaux. 148-151
- On the Bi-enhancement of Chordal-bipartite Probe GraphsElad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern. 152-156
- A Compact Representation for Chordal GraphsLilian Markenzon, Paulo Renato da Costa Pereira. 174-176
- Constrained Decompositions of Integer Matrices and their Applications to Intensity Modulated Radiation TherapyCéline Engelbeen, Samuel Fiorini. 177-180
- A Note on LP Relaxations for the 1D Cutting Stock Problem with Setup CostsAlessandro Aloisio, Claudio Arbib, Fabrizio Marinelli. 181-183
- Locating Median Paths on Connected Outerplanar GraphsIsabella Lari, Federica Ricca, Andrea Scozzari, Ronald I. Becker. 186-188
- Dynamic Programming for Optimization of Capacitor Allocation in Power Distribution NetworksJosé Federico Vizcaino González, Christiano Lyra. 189-192
- Approximating (::::r, p::::)-Centroid on a PathJoachim Spoerhase, Hans-Christoph Wirth. 193-195