Christophe Paul and Markus Bläser. LIPIcs, Vol. 154, STACS 2020, Complete Volume. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 0-1024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@Proceedings{paul_et_al:LIPIcs.STACS.2020, title = {{LIPIcs, Vol. 154, STACS 2020, Complete Volume}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020}, URN = {urn:nbn:de:0030-drops-118603}, doi = {10.4230/LIPIcs.STACS.2020}, annote = {Keywords: LIPIcs, Vol. 154, STACS 2020, Complete Volume} }
Christophe Paul and Markus Bläser. Front Matter, Table of Contents, Preface, Conference Organization. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 0:i-0:xii, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{paul_et_al:LIPIcs.STACS.2020.0, author = {Paul, Christophe and Bl\"{a}ser, Markus}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {0:i--0:xii}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.0}, URN = {urn:nbn:de:0030-drops-118614}, doi = {10.4230/LIPIcs.STACS.2020.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Dana Randall. Statistical Physics and Algorithms (Invited Talk). In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 1:1-1:6, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{randall:LIPIcs.STACS.2020.1, author = {Randall, Dana}, title = {{Statistical Physics and Algorithms}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {1:1--1:6}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.1}, URN = {urn:nbn:de:0030-drops-118624}, doi = {10.4230/LIPIcs.STACS.2020.1}, annote = {Keywords: Markov chains, mixing times, phase transitions, programmable matter} }
Martin Grohe. Weisfeiler and Leman’s Unlikely Journey from Graph Isomorphism to Neural Networks (Invited Talk). In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, p. 2:1, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{grohe:LIPIcs.STACS.2020.2, author = {Grohe, Martin}, title = {{Weisfeiler and Leman’s Unlikely Journey from Graph Isomorphism to Neural Networks}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {2:1--2:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.2}, URN = {urn:nbn:de:0030-drops-118634}, doi = {10.4230/LIPIcs.STACS.2020.2}, annote = {Keywords: Weisfeiler adn Leman algorithm, Graph isomorphism, Neural network, logic, algebra, linear and semi-definite programming} }
Olivier Bournez. Computability, Complexity and Programming with Ordinary Differential Equations (Invited Talk). In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 3:1-3:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{bournez:LIPIcs.STACS.2020.3, author = {Bournez, Olivier}, title = {{Computability, Complexity and Programming with Ordinary Differential Equations}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {3:1--3:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.3}, URN = {urn:nbn:de:0030-drops-118642}, doi = {10.4230/LIPIcs.STACS.2020.3}, annote = {Keywords: Ordinary differential equations, Models of computation, Analog Computations, discrete ordinary differential equations, Implicit complexity, recursion scheme} }
Martin C. Cooper, Simon de Givry, and Thomas Schiex. Graphical Models: Queries, Complexity, Algorithms (Tutorial). In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 4:1-4:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{cooper_et_al:LIPIcs.STACS.2020.4, author = {Cooper, Martin C. and de Givry, Simon and Schiex, Thomas}, title = {{Graphical Models: Queries, Complexity, Algorithms}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {4:1--4:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.4}, URN = {urn:nbn:de:0030-drops-118654}, doi = {10.4230/LIPIcs.STACS.2020.4}, annote = {Keywords: Computational complexity, tree decomposition, graphical models, submodularity, message passing, local consistency, artificial intelligence, valued constraints, optimization} }
Marten Maack and Klaus Jansen. Inapproximability Results for Scheduling with Interval and Resource Restrictions. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 5:1-5:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{maack_et_al:LIPIcs.STACS.2020.5, author = {Maack, Marten and Jansen, Klaus}, title = {{Inapproximability Results for Scheduling with Interval and Resource Restrictions}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {5:1--5:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.5}, URN = {urn:nbn:de:0030-drops-118663}, doi = {10.4230/LIPIcs.STACS.2020.5}, annote = {Keywords: Scheduling, Restricted Assignment, Approximation, Inapproximability, PTAS} }
Jan Philipp Wächter and Armin Weiß. An Automaton Group with PSPACE-Complete Word Problem. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 6:1-6:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{wachter_et_al:LIPIcs.STACS.2020.6, author = {W\"{a}chter, Jan Philipp and Wei{\ss}, Armin}, title = {{An Automaton Group with PSPACE-Complete Word Problem}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {6:1--6:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.6}, URN = {urn:nbn:de:0030-drops-118674}, doi = {10.4230/LIPIcs.STACS.2020.6}, annote = {Keywords: automaton group, word problem, PSPACE, compressed word problem} }
Wim Martens, Matthias Niewerth, and Tina Trautner. A Trichotomy for Regular Trail Queries. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 7:1-7:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{martens_et_al:LIPIcs.STACS.2020.7, author = {Martens, Wim and Niewerth, Matthias and Trautner, Tina}, title = {{A Trichotomy for Regular Trail Queries}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {7:1--7:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.7}, URN = {urn:nbn:de:0030-drops-118681}, doi = {10.4230/LIPIcs.STACS.2020.7}, annote = {Keywords: Regular languages, query languages, path queries, graph databases, databases, complexity, trails, simple paths} }
Antonin Callard and Mathieu Hoyrup. Descriptive Complexity on Non-Polish Spaces. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 8:1-8:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{callard_et_al:LIPIcs.STACS.2020.8, author = {Callard, Antonin and Hoyrup, Mathieu}, title = {{Descriptive Complexity on Non-Polish Spaces}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {8:1--8:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.8}, URN = {urn:nbn:de:0030-drops-118694}, doi = {10.4230/LIPIcs.STACS.2020.8}, annote = {Keywords: Represented space, Computable analysis, Descriptive set theory, CoPolish spaces} }
Titus Dose and Christian Glaßer. NP-Completeness, Proof Systems, and Disjoint NP-Pairs. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 9:1-9:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{dose_et_al:LIPIcs.STACS.2020.9, author = {Dose, Titus and Gla{\ss}er, Christian}, title = {{NP-Completeness, Proof Systems, and Disjoint NP-Pairs}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {9:1--9:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.9}, URN = {urn:nbn:de:0030-drops-118707}, doi = {10.4230/LIPIcs.STACS.2020.9}, annote = {Keywords: NP-complete, propositional proof system, disjoint NP-pair, oracle} }
Philip Bille, Inge Li Gørtz, and Teresa Anna Steiner. String Indexing with Compressed Patterns. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 10:1-10:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{bille_et_al:LIPIcs.STACS.2020.10, author = {Bille, Philip and G{\o}rtz, Inge Li and Steiner, Teresa Anna}, title = {{String Indexing with Compressed Patterns}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {10:1--10:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.10}, URN = {urn:nbn:de:0030-drops-118716}, doi = {10.4230/LIPIcs.STACS.2020.10}, annote = {Keywords: string indexing, compression, pattern matching} }
Yusuke Kobayashi. An FPT Algorithm for Minimum Additive Spanner Problem. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 11:1-11:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{kobayashi:LIPIcs.STACS.2020.11, author = {Kobayashi, Yusuke}, title = {{An FPT Algorithm for Minimum Additive Spanner Problem}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {11:1--11:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.11}, URN = {urn:nbn:de:0030-drops-118729}, doi = {10.4230/LIPIcs.STACS.2020.11}, annote = {Keywords: Graph algorithms, Fixed-parameter tractability, Graph spanner} }
Susanne Albers and Maximilian Janke. New Bounds for Randomized List Update in the Paid Exchange Model. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 12:1-12:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{albers_et_al:LIPIcs.STACS.2020.12, author = {Albers, Susanne and Janke, Maximilian}, title = {{New Bounds for Randomized List Update in the Paid Exchange Model}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {12:1--12:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.12}, URN = {urn:nbn:de:0030-drops-118735}, doi = {10.4230/LIPIcs.STACS.2020.12}, annote = {Keywords: self-organizing lists, online algorithm, competitive analysis, lower bound} }
Dan Bergren, Eduard Eiben, Robert Ganian, and Iyad Kanj. On Covering Segments with Unit Intervals. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 13:1-13:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{bergren_et_al:LIPIcs.STACS.2020.13, author = {Bergren, Dan and Eiben, Eduard and Ganian, Robert and Kanj, Iyad}, title = {{On Covering Segments with Unit Intervals}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {13:1--13:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.13}, URN = {urn:nbn:de:0030-drops-118741}, doi = {10.4230/LIPIcs.STACS.2020.13}, annote = {Keywords: Segment covering, unit intervals, NP-completeness, parameterized complexity} }
Jarkko Kari and Etienne Moutot. Decidability and Periodicity of Low Complexity Tilings. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 14:1-14:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{kari_et_al:LIPIcs.STACS.2020.14, author = {Kari, Jarkko and Moutot, Etienne}, title = {{Decidability and Periodicity of Low Complexity Tilings}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {14:1--14:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.14}, URN = {urn:nbn:de:0030-drops-118752}, doi = {10.4230/LIPIcs.STACS.2020.14}, annote = {Keywords: Nivat’s conjecture, domino problem, decidability, low pattern complexity, 2D subshifts, symbolic dynamics} }
Manuel Lafond, Binhai Zhu, and Peng Zou. The Tandem Duplication Distance Is NP-Hard. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 15:1-15:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{lafond_et_al:LIPIcs.STACS.2020.15, author = {Lafond, Manuel and Zhu, Binhai and Zou, Peng}, title = {{The Tandem Duplication Distance Is NP-Hard}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {15:1--15:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.15}, URN = {urn:nbn:de:0030-drops-118769}, doi = {10.4230/LIPIcs.STACS.2020.15}, annote = {Keywords: Tandem duplication, Text processing, Formal languages, Computational genomics, FPT algorithms} }
Paweł Gawrychowski, Martin Lange, Narad Rampersad, Jeffrey Shallit, and Marek Szykuła. Existential Length Universality. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 16:1-16:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{gawrychowski_et_al:LIPIcs.STACS.2020.16, author = {Gawrychowski, Pawe{\l} and Lange, Martin and Rampersad, Narad and Shallit, Jeffrey and Szyku{\l}a, Marek}, title = {{Existential Length Universality}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {16:1--16:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.16}, URN = {urn:nbn:de:0030-drops-118770}, doi = {10.4230/LIPIcs.STACS.2020.16}, annote = {Keywords: decision problem, deterministic automaton, nondeterministic automaton, pushdown automaton, regular expression, regular language, universality} }
Walter Hussak and Amitabh Trehan. On the Termination of Flooding. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 17:1-17:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{hussak_et_al:LIPIcs.STACS.2020.17, author = {Hussak, Walter and Trehan, Amitabh}, title = {{On the Termination of Flooding}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {17:1--17:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.17}, URN = {urn:nbn:de:0030-drops-118786}, doi = {10.4230/LIPIcs.STACS.2020.17}, annote = {Keywords: Flooding algorithm, Network algorithms, Distributed algorithms, Graph theory, Termination, Bipartiteness, Communication, Broadcast} }
Bartłomiej Dudek, Paweł Gawrychowski, and Tatiana Starikovskaya. Generalised Pattern Matching Revisited. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 18:1-18:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{dudek_et_al:LIPIcs.STACS.2020.18, author = {Dudek, Bart{\l}omiej and Gawrychowski, Pawe{\l} and Starikovskaya, Tatiana}, title = {{Generalised Pattern Matching Revisited}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {18:1--18:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.18}, URN = {urn:nbn:de:0030-drops-118798}, doi = {10.4230/LIPIcs.STACS.2020.18}, annote = {Keywords: pattern matching, superimposed codes, conditional lower bounds} }
Gregory Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, and Magnus Wahlström. Parameterized Pre-Coloring Extension and List Coloring Problems. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 19:1-19:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{gutin_et_al:LIPIcs.STACS.2020.19, author = {Gutin, Gregory and Majumdar, Diptapriyo and Ordyniak, Sebastian and Wahlstr\"{o}m, Magnus}, title = {{Parameterized Pre-Coloring Extension and List Coloring Problems}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {19:1--19:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.19}, URN = {urn:nbn:de:0030-drops-118801}, doi = {10.4230/LIPIcs.STACS.2020.19}, annote = {Keywords: Parameterized Algorithms, W-hardness, Kernelization, Graph Coloring, List Coloring} }
Sevag Gharibian, Stephen Piddock, and Justin Yirka. Oracle Complexity Classes and Local Measurements on Physical Hamiltonians. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 20:1-20:37, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{gharibian_et_al:LIPIcs.STACS.2020.20, author = {Gharibian, Sevag and Piddock, Stephen and Yirka, Justin}, title = {{Oracle Complexity Classes and Local Measurements on Physical Hamiltonians}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {20:1--20:37}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.20}, URN = {urn:nbn:de:0030-drops-118818}, doi = {10.4230/LIPIcs.STACS.2020.20}, annote = {Keywords: Quantum Merlin Arthur (QMA), simulation of local measurement, local Hamiltonian, oracle complexity class, physical Hamiltonians} }
Marius Zimand. Secret Key Agreement from Correlated Data, with No Prior Information. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 21:1-21:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{zimand:LIPIcs.STACS.2020.21, author = {Zimand, Marius}, title = {{Secret Key Agreement from Correlated Data, with No Prior Information}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {21:1--21:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.21}, URN = {urn:nbn:de:0030-drops-118823}, doi = {10.4230/LIPIcs.STACS.2020.21}, annote = {Keywords: secret key agreement, Kolmogorov complexity, extractors} }
Michał Gańczorz. Using Statistical Encoding to Achieve Tree Succinctness Never Seen Before. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 22:1-22:29, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{ganczorz:LIPIcs.STACS.2020.22, author = {Ga\'{n}czorz, Micha{\l}}, title = {{Using Statistical Encoding to Achieve Tree Succinctness Never Seen Before}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {22:1--22:29}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.22}, URN = {urn:nbn:de:0030-drops-118836}, doi = {10.4230/LIPIcs.STACS.2020.22}, annote = {Keywords: succinct data structures, labeled tree, ordered tree, entropy, tree entropy} }
Taisuke Izumi, François Le Gall, and Frédéric Magniez. Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 23:1-23:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{izumi_et_al:LIPIcs.STACS.2020.23, author = {Izumi, Taisuke and Le Gall, Fran\c{c}ois and Magniez, Fr\'{e}d\'{e}ric}, title = {{Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {23:1--23:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.23}, URN = {urn:nbn:de:0030-drops-118840}, doi = {10.4230/LIPIcs.STACS.2020.23}, annote = {Keywords: Quantum computing, distributed computing, CONGEST model} }
Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann, and Olivier Serre. Lower Bounds for Arithmetic Circuits via the Hankel Matrix. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 24:1-24:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{fijalkow_et_al:LIPIcs.STACS.2020.24, author = {Fijalkow, Nathana\"{e}l and Lagarde, Guillaume and Ohlmann, Pierre and Serre, Olivier}, title = {{Lower Bounds for Arithmetic Circuits via the Hankel Matrix}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {24:1--24:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.24}, URN = {urn:nbn:de:0030-drops-118859}, doi = {10.4230/LIPIcs.STACS.2020.24}, annote = {Keywords: Arithmetic Circuit Complexity, Lower Bounds, Parse Trees, Hankel Matrix} }
Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich, and Maximilian Katzmann. Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 25:1-25:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{blasius_et_al:LIPIcs.STACS.2020.25, author = {Bl\"{a}sius, Thomas and Fischbeck, Philipp and Friedrich, Tobias and Katzmann, Maximilian}, title = {{Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {25:1--25:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.25}, URN = {urn:nbn:de:0030-drops-118865}, doi = {10.4230/LIPIcs.STACS.2020.25}, annote = {Keywords: vertex cover, random graphs, hyperbolic geometry, efficient algorithm} }
Nathalie Aubrun, Julien Esnay, and Mathieu Sablik. Domino Problem Under Horizontal Constraints. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 26:1-26:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{aubrun_et_al:LIPIcs.STACS.2020.26, author = {Aubrun, Nathalie and Esnay, Julien and Sablik, Mathieu}, title = {{Domino Problem Under Horizontal Constraints}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {26:1--26:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.26}, URN = {urn:nbn:de:0030-drops-118875}, doi = {10.4230/LIPIcs.STACS.2020.26}, annote = {Keywords: Dynamical Systems, Symbolic Dynamics, Subshifts, Wang tiles, Undecidability, Domino Problem, Combinatorics, Tilings, Subshifts of Finite Type} }
George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev, and Philipp Zschoche. Computing Maximum Matchings in Temporal Graphs. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 27:1-27:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{mertzios_et_al:LIPIcs.STACS.2020.27, author = {Mertzios, George B. and Molter, Hendrik and Niedermeier, Rolf and Zamaraev, Viktor and Zschoche, Philipp}, title = {{Computing Maximum Matchings in Temporal Graphs}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {27:1--27:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.27}, URN = {urn:nbn:de:0030-drops-118881}, doi = {10.4230/LIPIcs.STACS.2020.27}, annote = {Keywords: Temporal Graph, Link Stream, Temporal Line Graph, NP-hardness, APX-hardness, Approximation Algorithm, Fixed-parameter Tractability, Independent Set} }
Brieuc Guinard and Amos Korman. Tight Bounds for the Cover Times of Random Walks with Heterogeneous Step Lengths. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 28:1-28:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{guinard_et_al:LIPIcs.STACS.2020.28, author = {Guinard, Brieuc and Korman, Amos}, title = {{Tight Bounds for the Cover Times of Random Walks with Heterogeneous Step Lengths}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {28:1--28:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.28}, URN = {urn:nbn:de:0030-drops-118892}, doi = {10.4230/LIPIcs.STACS.2020.28}, annote = {Keywords: Computational Biology, Randomness in Computing, Search Algorithms, Random Walks, L\'{e}vy Flights, Intermittent Search, CCRW} }
Falko Hegerfeld and Stefan Kratsch. Solving Connectivity Problems Parameterized by Treedepth in Single-Exponential Time and Polynomial Space. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 29:1-29:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{hegerfeld_et_al:LIPIcs.STACS.2020.29, author = {Hegerfeld, Falko and Kratsch, Stefan}, title = {{Solving Connectivity Problems Parameterized by Treedepth in Single-Exponential Time and Polynomial Space}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {29:1--29:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.29}, URN = {urn:nbn:de:0030-drops-118907}, doi = {10.4230/LIPIcs.STACS.2020.29}, annote = {Keywords: Parameterized Complexity, Connectivity, Treedepth, Cut\&Count, Polynomial Space} }
Mitsuru Funakoshi and Julian Pape-Lange. Non-Rectangular Convolutions and (Sub-)Cadences with Three Elements. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 30:1-30:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{funakoshi_et_al:LIPIcs.STACS.2020.30, author = {Funakoshi, Mitsuru and Pape-Lange, Julian}, title = {{Non-Rectangular Convolutions and (Sub-)Cadences with Three Elements}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {30:1--30:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.30}, URN = {urn:nbn:de:0030-drops-118911}, doi = {10.4230/LIPIcs.STACS.2020.30}, annote = {Keywords: discrete acyclic convolutions, string-cadences, geometric algorithms, number theoretic transforms} }
Édouard Bonnet, Sergio Cabello, and Wolfgang Mulzer. Maximum Matchings in Geometric Intersection Graphs. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 31:1-31:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{bonnet_et_al:LIPIcs.STACS.2020.31, author = {Bonnet, \'{E}douard and Cabello, Sergio and Mulzer, Wolfgang}, title = {{Maximum Matchings in Geometric Intersection Graphs}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {31:1--31:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.31}, URN = {urn:nbn:de:0030-drops-118926}, doi = {10.4230/LIPIcs.STACS.2020.31}, annote = {Keywords: computational geometry, geometric intersection graph, maximum matching, disk graph, unit-disk graph} }
Thomas Colcombet and Sylvain Lombardy. Unambiguous Separators for Tropical Tree Automata. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 32:1-32:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{colcombet_et_al:LIPIcs.STACS.2020.32, author = {Colcombet, Thomas and Lombardy, Sylvain}, title = {{Unambiguous Separators for Tropical Tree Automata}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {32:1--32:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.32}, URN = {urn:nbn:de:0030-drops-118933}, doi = {10.4230/LIPIcs.STACS.2020.32}, annote = {Keywords: Tree automata, Tropical semiring, Separation, Unambiguity} }
Mirmahdi Rahgoshay and Mohammad R. Salavatipour. Asymptotic Quasi-Polynomial Time Approximation Scheme for Resource Minimization for Fire Containment. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 33:1-33:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{rahgoshay_et_al:LIPIcs.STACS.2020.33, author = {Rahgoshay, Mirmahdi and Salavatipour, Mohammad R.}, title = {{Asymptotic Quasi-Polynomial Time Approximation Scheme for Resource Minimization for Fire Containment}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {33:1--33:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.33}, URN = {urn:nbn:de:0030-drops-118946}, doi = {10.4230/LIPIcs.STACS.2020.33}, annote = {Keywords: Firefighter Problem, Resource Management, Fire Containment, Approximation Algorithm, Asymptotic Approximation Scheme} }
Yi-Jun Chang, Martín Farach-Colton, Tsan-Sheng Hsu, and Meng-Tsung Tsai. Streaming Complexity of Spanning Tree Computation. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 34:1-34:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{chang_et_al:LIPIcs.STACS.2020.34, author = {Chang, Yi-Jun and Farach-Colton, Mart{\'\i}n and Hsu, Tsan-Sheng and Tsai, Meng-Tsung}, title = {{Streaming Complexity of Spanning Tree Computation}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {34:1--34:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.34}, URN = {urn:nbn:de:0030-drops-118951}, doi = {10.4230/LIPIcs.STACS.2020.34}, annote = {Keywords: Max-Leaf Spanning Trees, BFS Trees, DFS Trees} }
Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, and Kunihiro Wasa. Shortest Reconfiguration of Colorings Under Kempe Changes. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 35:1-35:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{bonamy_et_al:LIPIcs.STACS.2020.35, author = {Bonamy, Marthe and Heinrich, Marc and Ito, Takehiro and Kobayashi, Yusuke and Mizuta, Haruka and M\"{u}hlenthaler, Moritz and Suzuki, Akira and Wasa, Kunihiro}, title = {{Shortest Reconfiguration of Colorings Under Kempe Changes}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {35:1--35:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.35}, URN = {urn:nbn:de:0030-drops-118961}, doi = {10.4230/LIPIcs.STACS.2020.35}, annote = {Keywords: Combinatorial Reconfiguration, Graph Algorithms, Graph Coloring, Kempe Equivalence} }
Eva-Maria C. Hols, Stefan Kratsch, and Astrid Pieterse. Elimination Distances, Blocking Sets, and Kernels for Vertex Cover. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 36:1-36:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{hols_et_al:LIPIcs.STACS.2020.36, author = {Hols, Eva-Maria C. and Kratsch, Stefan and Pieterse, Astrid}, title = {{Elimination Distances, Blocking Sets, and Kernels for Vertex Cover}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {36:1--36:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.36}, URN = {urn:nbn:de:0030-drops-118974}, doi = {10.4230/LIPIcs.STACS.2020.36}, annote = {Keywords: Vertex Cover, kernelization, blocking sets, elimination distance, structural parameters} }
S. Akshay, Nikhil Balaji, Aniket Murhekar, Rohith Varma, and Nikhil Vyas. Near-Optimal Complexity Bounds for Fragments of the Skolem Problem. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 37:1-37:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{akshay_et_al:LIPIcs.STACS.2020.37, author = {Akshay, S. and Balaji, Nikhil and Murhekar, Aniket and Varma, Rohith and Vyas, Nikhil}, title = {{Near-Optimal Complexity Bounds for Fragments of the Skolem Problem}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {37:1--37:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.37}, URN = {urn:nbn:de:0030-drops-118982}, doi = {10.4230/LIPIcs.STACS.2020.37}, annote = {Keywords: Linear Recurrences, Skolem problem, NP-completeness, Weighted automata} }
Stefan Kratsch and Florian Nelles. Efficient Parameterized Algorithms for Computing All-Pairs Shortest Paths. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 38:1-38:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{kratsch_et_al:LIPIcs.STACS.2020.38, author = {Kratsch, Stefan and Nelles, Florian}, title = {{Efficient Parameterized Algorithms for Computing All-Pairs Shortest Paths}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {38:1--38:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.38}, URN = {urn:nbn:de:0030-drops-118992}, doi = {10.4230/LIPIcs.STACS.2020.38}, annote = {Keywords: All-pairs shortest Paths, efficient parameterized Algorithms, parameterized Complexity, Clique-width, Modular-width} }
Michał Wrona. Relational Width of First-Order Expansions of Homogeneous Graphs with Bounded Strict Width. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 39:1-39:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{wrona:LIPIcs.STACS.2020.39, author = {Wrona, Micha{\l}}, title = {{Relational Width of First-Order Expansions of Homogeneous Graphs with Bounded Strict Width}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {39:1--39:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.39}, URN = {urn:nbn:de:0030-drops-119000}, doi = {10.4230/LIPIcs.STACS.2020.39}, annote = {Keywords: Constraint Satisfaction, Homogeneous Graphs, Bounded Width, Strict Width, Relational Width, Computational Complexity} }
Michael Blondin, Javier Esparza, Blaise Genest, Martin Helfrich, and Stefan Jaax. Succinct Population Protocols for Presburger Arithmetic. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 40:1-40:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{blondin_et_al:LIPIcs.STACS.2020.40, author = {Blondin, Michael and Esparza, Javier and Genest, Blaise and Helfrich, Martin and Jaax, Stefan}, title = {{Succinct Population Protocols for Presburger Arithmetic}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {40:1--40:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.40}, URN = {urn:nbn:de:0030-drops-119018}, doi = {10.4230/LIPIcs.STACS.2020.40}, annote = {Keywords: Population protocols, Presburger arithmetic, state complexity} }
Lech Duraj. A Sub-Quadratic Algorithm for the Longest Common Increasing Subsequence Problem. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 41:1-41:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{duraj:LIPIcs.STACS.2020.41, author = {Duraj, Lech}, title = {{A Sub-Quadratic Algorithm for the Longest Common Increasing Subsequence Problem}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {41:1--41:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.41}, URN = {urn:nbn:de:0030-drops-119020}, doi = {10.4230/LIPIcs.STACS.2020.41}, annote = {Keywords: longest common increasing subsequence, log-shaving, matching pairs} }
Andrés Cristi, Mathieu Mari, and Andreas Wiese. Fixed-Parameter Algorithms for Unsplittable Flow Cover. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 42:1-42:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{cristi_et_al:LIPIcs.STACS.2020.42, author = {Cristi, Andr\'{e}s and Mari, Mathieu and Wiese, Andreas}, title = {{Fixed-Parameter Algorithms for Unsplittable Flow Cover}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {42:1--42:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.42}, URN = {urn:nbn:de:0030-drops-119037}, doi = {10.4230/LIPIcs.STACS.2020.42}, annote = {Keywords: Unsplittable Flow Cover, fixed parameter algorithms, approximation algorithms} }
Frank Fuhlbrück, Johannes Köbler, and Oleg Verbitsky. Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 43:1-43:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{fuhlbruck_et_al:LIPIcs.STACS.2020.43, author = {Fuhlbr\"{u}ck, Frank and K\"{o}bler, Johannes and Verbitsky, Oleg}, title = {{Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {43:1--43:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.43}, URN = {urn:nbn:de:0030-drops-119046}, doi = {10.4230/LIPIcs.STACS.2020.43}, annote = {Keywords: Graph Isomorphism, Weisfeiler-Leman Algorithm, Cai-F\"{u}rer-Immerman Graphs, coherent Configurations} }
Andrés Cristi and Andreas Wiese. Better Approximations for General Caching and UFP-Cover Under Resource Augmentation. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 44:1-44:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{cristi_et_al:LIPIcs.STACS.2020.44, author = {Cristi, Andr\'{e}s and Wiese, Andreas}, title = {{Better Approximations for General Caching and UFP-Cover Under Resource Augmentation}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {44:1--44:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.44}, URN = {urn:nbn:de:0030-drops-119053}, doi = {10.4230/LIPIcs.STACS.2020.44}, annote = {Keywords: General caching, unsplittable flow cover, approximation algorithm, resource augmentation} }
Srinivasan Arunachalam, Sourav Chakraborty, Michal Koucký, Nitin Saurabh, and Ronald de Wolf. Improved Bounds on Fourier Entropy and Min-Entropy. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 45:1-45:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{arunachalam_et_al:LIPIcs.STACS.2020.45, author = {Arunachalam, Srinivasan and Chakraborty, Sourav and Kouck\'{y}, Michal and Saurabh, Nitin and de Wolf, Ronald}, title = {{Improved Bounds on Fourier Entropy and Min-Entropy}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {45:1--45:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.45}, URN = {urn:nbn:de:0030-drops-119062}, doi = {10.4230/LIPIcs.STACS.2020.45}, annote = {Keywords: Fourier analysis of Boolean functions, FEI conjecture, query complexity, polynomial approximation, approximate degree, certificate complexity} }
Bruno Bauwens. Information Distance Revisited. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 46:1-46:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{bauwens:LIPIcs.STACS.2020.46, author = {Bauwens, Bruno}, title = {{Information Distance Revisited}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {46:1--46:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.46}, URN = {urn:nbn:de:0030-drops-119071}, doi = {10.4230/LIPIcs.STACS.2020.46}, annote = {Keywords: Kolmogorov complexity, algorithmic information distance} }
Suryajith Chillara. On Computing Multilinear Polynomials Using Multi-r-ic Depth Four Circuits. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 47:1-47:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{chillara:LIPIcs.STACS.2020.47, author = {Chillara, Suryajith}, title = {{On Computing Multilinear Polynomials Using Multi-r-ic Depth Four Circuits}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {47:1--47:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.47}, URN = {urn:nbn:de:0030-drops-119084}, doi = {10.4230/LIPIcs.STACS.2020.47}, annote = {Keywords: Lower Bounds, Multilinear, Multi-r-ic} }
Dietmar Berwanger and Laurent Doyen. Observation and Distinction. Representing Information in Infinite Games. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 48:1-48:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{berwanger_et_al:LIPIcs.STACS.2020.48, author = {Berwanger, Dietmar and Doyen, Laurent}, title = {{Observation and Distinction. Representing Information in Infinite Games}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {48:1--48:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.48}, URN = {urn:nbn:de:0030-drops-119095}, doi = {10.4230/LIPIcs.STACS.2020.48}, annote = {Keywords: Infinite Games on Finite Graphs, Imperfect Information, Automatic Structures} }
Julian D'Costa, Engel Lefaucheux, Joël Ouaknine, and James Worrell. How Fast Can You Escape a Compact Polytope?. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 49:1-49:11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{dcosta_et_al:LIPIcs.STACS.2020.49, author = {D'Costa, Julian and Lefaucheux, Engel and Ouaknine, Jo\"{e}l and Worrell, James}, title = {{How Fast Can You Escape a Compact Polytope?}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {49:1--49:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.49}, URN = {urn:nbn:de:0030-drops-119105}, doi = {10.4230/LIPIcs.STACS.2020.49}, annote = {Keywords: Continuous linear dynamical systems, termination} }
Sidhanth Mohanty, Ryan O'Donnell, and Pedro Paredes. The SDP Value for Random Two-Eigenvalue CSPs. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 50:1-50:45, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{mohanty_et_al:LIPIcs.STACS.2020.50, author = {Mohanty, Sidhanth and O'Donnell, Ryan and Paredes, Pedro}, title = {{The SDP Value for Random Two-Eigenvalue CSPs}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {50:1--50:45}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.50}, URN = {urn:nbn:de:0030-drops-119110}, doi = {10.4230/LIPIcs.STACS.2020.50}, annote = {Keywords: Semidefinite programming, constraint satisfaction problems} }
Xiang Huang, Jack H. Lutz, Elvira Mayordomo, and Donald M. Stull. Asymptotic Divergences and Strong Dichotomy. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 51:1-51:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{huang_et_al:LIPIcs.STACS.2020.51, author = {Huang, Xiang and Lutz, Jack H. and Mayordomo, Elvira and Stull, Donald M.}, title = {{Asymptotic Divergences and Strong Dichotomy}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {51:1--51:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.51}, URN = {urn:nbn:de:0030-drops-119125}, doi = {10.4230/LIPIcs.STACS.2020.51}, annote = {Keywords: finite-state dimension, finite-state gambler, Kullback-Leibler divergence, normal sequences} }
S. M. Dhannya and N. S. Narayanaswamy. Perfect Resolution of Conflict-Free Colouring of Interval Hypergraphs. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 52:1-52:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{dhannya_et_al:LIPIcs.STACS.2020.52, author = {Dhannya, S. M. and Narayanaswamy, N. S.}, title = {{Perfect Resolution of Conflict-Free Colouring of Interval Hypergraphs}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {52:1--52:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.52}, URN = {urn:nbn:de:0030-drops-119138}, doi = {10.4230/LIPIcs.STACS.2020.52}, annote = {Keywords: Conflict-free Colouring, Interval Hypergraphs} }
Monika Henzinger and Pan Peng. Constant-Time Dynamic (Δ+1)-Coloring. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 53:1-53:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{henzinger_et_al:LIPIcs.STACS.2020.53, author = {Henzinger, Monika and Peng, Pan}, title = {{Constant-Time Dynamic (\Delta+1)-Coloring}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {53:1--53:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.53}, URN = {urn:nbn:de:0030-drops-119145}, doi = {10.4230/LIPIcs.STACS.2020.53}, annote = {Keywords: Dynamic graph algorithms, Graph coloring, Random sampling} }
Marcelo Arenas, Juan Reutter, Etienne Toussaint, Martín Ugarte, Francisco Vial, and Domagoj Vrgoč. Cryptocurrency Mining Games with Economic Discount and Decreasing Rewards. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 54:1-54:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{arenas_et_al:LIPIcs.STACS.2020.54, author = {Arenas, Marcelo and Reutter, Juan and Toussaint, Etienne and Ugarte, Mart{\'\i}n and Vial, Francisco and Vrgo\v{c}, Domagoj}, title = {{Cryptocurrency Mining Games with Economic Discount and Decreasing Rewards}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {54:1--54:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.54}, URN = {urn:nbn:de:0030-drops-119150}, doi = {10.4230/LIPIcs.STACS.2020.54}, annote = {Keywords: cryptocurrency, game theory, cryptomining, economic discount, decreasing rewards} }
André Nies and Frank Stephan. Randomness and Initial Segment Complexity for Probability Measures. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 55:1-55:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{nies_et_al:LIPIcs.STACS.2020.55, author = {Nies, Andr\'{e} and Stephan, Frank}, title = {{Randomness and Initial Segment Complexity for Probability Measures}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {55:1--55:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.55}, URN = {urn:nbn:de:0030-drops-119168}, doi = {10.4230/LIPIcs.STACS.2020.55}, annote = {Keywords: algorithmic randomness, probability measure on Cantor space, Kolmogorov complexity, statistical superposition, quantum states} }
Jakub Gajarský and Stephan Kreutzer. Computing Shrub-Depth Decompositions. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 56:1-56:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{gajarsky_et_al:LIPIcs.STACS.2020.56, author = {Gajarsk\'{y}, Jakub and Kreutzer, Stephan}, title = {{Computing Shrub-Depth Decompositions}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {56:1--56:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.56}, URN = {urn:nbn:de:0030-drops-119177}, doi = {10.4230/LIPIcs.STACS.2020.56}, annote = {Keywords: shrub-depth, tree-model, decomposition, fixed-parameter tractability} }
Hans L. Bodlaender, Lars Jaffke, and Jan Arne Telle. Typical Sequences Revisited - Computing Width Parameters of Graphs. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 57:1-57:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{bodlaender_et_al:LIPIcs.STACS.2020.57, author = {Bodlaender, Hans L. and Jaffke, Lars and Telle, Jan Arne}, title = {{Typical Sequences Revisited - Computing Width Parameters of Graphs}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {57:1--57:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.57}, URN = {urn:nbn:de:0030-drops-119189}, doi = {10.4230/LIPIcs.STACS.2020.57}, annote = {Keywords: typical sequences, treewidth, series parallel digraphs, cutwidth, modified cutwidth} }
Pierre Aboulker, Édouard Bonnet, Eun Jung Kim, and Florian Sikora. Grundy Coloring & Friends, Half-Graphs, Bicliques. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 58:1-58:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{aboulker_et_al:LIPIcs.STACS.2020.58, author = {Aboulker, Pierre and Bonnet, \'{E}douard and Kim, Eun Jung and Sikora, Florian}, title = {{Grundy Coloring \& Friends, Half-Graphs, Bicliques}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {58:1--58:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.58}, URN = {urn:nbn:de:0030-drops-119190}, doi = {10.4230/LIPIcs.STACS.2020.58}, annote = {Keywords: Grundy coloring, parameterized complexity, ETH lower bounds, K\underline\{t,t\}-free graphs, half-graphs} }
Nikhil Vyas and R. Ryan Williams. Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 59:1-59:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{vyas_et_al:LIPIcs.STACS.2020.59, author = {Vyas, Nikhil and Williams, R. Ryan}, title = {{Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {59:1--59:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.59}, URN = {urn:nbn:de:0030-drops-119200}, doi = {10.4230/LIPIcs.STACS.2020.59}, annote = {Keywords: #SAT, satisfiability, circuit complexity, exact majority, ACC} }
Jacobo Torán and Florian Wörz. Reversible Pebble Games and the Relation Between Tree-Like and General Resolution Space. In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 154, pp. 60:1-60:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{toran_et_al:LIPIcs.STACS.2020.60, author = {Tor\'{a}n, Jacobo and W\"{o}rz, Florian}, title = {{Reversible Pebble Games and the Relation Between Tree-Like and General Resolution Space}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {60:1--60:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-140-5}, ISSN = {1868-8969}, year = {2020}, volume = {154}, editor = {Paul, Christophe and Bl\"{a}ser, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.60}, URN = {urn:nbn:de:0030-drops-119213}, doi = {10.4230/LIPIcs.STACS.2020.60}, annote = {Keywords: Proof Complexity, Resolution, Tree-like Resolution, Pebble Game, Reversible Pebbling, Prover-Delayer Game, Raz - McKenzie Game, Clause Space, Variable Space} }
Feedback for Dagstuhl Publishing