Abstract is missing.
- On Maximum Weight Objects Decomposable into Based Rectilinear Convex ObjectsMahmuda Ahmed, Iffat Chowdhury, Matt Gibson, Mohammad Shahedul Islam, Jessica Sherrette. 1-12 [doi]
- Bundling Three Convex Polygons to Minimize Area or PerimeterHee-Kap Ahn, Helmut Alt, Sang Won Bae, Dongwoo Park. 13-24 [doi]
- Smart-Grid Electricity Allocation via Strip Packing with SlicingSoroush Alamdari, Therese C. Biedl, Timothy M. Chan, Elyot Grant, Krishnam Raju Jampani, Srinivasan Keshav, Anna Lubiw, Vinayak Pathak. 25-36 [doi]
- On (Dynamic) Range Minimum Queries in External MemoryLars Arge, Johannes Fischer, Peter Sanders, Nodari Sitchinava. 37-48 [doi]
- Distance-Sensitive Planar Point LocationBoris Aronov, Mark de Berg, Marcel Roeloffzen, Bettina Speckmann. 49-60 [doi]
- Time-Space Tradeoffs for All-Nearest-Larger-Neighbors ProblemsTetsuo Asano, David G. Kirkpatrick. 61-72 [doi]
- Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless RectanglesAndrei Asinowski, Jean Cardinal, Nathann Cohen, Sébastien Collette, Thomas Hackl, Michael Hoffmann, Kolja B. Knauer, Stefan Langerman, Michal Lason, Piotr Micek, Günter Rote, Torsten Ueckerdt. 73-84 [doi]
- Socially Stable Matchings in the Hospitals/Residents ProblemGeorgios Askalidis, Nicole Immorlica, Augustine Kwanashie, David Manlove, Emmanouil Pountourakis. 85-96 [doi]
- Parameterized Complexity of 1-PlanarityMichael J. Bannister, Sergio Cabello, David Eppstein. 97-108 [doi]
- On the Stretch Factor of the Theta-4 GraphLuis Barba, Prosenjit Bose, Jean-Lou De Carufel, André van Renssen, Sander Verdonschot. 109-120 [doi]
- Better Space Bounds for Parameterized Range Majority and MinorityDjamal Belazzougui, Travis Gagie, Gonzalo Navarro. 121-132 [doi]
- Online Control Message Aggregation in Chain NetworksMarcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Lukasz Jez, Jiri Sgall, Grzegorz Stachowiak. 133-145 [doi]
- Fingerprints in Compressed StringsPhilip Bille, Patrick Hagge Cording, Inge Li Gørtz, Benjamin Sach, Hjalte Wedel Vildhøj, Søren Vind. 146-157 [doi]
- Beacon-Based Algorithms for Geometric RoutingMichael Biro, Justin Iwerks, Irina Kostitsyna, Joseph S. B. Mitchell. 158-169 [doi]
- Interval Selection with Machine-Dependent IntervalsKaterina Böhmová, Yann Disser, Matús Mihalák, Peter Widmayer. 170-181 [doi]
- On the Spanning Ratio of Theta-GraphsProsenjit Bose, André van Renssen, Sander Verdonschot. 182-194 [doi]
- Relative Interval Analysis of Paging Algorithms on Access GraphsJoan Boyar, Sushmita Gupta, Kim S. Larsen. 195-206 [doi]
- On Explaining Integer Vectors by Few Homogenous SegmentsRobert Bredereck, Jiehua Chen, Sepp Hartung, Christian Komusiewicz, Rolf Niedermeier, Ondrej Suchý. 207-218 [doi]
- Trajectory Grouping StructureKevin Buchin, Maike Buchin, Marc J. van Kreveld, Bettina Speckmann, Frank Staals. 219-230 [doi]
- The Art of Shaving LogsTimothy M. Chan. 231 [doi]
- Treewidth and Pathwidth Parameterized by the Vertex Cover NumberMathieu Chapelle, Mathieu Liedloff, Ioan Todinca, Yngve Villanger. 232-243 [doi]
- Visibility and Ray Shooting Queries in Polygonal DomainsDanny Z. Chen, Haitao Wang. 244-255 [doi]
- Lift-and-Project Methods for Set Cover and KnapsackEden Chlamtac, Zachary Friggstad, Konstantinos Georgiou. 256-267 [doi]
- Optimal Time-Convex Hull under the L p MetricsBang-Sin Dai, Mong-Jen Kao, D. T. Lee. 268-279 [doi]
- Blame TreesErik D. Demaine, Pavel Panchekha, David A. Wilson, Edward Z. Yang. 280-290 [doi]
- Plane 3-trees: Embeddability and Approximation - (Extended Abstract)Stephane Durocher, Debajyoti Mondal. 291-303 [doi]
- A Dynamic Data Structure for Counting Subgraphs in Sparse GraphsZdenek Dvorak, Vojtech Tuma. 304-315 [doi]
- Combinatorial Pair Testing: Distinguishing Workers from SlackersDavid Eppstein, Michael T. Goodrich, Daniel S. Hirschberg. 316-327 [doi]
- Approximation Algorithms for B 1-EPG GraphsDror Epstein, Martin Charles Golumbic, Gila Morgenstern. 328-340 [doi]
- Universal Point Sets for Planar Three-TreesRadoslav Fulek, Csaba D. Tóth. 341-352 [doi]
- Planar Packing of Binary TreesMarkus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, Csaba D. Tóth. 353-364 [doi]
- Hierarchies of Predominantly Connected CommunitiesMichael Hamann, Tanja Hartmann, Dorothea Wagner. 365-377 [doi]
- Joint Cache Partition and Job Assignment on Multi-core ProcessorsAvinatan Hassidim, Haim Kaplan, Omry Tuval. 378-389 [doi]
- Finding the Minimum-Weight k-PathAvinatan Hassidim, Orgad Keller, Moshe Lewenstein, Liam Roditty. 390-401 [doi]
- Compressed Persistent Index for Efficient Rank/Select QueriesWing-Kai Hon, Lap-Kei Lee, Kunihiko Sadakane, Konstantinos Tsakalidis. 402-414 [doi]
- Tight Bounds for Low Dimensional Star Stencils in the External Memory ModelPhilipp Hupp, Riko Jacob. 415-426 [doi]
- Neighborhood-Preserving Mapping between TreesJan Baumbach, Jiong Guo, Rashid Ibragimov. 427-438 [doi]
- Bounding the Running Time of Algorithms for Scheduling and Packing ProblemsKlaus Jansen, Felix Land, Kati Land. 439-450 [doi]
- When Is Weighted Satisfiability FPT?Iyad A. Kanj, Ge Xia. 451-462 [doi]
- Two-Sided Boundary Labeling with Adjacent SidesPhilipp Kindermann, Benjamin Niedermann, Ignaz Rutter, Marcus Schaefer, André Schulz, Alexander Wolff. 463-474 [doi]
- Optimal Batch Schedules for Parallel MachinesFrederic Koehler, Samir Khuller. 475-486 [doi]
- Unions of Onions: Preprocessing Imprecise Points for Fast Onion Layer DecompositionMaarten Löffler, Wolfgang Mulzer. 487-498 [doi]
- Dynamic Planar Point Location with Sub-logarithmic Local UpdatesMaarten Löffler, Joseph A. Simons, Darren Strash. 499-511 [doi]
- Parameterized Enumeration of (Locally-) Optimal AggregationsNaomi Nishimura, Narges Simjour. 512-523 [doi]
- MapReduce AlgorithmicsSergei Vassilvitskii. 524 [doi]
- The Greedy Gray Code AlgorithmAaron Williams. 525-536 [doi]