Abstract is missing.
- Small Candidate Set for Translational Pattern SearchZiyun Huang, Qilong Feng, Jianxin Wang, Jinhui Xu 0001. [doi]
- The Generalized Microscopic Image Reconstruction ProblemAmotz Bar-Noy, Toni Böhnlein, Zvi Lotker, David Peleg, Dror Rawitz. [doi]
- New Results for the k-Secretary ProblemSusanne Albers, Leon Ladewig. [doi]
- Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph ParametersRobert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier. [doi]
- Stabilization Time in Minority ProcessesPál András Papp, Roger Wattenhofer. [doi]
- Two Phase Transitions in Two-Way Bootstrap PercolationAhad N. Zehmakan. [doi]
- A Polynomial-Delay Algorithm for Enumerating Connectors Under Various Connectivity ConditionsKazuya Haraguchi, Hiroshi Nagamochi. [doi]
- New Applications of Nearest-Neighbor Chains: Euclidean TSP and Motorcycle GraphsNil Mamano, Alon Efrat, David Eppstein, Daniel Frishberg, Michael T. Goodrich, Stephen G. Kobourov, Pedro Matias, Valentin Polishchuk. [doi]
- Graph Searches and Their End VerticesYixin Cao 0001, Zhifeng Wang, Guozhen Rong, Jianxin Wang. [doi]
- Sliding Window Property Testing for Regular LanguagesMoses Ganardi, Danny Hucke, Markus Lohrey, Tatiana Starikovskaya. [doi]
- The Weighted k-Center Problem in Trees for Fixed kBinay Bhattacharya, Sandip Das 0001, Subhadeep Ranjan Dev. [doi]
- On Adaptivity Gaps of Influence Maximization Under the Independent Cascade Model with Full-Adoption FeedbackWei Chen, Binghui Peng. [doi]
- On Optimal Balance in B-Trees: What Does It Cost to Stay in Perfect Shape?Rolf Fagerberg, David Hammer, Ulrich Meyer 0001. [doi]
- Cyclability in Graph ClassesChristophe Crespelle, Carl Feghali, Petr A. Golovach. [doi]
- Efficient Interactive Proofs for Linear AlgebraGraham Cormode, Chris Hickey. [doi]
- Improved Algorithms for Clustering with OutliersQilong Feng, Zhen Zhang, Ziyun Huang, Jinhui Xu 0001, Jianxin Wang. [doi]
- On Explicit Branching Programs for the Rectangular Determinant and Permanent PolynomialsVikraman Arvind, Abhranil Chatterjee 0001, Rajit Datta, Partha Mukhopadhyay. [doi]
- On the Hardness of Set Disjointness and Set Intersection with Bounded UniverseIsaac Goldstein, Moshe Lewenstein, Ely Porat. [doi]
- Distance Measures for Embedded GraphsHugo A. Akitaya, Maike Buchin, Bernhard Kilgus, Stef Sijben, Carola Wenk. [doi]
- Approximate Pricing in Networks: How to Boost the Betweenness and Revenue of a NodeK. Ruben Brokkelkamp, Sven C. Polak, Guido Schäfer, Yllka Velaj. [doi]
- Reachability in High Treewidth GraphsRahul Jain, Raghunath Tewari. [doi]
- Concurrent Distributed Serving with Mobile ServersAbdolhamid Ghodselahi, Fabian Kuhn, Volker Turau. [doi]
- On the Complexity of Lattice PuzzlesYasuaki Kobayashi, Koki Suetsugu, Hideki Tsuiki, Ryuhei Uehara. [doi]
- Online Multidimensional Packing Problems in the Random-Order ModelDavid Naori, Danny Raz. [doi]
- Internal Dictionary MatchingPanagiotis Charalampopoulos, Tomasz Kociumaka, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen. [doi]
- The I/O Complexity of Hybrid Algorithms for Square Matrix MultiplicationLorenzo De Stefani. [doi]
- Local Routing in Sparse and Lightweight Geometric GraphsVikrant Ashvinkumar, Joachim Gudmundsson, Christos Levcopoulos, Bengt J. Nilsson, André van Renssen. [doi]
- Strategy-Proof Approximation Algorithms for the Stable Marriage Problem with Ties and Incomplete ListsKoki Hamada, Shuichi Miyazaki, Hiroki Yanagisawa. [doi]
- Blocking Dominating Sets for H-Free Graphs via Edge ContractionsEsther Galby, Paloma T. Lima, Bernard Ries. [doi]
- Complexity of Linear OperatorsAlexander S. Kulikov, Ivan Mikhailin, Andrey Mokhov, Vladimir V. Podolskii. [doi]
- A Competitive Algorithm for Random-Order Stochastic Virtual Circuit RoutingNguyen Kim Thang. [doi]
- Gathering and Election by Mobile Robots in a Continuous CyclePaola Flocchini, Ryan Killick, Evangelos Kranakis, Nicola Santoro, Masafumi Yamashita. [doi]
- Online Knapsack Problems with a Resource BufferXin Han, Yasushi Kawase, Kazuhisa Makino, Haruki Yokomaku. [doi]
- External Memory Planar Point Location with Fast UpdatesJohn Iacono, Ben Karsin, Grigorios Koumoutsos. [doi]
- Measure and Conquer for Max Hamming Distance XSATGordon Hoi, Frank Stephan 0001. [doi]
- The k-Fréchet Distance: How to Walk Your Dog While TeleportingHugo Alves Akitaya, Maike Buchin, Leonie Ryvkin, Jérôme Urhausen. [doi]
- A 21/16-Approximation for the Minimum 3-Path Partition ProblemYong Chen 0002, Randy Goebel, Bing Su, Weitian Tong, Yao Xu, An Zhang. [doi]
- Step-By-Step Community Detection in Volume-Regular GraphsLuca Becchetti, Emilio Cruciani, Francesco Pasquale, Sara Rizzo. [doi]
- Path and Ancestor Queries over Trees with Multidimensional Weight VectorsMeng He 0001, Serikzhan Kazi. [doi]
- Efficiently Realizing Interval SequencesAmotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz. [doi]
- Slaying Hydrae: Improved Bounds for Generalized k-Server in Uniform MetricsMarcin Bienkowski, Lukasz Jez, Pawel Schmidt. [doi]
- Efficient Circuit Simulation in MapReduceFabian Frei, Koichi Wada. [doi]
- Minimum-Width Double-Strip and Parallelogram AnnulusSang Won Bae. [doi]
- Triangle Estimation Using Tripartite Independent Set QueriesAnup Bhattacharya, Arijit Bishnu, Arijit Ghosh, Gopinath Mishra. [doi]
- Approximating the Geometric Edit DistanceKyle Fox, Xinyi Li. [doi]
- Online Algorithms for Warehouse ManagementPhilip Dasler, David M. Mount. [doi]
- Tracking Paths in Planar GraphsDavid Eppstein, Michael T. Goodrich, James A. Liu, Pedro Matias. [doi]
- Searching for Cryptogenography Upper Bounds via Sum of Square ProgrammingDominik Scheder, Shuyang Tang, Jiaheng Zhang. [doi]
- Top Tree Compression of TriesPhilip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann. [doi]
- Minimizing and Computing the Inverse Geodesic Length on TreesSerge Gaspers, Joshua Lau. [doi]
- How Does Object Fatness Impact the Complexity of Packing in d Dimensions?Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden. [doi]
- Accurate MapReduce Algorithms for k-Median and k-Means in General Metric SpacesAlessio Mazzetto, Andrea Pietracaprina, Geppino Pucci. [doi]
- When Maximum Stable Set Can Be Solved in FPT TimeÉdouard Bonnet, Nicolas Bousquet, Stéphan Thomassé, Rémi Watrigant. [doi]
- Approximate Euclidean Shortest Paths in Polygonal DomainsR. Inkulu, Sanjiv Kapoor. [doi]
- An Improved Data Structure for Left-Right Maximal Generic Words ProblemYuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. [doi]
- Dual-Mode Greedy Algorithms Can Save EnergyBarbara Geissmann, Stefano Leucci 0001, Chih-Hung Liu, Paolo Penna, Guido Proietti. [doi]
- Parameterized Complexity Classification of Deletion to List Matrix-Partition for Low-Order MatricesAkanksha Agrawal, Sudeshna Kolay, Jayakrishnan Madathil, Saket Saurabh 0001. [doi]
- On Approximate Range Mode and Range SelectionHicham El-Zein, Meng He 0001, J. Ian Munro, Yakov Nekrich, Bryce Sandlund. [doi]
- On One-Round Discrete Voronoi GamesMark de Berg, Sándor Kisfaludi-Bak, Mehran Mehr. [doi]
- Front Matter, Table of Contents, Preface, Symposium Organization [doi]
- 8-Free Chordal GraphsOscar Defrain, Lhouari Nourine. [doi]
- Lower Bound for Non-Adaptive Estimation of the Number of Defective ItemsNader H. Bshouty. [doi]
- Local Cliques in ER-Perturbed Random Geometric GraphsMatthew Kahle, Minghao Tian, Yusu Wang. [doi]
- Unbounded Regions of High-Order Voronoi Diagrams of Lines and Segments in Higher DimensionsGill Barequet, Evanthia Papadopoulou, Martin Suderland. [doi]
- Result-Sensitive Binary Search with Noisy InformationNarthana S. Epa, Junhao Gan, Anthony Wirth. [doi]