PAPERS ACCEPTED TO SWAT 2022
Philip Bille, Inge Li Gørtz and Tord Stordalen. Predecessor on the Ultra-Wide Word RAM.
Antonios Antoniadis, Peyman Jabbarzade Ganje and Golnoosh Shahkarami. A Novel Prediction Setup for Online Speed-Scaling.
Md Lutfar Rahman and Thomas Watson. Erdos-Selfridge Theorem for Nonmonotone CNFs.
Patrizio Angelini, Michael Bekos, Giordano Da Lozzo, Martin Gronemann, Fabrizio Montecchiani and Alessandra Tappini. Recognizing Map Graphs of Bounded Treewidth.
Haitao Wang. Unit-Disk Range Searching and Applications.
Max Bannach, Pamela Fleischmann and Malte Skambath. Max-SAT with Absolute Value Functions: A Parameterized Perspective.
Prosenjit Bose, Pat Morin and Saeed Odak. An Optimal Algorithm for Product Structure in Planar Graphs.
Joan Boyar, Lene Favrholdt and Kim S. Larsen. Online Unit Profit Knapsack with Untrusted Predictions.
Matt Gibson-Lopez and Serge Zamarripa. Optimal Bounds for Weak Consistent Digital Rays in 2D
Chien-Chung Huang and François Sellier. Matroid-Constrained Maximum Vertex Cover: Approximate Kernels and Streaming Algorithms.
Benjamin Aram Berendsohn. The Diameter of Caterpillar Associahedra.
Antonios Antoniadis, Sándor Kisfaludi-Bak, Bundit Laekhanukit and Daniel Vaz. On the Approximability of the Traveling Salesman Problem with Line Neighborhoods.
Zdenek Dvorak. Approximation Metatheorems for Classes with Bounded Expansion.
Tatsuya Yanagita, Sankardeep Chakraborty, Kunihiko Sadakane and Srinivasa Rao Satti. Space-Efficient Data Structure for Posets with Applications.
Jonas Cleve, Nicolas Grelier, Kristin Knorr, Maarten Löffler, Wolfgang Mulzer and Daniel Perz. Nearest-Neighbor Decompositions of Drawings.
Tanmay Inamdar and Kasturi Varadarajan. Non-Uniform k-Center and Greedy Clustering
Boris Aronov and Matthew Katz. Dynamic Approximate Multiplicatively-Weighted Nearest Neighbors.
Hugo 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.
David Adjiashvili, Felix Hommelsheim, Moritz Muehlenthaler and Oliver Schaudt. Fault-Tolerant Edge-Disjoint s-t Paths - Beyond Uniform Faults.
Michael Elkin, Yuval Gitlitz and Ofer Neiman. Almost Shortest Paths with Near-Additive Error in Weighted Graphs.
Helena Bergold, Daniel Bertschinger, Nicolas Grelier, Wolfgang Mulzer and Patrick Schnider. Well-Separation and Hyperplane Transversals in High Dimensions.
Mark De Berg, Arpan Sadhukhan and Frits Spieksma. Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem.
Foivos Fioravantes, Nikolaos Melissinos and Theofilos Triomatis.
Complexity of Finding Maximum Locally Irregular Induced Subgraphs.
Safwa Ameer, Matt Gibson-Lopez, Erik Krohn and Qing Wang. On the Visibility Graphs of Pseudo-Polygons and Simple Polygons.
Pankaj K. Agarwal, Sharath Raghvendra, Pouyan Shirzadian and Rachita Sowle. An Improved epsilon-Approximation Algorithm for Geometric Bipartite Matching.
Junhao Gan, Anthony Wirth and Xin Zhang. An Almost Optimal Algorithm for Unbounded Search with Noisy Information.
Cristina Bazgan, Katrin Casel and Pierre Cazals. Dense Graph Partitioning on Sparse and Dense Graphs.
Rachita Sowle and Sharath Raghvendra. A Scalable Work Function Algorithm for the k-Server Problem.
Daniel Bertschinger, Meghana M Reddy and Enrico Mann. Lions and
Contamination: Monotone Clearings.
Pascal Kunz, Till Fluschnik, Rolf Niedermeier and Malte Renken. Most Classic Problems Remain NP-hard on Relative Neighborhood Graphs and Their Relatives.