Abstract is missing.
- An Optimal Algorithm for Tiling the Plane with a Translated PolyominoAndrew Winslow. 3-13 [doi]
- Adaptive Point Location in Planar Convex SubdivisionsSiu-Wing Cheng, Man-Kit Lau. 14-22 [doi]
- Competitive Local Routing with ConstraintsProsenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot. 23-34 [doi]
- Navigating Weighted Regions with Scattered Skinny TetrahedraSiu-Wing Cheng, Man-Kwun Chiu, Jiongxin Jin, Antoine Vigneron. 35-45 [doi]
- On the Succinct Representation of Unlabeled PermutationsHicham El-Zein, J. Ian Munro, Siwei Yang. 49-59 [doi]
- How to Select the Top k Elements from Evolving Data?Qin Huang, Xingwu Liu, Xiaoming Sun, Jialin Zhang. 60-70 [doi]
- Optimal Search Trees with 2-Way ComparisonsMarek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young. 71-82 [doi]
- Multidimensional Range SelectionTimothy M. Chan, Gelin Zhou. 83-92 [doi]
- On the Minimum Cost Range Assignment ProblemPaz Carmi, Lilach Chaitman-Yerushalmi. 95-105 [doi]
- On the Approximability of the Minimum Rainbow Subgraph Problem and Other Related ProblemsSumedh Tirodkar, Sundar Vishwanathan. 106-115 [doi]
- General Caching Is Hard: Even with Small PagesLukas Folwarczny, Jirí Sgall. 116-126 [doi]
- The Secretary Problem with a Choice FunctionYasushi Kawase. 129-139 [doi]
- The Benefit of Recombination in Noisy Evolutionary SearchTobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton. 140-150 [doi]
- Algorithmic Learning for Steganography: Proper Learning of k-term DNF Formulas from Positive SamplesMatthias Ernst, Maciej Liskiewicz, Rüdiger Reischuk. 151-162 [doi]
- Obtaining a Triangular Matrix by Independent Row-Column PermutationsGuillaume Fertin, Irena Rusu, Stéphane Vialette. 165-175 [doi]
- Many-to-one Matchings with Lower Quotas: Algorithms and ComplexityAshwin Arulselvan, Ágnes Cseh, Martin Groß, David F. Manlove, Jannik Matuschke. 176-187 [doi]
- Minimizing the Maximum Moving Cost of Interval CoverageHaitao Wang, Xiao Zhang. 188-198 [doi]
- Heuristic Time Hierarchies via Hierarchies for Sampling DistributionsDmitry Itsykson, Alexander Knop, Dmitry Sokolov. 201-211 [doi]
- Unbounded Discrepancy of Deterministic Random Walks on GridsTobias Friedrich, Maximilian Katzmann, Anton Krohmer. 212-222 [doi]
- Trading off Worst and Expected Cost in Decision Tree ProblemsAline Medeiros Saettler, Eduardo Sany Laber, Ferdinando Cicalese. 223-234 [doi]
- Sliding Token on Bipartite Permutation GraphsEli Fox-Epstein, Duc A. Hoang, Yota Otachi, Ryuhei Uehara. 237-247 [doi]
- Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-WidthPetr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve Hortemo Sæther, Yngve Villanger. 248-258 [doi]
- Minimum Degree Up to Local Complementation: Bounds, Parameterized Complexity, and Exact AlgorithmsDavid Cattanéo, Simon Perdrix. 259-270 [doi]
- Exact and FPT Algorithms for Max-Conflict Free Coloring in HypergraphsPradeesha Ashok, Aditi Dudeja, Sudeshna Kolay. 271-282 [doi]
- Geometric Matching Algorithms for Two Realistic TerrainsSang Duk Yoon, Min Gyu Kim, Wanbin Son, Hee-Kap Ahn. 285-295 [doi]
- Size-Dependent Tile Self-Assembly: Constant-Height Rectangles and StabilitySándor P. Fekete, Robert T. Schweller, Andrew Winslow. 296-306 [doi]
- The 2-Center Problem in a Simple PolygonEunjin Oh, Jean-Lou De Carufel, Hee-Kap Ahn. 307-317 [doi]
- Choice Is HardEsther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Matthew J. Katz, Joseph S. B. Mitchell, Marina Simakov. 318-328 [doi]
- Fully Dynamic Betweenness CentralityMatteo Pontecorvi, Vijaya Ramachandran. 331-342 [doi]
- When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile RobotsJurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Evangelos Kranakis, Danny Krizanc, Najmeh Taleb. 343-354 [doi]
- Cops and Robbers on String GraphsTomás Gavenciak, Przemyslaw Gordinowicz, Vít Jelínek, Pavel Klavík, Jan Kratochvíl. 355-366 [doi]
- Min-Power Covering ProblemsEric Angel, Evripidis Bampis, Vincent Chau, Alexander V. Kononov. 367-377 [doi]
- Minimizing the Diameter of a Spanning Tree for Imprecise PointsChih-Hung Liu, Sandro Montanari. 381-392 [doi]
- Model-Based Classification of TrajectoriesMaike Buchin, Stef Sijben. 393-403 [doi]
- Linear-Time Algorithms for the Farthest-Segment Voronoi Diagram and Related Tree StructuresElena Khramtcova, Evanthia Papadopoulou. 404-414 [doi]
- Unfolding Orthogonal Polyhedra with Linear RefinementYi-Jun Chang, Hsu-Chun Yen. 415-425 [doi]
- Colored Non-crossing Euclidean Steiner ForestSergey Bereg, Krzysztof Fleszar, Philipp Kindermann, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff. 429-441 [doi]
- On a Generalization of Nemhauser and Trotter's Local Optimization TheoremMingyu Xiao. 442-452 [doi]
- Approximation Algorithms in the Successive Hitting Set ModelSabine Storandt. 453-464 [doi]
- Generating Random Hyperbolic Graphs in Subquadratic TimeMoritz von Looz, Henning Meyerhenke, Roman Prutkin. 467-478 [doi]
- Provable Efficiency of Contraction Hierarchies with Randomized PreprocessingStefan Funke, Sabine Storandt. 479-490 [doi]
- Randomized Minmax Regret for Combinatorial Optimization Under UncertaintyAndrew Mastin, Patrick Jaillet, Sang Chin. 491-501 [doi]
- An Optimal Algorithm for Reconstructing Point Set Order Types from Radial OrderingsOswin Aichholzer, Vincent Kusters, Wolfgang Mulzer, Alexander Pilz, Manuel Wettstein. 505-516 [doi]
- Improved Approximation for Fréchet Distance on c-packed Curves Matching Conditional Lower BoundsKarl Bringmann, Marvin Künnemann. 517-528 [doi]
- Computing the Gromov-Hausdorff Distance for Metric TreesPankaj K. Agarwal, Kyle Fox, Abhinandan Nath, Anastasios Sidiropoulos, Yusu Wang. 529-540 [doi]
- The VC-Dimension of Visibility on the Boundary of a Simple PolygonMatt Gibson, Erik Krohn, Qing Wang. 541-551 [doi]
- Quantum Bit Commitment with Application in Quantum Zero-Knowledge Proof (Extended Abstract)Jun Yan, Jian Weng, Dongdai Lin, Yujuan Quan. 555-565 [doi]
- Effectiveness of Structural Restrictions for Hybrid CSPsVladimir Kolmogorov, Michal Rolínek, Rustem Takhanov. 566-577 [doi]
- Polynomial-Time Isomorphism Test of Groups that are Tame Extensions - (Extended Abstract)Joshua A. Grochow, Youming Qiao. 578-589 [doi]
- Quantum Algorithm for Triangle Finding in Sparse GraphsFrançois Le Gall, Shogo Nakajima. 590-600 [doi]
- On Hardness of the Joint Crossing NumberPetr Hlinený, Gelasio Salazar. 603-613 [doi]
- An O(n^ε ) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar GraphsDiptarka Chakraborty, Raghunath Tewari. 614-624 [doi]
- Constant Query Time (1+\epsilon ) -Approximate Distance Oracle for Planar GraphsQian-Ping Gu, Gengchun Xu. 625-636 [doi]
- Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable RegionsMartin Nöllenburg, Roman Prutkin, Ignaz Rutter. 637-649 [doi]
- A New Approximate Min-Max Theorem with Applications in CryptographyMaciej Skórski. 653-663 [doi]
- Give Me Another One!Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer. 664-676 [doi]
- On the Complexity of Computing Prime TablesMartin Farach-Colton, Meng-Tsung Tsai. 677-688 [doi]
- Game Values and Computational Complexity: An Analysis via Black-White Combinatorial GamesStephen A. Fenner, Daniel Grier, Jochen Messner, Luke Schaeffer, Thomas Thierauf. 689-699 [doi]
- Run Generation Revisited: What Goes Up May or May Not Come DownMichael A. Bender, Samuel McCauley, Andrew McGregor, Shikha Singh 0002, Hoa T. Vu. 703-714 [doi]
- Streaming Verification in Data AnalysisSamira Daruki, Justin Thaler, Suresh Venkatasubramanian. 715-726 [doi]
- All-Around Near-Optimal Solutions for the Online Bin Packing ProblemShahin Kamali, Alejandro López-Ortiz. 727-739 [doi]
- Serving Online Requests with Mobile ServersAbdolhamid Ghodselahi, Fabian Kuhn. 740-751 [doi]
- An In-place Framework for Exact and Approximate Shortest Unique Substring QueriesWing-Kai Hon, Sharma V. Thankachan, Bojian Xu. 755-767 [doi]
- Inferring Strings from Full Abelian PeriodsMakoto Nishida, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. 768-779 [doi]
- Toehold DNA Languages are Regular (Extended Abstract)Sebastian Brandt, Nicolas Mattia, Jochen Seidel, Roger Wattenhofer. 780-790 [doi]