@Proceedings{blaser_et_al:LIPIcs.STACS.2021,
title = {{LIPIcs, Volume 187, STACS 2021, Complete Volume}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {1--988},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021},
URN = {urn:nbn:de:0030-drops-136444},
doi = {10.4230/LIPIcs.STACS.2021},
annote = {Keywords: LIPIcs, Volume 187, STACS 2021, Complete Volume}
}
@InProceedings{blaser_et_al:LIPIcs.STACS.2021.0,
author = {Bl\"{a}ser, Markus and Monmege, Benjamin},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {0:i--0:xvi},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.0},
URN = {urn:nbn:de:0030-drops-136459},
doi = {10.4230/LIPIcs.STACS.2021.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{burgisser:LIPIcs.STACS.2021.1,
author = {B\"{u}rgisser, Peter},
title = {{Optimization, Complexity and Invariant Theory}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {1:1--1:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.1},
URN = {urn:nbn:de:0030-drops-136460},
doi = {10.4230/LIPIcs.STACS.2021.1},
annote = {Keywords: geometric invariant theory, geodesic optimization, non-commutative optimization, null cone, operator scaling, moment polytope, orbit closure intersection, geometric programming}
}
@InProceedings{ossonademendez:LIPIcs.STACS.2021.2,
author = {Ossona de Mendez, Patrice},
title = {{First-Order Transductions of Graphs}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {2:1--2:7},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.2},
URN = {urn:nbn:de:0030-drops-136473},
doi = {10.4230/LIPIcs.STACS.2021.2},
annote = {Keywords: Finite model theory, structural graph theory}
}
@InProceedings{tendera:LIPIcs.STACS.2021.3,
author = {Tendera, Lidia},
title = {{On the Fluted Fragment}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {3:1--3:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.3},
URN = {urn:nbn:de:0030-drops-136481},
doi = {10.4230/LIPIcs.STACS.2021.3},
annote = {Keywords: decidability, fluted fragment, first-order logic, complexity, satisfiability, non-elementary}
}
@InProceedings{aggarwal_et_al:LIPIcs.STACS.2021.4,
author = {Aggarwal, Divesh and Chen, Yanlin and Kumar, Rajendra and Shen, Yixin},
title = {{Improved (Provable) Algorithms for the Shortest Vector Problem via Bounded Distance Decoding}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {4:1--4:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.4},
URN = {urn:nbn:de:0030-drops-136494},
doi = {10.4230/LIPIcs.STACS.2021.4},
annote = {Keywords: Lattices, Shortest Vector Problem, Discrete Gaussian Sampling, Time-Space Tradeoff, Quantum computation, Bounded distance decoding}
}
@InProceedings{agrawal_et_al:LIPIcs.STACS.2021.5,
author = {Agrawal, Akanksha and Kanesh, Lawqueen and Panolan, Fahad and Ramanujan, M. S. and Saurabh, Saket},
title = {{An FPT Algorithm for Elimination Distance to Bounded Degree Graphs}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {5:1--5:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.5},
URN = {urn:nbn:de:0030-drops-136507},
doi = {10.4230/LIPIcs.STACS.2021.5},
annote = {Keywords: Elimination Distance, Fixed-parameter Tractability, Graph Modification}
}
@InProceedings{apers_et_al:LIPIcs.STACS.2021.6,
author = {Apers, Simon and Gily\'{e}n, Andr\'{a}s and Jeffery, Stacey},
title = {{A Unified Framework of Quantum Walk Search}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {6:1--6:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.6},
URN = {urn:nbn:de:0030-drops-136511},
doi = {10.4230/LIPIcs.STACS.2021.6},
annote = {Keywords: Quantum Algorithms, Quantum Walks, Graph Theory}
}
@InProceedings{arutyunova_et_al:LIPIcs.STACS.2021.7,
author = {Arutyunova, Anna and Schmidt, Melanie},
title = {{Achieving Anonymity via Weak Lower Bound Constraints for k-Median and k-Means}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {7:1--7:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.7},
URN = {urn:nbn:de:0030-drops-136529},
doi = {10.4230/LIPIcs.STACS.2021.7},
annote = {Keywords: Clustering with Constraints, lower Bounds, k-Means, Anonymity}
}
@InProceedings{barloy_et_al:LIPIcs.STACS.2021.8,
author = {Barloy, Corentin and Clemente, Lorenzo},
title = {{Bidimensional Linear Recursive Sequences and Universality of Unambiguous Register Automata}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {8:1--8:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.8},
URN = {urn:nbn:de:0030-drops-136533},
doi = {10.4230/LIPIcs.STACS.2021.8},
annote = {Keywords: unambiguous register automata, universality and inclusion problems, multi-dimensional linear recurrence sequences}
}
@InProceedings{barman_et_al:LIPIcs.STACS.2021.9,
author = {Barman, Siddharth and Fawzi, Omar and Ferm\'{e}, Paul},
title = {{Tight Approximation Guarantees for Concave Coverage Problems}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {9:1--9:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.9},
URN = {urn:nbn:de:0030-drops-136543},
doi = {10.4230/LIPIcs.STACS.2021.9},
annote = {Keywords: Approximation Algorithms, Coverage Problems, Concave Function}
}
@InProceedings{barto_et_al:LIPIcs.STACS.2021.10,
author = {Barto, Libor and Battistelli, Diego and Berg, Kevin M.},
title = {{Symmetric Promise Constraint Satisfaction Problems: Beyond the Boolean Case}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {10:1--10:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.10},
URN = {urn:nbn:de:0030-drops-136557},
doi = {10.4230/LIPIcs.STACS.2021.10},
annote = {Keywords: constraint satisfaction problems, promise constraint satisfaction, Boolean PCSP, polymorphism}
}
@InProceedings{bergstraer_et_al:LIPIcs.STACS.2021.11,
author = {Bergstr\"{a}{\ss}er, Pascal and Ganardi, Moses and Zetzsche, Georg},
title = {{A Characterization of Wreath Products Where Knapsack Is Decidable}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {11:1--11:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.11},
URN = {urn:nbn:de:0030-drops-136566},
doi = {10.4230/LIPIcs.STACS.2021.11},
annote = {Keywords: knapsack, wreath products, decision problems in group theory, decidability, discrete Heisenberg group, Baumslag-Solitar groups}
}
@InProceedings{berlinkov_et_al:LIPIcs.STACS.2021.12,
author = {Berlinkov, Mikhail V. and Ferens, Robert and Ryzhikov, Andrew and Szyku{\l}a, Marek},
title = {{Synchronizing Strongly Connected Partial DFAs}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {12:1--12:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.12},
URN = {urn:nbn:de:0030-drops-136579},
doi = {10.4230/LIPIcs.STACS.2021.12},
annote = {Keywords: \v{C}ern\'{y} conjecture, literal automaton, partial automaton, prefix code, rank conjecture, reset threshold, reset word, synchronizing automaton, synchronizing word}
}
@InProceedings{bhore_et_al:LIPIcs.STACS.2021.13,
author = {Bhore, Sujoy and T\'{o}th, Csaba D.},
title = {{On Euclidean Steiner (1+\epsilon)-Spanners}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {13:1--13:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.13},
URN = {urn:nbn:de:0030-drops-136586},
doi = {10.4230/LIPIcs.STACS.2021.13},
annote = {Keywords: Geometric spanner, (1+\epsilon)-spanner, lightness, sparsity, minimum weight}
}
@InProceedings{bienkowski_et_al:LIPIcs.STACS.2021.14,
author = {Bienkowski, Marcin and Feldkord, Bj\"{o}rn and Schmidt, Pawe{\l}},
title = {{A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {14:1--14:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.14},
URN = {urn:nbn:de:0030-drops-136598},
doi = {10.4230/LIPIcs.STACS.2021.14},
annote = {Keywords: Online algorithms, deterministic rounding, linear programming, facility location, set cover}
}
@InProceedings{bjorklund:LIPIcs.STACS.2021.15,
author = {Bj\"{o}rklund, Andreas},
title = {{An Asymptotically Fast Polynomial Space Algorithm for Hamiltonicity Detection in Sparse Directed Graphs}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {15:1--15:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.15},
URN = {urn:nbn:de:0030-drops-136601},
doi = {10.4230/LIPIcs.STACS.2021.15},
annote = {Keywords: Hamiltonian cycle, directed graph, worst case analysis algorithm}
}
@InProceedings{bockenhauer_et_al:LIPIcs.STACS.2021.16,
author = {B\"{o}ckenhauer, Hans-Joachim and Burjons, Elisabet and Hromkovi\v{c}, Juraj and Lotze, Henri and Rossmanith, Peter},
title = {{Online Simple Knapsack with Reservation Costs}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {16:1--16:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.16},
URN = {urn:nbn:de:0030-drops-136613},
doi = {10.4230/LIPIcs.STACS.2021.16},
annote = {Keywords: Online problem, Simple knapsack, Reservation costs}
}
@InProceedings{bonnet:LIPIcs.STACS.2021.17,
author = {Bonnet, \'{E}douard},
title = {{Inapproximability of Diameter in Super-Linear Time: Beyond the 5/3 Ratio}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {17:1--17:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.17},
URN = {urn:nbn:de:0030-drops-136623},
doi = {10.4230/LIPIcs.STACS.2021.17},
annote = {Keywords: Diameter, inapproximability, SETH lower bounds, k-Orthogonal Vectors}
}
@InProceedings{brodowsky_et_al:LIPIcs.STACS.2021.18,
author = {Brodowsky, Ulrich A. and Hougardy, Stefan},
title = {{The Approximation Ratio of the 2-Opt Heuristic for the Euclidean Traveling Salesman Problem}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {18:1--18:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.18},
URN = {urn:nbn:de:0030-drops-136634},
doi = {10.4230/LIPIcs.STACS.2021.18},
annote = {Keywords: traveling salesman problem, metric TSP, Euclidean TSP, 2-Opt, approximation algorithm}
}
@InProceedings{buhrman_et_al:LIPIcs.STACS.2021.19,
author = {Buhrman, Harry and Patro, Subhasree and Speelman, Florian},
title = {{A Framework of Quantum Strong Exponential-Time Hypotheses}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {19:1--19:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.19},
URN = {urn:nbn:de:0030-drops-136642},
doi = {10.4230/LIPIcs.STACS.2021.19},
annote = {Keywords: complexity theory, fine-grained complexity, longest common subsequence, edit distance, quantum query complexity, strong exponential-time hypothesis}
}
@InProceedings{butti_et_al:LIPIcs.STACS.2021.20,
author = {Butti, Silvia and Dalmau, Victor},
title = {{The Complexity of the Distributed Constraint Satisfaction Problem}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {20:1--20:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.20},
URN = {urn:nbn:de:0030-drops-136654},
doi = {10.4230/LIPIcs.STACS.2021.20},
annote = {Keywords: Constraint Satisfaction Problems, Distributed Algorithms, Polymorphisms}
}
@InProceedings{censorhillel_et_al:LIPIcs.STACS.2021.21,
author = {Censor-Hillel, Keren and Leitersdorf, Dean and Polosukhin, Volodymyr},
title = {{Distance Computations in the Hybrid Network Model via Oracle Simulations}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {21:1--21:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.21},
URN = {urn:nbn:de:0030-drops-136663},
doi = {10.4230/LIPIcs.STACS.2021.21},
annote = {Keywords: Distributed graph algorithms, Hybrid network model, Distance computations}
}
@InProceedings{chan_et_al:LIPIcs.STACS.2021.22,
author = {Chan, Timothy M. and Rahul, Saladi},
title = {{Simple Multi-Pass Streaming Algorithms for Skyline Points and Extreme Points}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {22:1--22:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.22},
URN = {urn:nbn:de:0030-drops-136674},
doi = {10.4230/LIPIcs.STACS.2021.22},
annote = {Keywords: multi-pass streaming algorithms, skyline, convex hull, extreme points, randomized algorithms}
}
@InProceedings{cheraghchi_et_al:LIPIcs.STACS.2021.23,
author = {Cheraghchi, Mahdi and Hirahara, Shuichi and Myrisiotis, Dimitrios and Yoshida, Yuichi},
title = {{One-Tape Turing Machine and Branching Program Lower Bounds for MCSP}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {23:1--23:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.23},
URN = {urn:nbn:de:0030-drops-136681},
doi = {10.4230/LIPIcs.STACS.2021.23},
annote = {Keywords: Minimum Circuit Size Problem, Kolmogorov Complexity, One-Tape Turing Machines, Branching Programs, Lower Bounds, Pseudorandom Generators, Hitting Set Generators}
}
@InProceedings{cojaoghlan_et_al:LIPIcs.STACS.2021.24,
author = {Coja-Oghlan, Amin and Hahn-Klimroth, Max and Loick, Philipp and M\"{u}ller, Noela and Panagiotou, Konstantinos and Pasch, Matija},
title = {{Inference and Mutual Information on Random Factor Graphs}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {24:1--24:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.24},
URN = {urn:nbn:de:0030-drops-136692},
doi = {10.4230/LIPIcs.STACS.2021.24},
annote = {Keywords: Information theory, random factor graphs, inference problems, phase transitions}
}
@InProceedings{day_et_al:LIPIcs.STACS.2021.25,
author = {Day, Joel D. and Fleischmann, Pamela and Kosche, Maria and Ko{\ss}, Tore and Manea, Florin and Siemer, Stefan},
title = {{The Edit Distance to k-Subsequence Universality}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {25:1--25:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.25},
URN = {urn:nbn:de:0030-drops-136705},
doi = {10.4230/LIPIcs.STACS.2021.25},
annote = {Keywords: Subsequence, Scattered factor, Subword, Universality, k-subsequence universality, Edit distance, Efficient algorithms}
}
@InProceedings{dvorak_et_al:LIPIcs.STACS.2021.26,
author = {Dvo\v{r}\'{a}k, Pavel and Kouck\'{y}, Michal},
title = {{Barrington Plays Cards: The Complexity of Card-Based Protocols}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {26:1--26:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.26},
URN = {urn:nbn:de:0030-drops-136715},
doi = {10.4230/LIPIcs.STACS.2021.26},
annote = {Keywords: Efficient card-based protocol, Branching program, Turing machine}
}
@InProceedings{erlebach_et_al:LIPIcs.STACS.2021.27,
author = {Erlebach, Thomas and Hoffmann, Michael and de Lima, Murilo Santos},
title = {{Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {27:1--27:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.27},
URN = {urn:nbn:de:0030-drops-136728},
doi = {10.4230/LIPIcs.STACS.2021.27},
annote = {Keywords: online algorithms, competitive analysis, explorable uncertainty, parallel algorithms, minimum problem, selection problem}
}
@InProceedings{exibard_et_al:LIPIcs.STACS.2021.28,
author = {Exibard, L\'{e}o and Filiot, Emmanuel and Khalimov, Ayrat},
title = {{Church Synthesis on Register Automata over Linearly Ordered Data Domains}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {28:1--28:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.28},
URN = {urn:nbn:de:0030-drops-136735},
doi = {10.4230/LIPIcs.STACS.2021.28},
annote = {Keywords: Synthesis, Church Game, Register Automata, Transducers, Ordered Data Words}
}
@InProceedings{fearnley_et_al:LIPIcs.STACS.2021.29,
author = {Fearnley, John and Savani, Rahul},
title = {{A Faster Algorithm for Finding Tarski Fixed Points}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {29:1--29:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.29},
URN = {urn:nbn:de:0030-drops-136741},
doi = {10.4230/LIPIcs.STACS.2021.29},
annote = {Keywords: query complexity, Tarski fixed points, total function problem}
}
@InProceedings{ferens_et_al:LIPIcs.STACS.2021.30,
author = {Ferens, Robert and Je\.{z}, Artur},
title = {{Solving One Variable Word Equations in the Free Group in Cubic Time}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {30:1--30:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.30},
URN = {urn:nbn:de:0030-drops-136751},
doi = {10.4230/LIPIcs.STACS.2021.30},
annote = {Keywords: Word equations, free group, one-variable equations}
}
@InProceedings{fomin_et_al:LIPIcs.STACS.2021.31,
author = {Fomin, Fedor V. and Golovach, Petr A. and Panolan, Fahad and Philip, Geevarghese and Saurabh, Saket},
title = {{Diverse Collections in Matroids and Graphs}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {31:1--31:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.31},
URN = {urn:nbn:de:0030-drops-136769},
doi = {10.4230/LIPIcs.STACS.2021.31},
annote = {Keywords: Matroids, Diverse solutions, Fixed-parameter tractable algorithms}
}
@InProceedings{gamard_et_al:LIPIcs.STACS.2021.32,
author = {Gamard, Guilhem and Guillon, Pierre and Perrot, Kevin and Theyssier, Guillaume},
title = {{Rice-Like Theorems for Automata Networks}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {32:1--32:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.32},
URN = {urn:nbn:de:0030-drops-136770},
doi = {10.4230/LIPIcs.STACS.2021.32},
annote = {Keywords: Automata networks, Rice theorem, complexity classes, polynomial hierarchy, hardness}
}
@InProceedings{garg_et_al:LIPIcs.STACS.2021.33,
author = {Garg, Jugal and Husi\'{c}, Edin and V\'{e}gh, L\'{a}szl\'{o} A.},
title = {{Auction Algorithms for Market Equilibrium with Weak Gross Substitute Demands and Their Applications}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {33:1--33:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.33},
URN = {urn:nbn:de:0030-drops-136786},
doi = {10.4230/LIPIcs.STACS.2021.33},
annote = {Keywords: auction algorithm, weak gross substitutes, Fisher equilibrium, Gale equilibrium, Nash social welfare}
}
@InProceedings{gawrychowski_et_al:LIPIcs.STACS.2021.34,
author = {Gawrychowski, Pawe{\l} and Kosche, Maria and Ko{\ss}, Tore and Manea, Florin and Siemer, Stefan},
title = {{Efficiently Testing Simon’s Congruence}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {34:1--34:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.34},
URN = {urn:nbn:de:0030-drops-136796},
doi = {10.4230/LIPIcs.STACS.2021.34},
annote = {Keywords: Simon’s congruence, Subsequence, Scattered factor, Efficient algorithms}
}
@InProceedings{gibney_et_al:LIPIcs.STACS.2021.35,
author = {Gibney, Daniel and Thankachan, Sharma V.},
title = {{Finding an Optimal Alphabet Ordering for Lyndon Factorization Is Hard}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {35:1--35:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.35},
URN = {urn:nbn:de:0030-drops-136809},
doi = {10.4230/LIPIcs.STACS.2021.35},
annote = {Keywords: Lyndon Factorization, String Algorithms, Burrows-Wheeler Transform}
}
@InProceedings{goller_et_al:LIPIcs.STACS.2021.36,
author = {G\"{o}ller, Stefan and Hilaire, Mathieu},
title = {{Reachability in Two-Parametric Timed Automata with One Parameter Is EXPSPACE-Complete}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {36:1--36:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.36},
URN = {urn:nbn:de:0030-drops-136817},
doi = {10.4230/LIPIcs.STACS.2021.36},
annote = {Keywords: Parametric Timed Automata, Computational Complexity, Reachability}
}
@InProceedings{golovach_et_al:LIPIcs.STACS.2021.37,
author = {Golovach, Petr A. and Komusiewicz, Christian and Kratsch, Dieter and Le, Van Bang},
title = {{Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {37:1--37:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.37},
URN = {urn:nbn:de:0030-drops-136823},
doi = {10.4230/LIPIcs.STACS.2021.37},
annote = {Keywords: enumeration problems, polynomial delay, output-sensitive algorithms, kernelization, structural parameterizations, matching cuts}
}
@InProceedings{grochow_et_al:LIPIcs.STACS.2021.38,
author = {Grochow, Joshua A. and Qiao, Youming and Tang, Gang},
title = {{Average-Case Algorithms for Testing Isomorphism of Polynomials, Algebras, and Multilinear Forms}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {38:1--38:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.38},
URN = {urn:nbn:de:0030-drops-136836},
doi = {10.4230/LIPIcs.STACS.2021.38},
annote = {Keywords: polynomial isomorphism, trilinear form equivalence, algebra isomorphism, average-case algorithms, tensor isomorphism complete, symmetric and alternating bilinear maps}
}
@InProceedings{guo_et_al:LIPIcs.STACS.2021.39,
author = {Guo, Zhengyang and Li, Yi},
title = {{Geometric Cover with Outliers Removal}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {39:1--39:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.39},
URN = {urn:nbn:de:0030-drops-136849},
doi = {10.4230/LIPIcs.STACS.2021.39},
annote = {Keywords: Geometric Cover, Unit Square Cover, Unit Disk Cover, Shifting Strategy, Outliers Detection, Computational Geometry}
}
@InProceedings{haak_et_al:LIPIcs.STACS.2021.40,
author = {Haak, Anselm and Meier, Arne and Prakash, Om and Rao B. V., Raghavendra},
title = {{Parameterised Counting in Logspace}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {40:1--40:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.40},
URN = {urn:nbn:de:0030-drops-136859},
doi = {10.4230/LIPIcs.STACS.2021.40},
annote = {Keywords: Parameterized Complexity, Counting Complexity, Logspace}
}
@InProceedings{harutyunyan_et_al:LIPIcs.STACS.2021.41,
author = {Harutyunyan, Ararat and Lampis, Michael and Melissinos, Nikolaos},
title = {{Digraph Coloring and Distance to Acyclicity}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {41:1--41:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.41},
URN = {urn:nbn:de:0030-drops-136865},
doi = {10.4230/LIPIcs.STACS.2021.41},
annote = {Keywords: Digraph Coloring, Dichromatic number, NP-completeness, Parameterized complexity, Feedback vertex and arc sets}
}
@InProceedings{holm_et_al:LIPIcs.STACS.2021.42,
author = {Holm, Jacob and Rotenberg, Eva},
title = {{Good r-Divisions Imply Optimal Amortized Decremental Biconnectivity}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {42:1--42:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.42},
URN = {urn:nbn:de:0030-drops-136875},
doi = {10.4230/LIPIcs.STACS.2021.42},
annote = {Keywords: Dynamic graphs, 2-connectivity, graph minors, r-divisions, graph separators}
}
@InProceedings{jaffke_et_al:LIPIcs.STACS.2021.43,
author = {Jaffke, Lars and Lima, Paloma T. and Lokshtanov, Daniel},
title = {{b-Coloring Parameterized by Clique-Width}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {43:1--43:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.43},
URN = {urn:nbn:de:0030-drops-136881},
doi = {10.4230/LIPIcs.STACS.2021.43},
annote = {Keywords: b-Coloring, clique-width, vertex cover, structural parameterization}
}
@InProceedings{jecker:LIPIcs.STACS.2021.44,
author = {Jecker, Isma\"{e}l},
title = {{A Ramsey Theorem for Finite Monoids}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {44:1--44:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.44},
URN = {urn:nbn:de:0030-drops-136890},
doi = {10.4230/LIPIcs.STACS.2021.44},
annote = {Keywords: Semigroup, monoid, idempotent, automaton}
}
@InProceedings{jin_et_al:LIPIcs.STACS.2021.45,
author = {Jin, Ce and Nelson, Jelani and Wu, Kewen},
title = {{An Improved Sketching Algorithm for Edit Distance}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {45:1--45:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.45},
URN = {urn:nbn:de:0030-drops-136905},
doi = {10.4230/LIPIcs.STACS.2021.45},
annote = {Keywords: edit distance, sketching}
}
@InProceedings{kaplan_et_al:LIPIcs.STACS.2021.46,
author = {Kaplan, Haim and Tenenbaum, Jay},
title = {{Locality Sensitive Hashing for Efficient Similar Polygon Retrieval}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {46:1--46:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.46},
URN = {urn:nbn:de:0030-drops-136910},
doi = {10.4230/LIPIcs.STACS.2021.46},
annote = {Keywords: Locality sensitive hashing, polygons, turning function, L\underlinep distance, nearest neighbors, similarity search}
}
@InProceedings{koana_et_al:LIPIcs.STACS.2021.47,
author = {Koana, Tomohiro and Froese, Vincent and Niedermeier, Rolf},
title = {{Binary Matrix Completion Under Diameter Constraints}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {47:1--47:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.47},
URN = {urn:nbn:de:0030-drops-136925},
doi = {10.4230/LIPIcs.STACS.2021.47},
annote = {Keywords: sunflowers, binary matrices, Hamming distance, stringology, consensus problems, complexity dichotomy, combinatorial algorithms, graph factors, 2-Sat, Hamming radius}
}
@InProceedings{koechlin_et_al:LIPIcs.STACS.2021.48,
author = {Koechlin, Florent and Rotondo, Pablo},
title = {{Absorbing Patterns in BST-Like Expression-Trees}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {48:1--48:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.48},
URN = {urn:nbn:de:0030-drops-136933},
doi = {10.4230/LIPIcs.STACS.2021.48},
annote = {Keywords: BST trees, absorbing pattern, reduction, analytic combinatorics}
}
@InProceedings{li_et_al:LIPIcs.STACS.2021.49,
author = {Li, Shaohua and Pilipczuk, Marcin and Sorge, Manuel},
title = {{Cluster Editing Parameterized Above Modification-Disjoint P₃-Packings}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {49:1--49:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.49},
URN = {urn:nbn:de:0030-drops-136945},
doi = {10.4230/LIPIcs.STACS.2021.49},
annote = {Keywords: Graph algorithms, fixed-parameter tractability, parameterized complexity}
}
@InProceedings{lochet_et_al:LIPIcs.STACS.2021.50,
author = {Lochet, William and Lokshtanov, Daniel and Saurabh, Saket and Zehavi, Meirav},
title = {{Exploiting Dense Structures in Parameterized Complexity}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {50:1--50:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.50},
URN = {urn:nbn:de:0030-drops-136950},
doi = {10.4230/LIPIcs.STACS.2021.50},
annote = {Keywords: Dense graphs, disjoint paths, odd cycle transversal, kernels}
}
@InProceedings{lohrey:LIPIcs.STACS.2021.51,
author = {Lohrey, Markus},
title = {{Subgroup Membership in GL(2,Z)}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {51:1--51:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.51},
URN = {urn:nbn:de:0030-drops-136961},
doi = {10.4230/LIPIcs.STACS.2021.51},
annote = {Keywords: free groups, virtually free groups, subgroup membership, matrix groups}
}
@InProceedings{martynova_et_al:LIPIcs.STACS.2021.52,
author = {Martynova, Olga and Okhotin, Alexander},
title = {{Lower Bounds for Graph-Walking Automata}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {52:1--52:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.52},
URN = {urn:nbn:de:0030-drops-136974},
doi = {10.4230/LIPIcs.STACS.2021.52},
annote = {Keywords: Finite automata, graph-walking automata, halting, reversibility}
}
@InProceedings{neuwohner:LIPIcs.STACS.2021.53,
author = {Neuwohner, Meike},
title = {{An Improved Approximation Algorithm for the Maximum Weight Independent Set Problem in d-Claw Free Graphs}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {53:1--53:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.53},
URN = {urn:nbn:de:0030-drops-136982},
doi = {10.4230/LIPIcs.STACS.2021.53},
annote = {Keywords: d-Claw free Graphs, independent Set, local Improvement, k-Set Packing, weighted}
}
@InProceedings{okrasa_et_al:LIPIcs.STACS.2021.54,
author = {Okrasa, Karolina and Rz\k{a}\.{z}ewski, Pawe{\l}},
title = {{Complexity of the List Homomorphism Problem in Hereditary Graph Classes}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {54:1--54:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.54},
URN = {urn:nbn:de:0030-drops-136990},
doi = {10.4230/LIPIcs.STACS.2021.54},
annote = {Keywords: list homomorphism, fine-grained complexity, hereditary graph classes}
}
@InProceedings{paredes:LIPIcs.STACS.2021.55,
author = {Paredes, Pedro},
title = {{Spectrum Preserving Short Cycle Removal on Regular Graphs}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {55:1--55:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.55},
URN = {urn:nbn:de:0030-drops-137000},
doi = {10.4230/LIPIcs.STACS.2021.55},
annote = {Keywords: Ramanujan Graphs, High Girth Regular Graphs}
}
@InProceedings{piecyk_et_al:LIPIcs.STACS.2021.56,
author = {Piecyk, Marta and Rz\k{a}\.{z}ewski, Pawe{\l}},
title = {{Fine-Grained Complexity of the List Homomorphism Problem: Feedback Vertex Set and Cutwidth}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {56:1--56:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.56},
URN = {urn:nbn:de:0030-drops-137012},
doi = {10.4230/LIPIcs.STACS.2021.56},
annote = {Keywords: list homomorphisms, fine-grained complexity, SETH, feedback vertex set, cutwidth}
}
@InProceedings{rahman_et_al:LIPIcs.STACS.2021.57,
author = {Rahman, Md Lutfar and Watson, Thomas},
title = {{6-Uniform Maker-Breaker Game Is PSPACE-Complete}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {57:1--57:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.57},
URN = {urn:nbn:de:0030-drops-137020},
doi = {10.4230/LIPIcs.STACS.2021.57},
annote = {Keywords: Game, Maker-Breaker, Complexity, Reduction, PSPACE-complete, NL-hard}
}
@InProceedings{schweitzer_et_al:LIPIcs.STACS.2021.58,
author = {Schweitzer, Pascal and Seebach, Constantin},
title = {{Resolution with Symmetry Rule Applied to Linear Equations}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {58:1--58:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.58},
URN = {urn:nbn:de:0030-drops-137038},
doi = {10.4230/LIPIcs.STACS.2021.58},
annote = {Keywords: Logical Resolution, Symmetry Rule, Linear Equation System}
}
@InProceedings{venkateswaran_et_al:LIPIcs.STACS.2021.59,
author = {Venkateswaran, Ramgopal and O'Donnell, Ryan},
title = {{Quantum Approximate Counting with Nonadaptive Grover Iterations}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {59:1--59:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.59},
URN = {urn:nbn:de:0030-drops-137048},
doi = {10.4230/LIPIcs.STACS.2021.59},
annote = {Keywords: quantum approximate counting, Grover search}
}
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