Abstract is missing.
- Piecewise-Linear Approximations of Uncertain FunctionsMohammad Ali Abam, Mark de Berg, AmirAli Khosravi. 1-12 [doi]
- A Constant Factor Approximation Algorithm for Boxicity of Circular Arc GraphsAbhijin Adiga, Jasine Babu, L. Sunil Chandran. 13-24 [doi]
- On the Area Requirements of Euclidean Minimum Spanning TreesPatrizio Angelini, Till Bruckdorfer, Marco Chiesa, Fabrizio Frati, Michael Kaufmann, Claudio Squarcella. 25-36 [doi]
- Multi-target Ray Searching ProblemsSpyros Angelopoulos, Alejandro López-Ortiz, Konstantinos Panagiotou. 37-48 [doi]
- Convex TransversalsEsther M. Arkin, Claudia Dieckmann, Christian Knauer, Joseph S. B. Mitchell, Valentin Polishchuk, Lena Schlipf, Shang Yang. 49-60 [doi]
- How to Cover a Point Set with a V-Shape of Minimum WidthBoris Aronov, Muriel Dulieu. 61-72 [doi]
- Witness Rectangle GraphsBoris Aronov, Muriel Dulieu, Ferran Hurtado. 73-85 [doi]
- Faster Optimal Algorithms for Segment Minimization with Small Maximal ValueTherese C. Biedl, Stephane Durocher, Céline Engelbeen, Samuel Fiorini, Maxwell Young. 86-97 [doi]
- Orthogonal Cartograms with Few Corners Per FaceTherese C. Biedl, Lesvia Elena Ruiz Velázquez. 98-109 [doi]
- Smoothed Analysis of Partitioning Algorithms for Euclidean FunctionalsMarkus Bläser, Bodo Manthey, B. V. Raghavendra Rao. 110-121 [doi]
- Feedback Vertex Set in Mixed GraphsPaul Bonsma, Daniel Lokshtanov. 122-133 [doi]
- Switching to Directional Antennas with Constant Increase in Radius and Hop DistanceProsenjit Bose, Paz Carmi, Mirela Damian, Robin Y. Flatland, Matthew J. Katz, Anil Maheshwari. 134-146 [doi]
- Frequency Capping in Online AdvertisingNiv Buchbinder, Moran Feldman, Arpita Ghosh, Joseph Naor. 147-158 [doi]
- Adjacency-Preserving Spatial TreemapsKevin Buchin, David Eppstein, Maarten Löffler, Martin Nöllenburg, Rodrigo I. Silveira. 159-170 [doi]
- Register Loading via Linear ProgrammingGruia Calinescu, Minming Li. 171-182 [doi]
- Connecting a Set of Circles with Minimum Sum of RadiiErin W. Chambers, Sándor P. Fekete, Hella-Franziska Hoffmann, Dimitri Marinakis, Joseph S. B. Mitchell, Venkatesh Srinivasan, Ulrike Stege, Sue Whitesides. 183-194 [doi]
- Streaming and Dynamic Algorithms for Minimum Enclosing Balls in High DimensionsTimothy M. Chan, Vinayak Pathak. 195-206 [doi]
- New Algorithms for 1-D Facility Location and Path Equipartition ProblemsDanny Z. Chen, Haitao Wang. 207-218 [doi]
- Multicut in Trees Viewed through the Eyes of Vertex CoverJianer Chen, Jia-Hao Fan, Iyad A. Kanj, Yang Liu, Fenghui Zhang. 219-230 [doi]
- Beyond Triangulation: Covering Polygons with TrianglesTobias Christ. 231-242 [doi]
- Lossless Fault-Tolerant Data Structures with Additive OverheadPaul Christiano, Erik D. Demaine, Shaunak Kishore. 243-254 [doi]
- Binary Identification Problems for Weighted TreesFerdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Caio Dias Valentim. 255-266 [doi]
- Computing the Fréchet Distance between Folded PolygonsAtlas F. Cook, Anne Driemel, Sariel Har-Peled, Jessica Sherette, Carola Wenk. 267-278 [doi]
- Parameterized Reductions and Algorithms for Another Vertex Cover GeneralizationPeter Damaschke, Leonid Molokov. 279-289 [doi]
- Path Minima Queries in Dynamic Weighted TreesGerth Stølting Brodal, Pooya Davoodi, S. Srinivasa Rao. 290-301 [doi]
- On Rectilinear Partitions with Minimum Stabbing NumberMark de Berg, AmirAli Khosravi, Sander Verdonschot, Vincent van der Weele. 302-313 [doi]
- Flattening Fixed-Angle Chains Is Strongly NP-HardErik D. Demaine, Sarah Eisenstat. 314-325 [doi]
- An O(n log n) Algorithm for a Load Balancing Problem on PathsNikhil R. Devanur, Uriel Feige. 326-337 [doi]
- Fully-Dynamic Hierarchical Graph Clustering Using Cut TreesChristof Doll, Tanja Hartmann, Dorothea Wagner. 338-349 [doi]
- Flow Computations on Imprecise TerrainsAnne Driemel, Herman J. Haverkort, Maarten Löffler, Rodrigo I. Silveira. 350-361 [doi]
- Tracking Moving Objects with Few HandoversDavid Eppstein, Michael T. Goodrich, Maarten Löffler. 362-373 [doi]
- Inducing the LCP-ArrayJohannes Fischer. 374-385 [doi]
- Horoball Hulls and Extents in Positive Definite SpaceP. Thomas Fletcher, John Moeller, Jeff M. Phillips, Suresh Venkatasubramanian. 386-398 [doi]
- Enumerating Minimal Subset Feedback Vertex SetsFedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger. 399-410 [doi]
- Upper Bounds for Maximally Greedy Binary Search TreesKyle Fox. 411-422 [doi]
- On the Matter of Dynamic Optimality in an Extended Model for Tree Access OperationsMichael L. Fredman. 423-437 [doi]
- Resilient and Low Stretch Routing through Embedding into Tree MetricsJie Gao, Dengpan Zhou. 438-450 [doi]
- Consistent Labeling of Rotating MapsAndreas Gemsa, Martin Nöllenburg, Ignaz Rutter. 451-462 [doi]
- Finding Longest Approximate Periodic PatternsBeat Gfeller. 463-474 [doi]
- A (5/3 + ε)-Approximation for Strip PackingRolf Harren, Klaus Jansen, Lars Prädel, Rob van Stee. 475-487 [doi]
- Reversing Longest Previous Factor Tables is HardJing He, Hongyu Liang, Guang Yang. 488-499 [doi]
- Space Efficient Data Structures for Dynamic Orthogonal Range CountingMeng He, J. Ian Munro. 500-511 [doi]
- Searching in Dynamic Tree-Like Partial OrdersBrent Heeringa, Marius Catalin Iordan, Louis Theran. 512-523 [doi]
- Counting Plane Graphs: Flippability and Its ApplicationsMichael Hoffmann, Micha Sharir, Adam Sheffer, Csaba D. Tóth, Emo Welzl. 524-535 [doi]
- Closest Pair and the Post Office Problem for Stochastic PointsPegah Kamousi, Timothy M. Chan, Subhash Suri. 548-559 [doi]
- Competitive Search in Symmetric TreesDavid G. Kirkpatrick, Sandra Zilles. 560-570 [doi]
- Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter · n log n) TimePhilip N. Klein, Shay Mozes. 571-582 [doi]
- Planar Subgraphs without Low-Degree NodesEvangelos Kranakis, Oscar Morales Ponce, Jukka Suomela. 583-594 [doi]
- Constructing Orthogonal de Bruijn SequencesYaw-Ling Lin, Charles B. Ward, Bharat Jain, Steven Skiena. 595-606 [doi]
- Succinct 2D Dictionary Matching with No SlowdownShoshana Neuburger, Dina Sokol. 619-630 [doi]
- PTAS for Densest k-Subgraph in Interval GraphsTim Nonner. 631-641 [doi]
- Improved Distance Queries in Planar GraphsYahav Nussbaum. 642-653 [doi]
- Piercing Quasi-Rectangles: On a Problem of Danzer and RogersJános Pach, Gábor Tardos. 654 [doi]
- Faster Algorithms for Minimum-Link Paths with Restricted OrientationsValentin Polishchuk, Mikko Sysikaski. 655-666 [doi]
- Streaming Algorithms for 2-Coloring Uniform HypergraphsJaikumar Radhakrishnan, Saswata Shannigrahi. 667-678 [doi]
- Density-Constrained Graph ClusteringRobert Görke, Andrea Schumm, Dorothea Wagner. 679-690 [doi]
- The MST of Symmetric Disk Graphs (in Arbitrary Metric Spaces) is LightShay Solomon. 691-702 [doi]
- Theory vs. Practice in the Design and Analysis of AlgorithmsRobert Endre Tarjan. 703 [doi]
- A Fully Polynomial Approximation Scheme for a Knapsack Problem with a Minimum Filling ConstraintZhou Xu, Xiaofan Lai. 704-715 [doi]