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