default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID20th SWAT 2026: Copenhagen, Denmark
- Pierre Fraigniaud
:
20th Scandinavian Symposium on Algorithm Theory, SWAT 2026, Copenhagen, Denmark, June 17-19, 2026. LIPIcs 370, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2026, ISBN 978-3-95977-421-5 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xvi
- Aditya Acharya, Auguste H. Gezalyan, David M. Mount:
Classifiers in High Dimensional Hilbert Metrics. 1:1-1:16 - Boris Aronov, Mayank Goswami, John Iacono, Indu Ramesh:
On the Fragile Complexity of Geometric Algorithms. 2:1-2:18 - Divya Bajaj, Bin Fu, Ryan Knobel, Austin Luchsinger, Aiden Massie, Pablo Santos, Ramiro Santos, Robert Schweller, Evan Tomai, Tim Wylie:
Reachability with Restricted Reactions in Inhibitory Chemical Reaction Networks. 3:1-3:18 - Júlia Baligács, Yann Disser, Linda Thelen:
Improved Bounds for Online TSP on the Half-Line. 4:1-4:17 - Robert D. Barish, Tetsuo Shibuya:
Arranging Pairwise Disjoint Shapes to Partition Point Sets. 5:1-5:18 - Michael A. Bekos, Eleni Katsanou, Philipp Kindermann, Maria Eleni Pavlidi:
How Many Slopes Does Polynomial Area Cost? 6:1-6:18 - Mark de Berg, Prosenjit Bose, Leonidas Theocharous:
On the Doubling Dimension and the Perimeter of Geodesically Convex Sets in Fat Polygons. 7:1-7:16 - Kimon Boehmer:
Submodular Max-Min Allocation Under Identical Valuations. 8:1-8:17 - Édouard Bonnet, Jadwiga Czyzewska, Tomás Masarík, Marcin Pilipczuk, Pawel Rzazewski:
QPTAS for MWIS and Finding Large Sparse Induced Subgraphs in Graphs with Few Independent Long Holes. 9:1-9:14 - Nicolas Bousquet, Frank Connor, Remy El Sabeh, Louis-Roy Langevin, Amer E. Mouawad, Naomi Nishimura, Agnes Totschnig:
Robotic Arm Rotation: Standing up Is Harder Than You Think. 10:1-10:17 - Anna Brötzner, Bengt J. Nilsson, Christiane Schmidt:
Improved Approximation of Two Watchmen's Routes in Simple Polygons. 11:1-11:16 - Tiziana Calamoneri, Pierre Gaillard, Giacomo Paesani, Giuseppe Perelli:
Strategy Repair in Reachability Games via a Graph Quotientation. 12:1-12:16 - Panagiotis Charalampopoulos, Manal Mohamed, Solon P. Pissis, Hilde Verbeek, Wiktor Zuba:
Faster Algorithms for Shortest Unique or Absent Substrings. 13:1-13:19 - Jaehoon Chung:
Orthogonal Strip Partitioning of Polygons: Lattice-Theoretic Algorithms and Lower Bounds. 14:1-14:17 - Avinandan Das:
One Color Makes All the Difference in the Tractability of Partial Coloring in Semi-Streaming. 15:1-15:16 - Minati De, Satyam Singh, Csaba D. Tóth:
Online Hitting Set for Axis-Aligned Squares. 16:1-16:18 - Ronald Deng, Samuel McCauley, Aidin Niaparast, Helia Niaparast, Bennett Ptak, Shirel Quintanilla, Shikha Singh, Nathan Vosburg:
Incremental Strongly Connected Components with Predictions. 17:1-17:16 - Omrit Filtser, Tzalik Maimon, Michal Moiseev:
On Fréchet Traveling Salesmen Problems. 18:1-18:17 - Nicole Funk, Annika Hennes, Johanna Hillebrand, Sarah Sturm:
Constant-Factor Approximations for Doubly Constrained Fair k-Center, k-Median and k-Means. 19:1-19:19 - Jie Gao, Pawel Gawrychowski, Panos Giannopoulos, Wolfgang Mulzer, Satyam Singh, Frank Staals, Meirav Zehavi:
Near-Linear and Parameterized Approximations for Maximum Cliques in Disk Graphs. 20:1-20:17 - Manoj Gupta, Shahbaz Khan, Madhu Surendra:
Dynamic MIS Revisited: Incremental, Fault Tolerant and Fully Dynamic. 21:1-21:11 - Bart M. P. Jansen, Ruben F. A. Verhaegh:
Search-Space Reduction for Boolean MinCSPs via Essential Constraints. 22:1-22:17 - Seungbum Jo, Dominik Köppl:
Indexing Range Maximum-Sum Segment Queries with Offsets. 23:1-23:16 - Chirag Kaudan, Amir Nayyeri:
Cutwidth Versus BFS-Width with Applications to Graph Reconstruction from Distance Queries. 24:1-24:13 - Dusan Knop, Nikolaos Melissinos, Manolis Vasilakis:
Parameterized Critical Node Cut Revisited. 25:1-25:17 - Pankaj Kumar, Haiko Müller, Sebastian Ordyniak, Melanie Schmidt:
On the Parameterized Complexity of Min-Sum-Radii. 26:1-26:18 - Suruchi Kushwaha, Yakov Nekrich:
New Results on Three-Sided Skyline Range Counting and Reporting. 27:1-27:14 - Antonio Lauerbach, Konstanty Junosza-Szaniawski, Marie Diana Sieper, Alexander Wolff:
The Parameterized Complexity of Coloring Mixed Graphs. 28:1-28:18 - Jaegun Lee, Chaeyoon Chung, Hee-Kap Ahn:
Bichromatic Classifications of Points Using Strips. 29:1-29:17 - Michael Levet:
Parallel Algorithms for Group Isomorphism via Code Equivalence. 30:1-30:19 - Young-San Lin, Alexander Turoczy:
Improved and Parameterized Algorithms for Online Multi-Level Aggregation. 31:1-31:17 - Anand Louis, Kirtan Vora:
Semirandom Planted Bipartite Subgraphs. 32:1-32:13 - Alma Arevalo Loyola, Ahmad Biniaz, Prosenjit Bose, Thomas C. Shermer:
Polychromatic 2-Colorings with Bounded Discrepancy for Triangulations. 33:1-33:13 - Kengo Nakamura, Masaaki Nishino:
Linear-Time Exact Computation of Influence Spread on Bounded-Pathwidth Graphs. 34:1-34:17 - Ofer Neiman, Alon Spector:
Path-Reporting Distance Oracles for Vertex-Labeled Graphs. 35:1-35:16 - Seongbin Park, Eunjin Oh:
Exact Subquadratic Algorithm for Many-To-Many Matching on Planar Point Sets with Integer Coordinates. 36:1-36:16 - Ovidiu Rata:
Faster Linear-Space Data Structures for Path Frequency Queries. 37:1-37:17 - Liam Roditty, Plia Trabelsi:
New Algorithms for Girth and Cycle Detection. 38:1-38:17 - Tatsuya Terao:
Faster Approximate Linear Matroid Intersection. 39:1-39:19 - Anastasiia Tkachenko, Haitao Wang:
Maximum Independent Sets in Disk Graphs with Disks in Convex Position. 40:1-40:18
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-06-19 00:12 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:
