default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID16th SWAT 2018: Malmö, Sweden
- David Eppstein:
16th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2018, Malmö, Sweden, June 18-20, 2018. LIPIcs 101, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-068-2 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:ix
- Nancy M. Amato:
Sampling-Based Motion Planning: From Intelligent CAD to Crowd Simulation to Protein Folding (Invited Talk). 1:1-1:1 - Sorelle A. Friedler:
Optimizing Society? Ensuring Fairness in Automated Decision-Making (Invited Talk). 2:1-2:1 - Ankur Moitra:
Robustness Meets Algorithms (Invited Talk). 3:1-3:1 - Ahmed Abdelkader, David M. Mount
:
Economical Delone Sets for Approximating Convex Bodies. 4:1-4:12 - Pankaj K. Agarwal, Neeraj Kumar, Stavros Sintos, Subhash Suri:
Computing Shortest Paths in the Plane with Removable Obstacles. 5:1-5:15 - Hee-Kap Ahn, Eunjin Oh, Lena Schlipf, Fabian Stehn, Darren Strash:
On Romeo and Juliet Problems: Minimizing Distance-to-Sight. 6:1-6:13 - Evripidis Bampis, Bruno Escoffier, Michael Lampis, Vangelis Th. Paschos:
Multistage Matchings. 7:1-7:13 - Luis Barba, Michael Hoffmann, Matias Korman, Alexander Pilz:
Convex Hulls in Polygonal Domains. 8:1-8:13 - Matthias Bentert, Josef Malík, Mathias Weller:
Tree Containment With Soft Polytomies. 9:1-9:14 - Therese Biedl, Ahmad Biniaz, Martin Derka:
On the Size of Outer-String Representations. 10:1-10:14 - Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Flip Distance to some Plane Configurations. 11:1-11:14 - Prosenjit Bose, Paz Carmi, J. Mark Keil, Saeed Mehrabi, Debajyoti Mondal:
Boundary Labeling for Rectangular Diagrams. 12:1-12:14 - Prosenjit Bose, Thomas C. Shermer:
Gathering by Repulsion. 13:1-13:12 - Ahmad Biniaz, Prosenjit Bose, Aurélien Ooms, Sander Verdonschot:
Improved Bounds for Guarding Plane Graphs with Edges. 14:1-14:12 - Diptarka Chakraborty, Debarati Das:
Sparse Weight Tolerant Subgraph for Single Source Shortest Path. 15:1-15:15 - Lijie Chen, Ran Duan, Ruosong Wang, Hanrui Zhang, Tianyi Zhang:
An Improved Algorithm for Incremental DFS Tree in Undirected Graphs. 16:1-16:12 - Hicham El-Zein, J. Ian Munro, Yakov Nekrich:
Succinct Dynamic One-Dimensional Point Reporting. 17:1-17:11 - Khaled M. Elbassioni, Kazuhisa Makino:
Enumerating Vertices of 0/1-Polyhedra associated with 0/1-Totally Unimodular Matrices. 18:1-18:14 - Andreas Emil Feldmann, Dániel Marx:
The Parameterized Hardness of the k-Center Problem in Transportation Networks. 19:1-19:13 - Omrit Filtser, Matthew J. Katz:
Algorithms for the Discrete Fréchet Distance Under Translation. 20:1-20:14 - Fedor V. Fomin, Petr A. Golovach, Torstein J. F. Strømme, Dimitrios M. Thilikos:
Partial Complementation of Graphs. 21:1-21:13 - Sutanu Gayen, N. V. Vinodchandran:
New Algorithms for Distributed Sliding Windows. 22:1-22:15 - Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis, Paloma T. Lima, Charis Papadopoulos:
Parameterized Aspects of Strong Subgraph Closure. 23:1-23:13 - Tesshu Hanaka, Ioannis Katsikarelis, Michael Lampis, Yota Otachi, Florian Sikora:
Parameterized Orientable Deletion. 24:1-24:13 - Lingxiao Huang, Yifei Jin, Jian Li:
SVM via Saddle Point Optimization: New Bounds and Distributed Algorithms. 25:1-25:13 - Shang-En Huang, Seth Pettie:
Lower Bounds on Sparse Spanners, Emulators, and Diameter-reducing shortcuts. 26:1-26:12 - Takehiro Ito, Yota Otachi:
Reconfiguration of Colorable Sets in Classes of Perfect Graphs. 27:1-27:13 - Lukasz Kowalik, Arkadiusz Socala:
Tight Lower Bounds for List Edge Coloring. 28:1-28:12 - Michael Mitzenmacher, Konstantinos Panagiotou, Stefan Walzer:
Load Thresholds for Cuckoo Hashing with Double Hashing. 29:1-29:9 - Kim Thang Nguyen:
A Greedy Algorithm for Subspace Approximation Problem. 30:1-30:7 - Alexander Pilz:
Planar 3-SAT with a Clause/Variable Cycle. 31:1-31:13 - Erik D. Demaine, Mikhail Rudoy:
Tree-Residue Vertex-Breaking: a new tool for proving hardness. 32:1-32:14 - Lijie Chen, Erik D. Demaine, Yuzhou Gu, Virginia Vassilevska Williams, Yinzhan Xu, Yuancheng Yu:
Nearly Optimal Separation Between Partially and Fully Retroactive Data Structures. 33:1-33:12
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-05-29 23:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
