Petra Berenbrink and Benjamin Monmege. LIPIcs, Volume 219, STACS 2022, Complete Volume. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 1-1044, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@Proceedings{berenbrink_et_al:LIPIcs.STACS.2022, title = {{LIPIcs, Volume 219, STACS 2022, Complete Volume}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {1--1044}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022}, URN = {urn:nbn:de:0030-drops-158098}, doi = {10.4230/LIPIcs.STACS.2022}, annote = {Keywords: LIPIcs, Volume 219, STACS 2022, Complete Volume} }
Petra Berenbrink and Benjamin Monmege. Front Matter, Table of Contents, Preface, Conference Organization. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 0:i-0:xvi, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{berenbrink_et_al:LIPIcs.STACS.2022.0, author = {Berenbrink, Petra and Monmege, Benjamin}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {0:i--0:xvi}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.0}, URN = {urn:nbn:de:0030-drops-158101}, doi = {10.4230/LIPIcs.STACS.2022.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Marie Albenque. Local Limit of Random Discrete Surface with (Or Without!) a Statistical Physics Model (Invited Talk). In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 1:1-1:2, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{albenque:LIPIcs.STACS.2022.1, author = {Albenque, Marie}, title = {{Local Limit of Random Discrete Surface with (Or Without!) a Statistical Physics Model}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {1:1--1:2}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.1}, URN = {urn:nbn:de:0030-drops-158118}, doi = {10.4230/LIPIcs.STACS.2022.1}, annote = {Keywords: Random graphs, triangulations, Benjamini-Schramm convergence, Ising model} }
Maria-Florina Balcan. Generalization Guarantees for Data-Driven Mechanism Design (Invited Talk). In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, p. 2:1, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{balcan:LIPIcs.STACS.2022.2, author = {Balcan, Maria-Florina}, title = {{Generalization Guarantees for Data-Driven Mechanism Design}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {2:1--2:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.2}, URN = {urn:nbn:de:0030-drops-158127}, doi = {10.4230/LIPIcs.STACS.2022.2}, annote = {Keywords: mechanism configuration, algorithm configuration, machine learning, generalization guarantees} }
Fabian Kuhn. Deterministic Distributed Symmetry Breaking at the Example of Distributed Graph Coloring (Invited Talk). In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, p. 3:1, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{kuhn:LIPIcs.STACS.2022.3, author = {Kuhn, Fabian}, title = {{Deterministic Distributed Symmetry Breaking at the Example of Distributed Graph Coloring}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {3:1--3:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.3}, URN = {urn:nbn:de:0030-drops-158131}, doi = {10.4230/LIPIcs.STACS.2022.3}, annote = {Keywords: distributed graph algorithms, derandomization, distributed coloring} }
Ramtin Afshar, Michael T. Goodrich, Pedro Matias, and Martha C. Osegueda. Mapping Networks via Parallel kth-Hop Traceroute Queries. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 4:1-4:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{afshar_et_al:LIPIcs.STACS.2022.4, author = {Afshar, Ramtin and Goodrich, Michael T. and Matias, Pedro and Osegueda, Martha C.}, title = {{Mapping Networks via Parallel kth-Hop Traceroute Queries}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {4:1--4:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.4}, URN = {urn:nbn:de:0030-drops-158142}, doi = {10.4230/LIPIcs.STACS.2022.4}, annote = {Keywords: Network mapping, graph algorithms, parallel algorithms, distributed computing, query complexity, kth-hop queries} }
S. Akshay, Hugo Bazille, Blaise Genest, and Mihir Vahanwala. On Robustness for the Skolem and Positivity Problems. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 5:1-5:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{akshay_et_al:LIPIcs.STACS.2022.5, author = {Akshay, S. and Bazille, Hugo and Genest, Blaise and Vahanwala, Mihir}, title = {{On Robustness for the Skolem and Positivity Problems}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {5:1--5:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.5}, URN = {urn:nbn:de:0030-drops-158156}, doi = {10.4230/LIPIcs.STACS.2022.5}, annote = {Keywords: Skolem problem, verification, dynamical systems, robustness} }
Yacine Al-Najjar, Walid Ben-Ameur, and Jérémie Leguay. Approximability of Robust Network Design: The Directed Case. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 6:1-6:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{alnajjar_et_al:LIPIcs.STACS.2022.6, author = {Al-Najjar, Yacine and Ben-Ameur, Walid and Leguay, J\'{e}r\'{e}mie}, title = {{Approximability of Robust Network Design: The Directed Case}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {6:1--6:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.6}, URN = {urn:nbn:de:0030-drops-158165}, doi = {10.4230/LIPIcs.STACS.2022.6}, annote = {Keywords: Robust Optimization, Network Design, Approximation, Inapproximability, Competitive Ratio of Oblivious Routing} }
Pascal Baumann, Moses Ganardi, Ramanathan S. Thinniyam, and Georg Zetzsche. Existential Definability over the Subword Ordering. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 7:1-7:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{baumann_et_al:LIPIcs.STACS.2022.7, author = {Baumann, Pascal and Ganardi, Moses and Thinniyam, Ramanathan S. and Zetzsche, Georg}, title = {{Existential Definability over the Subword Ordering}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {7:1--7:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.7}, URN = {urn:nbn:de:0030-drops-158178}, doi = {10.4230/LIPIcs.STACS.2022.7}, annote = {Keywords: subword, subsequence, definability, expressiveness, first order logic, existential fragment, quantifier alternation} }
Nikolay Bazhenov, Dariusz Kalociński, and Michał Wrocławski. Intrinsic Complexity of Recursive Functions on Natural Numbers with Standard Order. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 8:1-8:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{bazhenov_et_al:LIPIcs.STACS.2022.8, author = {Bazhenov, Nikolay and Kaloci\'{n}ski, Dariusz and Wroc{\l}awski, Micha{\l}}, title = {{Intrinsic Complexity of Recursive Functions on Natural Numbers with Standard Order}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {8:1--8:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.8}, URN = {urn:nbn:de:0030-drops-158185}, doi = {10.4230/LIPIcs.STACS.2022.8}, annote = {Keywords: Computable Structure Theory, Degree Spectra, \omega-Type Order, c.e. Degrees, d.c.e. Degrees, \Delta₂ Degrees, Learnability} }
Pierre Bergé, Guillaume Ducoffe, and Michel Habib. Subquadratic-Time Algorithm for the Diameter and All Eccentricities on Median Graphs. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 9:1-9:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{berge_et_al:LIPIcs.STACS.2022.9, author = {Berg\'{e}, Pierre and Ducoffe, Guillaume and Habib, Michel}, title = {{Subquadratic-Time Algorithm for the Diameter and All Eccentricities on Median Graphs}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {9:1--9:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.9}, URN = {urn:nbn:de:0030-drops-158192}, doi = {10.4230/LIPIcs.STACS.2022.9}, annote = {Keywords: Diameter, Eccentricities, Metric graph theory, Median graphs, Hypercubes} }
Anup Bhattacharya, Arijit Bishnu, Arijit Ghosh, and Gopinath Mishra. Faster Counting and Sampling Algorithms Using Colorful Decision Oracle. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 10:1-10:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{bhattacharya_et_al:LIPIcs.STACS.2022.10, author = {Bhattacharya, Anup and Bishnu, Arijit and Ghosh, Arijit and Mishra, Gopinath}, title = {{Faster Counting and Sampling Algorithms Using Colorful Decision Oracle}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {10:1--10:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.10}, URN = {urn:nbn:de:0030-drops-158205}, doi = {10.4230/LIPIcs.STACS.2022.10}, annote = {Keywords: Query Complexity, Subset Query, Hyperedge Estimation, and Colorful Independent Set oracle} }
Laurent Bienvenu, Valentino Delle Rose, and Tomasz Steifer. Probabilistic vs Deterministic Gamblers. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 11:1-11:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{bienvenu_et_al:LIPIcs.STACS.2022.11, author = {Bienvenu, Laurent and Delle Rose, Valentino and Steifer, Tomasz}, title = {{Probabilistic vs Deterministic Gamblers}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {11:1--11:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.11}, URN = {urn:nbn:de:0030-drops-158210}, doi = {10.4230/LIPIcs.STACS.2022.11}, annote = {Keywords: Algorithmic randomness, Martingales, Probabilistic computation, Almost everywhere domination} }
Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Guido Proietti, and Mirko Rossi. Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 12:1-12:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{bilo_et_al:LIPIcs.STACS.2022.12, author = {Bil\`{o}, Davide and D'Angelo, Gianlorenzo and Gual\`{a}, Luciano and Leucci, Stefano and Proietti, Guido and Rossi, Mirko}, title = {{Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {12:1--12:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.12}, URN = {urn:nbn:de:0030-drops-158221}, doi = {10.4230/LIPIcs.STACS.2022.12}, annote = {Keywords: multipath spanners, graph sparsification, edge-disjoint paths, min-cost flow} }
Ahmad Biniaz, Majid Daliri, and Amir Hossein Moradpour. A 10-Approximation of the π/2-MST. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 13:1-13:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{biniaz_et_al:LIPIcs.STACS.2022.13, author = {Biniaz, Ahmad and Daliri, Majid and Moradpour, Amir Hossein}, title = {{A 10-Approximation of the \pi/2-MST}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {13:1--13:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.13}, URN = {urn:nbn:de:0030-drops-158232}, doi = {10.4230/LIPIcs.STACS.2022.13}, annote = {Keywords: Euclidean spanning trees, approximation algorithms, bounded-angle visibility} }
Jeremiah Blocki, Mike Cinkoske, Seunghoon Lee, and Jin Young Son. On Explicit Constructions of Extremely Depth Robust Graphs. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 14:1-14:11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{blocki_et_al:LIPIcs.STACS.2022.14, author = {Blocki, Jeremiah and Cinkoske, Mike and Lee, Seunghoon and Son, Jin Young}, title = {{On Explicit Constructions of Extremely Depth Robust Graphs}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {14:1--14:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.14}, URN = {urn:nbn:de:0030-drops-158241}, doi = {10.4230/LIPIcs.STACS.2022.14}, annote = {Keywords: Depth-Robust Graphs, Explicit Constructions, Data-Independent Memory Hard Functions, Proofs of Space and Replication} }
Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, and Kunihiro Wasa. Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 15:1-15:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{bousquet_et_al:LIPIcs.STACS.2022.15, author = {Bousquet, Nicolas and Ito, Takehiro and Kobayashi, Yusuke and Mizuta, Haruka and Ouvrard, Paul and Suzuki, Akira and Wasa, Kunihiro}, title = {{Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {15:1--15:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.15}, URN = {urn:nbn:de:0030-drops-158253}, doi = {10.4230/LIPIcs.STACS.2022.15}, annote = {Keywords: combinatorial reconfiguration, spanning trees, PSPACE, polynomial-time algorithms} }
Patricia Bouyer, Mickael Randour, and Pierre Vandenhove. Characterizing Omega-Regularity Through Finite-Memory Determinacy of Games on Infinite Graphs. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 16:1-16:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{bouyer_et_al:LIPIcs.STACS.2022.16, author = {Bouyer, Patricia and Randour, Mickael and Vandenhove, Pierre}, title = {{Characterizing Omega-Regularity Through Finite-Memory Determinacy of Games on Infinite Graphs}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {16:1--16:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.16}, URN = {urn:nbn:de:0030-drops-158262}, doi = {10.4230/LIPIcs.STACS.2022.16}, annote = {Keywords: two-player games on graphs, infinite arenas, finite-memory determinacy, optimal strategies, \omega-regular languages} }
Nader H. Bshouty and Catherine A. Haddad-Zaknoon. On Testing Decision Tree. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 17:1-17:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{bshouty_et_al:LIPIcs.STACS.2022.17, author = {Bshouty, Nader H. and Haddad-Zaknoon, Catherine A.}, title = {{On Testing Decision Tree}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {17:1--17:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.17}, URN = {urn:nbn:de:0030-drops-158273}, doi = {10.4230/LIPIcs.STACS.2022.17}, annote = {Keywords: Testing decision trees} }
Andrei A. Bulatov and Akbar Rafiey. The Ideal Membership Problem and Abelian Groups. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 18:1-18:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{bulatov_et_al:LIPIcs.STACS.2022.18, author = {Bulatov, Andrei A. and Rafiey, Akbar}, title = {{The Ideal Membership Problem and Abelian Groups}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {18:1--18:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.18}, URN = {urn:nbn:de:0030-drops-158280}, doi = {10.4230/LIPIcs.STACS.2022.18}, annote = {Keywords: Polynomial Ideal Membership, Constraint Satisfaction Problems, Polymorphisms, Gr\"{o}bner Bases, Abelian Groups} }
Antonin Callard and Benjamin Hellouin de Menibus. The Aperiodic Domino Problem in Higher Dimension. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 19:1-19:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{callard_et_al:LIPIcs.STACS.2022.19, author = {Callard, Antonin and Hellouin de Menibus, Benjamin}, title = {{The Aperiodic Domino Problem in Higher Dimension}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {19:1--19:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.19}, URN = {urn:nbn:de:0030-drops-158296}, doi = {10.4230/LIPIcs.STACS.2022.19}, annote = {Keywords: Subshift, periodicity, aperiodicity, domino problem, subshift of finite type, sofic subshift, effective subshift, tilings, computability} }
Sourav Chakraborty, Arkadev Chattopadhyay, Peter Høyer, Nikhil S. Mande, Manaswi Paraashar, and Ronald de Wolf. Symmetry and Quantum Query-To-Communication Simulation. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 20:1-20:23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{chakraborty_et_al:LIPIcs.STACS.2022.20, author = {Chakraborty, Sourav and Chattopadhyay, Arkadev and H{\o}yer, Peter and Mande, Nikhil S. and Paraashar, Manaswi and de Wolf, Ronald}, title = {{Symmetry and Quantum Query-To-Communication Simulation}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {20:1--20:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.20}, URN = {urn:nbn:de:0030-drops-158309}, doi = {10.4230/LIPIcs.STACS.2022.20}, annote = {Keywords: Classical and quantum communication complexity, query-to-communication-simulation, quantum computing} }
Jianer Chen, Qin Huang, Iyad Kanj, and Ge Xia. Near-Optimal Algorithms for Point-Line Covering Problems. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 21:1-21:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{chen_et_al:LIPIcs.STACS.2022.21, author = {Chen, Jianer and Huang, Qin and Kanj, Iyad and Xia, Ge}, title = {{Near-Optimal Algorithms for Point-Line Covering Problems}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {21:1--21:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.21}, URN = {urn:nbn:de:0030-drops-158312}, doi = {10.4230/LIPIcs.STACS.2022.21}, annote = {Keywords: line cover, rich lines, exact fitting, kernelization, randomized algorithms, complexity lower bounds, algebraic computation trees} }
Leroy Chew and Friedrich Slivovsky. Towards Uniform Certification in QBF. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 22:1-22:23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{chew_et_al:LIPIcs.STACS.2022.22, author = {Chew, Leroy and Slivovsky, Friedrich}, title = {{Towards Uniform Certification in QBF}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {22:1--22:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.22}, URN = {urn:nbn:de:0030-drops-158326}, doi = {10.4230/LIPIcs.STACS.2022.22}, annote = {Keywords: QBF, Proof Complexity, Verification, Frege, Extended Frege, Strategy Extraction} }
Yung-Chung Chiu and Hsueh-I Lu. Blazing a Trail via Matrix Multiplications: A Faster Algorithm for Non-Shortest Induced Paths. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 23:1-23:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{chiu_et_al:LIPIcs.STACS.2022.23, author = {Chiu, Yung-Chung and Lu, Hsueh-I}, title = {{Blazing a Trail via Matrix Multiplications: A Faster Algorithm for Non-Shortest Induced Paths}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {23:1--23:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.23}, URN = {urn:nbn:de:0030-drops-158333}, doi = {10.4230/LIPIcs.STACS.2022.23}, annote = {Keywords: Induced subgraph, induced path, non-shortest path, dynamic data structure} }
Stefan Dantchev, Nicola Galesi, Abdul Ghani, and Barnaby Martin. Depth Lower Bounds in Stabbing Planes for Combinatorial Principles. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 24:1-24:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{dantchev_et_al:LIPIcs.STACS.2022.24, author = {Dantchev, Stefan and Galesi, Nicola and Ghani, Abdul and Martin, Barnaby}, title = {{Depth Lower Bounds in Stabbing Planes for Combinatorial Principles}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {24:1--24:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.24}, URN = {urn:nbn:de:0030-drops-158349}, doi = {10.4230/LIPIcs.STACS.2022.24}, annote = {Keywords: proof complexity, computational complexity, lower bounds, cutting planes, stabbing planes} }
Bireswar Das, Anant Kumar, Shivdutt Sharma, and Dhara Thakkar. Linear Space Data Structures for Finite Groups with Constant Query-Time. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 25:1-25:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{das_et_al:LIPIcs.STACS.2022.25, author = {Das, Bireswar and Kumar, Anant and Sharma, Shivdutt and Thakkar, Dhara}, title = {{Linear Space Data Structures for Finite Groups with Constant Query-Time}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {25:1--25:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.25}, URN = {urn:nbn:de:0030-drops-158350}, doi = {10.4230/LIPIcs.STACS.2022.25}, annote = {Keywords: Compact Data Structures, Space Efficient Representations, Finite Groups, Simple Groups, Classification Theorem for Finite Simple Groups} }
Heiko Dietrich, Murray Elder, Adam Piggott, Youming Qiao, and Armin Weiß. The Isomorphism Problem for Plain Groups Is in Σ₃^{𝖯}. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 26:1-26:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{dietrich_et_al:LIPIcs.STACS.2022.26, author = {Dietrich, Heiko and Elder, Murray and Piggott, Adam and Qiao, Youming and Wei{\ss}, Armin}, title = {{The Isomorphism Problem for Plain Groups Is in \Sigma₃^\{𝖯\}}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {26:1--26:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.26}, URN = {urn:nbn:de:0030-drops-158368}, doi = {10.4230/LIPIcs.STACS.2022.26}, annote = {Keywords: plain group, isomorphism problem, polynomial hierarchy, \Sigma₃^\{𝖯\} complexity class, inverse-closed finite convergent length-reducing rewriting system} }
Michael Elkin and Ofer Neiman. Centralized, Parallel, and Distributed Multi-Source Shortest Paths via Hopsets and Rectangular Matrix Multiplication. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 27:1-27:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{elkin_et_al:LIPIcs.STACS.2022.27, author = {Elkin, Michael and Neiman, Ofer}, title = {{Centralized, Parallel, and Distributed Multi-Source Shortest Paths via Hopsets and Rectangular Matrix Multiplication}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {27:1--27:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.27}, URN = {urn:nbn:de:0030-drops-158379}, doi = {10.4230/LIPIcs.STACS.2022.27}, annote = {Keywords: Shortest paths, matrix multiplication, hopsets} }
Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, and Lars Rohwedder. Cardinality Constrained Scheduling in Online Models. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 28:1-28:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{epstein_et_al:LIPIcs.STACS.2022.28, author = {Epstein, Leah and Lassota, Alexandra and Levin, Asaf and Maack, Marten and Rohwedder, Lars}, title = {{Cardinality Constrained Scheduling in Online Models}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {28:1--28:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.28}, URN = {urn:nbn:de:0030-drops-158385}, doi = {10.4230/LIPIcs.STACS.2022.28}, annote = {Keywords: Cardinality Constrained Scheduling, Makespan Minimization, Online Algorithms, Lower Bounds, Pure Online, Migration, Ordinal Algorithms} }
Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Kirill Simonov, and Saket Saurabh. Detours in Directed Graphs. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 29:1-29:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{fomin_et_al:LIPIcs.STACS.2022.29, author = {Fomin, Fedor V. and Golovach, Petr A. and Lochet, William and Sagunov, Danil and Simonov, Kirill and Saurabh, Saket}, title = {{Detours in Directed Graphs}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {29:1--29:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.29}, URN = {urn:nbn:de:0030-drops-158390}, doi = {10.4230/LIPIcs.STACS.2022.29}, annote = {Keywords: longest path, longest detour, diameter, directed graphs, parameterized complexity} }
Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, and Malte Renken. Delay-Robust Routes in Temporal Graphs. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 30:1-30:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{fuchsle_et_al:LIPIcs.STACS.2022.30, author = {F\"{u}chsle, Eugen and Molter, Hendrik and Niedermeier, Rolf and Renken, Malte}, title = {{Delay-Robust Routes in Temporal Graphs}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {30:1--30:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.30}, URN = {urn:nbn:de:0030-drops-158403}, doi = {10.4230/LIPIcs.STACS.2022.30}, annote = {Keywords: algorithms and complexity, parameterized complexity, time-varying networks, temporal paths, journeys} }
Hiromichi Goko, Kazuhisa Makino, Shuichi Miyazaki, and Yu Yokoi. Maximally Satisfying Lower Quotas in the Hospitals/Residents Problem with Ties. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 31:1-31:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{goko_et_al:LIPIcs.STACS.2022.31, author = {Goko, Hiromichi and Makino, Kazuhisa and Miyazaki, Shuichi and Yokoi, Yu}, title = {{Maximally Satisfying Lower Quotas in the Hospitals/Residents Problem with Ties}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {31:1--31:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.31}, URN = {urn:nbn:de:0030-drops-158414}, doi = {10.4230/LIPIcs.STACS.2022.31}, annote = {Keywords: Stable matching, Hospitals/Residents problem, Lower quota, NP-hardness, Approximation algorithm, Strategy-proofness} }
Hiromichi Goko, Akitoshi Kawamura, Yasushi Kawase, Kazuhisa Makino, and Hanna Sumita. Online Scheduling on Identical Machines with a Metric State Space. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 32:1-32:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{goko_et_al:LIPIcs.STACS.2022.32, author = {Goko, Hiromichi and Kawamura, Akitoshi and Kawase, Yasushi and Makino, Kazuhisa and Sumita, Hanna}, title = {{Online Scheduling on Identical Machines with a Metric State Space}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {32:1--32:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.32}, URN = {urn:nbn:de:0030-drops-158421}, doi = {10.4230/LIPIcs.STACS.2022.32}, annote = {Keywords: Online scheduling, Competitive analysis, Online dial-a-ride} }
Éric Goubault, Jérémy Ledent, and Sergio Rajsbaum. A Simplicial Model for KB4_n: Epistemic Logic with Agents That May Die. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 33:1-33:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{goubault_et_al:LIPIcs.STACS.2022.33, author = {Goubault, \'{E}ric and Ledent, J\'{e}r\'{e}my and Rajsbaum, Sergio}, title = {{A Simplicial Model for KB4\underlinen: Epistemic Logic with Agents That May Die}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {33:1--33:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.33}, URN = {urn:nbn:de:0030-drops-158434}, doi = {10.4230/LIPIcs.STACS.2022.33}, annote = {Keywords: Epistemic logic, Simplicial complexes, Distributed computing} }
Petr Gregor, Torsten Mütze, and Arturo Merino. Star Transposition Gray Codes for Multiset Permutations. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 34:1-34:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{gregor_et_al:LIPIcs.STACS.2022.34, author = {Gregor, Petr and M\"{u}tze, Torsten and Merino, Arturo}, title = {{Star Transposition Gray Codes for Multiset Permutations}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {34:1--34:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.34}, URN = {urn:nbn:de:0030-drops-158448}, doi = {10.4230/LIPIcs.STACS.2022.34}, annote = {Keywords: Gray code, permutation, combination, transposition, Hamilton cycle} }
Sander Gribling and Harold Nieuwboer. Improved Quantum Lower and Upper Bounds for Matrix Scaling. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 35:1-35:23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{gribling_et_al:LIPIcs.STACS.2022.35, author = {Gribling, Sander and Nieuwboer, Harold}, title = {{Improved Quantum Lower and Upper Bounds for Matrix Scaling}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {35:1--35:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.35}, URN = {urn:nbn:de:0030-drops-158458}, doi = {10.4230/LIPIcs.STACS.2022.35}, annote = {Keywords: Matrix scaling, quantum algorithms, lower bounds} }
Carla Groenland, Isja Mannens, Jesper Nederlof, and Krisztina Szilágyi. Tight Bounds for Counting Colorings and Connected Edge Sets Parameterized by Cutwidth. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 36:1-36:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{groenland_et_al:LIPIcs.STACS.2022.36, author = {Groenland, Carla and Mannens, Isja and Nederlof, Jesper and Szil\'{a}gyi, Krisztina}, title = {{Tight Bounds for Counting Colorings and Connected Edge Sets Parameterized by Cutwidth}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {36:1--36:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.36}, URN = {urn:nbn:de:0030-drops-158464}, doi = {10.4230/LIPIcs.STACS.2022.36}, annote = {Keywords: connected edge sets, cutwidth, parameterized algorithms, colorings, counting modulo p} }
Paweł M. Idziak, Piotr Kawałek, and Jacek Krzaczkowski. Satisfiability of Circuits and Equations over Finite Malcev Algebras. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 37:1-37:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{idziak_et_al:LIPIcs.STACS.2022.37, author = {Idziak, Pawe{\l} M. and Kawa{\l}ek, Piotr and Krzaczkowski, Jacek}, title = {{Satisfiability of Circuits and Equations over Finite Malcev Algebras}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {37:1--37:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.37}, URN = {urn:nbn:de:0030-drops-158474}, doi = {10.4230/LIPIcs.STACS.2022.37}, annote = {Keywords: Circuit satisfiability, solving equations, Exponential Time Hypothesis} }
Lars Jaffke, O-joung Kwon, and Jan Arne Telle. Classes of Intersection Digraphs with Good Algorithmic Properties. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 38:1-38:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{jaffke_et_al:LIPIcs.STACS.2022.38, author = {Jaffke, Lars and Kwon, O-joung and Telle, Jan Arne}, title = {{Classes of Intersection Digraphs with Good Algorithmic Properties}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {38:1--38:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.38}, URN = {urn:nbn:de:0030-drops-158480}, doi = {10.4230/LIPIcs.STACS.2022.38}, annote = {Keywords: intersection digraphs, H-digraphs, reflexive digraphs, directed domination, directed H-homomorphism} }
Lawqueen Kanesh, Jayakrishnan Madathil, Sanjukta Roy, Abhishek Sahu, and Saket Saurabh. Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 39:1-39:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{kanesh_et_al:LIPIcs.STACS.2022.39, author = {Kanesh, Lawqueen and Madathil, Jayakrishnan and Roy, Sanjukta and Sahu, Abhishek and Saurabh, Saket}, title = {{Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {39:1--39:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.39}, URN = {urn:nbn:de:0030-drops-158494}, doi = {10.4230/LIPIcs.STACS.2022.39}, annote = {Keywords: c-closed graphs, domination problems, perfect code, connected dominating set, fixed-parameter tractable, polynomial kernel} }
Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, and Sang-il Oum. Obstructions for Matroids of Path-Width at most k and Graphs of Linear Rank-Width at most k. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 40:1-40:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{kante_et_al:LIPIcs.STACS.2022.40, author = {Kant\'{e}, Mamadou Moustapha and Kim, Eun Jung and Kwon, O-joung and Oum, Sang-il}, title = {{Obstructions for Matroids of Path-Width at most k and Graphs of Linear Rank-Width at most k}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {40:1--40:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.40}, URN = {urn:nbn:de:0030-drops-158507}, doi = {10.4230/LIPIcs.STACS.2022.40}, annote = {Keywords: path-width, matroid, linear rank-width, graph, forbidden minor, vertex-minor, pivot-minor} }
Telikepalli Kavitha. Fairly Popular Matchings and Optimality. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 41:1-41:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{kavitha:LIPIcs.STACS.2022.41, author = {Kavitha, Telikepalli}, title = {{Fairly Popular Matchings and Optimality}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {41:1--41:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.41}, URN = {urn:nbn:de:0030-drops-158516}, doi = {10.4230/LIPIcs.STACS.2022.41}, annote = {Keywords: Bipartite graphs, Stable matchings, Mixed matchings, Polytopes} }
Tomohiro Koana, Christian Komusiewicz, André Nichterlein, and Frank Sommer. Covering Many (Or Few) Edges with k Vertices in Sparse Graphs. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 42:1-42:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{koana_et_al:LIPIcs.STACS.2022.42, author = {Koana, Tomohiro and Komusiewicz, Christian and Nichterlein, Andr\'{e} and Sommer, Frank}, title = {{Covering Many (Or Few) Edges with k Vertices in Sparse Graphs}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {42:1--42:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.42}, URN = {urn:nbn:de:0030-drops-158525}, doi = {10.4230/LIPIcs.STACS.2022.42}, annote = {Keywords: Parameterized Complexity, Kernelization, Partial Vertex Cover, Densest k-Subgraph, Max (k,n-k)-Cut, Degeneracy} }
Alexander Kozachinskiy. One-To-Two-Player Lifting for Mildly Growing Memory. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 43:1-43:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{kozachinskiy:LIPIcs.STACS.2022.43, author = {Kozachinskiy, Alexander}, title = {{One-To-Two-Player Lifting for Mildly Growing Memory}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {43:1--43:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.43}, URN = {urn:nbn:de:0030-drops-158535}, doi = {10.4230/LIPIcs.STACS.2022.43}, annote = {Keywords: Games on graphs, one-to-two-player lifting, strategy complexity, positional determinacy, finite-memory determinacy} }
Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, and Anamay Tengse. If VNP Is Hard, Then so Are Equations for It. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 44:1-44:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{kumar_et_al:LIPIcs.STACS.2022.44, author = {Kumar, Mrinal and Ramya, C. and Saptharishi, Ramprasad and Tengse, Anamay}, title = {{If VNP Is Hard, Then so Are Equations for It}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {44:1--44:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.44}, URN = {urn:nbn:de:0030-drops-158547}, doi = {10.4230/LIPIcs.STACS.2022.44}, annote = {Keywords: Computational Complexity, Algebraic Circuits, Algebraic Natural Proofs} }
Michael Lampis. Determining a Slater Winner Is Complete for Parallel Access to NP. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 45:1-45:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{lampis:LIPIcs.STACS.2022.45, author = {Lampis, Michael}, title = {{Determining a Slater Winner Is Complete for Parallel Access to NP}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {45:1--45:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.45}, URN = {urn:nbn:de:0030-drops-158555}, doi = {10.4230/LIPIcs.STACS.2022.45}, annote = {Keywords: Slater winner, Feedback Arc Set, Tournaments} }
Sławomir Lasota. Improved Ackermannian Lower Bound for the Petri Nets Reachability Problem. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 46:1-46:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{lasota:LIPIcs.STACS.2022.46, author = {Lasota, S{\l}awomir}, title = {{Improved Ackermannian Lower Bound for the Petri Nets Reachability Problem}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {46:1--46:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.46}, URN = {urn:nbn:de:0030-drops-158561}, doi = {10.4230/LIPIcs.STACS.2022.46}, annote = {Keywords: Petri nets, reachability problem, vector addition systems} }
Quanquan C. Liu, Manish Purohit, Zoya Svitkina, Erik Vee, and Joshua R. Wang. Scheduling with Communication Delay in Near-Linear Time. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 47:1-47:23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{liu_et_al:LIPIcs.STACS.2022.47, author = {Liu, Quanquan C. and Purohit, Manish and Svitkina, Zoya and Vee, Erik and Wang, Joshua R.}, title = {{Scheduling with Communication Delay in Near-Linear Time}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {47:1--47:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.47}, URN = {urn:nbn:de:0030-drops-158570}, doi = {10.4230/LIPIcs.STACS.2022.47}, annote = {Keywords: near-linear time scheduling, scheduling with duplication, precedence-constrained jobs, graph algorithms} }
Jack H. Lutz, Neil Lutz, and Elvira Mayordomo. Extending the Reach of the Point-To-Set Principle. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 48:1-48:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{lutz_et_al:LIPIcs.STACS.2022.48, author = {Lutz, Jack H. and Lutz, Neil and Mayordomo, Elvira}, title = {{Extending the Reach of the Point-To-Set Principle}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {48:1--48:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.48}, URN = {urn:nbn:de:0030-drops-158585}, doi = {10.4230/LIPIcs.STACS.2022.48}, annote = {Keywords: algorithmic dimensions, geometric measure theory, hyperspace, point-to-set principle} }
Nikhil S. Mande, Swagato Sanyal, and Suhail Sherif. One-Way Communication Complexity and Non-Adaptive Decision Trees. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 49:1-49:24, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{mande_et_al:LIPIcs.STACS.2022.49, author = {Mande, Nikhil S. and Sanyal, Swagato and Sherif, Suhail}, title = {{One-Way Communication Complexity and Non-Adaptive Decision Trees}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {49:1--49:24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.49}, URN = {urn:nbn:de:0030-drops-158598}, doi = {10.4230/LIPIcs.STACS.2022.49}, annote = {Keywords: Decision trees, communication complexity, composed Boolean functions} }
Jesper Nederlof, Michał Pilipczuk, Céline M. F. Swennenhuis, and Karol Węgrzycki. Isolation Schemes for Problems on Decomposable Graphs. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 50:1-50:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{nederlof_et_al:LIPIcs.STACS.2022.50, author = {Nederlof, Jesper and Pilipczuk, Micha{\l} and Swennenhuis, C\'{e}line M. F. and W\k{e}grzycki, Karol}, title = {{Isolation Schemes for Problems on Decomposable Graphs}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {50:1--50:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.50}, URN = {urn:nbn:de:0030-drops-158601}, doi = {10.4230/LIPIcs.STACS.2022.50}, annote = {Keywords: Isolation Lemma, Derandomization, Hamiltonian Cycle, Exact Algorithms} }
Daria Pchelina, Nicolas Schabanel, Shinnosuke Seki, and Guillaume Theyssier. Oritatami Systems Assemble Shapes No Less Complex Than Tile Assembly Model (ATAM). In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 51:1-51:23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{pchelina_et_al:LIPIcs.STACS.2022.51, author = {Pchelina, Daria and Schabanel, Nicolas and Seki, Shinnosuke and Theyssier, Guillaume}, title = {{Oritatami Systems Assemble Shapes No Less Complex Than Tile Assembly Model (ATAM)}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {51:1--51:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.51}, URN = {urn:nbn:de:0030-drops-158618}, doi = {10.4230/LIPIcs.STACS.2022.51}, annote = {Keywords: Molecular Self-assembly, Co-transcriptional folding, Intrinsic simulation, Arithmetical hierarchy of real numbers, 2D Turing machines, Computability} }
Michał Pilipczuk, Marek Sokołowski, and Anna Zych-Pawlewicz. Compact Representation for Matrices of Bounded Twin-Width. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 52:1-52:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{pilipczuk_et_al:LIPIcs.STACS.2022.52, author = {Pilipczuk, Micha{\l} and Soko{\l}owski, Marek and Zych-Pawlewicz, Anna}, title = {{Compact Representation for Matrices of Bounded Twin-Width}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {52:1--52:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.52}, URN = {urn:nbn:de:0030-drops-158620}, doi = {10.4230/LIPIcs.STACS.2022.52}, annote = {Keywords: twin-width, compact representation, adjacency oracle} }
C. Ramya and Anamay Tengse. On Finer Separations Between Subclasses of Read-Once Oblivious ABPs. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 53:1-53:23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{ramya_et_al:LIPIcs.STACS.2022.53, author = {Ramya, C. and Tengse, Anamay}, title = {{On Finer Separations Between Subclasses of Read-Once Oblivious ABPs}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {53:1--53:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.53}, URN = {urn:nbn:de:0030-drops-158636}, doi = {10.4230/LIPIcs.STACS.2022.53}, annote = {Keywords: Algebraic Complexity Theory, Algebraic Branching Programs, Commutative Matrices} }
Hanlin Ren and Rahul Santhanam. A Relativization Perspective on Meta-Complexity. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 54:1-54:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{ren_et_al:LIPIcs.STACS.2022.54, author = {Ren, Hanlin and Santhanam, Rahul}, title = {{A Relativization Perspective on Meta-Complexity}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {54:1--54:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.54}, URN = {urn:nbn:de:0030-drops-158646}, doi = {10.4230/LIPIcs.STACS.2022.54}, annote = {Keywords: meta-complexity, relativization, minimum circuit size problem} }
András Z. Salamon and Michael Wehar. Superlinear Lower Bounds Based on ETH. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 55:1-55:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{salamon_et_al:LIPIcs.STACS.2022.55, author = {Salamon, Andr\'{a}s Z. and Wehar, Michael}, title = {{Superlinear Lower Bounds Based on ETH}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {55:1--55:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.55}, URN = {urn:nbn:de:0030-drops-158652}, doi = {10.4230/LIPIcs.STACS.2022.55}, annote = {Keywords: Circuit Satisfiability, Conditional Lower Bounds, Exponential Time Hypothesis, Limited Nondeterminism} }
Martin Škoviera and Peter Varša. NP-Completeness of Perfect Matching Index of Cubic Graphs. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 56:1-56:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{skoviera_et_al:LIPIcs.STACS.2022.56, author = {\v{S}koviera, Martin and Var\v{s}a, Peter}, title = {{NP-Completeness of Perfect Matching Index of Cubic Graphs}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {56:1--56:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.56}, URN = {urn:nbn:de:0030-drops-158667}, doi = {10.4230/LIPIcs.STACS.2022.56}, annote = {Keywords: cubic graph, edge colouring, snark, perfect matching, covering, NP-completeness} }
D. M. Stull. Optimal Oracles for Point-To-Set Principles. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 57:1-57:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{stull:LIPIcs.STACS.2022.57, author = {Stull, D. M.}, title = {{Optimal Oracles for Point-To-Set Principles}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {57:1--57:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.57}, URN = {urn:nbn:de:0030-drops-158675}, doi = {10.4230/LIPIcs.STACS.2022.57}, annote = {Keywords: Algorithmic randomness, Kolmogorov complexity, geometric measure theory} }
Takeshi Tokuyama and Ryo Yoshimura. High Quality Consistent Digital Curved Rays via Vector Field Rounding. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 58:1-58:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{tokuyama_et_al:LIPIcs.STACS.2022.58, author = {Tokuyama, Takeshi and Yoshimura, Ryo}, title = {{High Quality Consistent Digital Curved Rays via Vector Field Rounding}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {58:1--58:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.58}, URN = {urn:nbn:de:0030-drops-158680}, doi = {10.4230/LIPIcs.STACS.2022.58}, annote = {Keywords: Computational Geometry, Discrepancy Theory, Consistent Digital Rays, Digital Geometry} }
Christopher Williamson. Sharp Indistinguishability Bounds from Non-Uniform Approximations. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 59:1-59:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{williamson:LIPIcs.STACS.2022.59, author = {Williamson, Christopher}, title = {{Sharp Indistinguishability Bounds from Non-Uniform Approximations}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {59:1--59:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.59}, URN = {urn:nbn:de:0030-drops-158692}, doi = {10.4230/LIPIcs.STACS.2022.59}, annote = {Keywords: bounded indistinguishability, randomness, secret sharing, polynomial approximation} }
Xinyu Wu. Analyzing XOR-Forrelation Through Stochastic Calculus. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 60:1-60:7, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{wu:LIPIcs.STACS.2022.60, author = {Wu, Xinyu}, title = {{Analyzing XOR-Forrelation Through Stochastic Calculus}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {60:1--60:7}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra 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.2022.60}, URN = {urn:nbn:de:0030-drops-158705}, doi = {10.4230/LIPIcs.STACS.2022.60}, annote = {Keywords: quantum complexity, Brownian motion} }
Feedback for Dagstuhl Publishing