default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID17th SWAT 2020: Tórshavn, Faroe Islands
- Susanne Albers:
17th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2020, June 22-24, 2020, Tórshavn, Faroe Islands. LIPIcs 162, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-150-4 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:10
- Fedor V. Fomin
, Petr A. Golovach, Kirill Simonov:
Parameterized Complexity of PCA (Invited Talk). 1:1-1:5 - Jukka Suomela:
Landscape of Locality (Invited Talk). 2:1-2:1 - Mohammad Ali Abam, Mark de Berg, Sina Farahzad, Mir Omid Haji Mirsadeghi, Morteza Saghafian:
Preclustering Algorithms for Imprecise Points. 3:1-3:12 - Akanksha Agrawal, Sudeshna Kolay, Meirav Zehavi:
Parameter Analysis for Guarding Terrains. 4:1-4:18 - Hassene Aissi, Da Qi Chen, R. Ravi:
Vertex Downgrading to Minimize Connectivity. 5:1-5:15 - Lars Arge, Mathias Rav, Morten Revsbæk, Yujin Shin, Jungwoo Yang:
Sea-Rise Flooding on Massive Dynamic Terrains. 6:1-6:19 - Esther M. Arkin, Faryad Darabi Sahneh, Alon Efrat, Fabian Frank, Radoslav Fulek, Stephen G. Kobourov, Joseph S. B. Mitchell:
Computing β-Stretch Paths in Drawings of Graphs. 7:1-7:20 - Arturs Backurs, Sariel Har-Peled:
Submodular Clustering in Low Dimensions. 8:1-8:14 - Max Bannach, Malte Skambath, Till Tantau:
Kernelizing the Hitting Set Problem in Linear Sequential and Constant Parallel Time. 9:1-9:16 - Amotz Bar-Noy, Keerti Choudhary, David Peleg, Dror Rawitz:
Graph Realizations: Maximum Degree in Vertex Neighborhoods. 10:1-10:17 - Ioana O. Bercea, Guy Even:
A Dynamic Space-Efficient Filter with Constant Time Operations. 11:1-11:17 - Nalin Bhardwaj, Antonio Molina Lovett, Bryce Sandlund:
A Simple Algorithm for Minimum Cuts in Near-Linear Time. 12:1-12:18 - Sujoy Bhore, Paz Carmi, Sudeshna Kolay, Meirav Zehavi:
Parameterized Study of Steiner Tree on Unit Disk Graphs. 13:1-13:18 - Ahmad Biniaz, Prosenjit Bose, Anna Lubiw, Anil Maheshwari:
Bounded-Angle Minimum Spanning Trees. 14:1-14:22 - Glencora Borradaile, Erin Wolf Chambers, David Eppstein, William Maxwell, Amir Nayyeri:
Low-Stretch Spanning Trees of Graphs with Bounded Width. 15:1-15:19 - Prosenjit Bose, Saeed Mehrabi, Debajyoti Mondal:
Parameterized Complexity of Two-Interval Pattern Problem. 16:1-16:10 - Bartlomiej Bosek, Yann Disser, Andreas Emil Feldmann, Jakub Pawlewicz, Anna Zych-Pawlewicz:
Recoloring Interval Graphs with Limited Recourse Budget. 17:1-17:23 - Nader H. Bshouty, Catherine A. Haddad-Zaknoon, Raghd Boulos, Foad Moalem, Jalal Nada, Elias Noufi, Yara Zaknoon:
Optimal Randomized Group Testing Algorithm to Determine the Number of Defectives. 18:1-18:12 - Kevin Buchin, Anne Driemel, Martijn Struijs:
On the Hardness of Computing an Average Curve. 19:1-19:19 - Jean Cardinal, Aurélien Ooms:
Sparse Regression via Range Counting. 20:1-20:17 - Steven Chaplick, Henry Förster, Myroslav Kryven, Alexander Wolff:
Drawing Graphs with Circular Arcs and Right-Angle Crossings. 21:1-21:14 - Stephane Durocher, Md Yeakub Hassan:
Clustering Moving Entities in Euclidean Space. 22:1-22:14 - Patrick Eades, Ivor van der Hoog, Maarten Löffler, Frank Staals:
Trajectory Visibility. 23:1-23:22 - David Eppstein, Daniel Frishberg, Elham Havvaei:
Simplifying Activity-On-Edge Graphs. 24:1-24:14 - Chenglin Fan, Anna C. Gilbert, Benjamin Raichel, Rishi Sonthalia, Gregory Van Buskirk:
Generalized Metric Repair on Graphs. 25:1-25:22 - Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz:
Maximum Edge-Colorable Subgraph and Strong Triadic Closure Parameterized by Distance to Low-Degree Graphs. 26:1-26:17 - Bart M. P. Jansen, Jari J. H. de Kroon:
Preprocessing Vertex-Deletion Problems: Characterizing Graph Properties by Low-Rank Adjacencies. 27:1-27:15 - Haim Kaplan, Jay Tenenbaum:
Locality Sensitive Hashing for Set-Queries, Motivated by Group Recommendations. 28:1-28:18 - Mikko Koivisto, Antti Röyskö:
Fast Multi-Subset Transform and Weighted Sums over Acyclic Digraphs. 29:1-29:12 - László Kozma:
Exact Exponential Algorithms for Two Poset Problems. 30:1-30:15 - J. Ian Munro, Bryce Sandlund, Corwin Sinnamon:
Space-Efficient Data Structures for Lattices. 31:1-31:22 - Ilan Newman, Yuri Rabinovich:
Online Embedding of Metrics. 32:1-32:13 - Sivakumar Rathinam, R. Ravi, J. Bae, Kaarthik Sundar:
Primal-Dual 2-Approximation Algorithm for the Monotonic Multiple Depot Heterogeneous Traveling Salesman Problem. 33:1-33:13 - Saket Saurabh, Uéverton dos Santos Souza, Prafullkumar Tale:
On the Parameterized Complexity of Grid Contraction. 34:1-34:17 - Joachim Spoerhase, Sabine Storandt, Johannes Zink:
Simplification of Polyline Bundles. 35:1-35:20 - Seiichiro Tani:
Quantum Algorithm for Finding the Optimal Variable Ordering for Binary Decision Diagrams. 36:1-36:19
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 2025-10-08 22:30 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:
