Table of Contents

• Effective Heuristics for Large Euclidean TSP Instances Based on Pseudo BackbonesChangxing Dong, Christian Ernst, Gerold Jäger, Dirk Richter, Paul Molitor. 3-6 [doi]
• Efficient Algorithms for the Double Traveling Salesman Problem with Multiple StacksMarco Casazza, Alberto Ceselli, Marc Nunkesser. 7-10 [doi]
• The Parking Warden Tour ProblemMaurizio Bruglieri, Alberto Colorni, Alessandro Lué. 11-15 [doi]
• On Self-Duality of Branchwidth in Graphs of Bounded GenusIgnasi Sau, Dimitrios M. Thilikos. 19-22 [doi]
• A Simple Linear-Time Recognition Algorithm for Weakly Quasi-Threshold GraphsStavros D. Nikolopoulos, Charis Papadopoulos. 23-27 [doi]
• From Sainte-Laguü to Claude Berge - French Graph Theory in the Twentieth CenturyHarald Gropp. 28-32 [doi]
• Colored Independent SetsJens Maßberg, Tim Nieberg. 35-39 [doi]
• A Note on the Parameterized Complexity of the Maximum Independent Set ProblemVadim V. Lozin. 40-43 [doi]
• On Multi-Agent Knapsack ProblemsGaia Nicosia, Andrea Pacifici, Ulrich Pferschy. 44-47 [doi]
• An Exact Method for the Minimum Caterpillar Spanning ProblemL. Simonetti, Yuri Frota, C. C. de Souza. 48-51 [doi]
• NP-Completeness of Determining the Total Chromatic Number of Graphs that do not Contain a Cycle with a Unique ChordRaphael Machado, Celina M. Herrera de Figueiredo. 55-59 [doi]
• Acyclic and Frugal Colourings of GraphsRoss J. Kang, Tobias Müller. 60-63 [doi]
• On Resistance of GraphsPetros A. Petrosyan, H. E. Sargsyan. 64-67 [doi]
• Colored Resource Allocation GamesEvangelos Bampas, Aris Pagourtzis, George Pierrakos, Vasileios Syrgkanis. 68-72 [doi]
• A Lower Bound for the Cutting Stock Problem with a Limited Number of Open StacksClaudio Arbib, Fabrizio Marinelli, Carlo M. Scoppola. 75-78 [doi]
• Packing Paths: Recycling Saves TimeHenning Fernau, Daniel Raible. 79-83 [doi]
• Rectangle Packing with Additional RestrictionsJens Maßsberg, Jan Schneider. 84-86 [doi]
• The Open Capacitated Arc Routing ProblemFabio Luiz Usberti, Paulo Morelato Franca, André Luiz Morelato Franca. 89-92 [doi]
• Optimising Node Coordinates for the Shortest Path ProblemMirko Maischberger. 93-96 [doi]
• The Sliding Shortest Path AlgorithmsRamesh Bhandari. 97-101 [doi]
• A Polynomial-Time Recursive Algorithm for some Unconstrained Quadratic Optimization ProblemsWalid Ben-Ameur, José Neto. 105-108 [doi]
• Finding Tight RLT Formulations for Quadratic Semi-Assignment ProblemsIngmar Schüle, Hendrik Ewe, Karl-Heinz Küfer. 109-112 [doi]
• Colored Trees in Edge-Colored GraphsA. Abouelaoualim, V. Borozan, Yannis Manoussakis, Carlos A. J. Martinhon, R. Muthu, Rachid Saad. 115-119 [doi]
• Intermediate TreesKathie Cameron, Joanna Fawcett. 120-121 [doi]
• Bilevel Programming and Maximally Violated Valid InequalitiesAndrea Lodi, Ted K. Ralphs. 125-134 [doi]
• Decomposition Methods for Stochastic Integer Programs with Dominance ConstraintsRüdiger Schultz. 137-139 [doi]
• On a Two-Stage Stochastic Knapsack Problem with Probabilistic ConstraintStefanie Kosuch, Abdel Lisser. 140-143 [doi]
• Improved Strategies for Branching on General DisjunctionsGérard Cornuéjols, Leo Liberti, Giacomo Nannicini. 144-145 [doi]
• Extremal Stable GraphsGyula Y. Katona, Illés Horváth. 149-152 [doi]
• Recognizing Edge-Perfect Graphs: some Polynomial InstancesValeria A. Leoni, Maria Patricia Dobson, Graciela L. Nasini. 153-156 [doi]
• Some Infinite Families of Q-Integral GraphsMaria Aguieras A. de Freitas, Nair Maria Maia de Abreu, Renata R. Del-Vecchio. 157-160 [doi]
• Balanced Clustering for Efficient Detection of Scientific PlagiarismAlberto Ceselli, Roberto Cordone, Marco Cremonini. 163-170 [doi]
• Robustness in Train TimetablingValentina Cacchiani, Alberto Caprara, Matteo Fischetti. 171-174 [doi]
• Combinatorial Optimization Based Recommender SystemsFabio Roda, Leo Liberti, Franco Raimondi. 175-179 [doi]
• Bounds and Solutions for Strategic, Tactical and Operational Ambulance LocationRoberto Cordone, Federico Ficarelli, Giovanni Righini. 180-183 [doi]
• A Branch-and-Price Approach for the Partition Coloring ProblemEdna A. Hoshino, Yuri Frota, Cid C. de Souza. 187-190 [doi]
• Two Upper Bounds on the Chromatic NumberMaría Soto, André Rossi, Marc Sevaux. 191-194 [doi]
• Minimum Sum Set Coloring on some Subclasses of Block GraphsFlavia Bonomo, Guillermo Durán, Javier Marenco, Mario Valencia-Pabon. 195-198 [doi]
• Acyclic and Star Colorings of Joins of Graphs and an Algorithm for CographsAndrew Lyons. 199-202 [doi]
• Exact Exponential-Time Algorithms for Finding Bicliques in a GraphHenning Fernau, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Daniel Raible. 205-209 [doi]
• An Exact Algorithm to Minimize the Makespan in Project Scheduling with Scarce Resources and Feeding Precedence RelationsLucio Bianco, Massimiliano Caramia. 210-214 [doi]
• Exact Algorithms for Vehicle Routing Problems with Different Service ConstraintsRita Macedo, Cláudio Alves, José M. Valério de Carvalho. 215-218 [doi]
• Algorithmic Solutions of Discrete Control Problems on Stochastic NetworksDmitrii Lozovanu, Stefan Pickl. 221-224 [doi]
• Routing and Wavelength Assignment in Optical Networks by Independent Sets in Conflict GraphsLucile Belgacem, Irène Charon, Olivier Hudry. 225-228 [doi]
• Recognition of Reducible Flow HypergraphsAndré Luiz Pires Guedes, Lilian Markenzon, L. Faria. 229-232 [doi]
• On the Complexity of Graph-Based Bounds for the Probability Bounding ProblemAndrea Scozzari, Fabio Tardella. 235-238 [doi]
• Integer Flow with Multipliers: The Special Case of Multipliers 1 and 2Birgit Engels, Sven Oliver Krumke, Rainer Schrader, Christiane Zeck. 239-243 [doi]
• Classification of 0/1-Facets of the Hop Constrained Path Polytope Defined on an Acyclic DigraphRüdiger Stephan. 247-250 [doi]
• The k-Gear Composition and the Stable Set PolytopeAnna Galluccio, Claudio Gentile, M. Macina, Paolo Ventura. 251-254 [doi]
• Diameter and Center Computations in NetworksMichel Habib. 257-258 [doi]
• Integer Programming with 2-Variable Equations and 1-Variable InequalitiesManuel Bodirsky, Gustav Nordh, Timo von Oertzen. 261-264 [doi]
• Faster Min-Max Resource Sharing and ApplicationsDirk Müller. 265-268 [doi]
• The Anonymous Subgraph ProblemAndrea Bettinelli, Leo Liberti, Franco Raimondi, David Savourey. 269-274 [doi]
• The Number of Excellent Discrete Morse Functions on GraphsRafael Ayala, Desamparados Fernández-Ternero, J. A. Vilches. 277-280 [doi]
• Partial Characterizations of Circle GraphsFlavia Bonomo, Guillermo Durán, Luciano N. Grippo, Martín Darío Safe. 281-284 [doi]
• A Replacement Model for a Scale-Free Property of CliquesTakeya Shigezumi, Yushi Uno, Osamu Watanabe. 285-289 [doi]
• Combinatorial Optimization Problems with Conflict GraphsAndreas Darmann, Ulrich Pferschy, Joachim Schauer, Gerhard J. Woeginger. 293-296 [doi]
• On the Decomposition of Graphs into Offensive k-AlliancesJose Maria Sigarreta, Ismael Gonález Yero, Sergio Bermudo, Juan Alberto Rodríguez-Velazquez. 297-300 [doi]
• Increasing the Edge Connectivity by One in O(lambda_G n^2 log* n) Expected TimeMichael Brinkmeier. 301-304 [doi]
• Enumerating all Finite Sets of Minimal Prime Extensions of GraphsVassilis Giakoumakis, Cheikh Brahim Ooud El Mounir. 305-309 [doi]
• On Planar and Directed Multicuts with few Source-Sink PairsCédric Bentz. 313-316 [doi]
• Maintenance Resources Allocation on Power Distribution Networks with a Multi-Objective FrameworkFabio Luiz Usberti, José Federico Vizcaino González, Christiano Lyra Filho, Celso Cavellucci. 317-320 [doi]
• Column Generation for the Multicommodity Min-cost Flow Over Time ProblemEnrico Grande, Pitu B. Mirchandani, Andrea Pacifici. 321-324 [doi]
• Inferring Update Sequences in Boolean Gene Regulatory NetworksFabien Tarissan, Camilo La Rota. 325-329 [doi]
• NANOCONES - A Classification Result in ChemistryGunnar Brinkmann, Nicolas Van Cleemput. 333-336 [doi]
• The Molecular Distance Geometry Problem Applied to Protein ConformationsAntonio Mucherino, Carlile Lavor, Nelson Maculan. 337-340 [doi]
• Protein ThreadingGuillaume Collet, Rumen Andonov, Nicola Yanev, Jean-François Gibrat. 341-344 [doi]
• Cardinality Constrained Graph Partitioning into Cliques with Submodular CostsJ. Correa, N. Megow, R. Raman, Karol Suchan. 347-350 [doi]
• A Simple MAX-CUT Algorithm for Planar GraphsF. Liers, G. Pardella. 351-354 [doi]
• k-Hyperplane Clustering Problem: Column Generation and a MetaheuristicEdoardo Amaldi, Stefano Coniglio, Kanika Dhyani. 355-358 [doi]
• A System-Theoretic Model for Cooperation and Allocation MechanismsUlrich Faigle, Jan Voss. 361-364 [doi]
• Distribution of Permanent of Matrices with Restricted Entries over Finite FieldsLe Anh Vinh. 367-370 [doi]
• On the Boundary of Tractability for Nonlinear Discrete OptimizationJon Lee. 373-383 [doi]