Abstract is missing.
- Towards a Distributed Search EngineRicardo A. Baeza-Yates. 1-5 [doi]
- Mechanisms for the Marriage and the Assignment GamePaul Dütting, Monika Henzinger. 6-12 [doi]
- Resilient Algorithms and Data StructuresGiuseppe F. Italiano. 13-24 [doi]
- An Exact Algorithm for Connected Red-Blue Dominating SetFaisal N. Abu-Khzam, Amer E. Mouawad, Mathieu Liedloff. 25-36 [doi]
- Maximizing PageRank with New BacklinksMartin Olsen. 37-48 [doi]
- Enumerating Rooted Graphs with Reflectional Block StructuresBingbing Zhuang, Hiroshi Nagamochi. 49-60 [doi]
- Improved Approximations for TSP with Simple Precedence ConstraintsHans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Monika Steinová. 61-72 [doi]
- Polynomial Space Algorithms for Counting Dominating Sets and the Domatic NumberJohan M. M. van Rooij. 73-84 [doi]
- Parameterized Complexity of Even/Odd Subgraph ProblemsLeizhen Cai, Boting Yang. 85-96 [doi]
- Popular Matchings in the Marriage and Roommates ProblemsPéter Biró, Robert W. Irving, David Manlove. 97-108 [doi]
- Bounding the Number of Tolerable Faults in Majority-Based SystemsChing-Lueh Chang, Yuh-Dauh Lyuu. 109-119 [doi]
- A Parameterized Algorithm for Chordal SandwichPinar Heggernes, Federico Mancini, Jesper Nederlof, Yngve Villanger. 120-130 [doi]
- Testing Computability by Width-2 OBDDs Where the Variable Order is UnknownDana Ron, Gilad Tsur. 131-142 [doi]
- Graph Unique-Maximum and Conflict-Free ColoringsPanagiotis Cheilaris, Géza Tóth. 143-154 [doi]
- Strategic Coloring of a GraphBruno Escoffier, Laurent Gourvès, Jérôme Monnot. 155-166 [doi]
- Multicut Algorithms via Tree DecompositionsReinhard Pichler, Stefan Rümmele, Stefan Woltran. 167-179 [doi]
- The Steiner Tree Reoptimization Problem with Sharpened Triangle InequalityHans-Joachim Böckenhauer, Karin Freiermuth, Juraj Hromkovic, Tobias Mömke, Andreas Sprock, Björn Steffen. 180-191 [doi]
- Kernelization for Maximum Leaf Spanning Tree with Positive Vertex WeightsBart Jansen. 192-203 [doi]
- A Planar Linear Arboricity ConjectureMarek Cygan, Lukasz Kowalik, Borut Luzar. 204-216 [doi]
- On the Number of Higher Order Delaunay TriangulationsDieter Mitsche, Maria Saumell, Rodrigo I. Silveira. 217-228 [doi]
- How Simple Robots Benefit from Looking BackJérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer. 229-239 [doi]
- On Strategy Improvement Algorithms for Simple Stochastic GamesRahul Tripathi, Elena Valkanova, V. S. Anil Kumar. 240-251 [doi]
- Online Cooperative Cost SharingJanina A. Brenner, Guido Schäfer. 252-263 [doi]
- On the Power of Nodes of Degree Four in the Local Max-Cut ProblemBurkhard Monien, Tobias Tscheuschner. 264-275 [doi]
- Packing Bipartite Graphs with Covers of Complete Bipartite GraphsJérémie Chalopin, Daniël Paulusma. 276-287 [doi]
- Irredundant Set Faster Than ::::O::::(2:::::::n:::::::)Marek Cygan, Marcin Pilipczuk, Jakub Onufry Wojtaszczyk. 288-298 [doi]
- The Complexity of Computing Minimal Unidirectional Covering SetsDorothea Baumeister, Felix Brandt, Felix A. Fischer, Jan Hoffmann 0002, Jörg Rothe. 299-310 [doi]
- A Parameterized Route to Exact Puzzles: Breaking the 2:::::::n:::::::-Barrier for IrredundanceDaniel Binkele-Raible, Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Peter Rossmanith. 311-322 [doi]
- Finding the Maximum Suffix with Fewer ComparisonsGianni Franceschini, Torben Hagerup. 323-334 [doi]
- An Algorithmic Framework for Motif Discovery Problems in Weighted SequencesHui Zhang, Qing Guo, Costas S. Iliopoulos. 335-346 [doi]
- Capacitated Confluent Flows: Complexity and AlgorithmsDaniel Dressler, Martin Strehler. 347-358 [doi]
- Preprocessing Speed-Up Techniques Is HardReinhard Bauer, Tobias Columbus, Bastian Katz, Marcus Krug, Dorothea Wagner. 359-370 [doi]
- Communication Requirements for Stable MarriagesJen-Hou Chou, Chi-Jen Lu. 371-382 [doi]