<h2>LIPIcs, Volume 227, SWAT 2022</h2>
<ul>
<li>
<span class="authors">Artur Czumaj and Qin Xin</span>
<span class="title">LIPIcs, Volume 227, SWAT 2022, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2022">10.4230/LIPIcs.SWAT.2022</a>
</li>
<li>
<span class="authors">Artur Czumaj and Qin Xin</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2022.0">10.4230/LIPIcs.SWAT.2022.0</a>
</li>
<li>
<span class="authors">Amotz Bar-Noy, Toni Böhnlein, David Peleg, and Dror Rawitz</span>
<span class="title">On Realizing a Single Degree Sequence by a Bipartite Graph (Invited Paper)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2022.1">10.4230/LIPIcs.SWAT.2022.1</a>
</li>
<li>
<span class="authors">Leszek Gąsieniec and Grzegorz Stachowiak</span>
<span class="title">Time, Clocks and Efficiency of Population Protocols (Invited Paper)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2022.2">10.4230/LIPIcs.SWAT.2022.2</a>
</li>
<li>
<span class="authors">Mikkel Thorup</span>
<span class="title">Reconstructing the Tree of Life (Fitting Distances by Tree Metrics) (Invited Paper)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2022.3">10.4230/LIPIcs.SWAT.2022.3</a>
</li>
<li>
<span class="authors">Hugo A. Akitaya, Erik D. Demaine, Matias Korman, Irina Kostitsyna, Irene Parada, Willem Sonke, Bettina Speckmann, Ryuhei Uehara, and Jules Wulms</span>
<span class="title">Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2022.4">10.4230/LIPIcs.SWAT.2022.4</a>
</li>
<li>
<span class="authors">David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler, and Oliver Schaudt</span>
<span class="title">Fault-Tolerant Edge-Disjoint s-t Paths - Beyond Uniform Faults</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2022.5">10.4230/LIPIcs.SWAT.2022.5</a>
</li>
<li>
<span class="authors">Pankaj K. Agarwal, Sharath Raghvendra, Pouyan Shirzadian, and Rachita Sowle</span>
<span class="title">An Improved ε-Approximation Algorithm for Geometric Bipartite Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2022.6">10.4230/LIPIcs.SWAT.2022.6</a>
</li>
<li>
<span class="authors">Safwa Ameer, Matt Gibson-Lopez, Erik Krohn, and Qing Wang</span>
<span class="title">On the Visibility Graphs of Pseudo-Polygons: Recognition and Reconstruction</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2022.7">10.4230/LIPIcs.SWAT.2022.7</a>
</li>
<li>
<span class="authors">Patrizio Angelini, Michael A. Bekos, Giordano Da Lozzo, Martin Gronemann, Fabrizio Montecchiani, and Alessandra Tappini</span>
<span class="title">Recognizing Map Graphs of Bounded Treewidth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2022.8">10.4230/LIPIcs.SWAT.2022.8</a>
</li>
<li>
<span class="authors">Antonios Antoniadis, Peyman Jabbarzade, and Golnoosh Shahkarami</span>
<span class="title">A Novel Prediction Setup for Online Speed-Scaling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2022.9">10.4230/LIPIcs.SWAT.2022.9</a>
</li>
<li>
<span class="authors">Antonios Antoniadis, Sándor Kisfaludi-Bak, Bundit Laekhanukit, and Daniel Vaz</span>
<span class="title">On the Approximability of the Traveling Salesman Problem with Line Neighborhoods</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2022.10">10.4230/LIPIcs.SWAT.2022.10</a>
</li>
<li>
<span class="authors">Boris Aronov and Matthew J. Katz</span>
<span class="title">Dynamic Approximate Multiplicatively-Weighted Nearest Neighbors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2022.11">10.4230/LIPIcs.SWAT.2022.11</a>
</li>
<li>
<span class="authors">Max Bannach, Pamela Fleischmann, and Malte Skambath</span>
<span class="title">MaxSAT with Absolute Value Functions: A Parameterized Perspective</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2022.12">10.4230/LIPIcs.SWAT.2022.12</a>
</li>
<li>
<span class="authors">Cristina Bazgan, Katrin Casel, and Pierre Cazals</span>
<span class="title">Dense Graph Partitioning on Sparse and Dense Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2022.13">10.4230/LIPIcs.SWAT.2022.13</a>
</li>
<li>
<span class="authors">Benjamin Aram Berendsohn</span>
<span class="title">The Diameter of Caterpillar Associahedra</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2022.14">10.4230/LIPIcs.SWAT.2022.14</a>
</li>
<li>
<span class="authors">Mark de Berg, Arpan Sadhukhan, and Frits Spieksma</span>
<span class="title">Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2022.15">10.4230/LIPIcs.SWAT.2022.15</a>
</li>
<li>
<span class="authors">Helena Bergold, Daniel Bertschinger, Nicolas Grelier, Wolfgang Mulzer, and Patrick Schnider</span>
<span class="title">Well-Separation and Hyperplane Transversals in High Dimensions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2022.16">10.4230/LIPIcs.SWAT.2022.16</a>
</li>
<li>
<span class="authors">Daniel Bertschinger, Meghana M. Reddy, and Enrico Mann</span>
<span class="title">Lions and Contamination: Monotone Clearings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2022.17">10.4230/LIPIcs.SWAT.2022.17</a>
</li>
<li>
<span class="authors">Philip Bille, Inge Li Gørtz, and Tord Stordalen</span>
<span class="title">Predecessor on the Ultra-Wide Word RAM</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2022.18">10.4230/LIPIcs.SWAT.2022.18</a>
</li>
<li>
<span class="authors">Prosenjit Bose, Pat Morin, and Saeed Odak</span>
<span class="title">An Optimal Algorithm for Product Structure in Planar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2022.19">10.4230/LIPIcs.SWAT.2022.19</a>
</li>
<li>
<span class="authors">Joan Boyar, Lene M. Favrholdt, and Kim S. Larsen</span>
<span class="title">Online Unit Profit Knapsack with Untrusted Predictions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2022.20">10.4230/LIPIcs.SWAT.2022.20</a>
</li>
<li>
<span class="authors">Jonas Cleve, Nicolas Grelier, Kristin Knorr, Maarten Löffler, Wolfgang Mulzer, and Daniel Perz</span>
<span class="title">Nearest-Neighbor Decompositions of Drawings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2022.21">10.4230/LIPIcs.SWAT.2022.21</a>
</li>
<li>
<span class="authors">Zdeněk Dvořák</span>
<span class="title">Approximation Metatheorems for Classes with Bounded Expansion</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2022.22">10.4230/LIPIcs.SWAT.2022.22</a>
</li>
<li>
<span class="authors">Michael Elkin, Yuval Gitlitz, and Ofer Neiman</span>
<span class="title">Almost Shortest Paths with Near-Additive Error in Weighted Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2022.23">10.4230/LIPIcs.SWAT.2022.23</a>
</li>
<li>
<span class="authors">Foivos Fioravantes, Nikolaos Melissinos, and Theofilos Triommatis</span>
<span class="title">Complexity of Finding Maximum Locally Irregular Induced Subgraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2022.24">10.4230/LIPIcs.SWAT.2022.24</a>
</li>
<li>
<span class="authors">Junhao Gan, Anthony Wirth, and Xin Zhang</span>
<span class="title">An Almost Optimal Algorithm for Unbounded Search with Noisy Information</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2022.25">10.4230/LIPIcs.SWAT.2022.25</a>
</li>
<li>
<span class="authors">Matt Gibson-Lopez and Serge Zamarripa</span>
<span class="title">Optimal Bounds for Weak Consistent Digital Rays in 2D</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2022.26">10.4230/LIPIcs.SWAT.2022.26</a>
</li>
<li>
<span class="authors">Chien-Chung Huang and François Sellier</span>
<span class="title">Matroid-Constrained Maximum Vertex Cover: Approximate Kernels and Streaming Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2022.27">10.4230/LIPIcs.SWAT.2022.27</a>
</li>
<li>
<span class="authors">Tanmay Inamdar and Kasturi Varadarajan</span>
<span class="title">Non-Uniform k-Center and Greedy Clustering</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2022.28">10.4230/LIPIcs.SWAT.2022.28</a>
</li>
<li>
<span class="authors">Pascal Kunz, Till Fluschnik, Rolf Niedermeier, and Malte Renken</span>
<span class="title">Most Classic Problems Remain NP-Hard on Relative Neighborhood Graphs and Their Relatives</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2022.29">10.4230/LIPIcs.SWAT.2022.29</a>
</li>
<li>
<span class="authors">Sharath Raghvendra and Rachita Sowle</span>
<span class="title">A Scalable Work Function Algorithm for the k-Server Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2022.30">10.4230/LIPIcs.SWAT.2022.30</a>
</li>
<li>
<span class="authors">Md Lutfar Rahman and Thomas Watson</span>
<span class="title">Erdős-Selfridge Theorem for Nonmonotone CNFs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2022.31">10.4230/LIPIcs.SWAT.2022.31</a>
</li>
<li>
<span class="authors">Haitao Wang</span>
<span class="title">Unit-Disk Range Searching and Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2022.32">10.4230/LIPIcs.SWAT.2022.32</a>
</li>
<li>
<span class="authors">Tatsuya Yanagita, Sankardeep Chakraborty, Kunihiko Sadakane, and Srinivasa Rao Satti</span>
<span class="title">Space-Efficient Data Structure for Posets with Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.SWAT.2022.33">10.4230/LIPIcs.SWAT.2022.33</a>
</li>
</ul>
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