@Proceedings{czumaj_et_al:LIPIcs.SWAT.2022,
title = {{LIPIcs, Volume 227, SWAT 2022, Complete Volume}},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)},
pages = {1--558},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-236-5},
ISSN = {1868-8969},
year = {2022},
volume = {227},
editor = {Czumaj, Artur and Xin, Qin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022},
URN = {urn:nbn:de:0030-drops-161599},
doi = {10.4230/LIPIcs.SWAT.2022},
annote = {Keywords: LIPIcs, Volume 227, SWAT 2022, Complete Volume}
}
@InProceedings{czumaj_et_al:LIPIcs.SWAT.2022.0,
author = {Czumaj, Artur and Xin, Qin},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)},
pages = {0:i--0:x},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-236-5},
ISSN = {1868-8969},
year = {2022},
volume = {227},
editor = {Czumaj, Artur and Xin, Qin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022.0},
URN = {urn:nbn:de:0030-drops-161602},
doi = {10.4230/LIPIcs.SWAT.2022.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{barnoy_et_al:LIPIcs.SWAT.2022.1,
author = {Bar-Noy, Amotz and B\"{o}hnlein, Toni and Peleg, David and Rawitz, Dror},
title = {{On Realizing a Single Degree Sequence by a Bipartite Graph}},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)},
pages = {1:1--1:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-236-5},
ISSN = {1868-8969},
year = {2022},
volume = {227},
editor = {Czumaj, Artur and Xin, Qin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022.1},
URN = {urn:nbn:de:0030-drops-161618},
doi = {10.4230/LIPIcs.SWAT.2022.1},
annote = {Keywords: Degree Sequences, Graph Realization, Bipartite Graphs, Graphic Sequences, Bigraphic Sequences, Multigraph Realization}
}
@InProceedings{gasieniec_et_al:LIPIcs.SWAT.2022.2,
author = {G\k{a}sieniec, Leszek and Stachowiak, Grzegorz},
title = {{Time, Clocks and Efficiency of Population Protocols}},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)},
pages = {2:1--2:2},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-236-5},
ISSN = {1868-8969},
year = {2022},
volume = {227},
editor = {Czumaj, Artur and Xin, Qin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022.2},
URN = {urn:nbn:de:0030-drops-161624},
doi = {10.4230/LIPIcs.SWAT.2022.2},
annote = {Keywords: Population protocols, phase clocks, oscillators, parallel time and efficiency}
}
@InProceedings{thorup:LIPIcs.SWAT.2022.3,
author = {Thorup, Mikkel},
title = {{Reconstructing the Tree of Life (Fitting Distances by Tree Metrics)}},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)},
pages = {3:1--3:2},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-236-5},
ISSN = {1868-8969},
year = {2022},
volume = {227},
editor = {Czumaj, Artur and Xin, Qin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022.3},
URN = {urn:nbn:de:0030-drops-161631},
doi = {10.4230/LIPIcs.SWAT.2022.3},
annote = {Keywords: Numerical taxonomy, computational phylogenetics, hierarchical clustering}
}
@InProceedings{a.akitaya_et_al:LIPIcs.SWAT.2022.4,
author = {A. Akitaya, Hugo and Demaine, Erik D. and Korman, Matias and Kostitsyna, Irina and Parada, Irene and Sonke, Willem and Speckmann, Bettina and Uehara, Ryuhei and Wulms, Jules},
title = {{Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares}},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)},
pages = {4:1--4:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-236-5},
ISSN = {1868-8969},
year = {2022},
volume = {227},
editor = {Czumaj, Artur and Xin, Qin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022.4},
URN = {urn:nbn:de:0030-drops-161644},
doi = {10.4230/LIPIcs.SWAT.2022.4},
annote = {Keywords: Sliding cubes, Reconfiguration, Modular robots, NP-hardness}
}
@InProceedings{adjiashvili_et_al:LIPIcs.SWAT.2022.5,
author = {Adjiashvili, David and Hommelsheim, Felix and M\"{u}hlenthaler, Moritz and Schaudt, Oliver},
title = {{Fault-Tolerant Edge-Disjoint s-t Paths - Beyond Uniform Faults}},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)},
pages = {5:1--5:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-236-5},
ISSN = {1868-8969},
year = {2022},
volume = {227},
editor = {Czumaj, Artur and Xin, Qin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022.5},
URN = {urn:nbn:de:0030-drops-161659},
doi = {10.4230/LIPIcs.SWAT.2022.5},
annote = {Keywords: graph algorithms, network design, fault tolerance, approximation algorithms}
}
@InProceedings{agarwal_et_al:LIPIcs.SWAT.2022.6,
author = {Agarwal, Pankaj K. and Raghvendra, Sharath and Shirzadian, Pouyan and Sowle, Rachita},
title = {{An Improved \epsilon-Approximation Algorithm for Geometric Bipartite Matching}},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)},
pages = {6:1--6:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-236-5},
ISSN = {1868-8969},
year = {2022},
volume = {227},
editor = {Czumaj, Artur and Xin, Qin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022.6},
URN = {urn:nbn:de:0030-drops-161660},
doi = {10.4230/LIPIcs.SWAT.2022.6},
annote = {Keywords: Euclidean bipartite matching, approximation algorithms, primal dual method}
}
@InProceedings{ameer_et_al:LIPIcs.SWAT.2022.7,
author = {Ameer, Safwa and Gibson-Lopez, Matt and Krohn, Erik and Wang, Qing},
title = {{On the Visibility Graphs of Pseudo-Polygons: Recognition and Reconstruction}},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)},
pages = {7:1--7:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-236-5},
ISSN = {1868-8969},
year = {2022},
volume = {227},
editor = {Czumaj, Artur and Xin, Qin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022.7},
URN = {urn:nbn:de:0030-drops-161673},
doi = {10.4230/LIPIcs.SWAT.2022.7},
annote = {Keywords: Pseudo-Polygons, Visibility Graph Recognition, Visibility Graph Reconstruction}
}
@InProceedings{angelini_et_al:LIPIcs.SWAT.2022.8,
author = {Angelini, Patrizio and Bekos, Michael A. and Da Lozzo, Giordano and Gronemann, Martin and Montecchiani, Fabrizio and Tappini, Alessandra},
title = {{Recognizing Map Graphs of Bounded Treewidth}},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)},
pages = {8:1--8:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-236-5},
ISSN = {1868-8969},
year = {2022},
volume = {227},
editor = {Czumaj, Artur and Xin, Qin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022.8},
URN = {urn:nbn:de:0030-drops-161681},
doi = {10.4230/LIPIcs.SWAT.2022.8},
annote = {Keywords: Map graphs, Recognition, Parameterized complexity}
}
@InProceedings{antoniadis_et_al:LIPIcs.SWAT.2022.9,
author = {Antoniadis, Antonios and Jabbarzade, Peyman and Shahkarami, Golnoosh},
title = {{A Novel Prediction Setup for Online Speed-Scaling}},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)},
pages = {9:1--9:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-236-5},
ISSN = {1868-8969},
year = {2022},
volume = {227},
editor = {Czumaj, Artur and Xin, Qin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022.9},
URN = {urn:nbn:de:0030-drops-161693},
doi = {10.4230/LIPIcs.SWAT.2022.9},
annote = {Keywords: learning augmented algorithms, speed-scaling, energy-efficiency, scheduling theory, online algorithms}
}
@InProceedings{antoniadis_et_al:LIPIcs.SWAT.2022.10,
author = {Antoniadis, Antonios and Kisfaludi-Bak, S\'{a}ndor and Laekhanukit, Bundit and Vaz, Daniel},
title = {{On the Approximability of the Traveling Salesman Problem with Line Neighborhoods}},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)},
pages = {10:1--10:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-236-5},
ISSN = {1868-8969},
year = {2022},
volume = {227},
editor = {Czumaj, Artur and Xin, Qin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022.10},
URN = {urn:nbn:de:0030-drops-161706},
doi = {10.4230/LIPIcs.SWAT.2022.10},
annote = {Keywords: Traveling Salesman with neighborhoods, Group Steiner Tree, Geometric approximation algorithms}
}
@InProceedings{aronov_et_al:LIPIcs.SWAT.2022.11,
author = {Aronov, Boris and Katz, Matthew J.},
title = {{Dynamic Approximate Multiplicatively-Weighted Nearest Neighbors}},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)},
pages = {11:1--11:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-236-5},
ISSN = {1868-8969},
year = {2022},
volume = {227},
editor = {Czumaj, Artur and Xin, Qin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022.11},
URN = {urn:nbn:de:0030-drops-161710},
doi = {10.4230/LIPIcs.SWAT.2022.11},
annote = {Keywords: Nearest neighbors, Approximate nearest neighbors, Weighted nearest neighbors, Nearest neighbor queries, SINR queries, Dynamic data structures}
}
@InProceedings{bannach_et_al:LIPIcs.SWAT.2022.12,
author = {Bannach, Max and Fleischmann, Pamela and Skambath, Malte},
title = {{MaxSAT with Absolute Value Functions: A Parameterized Perspective}},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)},
pages = {12:1--12:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-236-5},
ISSN = {1868-8969},
year = {2022},
volume = {227},
editor = {Czumaj, Artur and Xin, Qin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022.12},
URN = {urn:nbn:de:0030-drops-161728},
doi = {10.4230/LIPIcs.SWAT.2022.12},
annote = {Keywords: parameterized complexity, kernelization, weighted maximum satisfiability, absolute value maximization}
}
@InProceedings{bazgan_et_al:LIPIcs.SWAT.2022.13,
author = {Bazgan, Cristina and Casel, Katrin and Cazals, Pierre},
title = {{Dense Graph Partitioning on Sparse and Dense Graphs}},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)},
pages = {13:1--13:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-236-5},
ISSN = {1868-8969},
year = {2022},
volume = {227},
editor = {Czumaj, Artur and Xin, Qin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022.13},
URN = {urn:nbn:de:0030-drops-161732},
doi = {10.4230/LIPIcs.SWAT.2022.13},
annote = {Keywords: NP-hardness, approximation, density, graph partitioning, bipartite graphs, cubic graphs, dense graphs}
}
@InProceedings{berendsohn:LIPIcs.SWAT.2022.14,
author = {Berendsohn, Benjamin Aram},
title = {{The Diameter of Caterpillar Associahedra}},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)},
pages = {14:1--14:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-236-5},
ISSN = {1868-8969},
year = {2022},
volume = {227},
editor = {Czumaj, Artur and Xin, Qin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022.14},
URN = {urn:nbn:de:0030-drops-161743},
doi = {10.4230/LIPIcs.SWAT.2022.14},
annote = {Keywords: Graph Associahedra, Binary Search Trees, Elimination Trees}
}
@InProceedings{deberg_et_al:LIPIcs.SWAT.2022.15,
author = {de Berg, Mark and Sadhukhan, Arpan and Spieksma, Frits},
title = {{Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem}},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)},
pages = {15:1--15:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-236-5},
ISSN = {1868-8969},
year = {2022},
volume = {227},
editor = {Czumaj, Artur and Xin, Qin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022.15},
URN = {urn:nbn:de:0030-drops-161756},
doi = {10.4230/LIPIcs.SWAT.2022.15},
annote = {Keywords: Computational geometry, online algorithms, broadcast range assignment, stable approximation schemes}
}
@InProceedings{bergold_et_al:LIPIcs.SWAT.2022.16,
author = {Bergold, Helena and Bertschinger, Daniel and Grelier, Nicolas and Mulzer, Wolfgang and Schnider, Patrick},
title = {{Well-Separation and Hyperplane Transversals in High Dimensions}},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)},
pages = {16:1--16:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-236-5},
ISSN = {1868-8969},
year = {2022},
volume = {227},
editor = {Czumaj, Artur and Xin, Qin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022.16},
URN = {urn:nbn:de:0030-drops-161766},
doi = {10.4230/LIPIcs.SWAT.2022.16},
annote = {Keywords: hyperplane transversal, high-dimension, hardness}
}
@InProceedings{bertschinger_et_al:LIPIcs.SWAT.2022.17,
author = {Bertschinger, Daniel and M. Reddy, Meghana and Mann, Enrico},
title = {{Lions and Contamination: Monotone Clearings}},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)},
pages = {17:1--17:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-236-5},
ISSN = {1868-8969},
year = {2022},
volume = {227},
editor = {Czumaj, Artur and Xin, Qin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022.17},
URN = {urn:nbn:de:0030-drops-161778},
doi = {10.4230/LIPIcs.SWAT.2022.17},
annote = {Keywords: Algorithmic Games, Pursuit-Evasion Games, Graph Contamination, Clearings}
}
@InProceedings{bille_et_al:LIPIcs.SWAT.2022.18,
author = {Bille, Philip and G{\o}rtz, Inge Li and Stordalen, Tord},
title = {{Predecessor on the Ultra-Wide Word RAM}},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)},
pages = {18:1--18:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-236-5},
ISSN = {1868-8969},
year = {2022},
volume = {227},
editor = {Czumaj, Artur and Xin, Qin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022.18},
URN = {urn:nbn:de:0030-drops-161786},
doi = {10.4230/LIPIcs.SWAT.2022.18},
annote = {Keywords: Ultra-wide word RAM model, predecessor, word-level parallelism}
}
@InProceedings{bose_et_al:LIPIcs.SWAT.2022.19,
author = {Bose, Prosenjit and Morin, Pat and Odak, Saeed},
title = {{An Optimal Algorithm for Product Structure in Planar Graphs}},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)},
pages = {19:1--19:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-236-5},
ISSN = {1868-8969},
year = {2022},
volume = {227},
editor = {Czumaj, Artur and Xin, Qin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022.19},
URN = {urn:nbn:de:0030-drops-161797},
doi = {10.4230/LIPIcs.SWAT.2022.19},
annote = {Keywords: Planar graphs, product structure}
}
@InProceedings{boyar_et_al:LIPIcs.SWAT.2022.20,
author = {Boyar, Joan and Favrholdt, Lene M. and Larsen, Kim S.},
title = {{Online Unit Profit Knapsack with Untrusted Predictions}},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)},
pages = {20:1--20:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-236-5},
ISSN = {1868-8969},
year = {2022},
volume = {227},
editor = {Czumaj, Artur and Xin, Qin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022.20},
URN = {urn:nbn:de:0030-drops-161800},
doi = {10.4230/LIPIcs.SWAT.2022.20},
annote = {Keywords: online algorithms, untrusted predictions, knapsack problem, competitive analysis}
}
@InProceedings{cleve_et_al:LIPIcs.SWAT.2022.21,
author = {Cleve, Jonas and Grelier, Nicolas and Knorr, Kristin and L\"{o}ffler, Maarten and Mulzer, Wolfgang and Perz, Daniel},
title = {{Nearest-Neighbor Decompositions of Drawings}},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)},
pages = {21:1--21:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-236-5},
ISSN = {1868-8969},
year = {2022},
volume = {227},
editor = {Czumaj, Artur and Xin, Qin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022.21},
URN = {urn:nbn:de:0030-drops-161812},
doi = {10.4230/LIPIcs.SWAT.2022.21},
annote = {Keywords: nearest-neighbors, decompositions, drawing}
}
@InProceedings{dvorak:LIPIcs.SWAT.2022.22,
author = {Dvo\v{r}\'{a}k, Zden\v{e}k},
title = {{Approximation Metatheorems for Classes with Bounded Expansion}},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)},
pages = {22:1--22:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-236-5},
ISSN = {1868-8969},
year = {2022},
volume = {227},
editor = {Czumaj, Artur and Xin, Qin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022.22},
URN = {urn:nbn:de:0030-drops-161823},
doi = {10.4230/LIPIcs.SWAT.2022.22},
annote = {Keywords: bounded expansion, approximation, meta-algorithms}
}
@InProceedings{elkin_et_al:LIPIcs.SWAT.2022.23,
author = {Elkin, Michael and Gitlitz, Yuval and Neiman, Ofer},
title = {{Almost Shortest Paths with Near-Additive Error in Weighted Graphs}},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)},
pages = {23:1--23:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-236-5},
ISSN = {1868-8969},
year = {2022},
volume = {227},
editor = {Czumaj, Artur and Xin, Qin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022.23},
URN = {urn:nbn:de:0030-drops-161833},
doi = {10.4230/LIPIcs.SWAT.2022.23},
annote = {Keywords: spanners, hopset, shortest paths, PRAM, distance oracles}
}
@InProceedings{fioravantes_et_al:LIPIcs.SWAT.2022.24,
author = {Fioravantes, Foivos and Melissinos, Nikolaos and Triommatis, Theofilos},
title = {{Complexity of Finding Maximum Locally Irregular Induced Subgraphs}},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)},
pages = {24:1--24:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-236-5},
ISSN = {1868-8969},
year = {2022},
volume = {227},
editor = {Czumaj, Artur and Xin, Qin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022.24},
URN = {urn:nbn:de:0030-drops-161842},
doi = {10.4230/LIPIcs.SWAT.2022.24},
annote = {Keywords: Locally irregular, largest induced subgraph, FPT, treewidth, W-hardness, approximability}
}
@InProceedings{gan_et_al:LIPIcs.SWAT.2022.25,
author = {Gan, Junhao and Wirth, Anthony and Zhang, Xin},
title = {{An Almost Optimal Algorithm for Unbounded Search with Noisy Information}},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)},
pages = {25:1--25:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-236-5},
ISSN = {1868-8969},
year = {2022},
volume = {227},
editor = {Czumaj, Artur and Xin, Qin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022.25},
URN = {urn:nbn:de:0030-drops-161854},
doi = {10.4230/LIPIcs.SWAT.2022.25},
annote = {Keywords: Fault-tolerant search, noisy binary search, query complexity}
}
@InProceedings{gibsonlopez_et_al:LIPIcs.SWAT.2022.26,
author = {Gibson-Lopez, Matt and Zamarripa, Serge},
title = {{Optimal Bounds for Weak Consistent Digital Rays in 2D}},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)},
pages = {26:1--26:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-236-5},
ISSN = {1868-8969},
year = {2022},
volume = {227},
editor = {Czumaj, Artur and Xin, Qin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022.26},
URN = {urn:nbn:de:0030-drops-161862},
doi = {10.4230/LIPIcs.SWAT.2022.26},
annote = {Keywords: Digital Geometry, Consistent Digital Rays}
}
@InProceedings{huang_et_al:LIPIcs.SWAT.2022.27,
author = {Huang, Chien-Chung and Sellier, Fran\c{c}ois},
title = {{Matroid-Constrained Maximum Vertex Cover: Approximate Kernels and Streaming Algorithms}},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)},
pages = {27:1--27:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-236-5},
ISSN = {1868-8969},
year = {2022},
volume = {227},
editor = {Czumaj, Artur and Xin, Qin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022.27},
URN = {urn:nbn:de:0030-drops-161874},
doi = {10.4230/LIPIcs.SWAT.2022.27},
annote = {Keywords: Maximum vertex cover, matroid, approximate kernel, streaming}
}
@InProceedings{inamdar_et_al:LIPIcs.SWAT.2022.28,
author = {Inamdar, Tanmay and Varadarajan, Kasturi},
title = {{Non-Uniform k-Center and Greedy Clustering}},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)},
pages = {28:1--28:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-236-5},
ISSN = {1868-8969},
year = {2022},
volume = {227},
editor = {Czumaj, Artur and Xin, Qin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022.28},
URN = {urn:nbn:de:0030-drops-161881},
doi = {10.4230/LIPIcs.SWAT.2022.28},
annote = {Keywords: k-center, approximation algorithms, non-uniform k-center, clustering}
}
@InProceedings{kunz_et_al:LIPIcs.SWAT.2022.29,
author = {Kunz, Pascal and Fluschnik, Till and Niedermeier, Rolf and Renken, Malte},
title = {{Most Classic Problems Remain NP-Hard on Relative Neighborhood Graphs and Their Relatives}},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)},
pages = {29:1--29:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-236-5},
ISSN = {1868-8969},
year = {2022},
volume = {227},
editor = {Czumaj, Artur and Xin, Qin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022.29},
URN = {urn:nbn:de:0030-drops-161891},
doi = {10.4230/LIPIcs.SWAT.2022.29},
annote = {Keywords: Proximity Graphs, Relatively Closest Graphs, Gabriel Graphs, 3-Colorability, Dominating Set, Feedback Vertex Set, Hamiltonian Cycle, Independent Set, Exponential-Time Hypothesis}
}
@InProceedings{raghvendra_et_al:LIPIcs.SWAT.2022.30,
author = {Raghvendra, Sharath and Sowle, Rachita},
title = {{A Scalable Work Function Algorithm for the k-Server Problem}},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)},
pages = {30:1--30:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-236-5},
ISSN = {1868-8969},
year = {2022},
volume = {227},
editor = {Czumaj, Artur and Xin, Qin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022.30},
URN = {urn:nbn:de:0030-drops-161906},
doi = {10.4230/LIPIcs.SWAT.2022.30},
annote = {Keywords: k-server, Work Function Algorithm, Minimum-cost Flow}
}
@InProceedings{rahman_et_al:LIPIcs.SWAT.2022.31,
author = {Rahman, Md Lutfar and Watson, Thomas},
title = {{Erd\H{o}s-Selfridge Theorem for Nonmonotone CNFs}},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)},
pages = {31:1--31:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-236-5},
ISSN = {1868-8969},
year = {2022},
volume = {227},
editor = {Czumaj, Artur and Xin, Qin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022.31},
URN = {urn:nbn:de:0030-drops-161916},
doi = {10.4230/LIPIcs.SWAT.2022.31},
annote = {Keywords: Game, nonmonotone, CNFs}
}
@InProceedings{wang:LIPIcs.SWAT.2022.32,
author = {Wang, Haitao},
title = {{Unit-Disk Range Searching and Applications}},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)},
pages = {32:1--32:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-236-5},
ISSN = {1868-8969},
year = {2022},
volume = {227},
editor = {Czumaj, Artur and Xin, Qin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022.32},
URN = {urn:nbn:de:0030-drops-161926},
doi = {10.4230/LIPIcs.SWAT.2022.32},
annote = {Keywords: Unit disks, disk range searching, batched range searching, distance selection, discrete 2-center, arrangements, cuttings}
}
@InProceedings{yanagita_et_al:LIPIcs.SWAT.2022.33,
author = {Yanagita, Tatsuya and Chakraborty, Sankardeep and Sadakane, Kunihiko and Satti, Srinivasa Rao},
title = {{Space-Efficient Data Structure for Posets with Applications}},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)},
pages = {33:1--33:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-236-5},
ISSN = {1868-8969},
year = {2022},
volume = {227},
editor = {Czumaj, Artur and Xin, Qin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022.33},
URN = {urn:nbn:de:0030-drops-161931},
doi = {10.4230/LIPIcs.SWAT.2022.33},
annote = {Keywords: Succinct Data Structures, Posets, Blockchain}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing