default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID18th SWAT 2022: Tórshavn, Faroe Islands
- Artur Czumaj
, Qin Xin:
18th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2022, Tórshavn, Faroe Islands, June 27-29, 2022. LIPIcs 227, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-236-5 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:10
- Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz:
On Realizing a Single Degree Sequence by a Bipartite Graph (Invited Paper). 1:1-1:17 - Leszek Gasieniec, Grzegorz Stachowiak:
Time, Clocks and Efficiency of Population Protocols (Invited Paper). 2:1-2:2 - Mikkel Thorup:
Reconstructing the Tree of Life (Fitting Distances by Tree Metrics) (Invited Paper). 3:1-3:2 - Hugo A. Akitaya, Erik D. Demaine, Matias Korman, Irina Kostitsyna, Irene Parada, Willem Sonke, Bettina Speckmann, Ryuhei Uehara, Jules Wulms:
Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares. 4:1-4:19 - David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt:
Fault-Tolerant Edge-Disjoint s-t Paths - Beyond Uniform Faults. 5:1-5:19 - Pankaj K. Agarwal, Sharath Raghvendra, Pouyan Shirzadian, Rachita Sowle:
An Improved ε-Approximation Algorithm for Geometric Bipartite Matching. 6:1-6:20 - Safwa Ameer, Matt Gibson-Lopez, Erik Krohn, Qing Wang:
On the Visibility Graphs of Pseudo-Polygons: Recognition and Reconstruction. 7:1-7:13 - Patrizio Angelini, Michael A. Bekos, Giordano Da Lozzo, Martin Gronemann, Fabrizio Montecchiani, Alessandra Tappini:
Recognizing Map Graphs of Bounded Treewidth. 8:1-8:18 - Antonios Antoniadis, Peyman Jabbarzade, Golnoosh Shahkarami:
A Novel Prediction Setup for Online Speed-Scaling. 9:1-9:20 - Antonios Antoniadis, Sándor Kisfaludi-Bak, Bundit Laekhanukit, Daniel Vaz:
On the Approximability of the Traveling Salesman Problem with Line Neighborhoods. 10:1-10:21 - Boris Aronov, Matthew J. Katz:
Dynamic Approximate Multiplicatively-Weighted Nearest Neighbors. 11:1-11:14 - Max Bannach, Pamela Fleischmann, Malte Skambath:
MaxSAT with Absolute Value Functions: A Parameterized Perspective. 12:1-12:20 - Cristina Bazgan, Katrin Casel, Pierre Cazals:
Dense Graph Partitioning on Sparse and Dense Graphs. 13:1-13:15 - Benjamin Aram Berendsohn:
The Diameter of Caterpillar Associahedra. 14:1-14:12 - Mark de Berg, Arpan Sadhukhan, Frits C. R. Spieksma:
Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem. 15:1-15:21 - Helena Bergold, Daniel Bertschinger, Nicolas Grelier, Wolfgang Mulzer, Patrick Schnider:
Well-Separation and Hyperplane Transversals in High Dimensions. 16:1-16:14 - Daniel Bertschinger, Meghana M. Reddy, Enrico Mann:
Lions and Contamination: Monotone Clearings. 17:1-17:11 - Philip Bille, Inge Li Gørtz, Tord Stordalen:
Predecessor on the Ultra-Wide Word RAM. 18:1-18:15 - Prosenjit Bose, Pat Morin, Saeed Odak:
An Optimal Algorithm for Product Structure in Planar Graphs. 19:1-19:14 - Joan Boyar, Lene M. Favrholdt, Kim S. Larsen:
Online Unit Profit Knapsack with Untrusted Predictions. 20:1-20:17 - Jonas Cleve, Nicolas Grelier, Kristin Knorr, Maarten Löffler, Wolfgang Mulzer, Daniel Perz:
Nearest-Neighbor Decompositions of Drawings. 21:1-21:16 - Zdenek Dvorák:
Approximation Metatheorems for Classes with Bounded Expansion. 22:1-22:17 - Michael Elkin, Yuval Gitlitz, Ofer Neiman:
Almost Shortest Paths with Near-Additive Error in Weighted Graphs. 23:1-23:22 - Foivos Fioravantes, Nikolaos Melissinos, Theofilos Triommatis:
Complexity of Finding Maximum Locally Irregular Induced Subgraphs. 24:1-24:20 - Junhao Gan, Anthony Wirth, Xin Zhang:
An Almost Optimal Algorithm for Unbounded Search with Noisy Information. 25:1-25:15 - Matt Gibson-Lopez, Serge Zamarripa:
Optimal Bounds for Weak Consistent Digital Rays in 2D. 26:1-26:20 - Chien-Chung Huang, François Sellier:
Matroid-Constrained Maximum Vertex Cover: Approximate Kernels and Streaming Algorithms. 27:1-27:15 - Tanmay Inamdar, Kasturi R. Varadarajan:
Non-Uniform k-Center and Greedy Clustering. 28:1-28:20 - Pascal Kunz, Till Fluschnik, Rolf Niedermeier, Malte Renken:
Most Classic Problems Remain NP-Hard on Relative Neighborhood Graphs and Their Relatives. 29:1-29:19 - Sharath Raghvendra, Rachita Sowle:
A Scalable Work Function Algorithm for the k-Server Problem. 30:1-30:20 - Md Lutfar Rahman, Thomas Watson:
Erdős-Selfridge Theorem for Nonmonotone CNFs. 31:1-31:11 - Haitao Wang:
Unit-Disk Range Searching and Applications. 32:1-32:17 - Tatsuya Yanagita, Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti:
Space-Efficient Data Structure for Posets with Applications. 33:1-33:16
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-11-28 23:54 CET 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:
