Abstract is missing.
- I/O-Efficient Range Minima QueriesPeyman Afshani, Nodari Sitchinava. 1-12 [doi]
- Online Makespan Minimization with Parallel SchedulesSusanne Albers, Matthias Hellwig. 13-25 [doi]
- Expected Linear Time Sorting for Word Size Ω(log2 n loglogn)Djamal Belazzougui, Gerth Stølting Brodal, Jesper Sindahl Nielsen. 26-37 [doi]
- Amortized Analysis of Smooth Quadtrees in All DimensionsHuck Bennett, Chee Yap. 38-49 [doi]
- New Approximability Results for the Robust k-Median ProblemSayan Bhattacharya, Parinya Chalermsook, Kurt Mehlhorn, Adrian Neumann. 50-61 [doi]
- Trees and Co-trees with Bounded Degrees in Planar 3-connected GraphsTherese C. Biedl. 62-73 [doi]
- Approximating the Revenue Maximization Problem with Sharp DemandsVittorio Bilò, Michele Flammini, Gianpiero Monaco. 74-85 [doi]
- Reconfiguring Independent Sets in Claw-Free GraphsPaul Bonsma, Marcin Kaminski, Marcin Wrochna. 86-97 [doi]
- Competitive Online Routing on Delaunay TriangulationsProsenjit Bose, Jean-Lou De Carufel, Stephane Durocher, Perouz Taslakian. 98-109 [doi]
- Optimal Planar Orthogonal Skyline Counting QueriesGerth Stølting Brodal, Kasper Green Larsen. 110-121 [doi]
- B-slack Trees: Space Efficient B-TreesTrevor Brown. 122-133 [doi]
- Approximately Minwise Independence with Twisted TabulationSøren Dahlgaard, Mikkel Thorup. 134-145 [doi]
- Separability of Imprecise PointsMark de Berg, Ali D. Mehrabi, Farnaz Sheikhi. 146-157 [doi]
- Line-Distortion, Bandwidth and Path-Length of a GraphFeodor F. Dragan, Ekkehard Köhler, Arne Leitert. 158-169 [doi]
- Colorful Bin PackingGyörgy Dósa, Leah Epstein. 170-181 [doi]
- Algorithms Parameterized by Vertex Cover and Modular Width, through Potential Maximal CliquesFedor V. Fomin, Mathieu Liedloff, Pedro Montealegre-Barba, Ioan Todinca. 182-193 [doi]
- Win-Win Kernelization for Degree Sequence Completion ProblemsVincent Froese, André Nichterlein, Rolf Niedermeier. 194-205 [doi]
- On Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 3-Edge Dominating Set ProblemToshihiro Fujito. 206-216 [doi]
- Covering Problems in Edge- and Node-Weighted GraphsTakuro Fukunaga. 217-228 [doi]
- Colored Range Searching in Linear SpaceRoberto Grossi, Søren Vind. 229-240 [doi]
- Fast Dynamic Graph Algorithms for Parameterized ProblemsYoichi Iwata, Keigo Oka. 241-252 [doi]
- Extending Partial Representations of Proper and Unit Interval GraphsPavel Klavík, Jan Kratochvíl, Yota Otachi, Ignaz Rutter, Toshiki Saitoh, Maria Saumell, Tomás Vyskocil. 253-264 [doi]
- Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler DiagramsBoris Klemz, Tamara Mchedlidze, Martin Nöllenburg. 265-276 [doi]
- Additive Spanners: A Simple ConstructionMathias Bæk Tejs Knudsen. 277-281 [doi]
- Assigning Channels via the Meet-in-the-Middle ApproachLukasz Kowalik, Arkadiusz Socala. 282-293 [doi]
- Consistent Subset SamplingKonstantin Kutzkov, Rasmus Pagh. 294-305 [doi]
- Triangle Counting in Dynamic Graph StreamsKonstantin Kutzkov, Rasmus Pagh. 306-318 [doi]
- Linear Time LexDFS on Cocomparability GraphsEkkehard Köhler, Lalla Mouatadid. 319-330 [doi]
- Quantum Algorithms for Matrix Products over SemiringsFrançois Le Gall, Harumichi Nishimura. 331-343 [doi]
- Ranked Document SelectionJ. Ian Munro, Gonzalo Navarro, Rahul Shah, Sharma V. Thankachan. 344-356 [doi]
- Approximation Algorithms for Hitting Triangle-Free Sets of Line SegmentsAnup Joshi, N. S. Narayanaswamy. 357-367 [doi]
- Reduction Techniques for Graph Isomorphism in the Context of Width ParametersYota Otachi, Pascal Schweitzer. 368-379 [doi]
- Approximate Counting of Matchings in (3, 3)-HypergraphsAndrzej Dudek, Marek Karpinski, Andrzej Rucinski 0001, Edyta Szymanska. 380-391 [doi]