Abstract is missing.
- α-VisibilityMohammad Ghodsi, Anil Maheshwari, Mostafa Nouri, Jörg-Rüdiger Sack, Hamid Zarrabi-Zadeh. 1-12 [doi]
- Partial Matching between Surfaces Using Fréchet DistanceJessica Sherette, Carola Wenk. 13-23 [doi]
- A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit SquaresTakehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno. 24-35 [doi]
- Watchman Routes for Lines and SegmentsAdrian Dumitrescu, Joseph S. B. Mitchell, Pawel Zylinski. 36-47 [doi]
- Kinetic Pie Delaunay Graph and Its ApplicationsMohammad Ali Abam, Zahed Rahmati, Alireza Zarei. 48-58 [doi]
- Higher Order City Voronoi DiagramsAndreas Gemsa, D. T. Lee, Chih-Hung Liu, Dorothea Wagner. 59-70 [doi]
- On Minimum Sum of Radii and Diameters ClusteringBabak Behsaz, Mohammad R. Salavatipour. 71-82 [doi]
- A Simple Framework for the Generalized Nearest Neighbor ProblemTomas Hruz, Marcel Schöngens. 83-94 [doi]
- Deterministic Parameterized Connected Vertex CoverMarek Cygan. 95-106 [doi]
- Faster Parameterized Algorithms for Deletion to Split GraphsEsha Ghosh, Sudeshna Kolay, Mrinal Kumar, Pranabendu Misra, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan. 107-118 [doi]
- A Single-Exponential FPT Algorithm for the K 4-Minor Cover ProblemEun Jung Kim 0002, Christophe Paul, Geevarghese Philip. 119-130 [doi]
- An O(n 3 loglogn/log2 n) Time Algorithm for All Pairs Shortest PathsYijie Han, Tadao Takaoka. 131-141 [doi]
- Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced PathsAistis Atminas, Vadim V. Lozin, Igor Razgon. 142-152 [doi]
- Induced Disjoint Paths in AT-Free GraphsPetr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen. 153-164 [doi]
- Effective Computation of Immersion Obstructions for Unions of Graph ClassesArchontia C. Giannopoulou, Iosif Salem, Dimitris Zoros. 165-176 [doi]
- Algorithms on Minimizing the Maximum Sensor Movement for Barrier Coverage of a Linear DomainDanny Z. Chen, Yan Gu, Jian Li, Haitao Wang. 177-188 [doi]
- Annotating Simplices with a Homology Basis and Its ApplicationsOleksiy Busaryev, Sergio Cabello, Chao Chen, Tamal K. Dey, Yusu Wang. 189-200 [doi]
- Do Directional Antennas Facilitate in Reducing Interferences?Rom Aschner, Matthew J. Katz, Gila Morgenstern. 201-212 [doi]
- Minimum Convex Partitions and Maximum Empty PolytopesAdrian Dumitrescu, Sariel Har-Peled, Csaba D. Tóth. 213-224 [doi]
- A Probabilistic Analysis of Christofides' AlgorithmMarkus Bläser, Konstantinos Panagiotou, B. V. Raghavendra Rao. 225-236 [doi]
- New Approximation Algorithms for the Unsplittable Capacitated Facility Location ProblemBabak Behsaz, Mohammad R. Salavatipour, Zoya Svitkina. 237-248 [doi]
- Non-preemptive Speed ScalingAntonios Antoniadis, Chien-Chung Huang. 249-260 [doi]
- A Fast Algorithm for Permutation Pattern Matching Based on Alternating RunsMarie-Louise Bruner, Martin Lackner. 261-270 [doi]
- Sorted Range ReportingYakov Nekrich, Gonzalo Navarro. 271-282 [doi]
- String Indexing for Patterns with WildcardsPhilip Bille, Inge Li Gørtz, Hjalte Wedel Vildhøj, Søren Vind. 283-294 [doi]
- Linear-Space Data Structures for Range Minority Query in ArraysTimothy M. Chan, Stephane Durocher, Matthew Skala, Bryan T. Wilkinson. 295-306 [doi]
- Asynchronous Rumor Spreading in Preferential Attachment GraphsBenjamin Doerr, Mahmoud Fouz, Tobias Friedrich. 307-315 [doi]
- Connectivity Oracles for Planar GraphsGlencora Borradaile, Seth Pettie, Christian Wulff-Nilsen. 316-327 [doi]
- Access Graphs Results for LRU versus FIFO under Relative Worst Order AnalysisJoan Boyar, Sushmita Gupta, Kim S. Larsen. 328-339 [doi]
- Competitive Analysis of Maintaining Frequent Items of a StreamYiannis Giannakopoulos, Elias Koutsoupias. 340-351 [doi]
- Kernel Bounds for Structural Parameterizations of PathwidthHans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch. 352-363 [doi]
- Kernel Lower Bounds Using Co-nondeterminism: Finding Induced Hereditary SubgraphsStefan Kratsch, Marcin Pilipczuk, Ashutosh Rai, Venkatesh Raman. 364-375 [doi]
- Testing Formula SatisfactionEldar Fischer, Yonatan Goldhirsh, Oded Lachish. 376-387 [doi]
- Reconstructing Strings from Substrings with Quantum QueriesRichard Cleve, Kazuo Iwama, François Le Gall, Harumichi Nishimura, Seiichiro Tani, Junichi Teruyama, Shigeru Yamashita. 388-397 [doi]