Abstract is missing.
- Improved Approximation Algorithms for Stochastic MatchingMarek Adamczyk, Fabrizio Grandoni, Joydeep Mukherjee. 1-12 [doi]
- Sorting and Permuting without Bank Conflicts on GPUsPeyman Afshani, Nodari Sitchinava. 13-24 [doi]
- Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex PolygonsHelmut Alt, Mark de Berg, Christian Knauer. 25-34 [doi]
- Primal-Dual and Dual-Fitting Analysis of Online Scheduling Algorithms for Generalized Flow Time ProblemsSpyros Angelopoulos 0001, Giorgio Lucarelli, Nguyen Kim Thang. 35-46 [doi]
- Buffer Management for Packets with Processing TimesYossi Azar, Oren Gilon. 47-58 [doi]
- A Triplet-Based Exact Method for the Shift Minimisation Personnel Task Scheduling ProblemDavaatseren Baatar, Mohan Krishnamoorthy, Andreas T. Ernst. 59-70 [doi]
- Exact Minkowski Sums of Polygons With HolesAlon Baram, Efi Fogel, Dan Halperin, Michael Hemmer, Sebastian Morr. 71-82 [doi]
- λ > 4Gill Barequet, Günter Rote, Mira Shalah. 83-94 [doi]
- Revenue Maximization for Selling Multiple Correlated ItemsMohammadHossein Bateni, Sina Dehghani, MohammadTaghi Hajiaghayi, Saeed Seddighin. 95-105 [doi]
- Efficient Implementation of a Synchronous Parallel Push-Relabel AlgorithmNiklas Baumstark, Guy E. Blelloch, Julian Shun. 106-117 [doi]
- Towards Tight Lower Bounds for Scheduling ProblemsAbbas Bazzi, Ashkan Norouzi-Fard. 118-129 [doi]
- 1-Planar Graphs have Constant Book ThicknessMichael A. Bekos, Till Bruckdorfer, Michael Kaufmann 0001, Chrysanthi N. Raftopoulou. 130-141 [doi]
- Access, Rank, and Select in Grammar-compressed StringsDjamal Belazzougui, Patrick Hagge Cording, Simon J. Puglisi, Yasuo Tabei. 142-154 [doi]
- Fully-Dynamic Approximation of Betweenness CentralityElisabetta Bergamini, Henning Meyerhenke. 155-166 [doi]
- Improved Purely Additive Fault-Tolerant SpannersDavide Bilò, Fabrizio Grandoni, Luciano Gualà, Stefano Leucci 0001, Guido Proietti. 167-178 [doi]
- Subexponential Time Algorithms for Finding Small Tree and Path DecompositionsHans L. Bodlaender, Jesper Nederlof. 179-190 [doi]
- Enumeration of 2-Level PolytopesAdam Bohn, Yuri Faenza, Samuel Fiorini, Vissarion Fisikopoulos, Marco Macchia, Kanstantsin Pashkovich. 191-202 [doi]
- Upper and Lower Bounds for Online Routing on Delaunay TriangulationsNicolas Bonichon, Prosenjit Bose, Jean-Lou De Carufel, Ljubomir Perkovic, André van Renssen. 203-214 [doi]
- On Computing the Hyperbolicity of Real-World GraphsMichele Borassi, David Coudert, Pierluigi Crescenzi, Andrea Marino. 215-226 [doi]
- Towards Single Face Shortest Vertex-Disjoint Paths in Undirected Planar GraphsGlencora Borradaile, Amir Nayyeri, Farzad Zafarani. 227-238 [doi]
- Consensus Patterns (Probably) Has no EPTASChristina Boucher, Christine Lo, Daniel Lokshantov. 239-250 [doi]
- Fast Quasi-Threshold EditingUlrik Brandes, Michael Hamann, Ben Strasser, Dorothea Wagner. 251-262 [doi]
- Sublinear Estimation of Weighted Matchings in Dynamic Data StreamsMarc Bury, Chris Schwiegelshohn. 263-274 [doi]
- An Improved Approximation Algorithm for Knapsack Median Using SparsificationJaroslaw Byrka, Thomas Pensyl, Bartosz Rybicki, Joachim Spoerhase, Aravind Srinivasan, Khoa Trinh. 275-287 [doi]
- Output-Sensitive Algorithms for Enumerating the Extreme Nondominated Points of Multiobjective Combinatorial Optimization ProblemsFritz Bökler, Petra Mutzel. 288-299 [doi]
- Self-Adjusting Binary Search Trees: What Makes Them Tick?Parinya Chalermsook, Mayank Goswami, László Kozma 0002, Kurt Mehlhorn, Thatchaphol Saranurak. 300-312 [doi]
- On Element-Connectivity Preserving Graph SimplificationChandra Chekuri, Thapanapong Rukkanchanunt, Chao Xu. 313-324 [doi]
- On Randomized Algorithms for Matching in the Online Preemptive ModelAshish Chiplunkar, Sumedh Tirodkar, Sundar Vishwanathan. 325-336 [doi]
- A Characterization of Consistent Digital Line Segments in ℤ2Iffat Chowdhury, Matt Gibson. 337-348 [doi]
- On the Efficiency of All-Pay MechanismsGeorge Christodoulou 0001, Alkmini Sgouritsa, Bo Tang. 349-360 [doi]
- Dictionary Matching in a StreamRaphaël Clifford, Allyx Fontaine, Ely Porat, Benjamin Sach, Tatiana A. Starikovskaya. 361-372 [doi]
- Multicuts in Planar and Bounded-Genus Graphs with Bounded Number of TerminalsÉric Colin de Verdière. 373-385 [doi]
- A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a SurfaceVincent Cohen-Addad, Arnaud de Mesmay. 386-398 [doi]
- Explicit Expanding ExpandersMichael Dinitz, Michael Schapira, Asaf Valadarsky. 399-410 [doi]
- On the Threshold of IntractabilityPål Grønås Drange, Markus Sortland Dregi, Daniel Lokshtanov, Blair D. Sullivan. 411-423 [doi]
- A Polynomial Kernel for Trivially Perfect EditingPål Grønås Drange, Michal Pilipczuk. 424-436 [doi]
- Polymatroid Prophet InequalitiesPaul Dütting, Robert Kleinberg. 437-449 [doi]
- Node-Balancing by Edge-IncrementsFriedrich Eisenbrand, Shay Moran, Rom Pinchasi, Martin Skutella. 450-458 [doi]
- The Price of Matching with Metric PreferencesYuval Emek, Tobias Langner, Roger Wattenhofer. 459-470 [doi]
- Selfish Vector PackingLeah Epstein, Elena Kleiman. 471-482 [doi]
- Approximate Deadline-Scheduling with Precedence ConstraintsHossein Efsandiari, Mohammad Taghi Hajiaghayi, Jochen Könemann, Hamid Mahini, David L. Malec, Laura Sanità. 483-495 [doi]
- Prophet SecretaryHossein Esfandiari, MohammadTaghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh. 496-508 [doi]
- Smoothed Analysis of the Squared Euclidean Maximum-Cut ProblemMichael Etscheid, Heiko Röglin. 509-520 [doi]
- Maximizing Symmetric Submodular FunctionsMoran Feldman. 521-532 [doi]
- Approximating LZ77 via Small-Space Multiple-Pattern MatchingJohannes Fischer 0001, Travis Gagie, Pawel Gawrychowski, Tomasz Kociumaka. 533-544 [doi]
- Fast Algorithms for Parameterized Problems with Relaxed Disjointness ConstraintsAriel Gabizon, Daniel Lokshtanov, Michal Pilipczuk. 545-556 [doi]
- Medial Axis Based Routing Has Constant Load Balancing FactorJie Gao, Mayank Goswami. 557-569 [doi]
- An Experimental Evaluation of the Best-of-Many Christofides' Algorithm for the Traveling Salesman ProblemKyle Genova, David P. Williamson. 570-581 [doi]
- Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed GraphsLoukas Georgiadis, Giuseppe F. Italiano, Charis Papadopoulos, Nikos Parotsidis. 582-594 [doi]
- A Probabilistic Approach to Reducing Algebraic Complexity of Delaunay TriangulationsJean-Daniel Boissonnat, Ramsay Dyer, Arijit Ghosh. 595-606 [doi]
- A Characterization of Visibility Graphs for Pseudo-polygonsMatt Gibson, Erik Krohn, Qing Wang. 607-618 [doi]
- Faster and More Dynamic Maximum Flow by Incremental Breadth-First SearchAndrew V. Goldberg, Sagi Hed, Haim Kaplan, Pushmeet Kohli, Robert Endre Tarjan, Renato F. Werneck. 619-630 [doi]
- The Temp Secretary ProblemAmos Fiat, Ilia Gorelik, Haim Kaplan, Slava Novgorodov. 631-642 [doi]
- How to Sort by Walking on a TreeDaniel Graf. 643-655 [doi]
- Improved Analysis of Complete-Linkage ClusteringAnna Großwendt, Heiko Röglin. 656-667 [doi]
- Structural Parameterizations of the Mixed Chinese Postman ProblemGregory Gutin, Mark Jones, Magnus Wahlström. 668-679 [doi]
- Online Appointment Scheduling in the Random Order ModelOliver Göbel 0002, Thomas Kesselheim, Andreas Tönnis. 680-692 [doi]
- Approximation Algorithms for Connected Maximum Cut and Related ProblemsMohammad Taghi Hajiaghayi, Guy Kortsarz, Robert MacDavid, Manish Purohit, Kanthi K. Sarpatwar. 693-704 [doi]
- The Offset Filtration of Convex ObjectsDan Halperin, Michael Kerber, Doron Shaharabani. 705-716 [doi]
- Approximation Algorithms for Polynomial-Expansion and Low-Density GraphsSariel Har-Peled, Kent Quanrud. 717-728 [doi]
- Monotone Drawings of 3-Connected Plane GraphsXin He, Dayu He. 729-741 [doi]
- Faster Fully-Dynamic Minimum Spanning ForestJacob Holm, Eva Rotenberg, Christian Wulff-Nilsen. 742-753 [doi]
- On the Equivalence among Problems of Bounded WidthYoichi Iwata, Yuichi Yoshida. 754-765 [doi]
- Fast Output-Sensitive Matrix MultiplicationRiko Jacob, Morten Stöckel. 766-778 [doi]
- A Structural Approach to Kernels for ILPs: Treewidth and Total UnimodularityBart M. P. Jansen, Stefan Kratsch. 779-791 [doi]
- On the Approximability of Digraph OrderingSreyash Kenkre, Vinayaka Pandit, Manish Purohit, Rishi Saket. 792-803 [doi]
- Welfare Maximization with Deferred Acceptance Auctions in Reallocation ProblemsAnthony Kim. 804-815 [doi]
- On the Pathwidth of Almost Semicomplete DigraphsKenta Kitsunai, Yasuaki Kobayashi, Hisao Tamaki. 816-827 [doi]
- Quicksort, Largest Bucket, and Min-Wise Hashing with Limited IndependenceMathias Bæk Tejs Knudsen, Morten Stöckel. 828-839 [doi]
- Maximum Matching in Turnstile StreamsChristian Konrad. 840-852 [doi]
- A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling ProblemAdam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli. 853-864 [doi]
- Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi DiagramsDániel Marx, Michal Pilipczuk. 865-877 [doi]
- Randomization Helps Computing a Minimum Spanning Tree under UncertaintyNicole Megow, Julie Meißner, Martin Skutella. 878-890 [doi]
- Compressed Data Structures for Dynamic SequencesJ. Ian Munro, Yakov Nekrich. 891-902 [doi]
- Geometric Hitting Sets for Disks: Theory and PracticeNorbert Bus, Nabil H. Mustafa, Saurabh Ray. 903-914 [doi]
- Efficient Computation of Middle Levels Gray CodesTorsten Mütze, Jerri Nummenpalo. 915-927 [doi]
- Computing the Similarity Between Moving CurvesKevin Buchin, Tim Ophelders, Bettina Speckmann. 928-940 [doi]
- I/O-Efficient Similarity JoinRasmus Pagh, Ninh Pham, Francesco Silvestri, Morten Stöckel. 941-952 [doi]
- Improved Approximation Algorithms for Weighted 2-Path PartitionsAmotz Bar-Noy, David Peleg, George Rabanca, Ivo Vigan. 953-964 [doi]
- A Multivariate Approach for Weighted FPT AlgorithmsHadas Shachnai, Meirav Zehavi. 965-976 [doi]
- Incidences with Curves in ℝ dMicha Sharir, Adam Sheffer, Noam Solomon. 977-988 [doi]
- D3-Tree: A Dynamic Deterministic Decentralized StructureSpyros Sioutas, Efrosini Sourla, Kostas Tsichlas, Christos D. Zaroliagis. 989-1000 [doi]
- Ignorant vs. Anonymous RecommendationsJara Uitto, Roger Wattenhofer. 1001-1012 [doi]
- Lower Bounds in the Preprocessing and Query Phases of Routing AlgorithmsColin White. 1013-1024 [doi]
- Trip-Based Public Transit RoutingSascha Witt. 1025-1036 [doi]
- Mixing Color Coding-Related TechniquesMeirav Zehavi. 1037-1049 [doi]