Abstract is missing.
- Online Packet Scheduling with Bounded Delay and LookaheadMartin Böhm, Marek Chrobak, Lukasz Jez, Fei Li, Jirí Sgall, Pavel Veselý. [doi]
- On the Optimality of Tape Merge of Two Lists with Similar SizeQian Li, Xiaoming Sun, Jialin Zhang. [doi]
- Additive Approximation Algorithms for Modularity MaximizationYasushi Kawase, Tomomi Matsui, Atsushi Miyauchi. [doi]
- O(f) Bi-Approximation for Capacitated Covering with Hard CapacitiesMong-Jen Kao, Hai-Lun Tu, D. T. Lee. [doi]
- All-Pairs Shortest Paths in Unit-Disk Graphs in Slightly Subquadratic TimeTimothy M. Chan, Dimitrios Skrepetos. [doi]
- Space-Efficient Plane-Sweep AlgorithmsAmr Elmasry, Frank Kammer. [doi]
- The Subset Assignment Problem for Data Placement in CachesShahram Ghandeharizadeh, Sandy Irani, Jenny Lam. [doi]
- Pattern Matching and Consensus Problems on Weighted Sequences and ProfilesTomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski. [doi]
- Fast Approximation Algorithms for the Generalized Survivable Network Design ProblemAndreas Emil Feldmann, Jochen Könemann, Kanstantsin Pashkovich, Laura Sanità. [doi]
- Approximation Algorithms for Capacitated k-Travelling Repairmen ProblemsChristopher S. Martin, Mohammad R. Salavatipour. [doi]
- Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One GapAmihood Amir, Tsvi Kopelowitz, Avivit Levy, Seth Pettie, Ely Porat, B. Riva Shalom. [doi]
- Space-Time Trade-Offs for the Shortest Unique Substring ProblemArnab Ganguly 0002, Wing-Kai Hon, Rahul Shah, Sharma V. Thankachan. [doi]
- Kernels for Deletion to Classes of Acyclic DigraphsAkanksha Agrawal, Saket Saurabh, Roohani Sharma, Meirav Zehavi. [doi]
- Approximate Shortest Distances Among Smooth Obstacles in 3DChristian Scheffer, Jan Vahrenhold. [doi]
- A Near-Optimal Algorithm for Finding an Optimal Shortcut of a TreeEunjin Oh 0001, Hee-Kap Ahn. [doi]
- Distributed and Robust Support Vector MachineYangwei Liu, Hu Ding, Ziyun Huang, Jinhui Xu 0001. [doi]
- Optimal Nonpreemptive Scheduling in a Smart Grid ModelFu-Hong Liu, Hsiang Hsuan Liu, Prudence W. H. Wong. [doi]
- Surrogate Optimization for p-NormsYasushi Kawase, Kazuhisa Makino. [doi]
- An Improved Tax Scheme for Selfish RoutingTe-Li Wang, Chih-Kuan Yeh, Ho-Lin Chen. [doi]
- A Linear-Time Algorithm for Integral Multiterminal Flows in TreesMingyu Xiao, Hiroshi Nagamochi. [doi]
- On the Classes of Interval Graphs of Limited Nesting and Count of LengthsPavel Klavík, Yota Otachi, Jirí Sejnoha. [doi]
- Optimal Composition Ordering Problems for Piecewise Linear FunctionsYasushi Kawase, Kazuhisa Makino, Kento Seimi. [doi]
- Reconstruction of Weakly Simple Polygons from their EdgesHugo Alves Akitaya, Csaba D. Tóth. [doi]
- On r-Guarding Thin Orthogonal PolygonsTherese C. Biedl, Saeed Mehrabi 0001. [doi]
- Compressed and Searchable Indexes for Highly Similar Strings (Invited Talk)Kunsoo Park. [doi]
- Building Clusters with Lower-Bounded SizesFaisal N. Abu-Khzam, Cristina Bazgan, Katrin Casel, Henning Fernau. [doi]
- The (1|1)-Centroid Problem on the Plane Concerning Distance ConstraintsHung-I Yu, Tien-Ching Lin, Der-Tsai Lee. [doi]
- The Densest Subgraph Problem with a Convex/Concave Size FunctionYasushi Kawase, Atsushi Miyauchi. [doi]
- A Refined Definition for Groups of Moving Entities and its ComputationMarc J. van Kreveld, Maarten Löffler, Frank Staals, Lionov Wiratma. [doi]
- Computing the Pattern Waiting Time: A Revisit of the Intuitive ApproachKai Jin. [doi]
- Towards Processing of Big Graphs: from Theory, Algorithm to System (Invited Talk)Xuemin Lin. [doi]
- Towards Plane Spanners of Degree 3Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Cyril Gavoille, Anil Maheshwari, Michiel H. M. Smid. [doi]
- Complexity of Distributions and Average-Case HardnessDmitry Itsykson, Alexander Knop, Dmitry Sokolov. [doi]
- Simultaneous Feedback Edge Set: A Parameterized PerspectiveAkanksha Agrawal, Fahad Panolan, Saket Saurabh, Meirav Zehavi. [doi]
- Search on a Line by Byzantine RobotsJurek Czyzowicz, Konstantinos Georgiou, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende. [doi]
- Linear Kernels and Linear-Time Algorithms for Finding Large CutsMichael Etscheid, Matthias Mnich. [doi]
- Approximating Smallest Containers for Packing Three-Dimensional Convex ObjectsHelmut Alt, Nadja Scharf. [doi]
- Hard Communication Channels for SteganographySebastian Berndt, Maciej Liskiewicz. [doi]
- Streaming Verification of Graph PropertiesAmirali Abdullah, Samira Daruki, Chitradeep Dutta Roy, Suresh Venkatasubramanian. [doi]
- Scaling and Proximity Properties of Integrally Convex FunctionsSatoko Moriguchi, Kazuo Murota, Akihisa Tamura, Fabio Tardella. [doi]
- L_1 Geodesic Farthest Neighbors in a Simple Polygon and Related ProblemsSang Won Bae. [doi]
- A Sidetrack-Based Algorithm for Finding the k Shortest Simple Paths in a Directed GraphDenis Kurz, Petra Mutzel. [doi]
- Assigning Weights to Minimize the Covering Radius in the PlaneEunjin Oh 0001, Hee-Kap Ahn. [doi]
- Finding k Simple Shortest Paths and CyclesUdit Agarwal, Vijaya Ramachandran. [doi]
- Sink Evacuation on Trees with Dynamic Confluent FlowsDi Chen, Mordecai J. Golin. [doi]
- Dynamic Relative Compression, Dynamic Partial Sums, and Substring ConcatenationPhilip Bille, Patrick Hagge Cording, Inge Li Gørtz, Frederik Rye Skjoldjensen, Hjalte Wedel Vildhøj, Søren Vind. [doi]
- On the Complexity of Matching Cut in Graphs of Fixed DiameterHoàng-Oanh Le, Van Bang Le. [doi]
- Approximate Clustering via Metric PartitioningSayan Bandyapadhyay, Kasturi R. Varadarajan. [doi]
- Universal Guard ProblemsSándor P. Fekete, Qian Li, Joseph S. B. Mitchell, Christian Scheffer. [doi]
- Packing Short Plane Spanning Trees in Complete Geometric GraphsOswin Aichholzer, Thomas Hackl, Matias Korman, Alexander Pilz, Günter Rote, André van Renssen, Marcel Roeloffzen, Birgit Vogtenhuber. [doi]
- Front Matter, Table of Contents, Preface, Program Committee, External Reviewers [doi]
- On (1, epsilon)-Restricted Max-Min Fair Allocation ProblemT.-H. Hubert Chan, Zhihao Gavin Tang, Xiaowei Wu. [doi]
- Raising Permutations to Powers in PlaceHicham El-Zein, J. Ian Munro, Matthew Robertson. [doi]
- An Efficient Algorithm for Placing Electric Vehicle Charging StationsPankaj K. Agarwal, Jiangwei Pan, Will Victor. [doi]
- Sliding Tokens on a CactusDuc A. Hoang, Ryuhei Uehara. [doi]
- Clustered Planarity with PipesPatrizio Angelini, Giordano Da Lozzo. [doi]
- A Gap Trichotomy for Boolean Constraint Problems: Extending Schaefer's TheoremLucy Ham. [doi]
- Shortest Disjoint S-Paths Via Weighted Linear Matroid ParityYutaro Yamaguchi. [doi]
- Hierarchical Time-Dependent OraclesSpyros C. Kontogiannis, Dorothea Wagner, Christos D. Zaroliagis. [doi]
- Single Machine Scheduling with Job-Dependent Machine DeteriorationWenchang Luo, Yao Xu, Weitian Tong, Guohui Lin. [doi]
- Biconnectivity, Chain Decomposition and st-Numbering Using O(n) BitsSankardeep Chakraborty, Venkatesh Raman 0001, Srinivasa Rao Satti. [doi]
- Bipartite Matching with Linear Edge WeightsNevzat Onur Domaniç, Chi-Kit Lam, C. Gregory Plaxton. [doi]
- Dispersing Points on IntervalsShimin Li, Haitao Wang. [doi]
- Adaptivity vs. Postselection, and Hardness Amplification for Polynomial ApproximationLijie Chen. [doi]
- Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized ComplexityHans L. Bodlaender, Hirotaka Ono, Yota Otachi. [doi]