Abstract is missing.
- st-Paths with Minimum Activation CostHasna Mohsen Alqahtani, Thomas Erlebach. 1-12 [doi]
- Parameterized Complexity and Kernel Bounds for Hard Planning ProblemsChrister Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider. 13-24 [doi]
- Selfish Resource Allocation in Optical NetworksEvangelos Bampas, Aris Pagourtzis, George Pierrakos, Vasilis Syrgkanis. 25-36 [doi]
- Average Optimal String Matching in Packed StringsDjamal Belazzougui, Mathieu Raffinot. 37-48 [doi]
- Parameterized Complexity of DAG PartitioningRené van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý. 49-60 [doi]
- Four Measures of NonlinearityJoan Boyar, Magnus Find, René Peralta. 61-72 [doi]
- On the Characterization of Plane Bus GraphsTill Bruckdorfer, Stefan Felsner, Michael Kaufmann. 73-84 [doi]
- Online Multi-dimensional Dynamic Bin Packing of Unit-Fraction ItemsMihai Burcea, Prudence W. H. Wong, Fencol C. C. Yung. 85-96 [doi]
- A Greedy Approximation Algorithm for Minimum-Gap SchedulingMarek Chrobak, Uriel Feige, Mohammad Taghi Hajiaghayi, Sanjeev Khanna, Fei Li, Seffi Naor. 97-109 [doi]
- Exponential Complexity of Satisfiability Testing for Linear-Size Boolean FormulasEvgeny Dantsin, Alexander Wolpert. 110-121 [doi]
- Linear Time Distributed Swap Edge AlgorithmsAjoy Kumar Datta, Lawrence L. Larmore, Linda Pagli, Giuseppe Prencipe. 122-133 [doi]
- Decentralized Throughput SchedulingJasper de Jong, Marc Uetz, Andreas Wombacher. 134-145 [doi]
- New Results on Stabbing Segments with a PolygonJosé Miguel Díaz-Báñez, Matias Korman, Pablo Pérez-Lantero, Alexander Pilz, Carlos Seara, Rodrigo I. Silveira. 146-157 [doi]
- k -Bound on the Price of Stability in Undirected Shapley Network Design GamesYann Disser, Andreas Emil Feldmann, Max Klimm, Matús Mihalák. 158-169 [doi]
- Complexity of Barrier Coverage with Relocatable Sensors in the PlaneStefan Dobrev, Stephane Durocher, Mohsen Eftekhari Hesari, Konstantinos Georgiou, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende, Jorge Urrutia. 170-182 [doi]
- NEXP-Hard with Many Hard InstancesShlomi Dolev, Nova Fandina, Dan Gutfreund. 183-196 [doi]
- Money-Based Coordination of Network PacketsPavlos S. Efraimidis, Remous-Aris Koutsiamanis. 197-208 [doi]
- Truthful Many-to-Many Assignment with Private WeightsBruno Escoffier, Jérôme Monnot, Fanny Pascual, Olivier Spanjaard. 209-220 [doi]
- Competitive Online Clique ClusteringAleksander Fabijan, Bengt J. Nilsson, Mia Persson. 221-233 [doi]
- Optimal Network Decontamination with Threshold ImmunityPaola Flocchini, Fabrizio Luccio, Linda Pagli, Nicola Santoro. 234-245 [doi]
- Finding All Convex Cuts of a Plane Graph in Cubic TimeRoland Glantz, Henning Meyerhenke. 246-263 [doi]
- Shortest Paths with Bundles and Non-additive Weights Is HardPaul W. Goldberg, Antony McCabe. 264-275 [doi]
- Cliques and ClubsPetr A. Golovach, Pinar Heggernes, Dieter Kratsch, Arash Rafiey. 276-287 [doi]
- List Coloring in the Absence of Two SubgraphsPetr A. Golovach, Daniël Paulusma. 288-299 [doi]
- Query Complexity of MatroidsRaghav Kulkarni, Miklos Santha. 300-311 [doi]
- A New Dynamic Graph Structure for Large-Scale Transportation NetworksGeorgia Mali, Panagiotis Michail, Andreas Paraskevopoulos, Christos D. Zaroliagis. 312-323 [doi]
- Capacitated Rank-Maximal MatchingsKatarzyna E. Paluch. 324-335 [doi]
- A Faster CREW PRAM Algorithm for Computing Cartesian TreesChung Keung Poon, Hao Yuan. 336-344 [doi]
- Advice Complexity of the Online Coloring ProblemSebastian Seibert, Andreas Sprock, Walter Unger. 345-357 [doi]
- Sparse Linear Complementarity ProblemsHanna Sumita, Naonori Kakimura, Kazuhisa Makino. 358-369 [doi]
- LP-Rounding Algorithms for the Fault-Tolerant Facility Placement ProblemLi Yan, Marek Chrobak. 370-381 [doi]