LIPIcs, Volume 187, STACS 2021

• Markus Bläser and Benjamin Monmege LIPIcs, Volume 187, STACS 2021, Complete Volume 10.4230/LIPIcs.STACS.2021
• Markus Bläser and Benjamin Monmege Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.STACS.2021.0
• Peter Bürgisser Optimization, Complexity and Invariant Theory (Invited Talk) 10.4230/LIPIcs.STACS.2021.1
• Patrice Ossona de Mendez First-Order Transductions of Graphs (Invited Talk) 10.4230/LIPIcs.STACS.2021.2
• Lidia Tendera On the Fluted Fragment (Invited Talk) 10.4230/LIPIcs.STACS.2021.3
• Divesh Aggarwal, Yanlin Chen, Rajendra Kumar, and Yixin Shen Improved (Provable) Algorithms for the Shortest Vector Problem via Bounded Distance Decoding 10.4230/LIPIcs.STACS.2021.4
• Akanksha Agrawal, Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, and Saket Saurabh An FPT Algorithm for Elimination Distance to Bounded Degree Graphs 10.4230/LIPIcs.STACS.2021.5
• Simon Apers, András Gilyén, and Stacey Jeffery A Unified Framework of Quantum Walk Search 10.4230/LIPIcs.STACS.2021.6
• Anna Arutyunova and Melanie Schmidt Achieving Anonymity via Weak Lower Bound Constraints for k-Median and k-Means 10.4230/LIPIcs.STACS.2021.7
• Corentin Barloy and Lorenzo Clemente Bidimensional Linear Recursive Sequences and Universality of Unambiguous Register Automata 10.4230/LIPIcs.STACS.2021.8
• Siddharth Barman, Omar Fawzi, and Paul Fermé Tight Approximation Guarantees for Concave Coverage Problems 10.4230/LIPIcs.STACS.2021.9
• Libor Barto, Diego Battistelli, and Kevin M. Berg Symmetric Promise Constraint Satisfaction Problems: Beyond the Boolean Case 10.4230/LIPIcs.STACS.2021.10
• Pascal Bergsträßer, Moses Ganardi, and Georg Zetzsche A Characterization of Wreath Products Where Knapsack Is Decidable 10.4230/LIPIcs.STACS.2021.11
• Mikhail V. Berlinkov, Robert Ferens, Andrew Ryzhikov, and Marek Szykuła Synchronizing Strongly Connected Partial DFAs 10.4230/LIPIcs.STACS.2021.12
• Sujoy Bhore and Csaba D. Tóth On Euclidean Steiner (1+ε)-Spanners 10.4230/LIPIcs.STACS.2021.13
• Marcin Bienkowski, Björn Feldkord, and Paweł Schmidt A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location 10.4230/LIPIcs.STACS.2021.14
• Andreas Björklund An Asymptotically Fast Polynomial Space Algorithm for Hamiltonicity Detection in Sparse Directed Graphs 10.4230/LIPIcs.STACS.2021.15
• Hans-Joachim Böckenhauer, Elisabet Burjons, Juraj Hromkovič, Henri Lotze, and Peter Rossmanith Online Simple Knapsack with Reservation Costs 10.4230/LIPIcs.STACS.2021.16
• Édouard Bonnet Inapproximability of Diameter in Super-Linear Time: Beyond the 5/3 Ratio 10.4230/LIPIcs.STACS.2021.17
• Ulrich A. Brodowsky and Stefan Hougardy The Approximation Ratio of the 2-Opt Heuristic for the Euclidean Traveling Salesman Problem 10.4230/LIPIcs.STACS.2021.18
• Harry Buhrman, Subhasree Patro, and Florian Speelman A Framework of Quantum Strong Exponential-Time Hypotheses 10.4230/LIPIcs.STACS.2021.19
• Silvia Butti and Victor Dalmau The Complexity of the Distributed Constraint Satisfaction Problem 10.4230/LIPIcs.STACS.2021.20
• Keren Censor-Hillel, Dean Leitersdorf, and Volodymyr Polosukhin Distance Computations in the Hybrid Network Model via Oracle Simulations 10.4230/LIPIcs.STACS.2021.21
• Timothy M. Chan and Saladi Rahul Simple Multi-Pass Streaming Algorithms for Skyline Points and Extreme Points 10.4230/LIPIcs.STACS.2021.22
• Mahdi Cheraghchi, Shuichi Hirahara, Dimitrios Myrisiotis, and Yuichi Yoshida One-Tape Turing Machine and Branching Program Lower Bounds for MCSP 10.4230/LIPIcs.STACS.2021.23
• Amin Coja-Oghlan, Max Hahn-Klimroth, Philipp Loick, Noela Müller, Konstantinos Panagiotou, and Matija Pasch Inference and Mutual Information on Random Factor Graphs 10.4230/LIPIcs.STACS.2021.24
• Joel D. Day, Pamela Fleischmann, Maria Kosche, Tore Koß, Florin Manea, and Stefan Siemer The Edit Distance to k-Subsequence Universality 10.4230/LIPIcs.STACS.2021.25
• Pavel Dvořák and Michal Koucký Barrington Plays Cards: The Complexity of Card-Based Protocols 10.4230/LIPIcs.STACS.2021.26
• Thomas Erlebach, Michael Hoffmann, and Murilo Santos de Lima Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries 10.4230/LIPIcs.STACS.2021.27
• Léo Exibard, Emmanuel Filiot, and Ayrat Khalimov Church Synthesis on Register Automata over Linearly Ordered Data Domains 10.4230/LIPIcs.STACS.2021.28
• John Fearnley and Rahul Savani A Faster Algorithm for Finding Tarski Fixed Points 10.4230/LIPIcs.STACS.2021.29
• Robert Ferens and Artur Jeż Solving One Variable Word Equations in the Free Group in Cubic Time 10.4230/LIPIcs.STACS.2021.30
• Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, and Saket Saurabh Diverse Collections in Matroids and Graphs 10.4230/LIPIcs.STACS.2021.31
• Guilhem Gamard, Pierre Guillon, Kevin Perrot, and Guillaume Theyssier Rice-Like Theorems for Automata Networks 10.4230/LIPIcs.STACS.2021.32
• Jugal Garg, Edin Husić, and László A. Végh Auction Algorithms for Market Equilibrium with Weak Gross Substitute Demands and Their Applications 10.4230/LIPIcs.STACS.2021.33
• Paweł Gawrychowski, Maria Kosche, Tore Koß, Florin Manea, and Stefan Siemer Efficiently Testing Simon’s Congruence 10.4230/LIPIcs.STACS.2021.34
• Daniel Gibney and Sharma V. Thankachan Finding an Optimal Alphabet Ordering for Lyndon Factorization Is Hard 10.4230/LIPIcs.STACS.2021.35
• Stefan Göller and Mathieu Hilaire Reachability in Two-Parametric Timed Automata with One Parameter Is EXPSPACE-Complete 10.4230/LIPIcs.STACS.2021.36
• Petr A. Golovach, Christian Komusiewicz, Dieter Kratsch, and Van Bang Le Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration 10.4230/LIPIcs.STACS.2021.37
• Joshua A. Grochow, Youming Qiao, and Gang Tang Average-Case Algorithms for Testing Isomorphism of Polynomials, Algebras, and Multilinear Forms 10.4230/LIPIcs.STACS.2021.38
• Zhengyang Guo and Yi Li Geometric Cover with Outliers Removal 10.4230/LIPIcs.STACS.2021.39
• Anselm Haak, Arne Meier, Om Prakash, and Raghavendra Rao B. V. Parameterised Counting in Logspace 10.4230/LIPIcs.STACS.2021.40
• Ararat Harutyunyan, Michael Lampis, and Nikolaos Melissinos Digraph Coloring and Distance to Acyclicity 10.4230/LIPIcs.STACS.2021.41
• Jacob Holm and Eva Rotenberg Good r-Divisions Imply Optimal Amortized Decremental Biconnectivity 10.4230/LIPIcs.STACS.2021.42
• Lars Jaffke, Paloma T. Lima, and Daniel Lokshtanov b-Coloring Parameterized by Clique-Width 10.4230/LIPIcs.STACS.2021.43
• Ismaël Jecker A Ramsey Theorem for Finite Monoids 10.4230/LIPIcs.STACS.2021.44
• Ce Jin, Jelani Nelson, and Kewen Wu An Improved Sketching Algorithm for Edit Distance 10.4230/LIPIcs.STACS.2021.45
• Haim Kaplan and Jay Tenenbaum Locality Sensitive Hashing for Efficient Similar Polygon Retrieval 10.4230/LIPIcs.STACS.2021.46
• Tomohiro Koana, Vincent Froese, and Rolf Niedermeier Binary Matrix Completion Under Diameter Constraints 10.4230/LIPIcs.STACS.2021.47
• Florent Koechlin and Pablo Rotondo Absorbing Patterns in BST-Like Expression-Trees 10.4230/LIPIcs.STACS.2021.48
• Shaohua Li, Marcin Pilipczuk, and Manuel Sorge Cluster Editing Parameterized Above Modification-Disjoint P₃-Packings 10.4230/LIPIcs.STACS.2021.49
• William Lochet, Daniel Lokshtanov, Saket Saurabh, and Meirav Zehavi Exploiting Dense Structures in Parameterized Complexity 10.4230/LIPIcs.STACS.2021.50
• Markus Lohrey Subgroup Membership in GL(2,Z) 10.4230/LIPIcs.STACS.2021.51
• Olga Martynova and Alexander Okhotin Lower Bounds for Graph-Walking Automata 10.4230/LIPIcs.STACS.2021.52
• Meike Neuwohner An Improved Approximation Algorithm for the Maximum Weight Independent Set Problem in d-Claw Free Graphs 10.4230/LIPIcs.STACS.2021.53
• Karolina Okrasa and Paweł Rzążewski Complexity of the List Homomorphism Problem in Hereditary Graph Classes 10.4230/LIPIcs.STACS.2021.54
• Pedro Paredes Spectrum Preserving Short Cycle Removal on Regular Graphs 10.4230/LIPIcs.STACS.2021.55
• Marta Piecyk and Paweł Rzążewski Fine-Grained Complexity of the List Homomorphism Problem: Feedback Vertex Set and Cutwidth 10.4230/LIPIcs.STACS.2021.56
• Md Lutfar Rahman and Thomas Watson 6-Uniform Maker-Breaker Game Is PSPACE-Complete 10.4230/LIPIcs.STACS.2021.57
• Pascal Schweitzer and Constantin Seebach Resolution with Symmetry Rule Applied to Linear Equations 10.4230/LIPIcs.STACS.2021.58
• Ramgopal Venkateswaran and Ryan O'Donnell Quantum Approximate Counting with Nonadaptive Grover Iterations 10.4230/LIPIcs.STACS.2021.59