16th Scandinavian symposium and workshops on algorithm theory. SWAT 2018, June 18–20, 2018, Malmö University, Malmö, Sweden. (English) Zbl 1390.68019

Eppstein, David (ed.)

LIPIcs – Leibniz International Proceedings in Informatics 101. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-068-2). vii, 33 articles, not consecutively paged, electronic only, open access (2018).

Show indexed articles as search result.

The articles of this volume will be reviewed individually. For the preceding workshop see [Zbl 1351.68026].
Indexed articles:
Abdelkader, Ahmed; Mount, David M., Economical Delone sets for approximating convex bodies, Article 4, 12 p. [Zbl 07238959]
Agarwal, Pankaj K.; Kumar, Neeraj; Sintos, Stavros; Suri, Subhash, Computing shortest paths in the plane with removable obstacles, Article 5, 15 p. [Zbl 07238960]
Ahn, Hee-Kap; Oh, Eunjin; Schlipf, Lena; Stehn, Fabian; Strash, Darren, On Romeo and Juliet problems: minimizing distance-to-sight, Article 6, 13 p. [Zbl 07238961]
Bampis, Evripidis; Escoffier, Bruno; Lampis, Michael; Paschos, Vangelis Th., Multistage matchings, Article 7, 13 p. [Zbl 07238962]
Barba, Luis; Hoffmann, Michael; Korman, Matias; Pilz, Alexander, Convex hulls in polygonal domains, Article 8, 13 p. [Zbl 07238963]
Bentert, Matthias; Mallík, Josef; Weller, Mathias, Tree containment with soft polytomies, Article 9, 14 p. [Zbl 07238964]
Biedl, Therese; Biniaz, Ahmad; Derka, Martin, On the size of outer-string representations, Article 10, 14 p. [Zbl 07238965]
Biniaz, Ahmad; Maheshwari, Anil; Smid, Michiel, Flip distance to some plane configurations, Article 11, 14 p. [Zbl 07238966]
Bose, Prosenjit; Carmi, Paz; Keil, J. Mark; Mehrabi, Saeed; Mondal, Debajyoti, Boundary labeling for rectangular diagrams, Article 12, 14 p. [Zbl 07238967]
Bose, Prosenjit; Shermer, Thomas C., Gathering by repulsion, Article 13, 12 p. [Zbl 07238968]
Biniaz, Ahmad; Bose, Prosenjit; Ooms, Aurélien; Verdonschot, Sander, Improved bounds for guarding plane graphs with edges, Article 14, 12 p. [Zbl 07238969]
Chakraborty, Diptarka; Das, Debarati, Sparse weight tolerant subgraph for single source shortest path, Article 15, 15 p. [Zbl 07238970]
Chen, Lijie; Duan, Ran; Wang, Ruosong; Zhang, Hanrui; Zhang, Tianyi, An improved algorithm for incremental DFS tree in undirected graphs, Article 16, 12 p. [Zbl 07238971]
El-Zein, Hicham; Munro, J. Ian; Nekrich, Yakov, Succinct dynamic one-dimensional point reporting, Article 17, 11 p. [Zbl 07238972]
Elbassioni, Khaled; Makino, Kazuhisa, Enumerating vertices of \(0/1\)-polyhedra associated with \(0/1\)-totally unimodular matrices, Article 18, 14 p. [Zbl 07238973]
Feldmann, Andreas Emil; Marx, Dániel, The parameterized hardness of the \(k\)-center problem in transportation networks, Article 19, 13 p. [Zbl 07238974]
Filtser, Omrit; Katz, Matthew J., Algorithms for the discrete Fréchet distance under translation, Article 20, 14 p. [Zbl 07238975]
Fomin, Fedor V.; Golovach, Petr A.; Strømme, Torstein J. F.; Thilikos, Dimitrios M., Partial complementation of graphs, Article 21, 13 p. [Zbl 07238976]
Gayen, Sutanu; Vinodchandran, N. V., New algorithms for distributed sliding windows, Article 22, 15 p. [Zbl 07238977]
Golovach, Petr A.; Heggernes, Pinar; Konstantinidis, Athanasios L.; Lima, Paloma T.; Papadopoulos, Charis, Parameterized aspects of strong subgraph closure, Article 23, 13 p. [Zbl 1442.68169]
Hanaka, Tesshu; Katsikarelis, Ioannis; Lampis, Michael; Otachi, Yota; Sikora, Florian, Parameterized orientable deletion, Article 24, 13 p. [Zbl 07238979]
Huang, Lingxiao; Jin, Yifei; Li, Jian, SVM via saddle point optimization: new bounds and distributed algorithms, Article 25, 13 p. [Zbl 07238980]
Huang, Shang-En; Pettie, Seth, Lower bounds on sparse spanners, emulators, and diameter-reducing shortcuts, Article 26, 12 p. [Zbl 07238981]
Ito, Takehiro; Otachi, Yota, Reconfiguration of colorable sets in classes of perfect graphs, Article 27, 13 p. [Zbl 07238982]
Kowalik, Łukasz; Socała, Arkadiusz, Tight lower bounds for list edge coloring, Article 28, 12 p. [Zbl 07238983]
Mitzenmacher, Michael; Panagiotou, Konstantinos; Walzer, Stefan, Load thresholds for cuckoo hashing with double hashing, Article 29, 9 p. [Zbl 07238984]
Thang, Nguyen Kim, A greedy algorithm for subspace approximation problem, Article 30, 7 p. [Zbl 07238985]
Pilz, Alexander, Planar 3-SAT with a clause/variable cycle, Article 31, 13 p. [Zbl 07238986]
Demaine, Erik D.; Rudoy, Mikhail, Tree-residue vertex-breaking: a new tool for proving hardness, Article 32, 14 p. [Zbl 07238987]
Chen, Lijie; Demaine, Erik D.; Gu, Yuzhou; Vassilevska Williams, Virginia; Xu, Yinzhan; Yu, Yuancheng, Nearly optimal separation between partially and fully retroactive data structures, Article 33, 12 p. [Zbl 07238988]

MSC:

68-06	Proceedings, conferences, collections, etc. pertaining to computer science
68Wxx	Algorithms in computer science
00B25	Proceedings of conferences of miscellaneous specific interest