LIPIcs, Volume 227, SWAT 2022

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