45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 1-1216, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@Proceedings{esparza_et_al:LIPIcs.MFCS.2020, title = {{LIPIcs, Volume 170, MFCS 2020, Complete Volume}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {1--1216}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020}, URN = {urn:nbn:de:0030-drops-126703}, doi = {10.4230/LIPIcs.MFCS.2020}, annote = {Keywords: LIPIcs, Volume 170, MFCS 2020, Complete Volume} }
45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 0:i-0:xviii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{esparza_et_al:LIPIcs.MFCS.2020.0, author = {Esparza, Javier and Kr\'{a}l', Daniel}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {0:i--0:xviii}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.0}, URN = {urn:nbn:de:0030-drops-126714}, doi = {10.4230/LIPIcs.MFCS.2020.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Nathalie Bertrand. Concurrent Games with Arbitrarily Many Players (Invited Talk). In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 1:1-1:8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{bertrand:LIPIcs.MFCS.2020.1, author = {Bertrand, Nathalie}, title = {{Concurrent Games with Arbitrarily Many Players}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {1:1--1:8}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.1}, URN = {urn:nbn:de:0030-drops-126724}, doi = {10.4230/LIPIcs.MFCS.2020.1}, annote = {Keywords: concurrent games, parameterized verification} }
Sergio Cabello. Some Open Problems in Computational Geometry (Invited Talk). In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 2:1-2:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{cabello:LIPIcs.MFCS.2020.2, author = {Cabello, Sergio}, title = {{Some Open Problems in Computational Geometry}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {2:1--2:6}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.2}, URN = {urn:nbn:de:0030-drops-126734}, doi = {10.4230/LIPIcs.MFCS.2020.2}, annote = {Keywords: barrier resilience, maximum matching, geometric graphs, fixed-parameter tractability, stochastic computational geometry} }
Mary Wootters. List-Decodability of Structured Ensembles of Codes (Invited Talk). In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 3:1-3:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{wootters:LIPIcs.MFCS.2020.3, author = {Wootters, Mary}, title = {{List-Decodability of Structured Ensembles of Codes}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {3:1--3:5}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.3}, URN = {urn:nbn:de:0030-drops-126742}, doi = {10.4230/LIPIcs.MFCS.2020.3}, annote = {Keywords: Error Correcting Codes, List-Decoding} }
Deniz Ağaoğlu and Petr Hliněný. Isomorphism Problem for S_d-Graphs. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 4:1-4:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{agaoglu_et_al:LIPIcs.MFCS.2020.4, author = {A\u{g}ao\u{g}lu, Deniz and Hlin\v{e}n\'{y}, Petr}, title = {{Isomorphism Problem for S\underlined-Graphs}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {4:1--4:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.4}, URN = {urn:nbn:de:0030-drops-126754}, doi = {10.4230/LIPIcs.MFCS.2020.4}, annote = {Keywords: intersection graph, isomorphism testing, interval graph, H-graph} }
Jungho Ahn, Eduard Eiben, O-joung Kwon, and Sang-il Oum. A Polynomial Kernel for 3-Leaf Power Deletion. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 5:1-5:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{ahn_et_al:LIPIcs.MFCS.2020.5, author = {Ahn, Jungho and Eiben, Eduard and Kwon, O-joung and Oum, Sang-il}, title = {{A Polynomial Kernel for 3-Leaf Power Deletion}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {5:1--5:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.5}, URN = {urn:nbn:de:0030-drops-126763}, doi = {10.4230/LIPIcs.MFCS.2020.5}, annote = {Keywords: 𝓁-leaf power, parameterized algorithms, kernelization} }
Saeed Akhoondian Amiri, Alexandru Popa, Mohammad Roghani, Golnoosh Shahkarami, Reza Soltani, and Hossein Vahidi. Complexity of Computing the Anti-Ramsey Numbers for Paths. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 6:1-6:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{akhoondianamiri_et_al:LIPIcs.MFCS.2020.6, author = {Akhoondian Amiri, Saeed and Popa, Alexandru and Roghani, Mohammad and Shahkarami, Golnoosh and Soltani, Reza and Vahidi, Hossein}, title = {{Complexity of Computing the Anti-Ramsey Numbers for Paths}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {6:1--6:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.6}, URN = {urn:nbn:de:0030-drops-126781}, doi = {10.4230/LIPIcs.MFCS.2020.6}, annote = {Keywords: Coloring, Anti-Ramsey, Approximation, NP-hard, Algorithm, ETH} }
Susanne Albers, Arindam Khan, and Leon Ladewig. Best Fit Bin Packing with Random Order Revisited. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 7:1-7:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{albers_et_al:LIPIcs.MFCS.2020.7, author = {Albers, Susanne and Khan, Arindam and Ladewig, Leon}, title = {{Best Fit Bin Packing with Random Order Revisited}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {7:1--7:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.7}, URN = {urn:nbn:de:0030-drops-127300}, doi = {10.4230/LIPIcs.MFCS.2020.7}, annote = {Keywords: Online bin packing, random arrival order, probabilistic analysis} }
Andris Ambainis, Kaspars Balodis, Jānis Iraids, Kamil Khadiev, Vladislavs Kļevickis, Krišjānis Prūsis, Yixin Shen, Juris Smotrovs, and Jevgēnijs Vihrovs. Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 8:1-8:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{ambainis_et_al:LIPIcs.MFCS.2020.8, author = {Ambainis, Andris and Balodis, Kaspars and Iraids, J\={a}nis and Khadiev, Kamil and K\c{l}evickis, Vladislavs and Pr\={u}sis, Kri\v{s}j\={a}nis and Shen, Yixin and Smotrovs, Juris and Vihrovs, Jevg\={e}nijs}, title = {{Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {8:1--8:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.8}, URN = {urn:nbn:de:0030-drops-126774}, doi = {10.4230/LIPIcs.MFCS.2020.8}, annote = {Keywords: Quantum query complexity, Quantum algorithms, Dyck language, Grid path} }
Boris Aronov, Matthew J. Katz, and Elad Sulami. Dynamic Time Warping-Based Proximity Problems. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 9:1-9:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{aronov_et_al:LIPIcs.MFCS.2020.9, author = {Aronov, Boris and Katz, Matthew J. and Sulami, Elad}, title = {{Dynamic Time Warping-Based Proximity Problems}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {9:1--9:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.9}, URN = {urn:nbn:de:0030-drops-126794}, doi = {10.4230/LIPIcs.MFCS.2020.9}, annote = {Keywords: dynamic time warping, distance oracle, clustering, nearest-neighbor search} }
V. Arvind, Abhranil Chatterjee, Rajit Datta, and Partha Mukhopadhyay. A Special Case of Rational Identity Testing and the Brešar-Klep Theorem. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 10:1-10:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{arvind_et_al:LIPIcs.MFCS.2020.10, author = {Arvind, V. and Chatterjee, Abhranil and Datta, Rajit and Mukhopadhyay, Partha}, title = {{A Special Case of Rational Identity Testing and the Bre\v{s}ar-Klep Theorem}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {10:1--10:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.10}, URN = {urn:nbn:de:0030-drops-126807}, doi = {10.4230/LIPIcs.MFCS.2020.10}, annote = {Keywords: Rational identity testing, ABP with inverses, Bre\v{s}ar-Klep Theorem, Invertible image, Amitsur’s theorem} }
Max Bannach, Sebastian Berndt, Marten Maack, Matthias Mnich, Alexandra Lassota, Malin Rau, and Malte Skambath. Solving Packing Problems with Few Small Items Using Rainbow Matchings. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 11:1-11:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{bannach_et_al:LIPIcs.MFCS.2020.11, author = {Bannach, Max and Berndt, Sebastian and Maack, Marten and Mnich, Matthias and Lassota, Alexandra and Rau, Malin and Skambath, Malte}, title = {{Solving Packing Problems with Few Small Items Using Rainbow Matchings}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {11:1--11:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.11}, URN = {urn:nbn:de:0030-drops-126816}, doi = {10.4230/LIPIcs.MFCS.2020.11}, annote = {Keywords: Bin Packing, Knapsack, matching, fixed-parameter tractable} }
Pierre Béaur and Jarkko Kari. Decidability in Group Shifts and Group Cellular Automata. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 12:1-12:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{beaur_et_al:LIPIcs.MFCS.2020.12, author = {B\'{e}aur, Pierre and Kari, Jarkko}, title = {{Decidability in Group Shifts and Group Cellular Automata}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {12:1--12:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.12}, URN = {urn:nbn:de:0030-drops-127206}, doi = {10.4230/LIPIcs.MFCS.2020.12}, annote = {Keywords: group cellular automata, group shifts, symbolic dynamics, decidability} }
Arpitha P. Bharathi and Monaldo Mastrolilli. Ideal Membership Problem and a Majority Polymorphism over the Ternary Domain. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 13:1-13:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{bharathi_et_al:LIPIcs.MFCS.2020.13, author = {Bharathi, Arpitha P. and Mastrolilli, Monaldo}, title = {{Ideal Membership Problem and a Majority Polymorphism over the Ternary Domain}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {13:1--13:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.13}, URN = {urn:nbn:de:0030-drops-126829}, doi = {10.4230/LIPIcs.MFCS.2020.13}, annote = {Keywords: Polynomial ideal membership, Polymorphisms, Gr\"{o}bner basis theory, Constraint satisfaction problems} }
Therese Biedl, Steven Chaplick, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, and Chrysanthi Raftopoulou. Layered Fan-Planar Graph Drawings. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 14:1-14:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{biedl_et_al:LIPIcs.MFCS.2020.14, author = {Biedl, Therese and Chaplick, Steven and Kaufmann, Michael and Montecchiani, Fabrizio and N\"{o}llenburg, Martin and Raftopoulou, Chrysanthi}, title = {{Layered Fan-Planar Graph Drawings}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {14:1--14:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.14}, URN = {urn:nbn:de:0030-drops-126835}, doi = {10.4230/LIPIcs.MFCS.2020.14}, annote = {Keywords: Graph Drawing, Parameterized Complexity, Beyond Planar Graphs} }
Davide Bilò, Vittorio Bilò, Pascal Lenzner, and Louise Molitor. Topological Influence and Locality in Swap Schelling Games. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 15:1-15:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{bilo_et_al:LIPIcs.MFCS.2020.15, author = {Bil\`{o}, Davide and Bil\`{o}, Vittorio and Lenzner, Pascal and Molitor, Louise}, title = {{Topological Influence and Locality in Swap Schelling Games}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {15:1--15:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.15}, URN = {urn:nbn:de:0030-drops-126841}, doi = {10.4230/LIPIcs.MFCS.2020.15}, annote = {Keywords: Residential Segregation, Schelling’s Segregation Model, Non-cooperative Games, Price of Anarchy, Game Dynamics} }
Arindam Biswas, Venkatesh Raman, and Saket Saurabh. Approximation in (Poly-) Logarithmic Space. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 16:1-16:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{biswas_et_al:LIPIcs.MFCS.2020.16, author = {Biswas, Arindam and Raman, Venkatesh and Saurabh, Saket}, title = {{Approximation in (Poly-) Logarithmic Space}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {16:1--16:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.16}, URN = {urn:nbn:de:0030-drops-126852}, doi = {10.4230/LIPIcs.MFCS.2020.16}, annote = {Keywords: approximation, logspace, logarithmic, log, space, small, limited, memory, ROM, read-only} }
Markus Bläser and Vladimir Lysikov. Slice Rank of Block Tensors and Irreversibility of Structure Tensors of Algebras. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 17:1-17:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{blaser_et_al:LIPIcs.MFCS.2020.17, author = {Bl\"{a}ser, Markus and Lysikov, Vladimir}, title = {{Slice Rank of Block Tensors and Irreversibility of Structure Tensors of Algebras}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {17:1--17:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.17}, URN = {urn:nbn:de:0030-drops-126869}, doi = {10.4230/LIPIcs.MFCS.2020.17}, annote = {Keywords: Tensors, Slice rank, Barriers, Matrix multiplication, GIT stability} }
Martin Böhm, Ruben Hoeksma, Nicole Megow, Lukas Nölke, and Bertrand Simon. Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 18:1-18:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{bohm_et_al:LIPIcs.MFCS.2020.18, author = {B\"{o}hm, Martin and Hoeksma, Ruben and Megow, Nicole and N\"{o}lke, Lukas and Simon, Bertrand}, title = {{Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {18:1--18:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.18}, URN = {urn:nbn:de:0030-drops-126870}, doi = {10.4230/LIPIcs.MFCS.2020.18}, annote = {Keywords: k-hop Steiner tree, dynamic programming, bounded treewidth} }
Mikołaj Bojańczyk and Janusz Schmude. Some Remarks on Deciding Equivalence for Graph-To-Graph Transducers. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 19:1-19:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{bojanczyk_et_al:LIPIcs.MFCS.2020.19, author = {Boja\'{n}czyk, Miko{\l}aj and Schmude, Janusz}, title = {{Some Remarks on Deciding Equivalence for Graph-To-Graph Transducers}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {19:1--19:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.19}, URN = {urn:nbn:de:0030-drops-127529}, doi = {10.4230/LIPIcs.MFCS.2020.19}, annote = {Keywords: equivalence for mso transductions, bounded treewidth, Hilbert basis theorem} }
Jan Bok, Richard Brewster, Tomás Feder, Pavol Hell, and Nikola Jedličková. List Homomorphism Problems for Signed Graphs. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 20:1-20:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{bok_et_al:LIPIcs.MFCS.2020.20, author = {Bok, Jan and Brewster, Richard and Feder, Tom\'{a}s and Hell, Pavol and Jedli\v{c}kov\'{a}, Nikola}, title = {{List Homomorphism Problems for Signed Graphs}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {20:1--20:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.20}, URN = {urn:nbn:de:0030-drops-126886}, doi = {10.4230/LIPIcs.MFCS.2020.20}, annote = {Keywords: complexity, dichotomy, graph homomorphism, signed graph} }
Laura Bozzelli, Angelo Montanari, Adriano Peron, and Pietro Sala. On a Temporal Logic of Prefixes and Infixes. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 21:1-21:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{bozzelli_et_al:LIPIcs.MFCS.2020.21, author = {Bozzelli, Laura and Montanari, Angelo and Peron, Adriano and Sala, Pietro}, title = {{On a Temporal Logic of Prefixes and Infixes}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {21:1--21:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.21}, URN = {urn:nbn:de:0030-drops-126898}, doi = {10.4230/LIPIcs.MFCS.2020.21}, annote = {Keywords: Interval Temporal Logic, Star-Free Regular Languages, Satisfiability, Complexity} }
Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Ismaël Jecker, and Jakub Svoboda. Simplified Game of Life: Algorithms and Complexity. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 22:1-22:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{chatterjee_et_al:LIPIcs.MFCS.2020.22, author = {Chatterjee, Krishnendu and Ibsen-Jensen, Rasmus and Jecker, Isma\"{e}l and Svoboda, Jakub}, title = {{Simplified Game of Life: Algorithms and Complexity}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {22:1--22:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.22}, URN = {urn:nbn:de:0030-drops-126903}, doi = {10.4230/LIPIcs.MFCS.2020.22}, annote = {Keywords: game of life, cellular automata, computational complexity, dynamical systems} }
Nai-Hui Chia, Tongyang Li, Han-Hsuan Lin, and Chunhao Wang. Quantum-Inspired Sublinear Algorithm for Solving Low-Rank Semidefinite Programming. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 23:1-23:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{chia_et_al:LIPIcs.MFCS.2020.23, author = {Chia, Nai-Hui and Li, Tongyang and Lin, Han-Hsuan and Wang, Chunhao}, title = {{Quantum-Inspired Sublinear Algorithm for Solving Low-Rank Semidefinite Programming}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {23:1--23:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.23}, URN = {urn:nbn:de:0030-drops-126919}, doi = {10.4230/LIPIcs.MFCS.2020.23}, annote = {Keywords: Spectral decomposition, Semi-definite programming, Quantum-inspired algorithm, Sublinear algorithm} }
Alexandre Clément and Simon Perdrix. PBS-Calculus: A Graphical Language for Coherent Control of Quantum Computations. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 24:1-24:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{clement_et_al:LIPIcs.MFCS.2020.24, author = {Cl\'{e}ment, Alexandre and Perdrix, Simon}, title = {{PBS-Calculus: A Graphical Language for Coherent Control of Quantum Computations}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {24:1--24:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.24}, URN = {urn:nbn:de:0030-drops-126921}, doi = {10.4230/LIPIcs.MFCS.2020.24}, annote = {Keywords: Quantum Computing, Diagrammatic Language, Completeness, Quantum Control, Polarising Beam Splitter, Categorical Quantum Mechanics, Quantum Switch} }
Alessio Conte, Pierluigi Crescenzi, Andrea Marino, and Giulia Punzi. Enumeration of s-d Separators in DAGs with Application to Reliability Analysis in Temporal Graphs. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 25:1-25:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{conte_et_al:LIPIcs.MFCS.2020.25, author = {Conte, Alessio and Crescenzi, Pierluigi and Marino, Andrea and Punzi, Giulia}, title = {{Enumeration of s-d Separators in DAGs with Application to Reliability Analysis in Temporal Graphs}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {25:1--25:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.25}, URN = {urn:nbn:de:0030-drops-126932}, doi = {10.4230/LIPIcs.MFCS.2020.25}, annote = {Keywords: minimal cutset, temporal graph, minimal separator, directed acyclic graph} }
Arjan Cornelissen, Stacey Jeffery, Maris Ozols, and Alvaro Piedrafita. Span Programs and Quantum Time Complexity. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 26:1-26:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{cornelissen_et_al:LIPIcs.MFCS.2020.26, author = {Cornelissen, Arjan and Jeffery, Stacey and Ozols, Maris and Piedrafita, Alvaro}, title = {{Span Programs and Quantum Time Complexity}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {26:1--26:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.26}, URN = {urn:nbn:de:0030-drops-126947}, doi = {10.4230/LIPIcs.MFCS.2020.26}, annote = {Keywords: quantum query algorithms, span programs, variable-time quantum search} }
Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis, and Viktor Zamaraev. Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 27:1-27:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{deligkas_et_al:LIPIcs.MFCS.2020.27, author = {Deligkas, Argyrios and Mertzios, George B. and Spirakis, Paul G. and Zamaraev, Viktor}, title = {{Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {27:1--27:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.27}, URN = {urn:nbn:de:0030-drops-126953}, doi = {10.4230/LIPIcs.MFCS.2020.27}, annote = {Keywords: Hamiltonian cycle, cubic graph, exact algorithm, approximation algorithm} }
Palash Dey, Jaikumar Radhakrishnan, and Santhoshini Velusamy. Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 28:1-28:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{dey_et_al:LIPIcs.MFCS.2020.28, author = {Dey, Palash and Radhakrishnan, Jaikumar and Velusamy, Santhoshini}, title = {{Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {28:1--28:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.28}, URN = {urn:nbn:de:0030-drops-126965}, doi = {10.4230/LIPIcs.MFCS.2020.28}, annote = {Keywords: Set membership, Bit-probe model, Fully-explicit data structures, Adaptive data structures, Error-correcting codes} }
Gaëtan Douéneau-Tabot, Emmanuel Filiot, and Paul Gastin. Register Transducers Are Marble Transducers. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 29:1-29:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{doueneautabot_et_al:LIPIcs.MFCS.2020.29, author = {Dou\'{e}neau-Tabot, Ga\"{e}tan and Filiot, Emmanuel and Gastin, Paul}, title = {{Register Transducers Are Marble Transducers}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {29:1--29:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.29}, URN = {urn:nbn:de:0030-drops-126979}, doi = {10.4230/LIPIcs.MFCS.2020.29}, annote = {Keywords: streaming string transducer, two-way transducer, marbles, pebbles} }
Pavol Ďuriš, Rastislav Královič, Richard Královič, Dana Pardubská, Martin Pašen, and Peter Rossmanith. Randomization in Non-Uniform Finite Automata. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 30:1-30:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{duris_et_al:LIPIcs.MFCS.2020.30, author = {\v{D}uri\v{s}, Pavol and Kr\'{a}lovi\v{c}, Rastislav and Kr\'{a}lovi\v{c}, Richard and Pardubsk\'{a}, Dana and Pa\v{s}en, Martin and Rossmanith, Peter}, title = {{Randomization in Non-Uniform Finite Automata}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {30:1--30:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.30}, URN = {urn:nbn:de:0030-drops-126987}, doi = {10.4230/LIPIcs.MFCS.2020.30}, annote = {Keywords: finite automata, non-uniform computation, randomization} }
Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, and Martin Nöllenburg. Extending Nearly Complete 1-Planar Drawings in Polynomial Time. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 31:1-31:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{eiben_et_al:LIPIcs.MFCS.2020.31, author = {Eiben, Eduard and Ganian, Robert and Hamm, Thekla and Klute, Fabian and N\"{o}llenburg, Martin}, title = {{Extending Nearly Complete 1-Planar Drawings in Polynomial Time}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {31:1--31:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.31}, URN = {urn:nbn:de:0030-drops-126998}, doi = {10.4230/LIPIcs.MFCS.2020.31}, annote = {Keywords: Extension problems, 1-planarity} }
Yury Elkin and Vitaliy Kurlin. The Mergegram of a Dendrogram and Its Stability. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 32:1-32:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{elkin_et_al:LIPIcs.MFCS.2020.32, author = {Elkin, Yury and Kurlin, Vitaliy}, title = {{The Mergegram of a Dendrogram and Its Stability}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {32:1--32:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.32}, URN = {urn:nbn:de:0030-drops-127281}, doi = {10.4230/LIPIcs.MFCS.2020.32}, annote = {Keywords: clustering dendrogram, topological data analysis, persistence, stability} }
Henning Fernau, Petra Wolf, and Tomoyuki Yamakami. Synchronizing Deterministic Push-Down Automata Can Be Really Hard. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 33:1-33:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{fernau_et_al:LIPIcs.MFCS.2020.33, author = {Fernau, Henning and Wolf, Petra and Yamakami, Tomoyuki}, title = {{Synchronizing Deterministic Push-Down Automata Can Be Really Hard}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {33:1--33:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.33}, URN = {urn:nbn:de:0030-drops-127008}, doi = {10.4230/LIPIcs.MFCS.2020.33}, annote = {Keywords: Synchronizing automaton, Reset sequence, Real-time deterministic push-down automaton, Finite-turn push-down automaton, Computability, Computational complexity} }
Nathanaël Fijalkow, Paweł Gawrychowski, and Pierre Ohlmann. Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 34:1-34:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{fijalkow_et_al:LIPIcs.MFCS.2020.34, author = {Fijalkow, Nathana\"{e}l and Gawrychowski, Pawe{\l} and Ohlmann, Pierre}, title = {{Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {34:1--34:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.34}, URN = {urn:nbn:de:0030-drops-127011}, doi = {10.4230/LIPIcs.MFCS.2020.34}, annote = {Keywords: Mean payoff games, Universal graphs, Value iteration} }
Fedor V. Fomin, Danil Sagunov, and Kirill Simonov. Building Large k-Cores from Sparse Graphs. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 35:1-35:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{fomin_et_al:LIPIcs.MFCS.2020.35, author = {Fomin, Fedor V. and Sagunov, Danil and Simonov, Kirill}, title = {{Building Large k-Cores from Sparse Graphs}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {35:1--35:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.35}, URN = {urn:nbn:de:0030-drops-127026}, doi = {10.4230/LIPIcs.MFCS.2020.35}, annote = {Keywords: parameterized complexity, k-core, vertex cover, treewidth} }
Andreas Galanis, Leslie Ann Goldberg, and Andrés Herrera-Poyatos. The Complexity of Approximating the Complex-Valued Potts Model. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 36:1-36:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{galanis_et_al:LIPIcs.MFCS.2020.36, author = {Galanis, Andreas and Goldberg, Leslie Ann and Herrera-Poyatos, Andr\'{e}s}, title = {{The Complexity of Approximating the Complex-Valued Potts Model}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {36:1--36:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.36}, URN = {urn:nbn:de:0030-drops-127038}, doi = {10.4230/LIPIcs.MFCS.2020.36}, annote = {Keywords: approximate counting, Potts model, Tutte polynomial, partition function, complex numbers} }
Andreas Galanis, Leslie Ann Goldberg, and James Stewart. Fast Algorithms for General Spin Systems on Bipartite Expanders. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 37:1-37:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{galanis_et_al:LIPIcs.MFCS.2020.37, author = {Galanis, Andreas and Goldberg, Leslie Ann and Stewart, James}, title = {{Fast Algorithms for General Spin Systems on Bipartite Expanders}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {37:1--37:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.37}, URN = {urn:nbn:de:0030-drops-127049}, doi = {10.4230/LIPIcs.MFCS.2020.37}, annote = {Keywords: bipartite expanders, approximate counting, spin systems} }
Paul D. Gallot, Aurélien Lemay, and Sylvain Salvati. Linear High-Order Deterministic Tree Transducers with Regular Look-Ahead. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 38:1-38:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{gallot_et_al:LIPIcs.MFCS.2020.38, author = {Gallot, Paul D. and Lemay, Aur\'{e}lien and Salvati, Sylvain}, title = {{Linear High-Order Deterministic Tree Transducers with Regular Look-Ahead}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {38:1--38:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.38}, URN = {urn:nbn:de:0030-drops-127050}, doi = {10.4230/LIPIcs.MFCS.2020.38}, annote = {Keywords: Transducers, \lambda-calculus, Trees} }
Junhao Gan, David F. Gleich, Nate Veldt, Anthony Wirth, and Xin Zhang. Graph Clustering in All Parameter Regimes. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 39:1-39:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{gan_et_al:LIPIcs.MFCS.2020.39, author = {Gan, Junhao and Gleich, David F. and Veldt, Nate and Wirth, Anthony and Zhang, Xin}, title = {{Graph Clustering in All Parameter Regimes}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {39:1--39:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.39}, URN = {urn:nbn:de:0030-drops-127065}, doi = {10.4230/LIPIcs.MFCS.2020.39}, annote = {Keywords: Graph Clustering, Algorithms, Parametric Linear Programming} }
Pierre Ganty, Elena Gutiérrez, and Pedro Valero. A Quasiorder-Based Perspective on Residual Automata. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 40:1-40:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{ganty_et_al:LIPIcs.MFCS.2020.40, author = {Ganty, Pierre and Guti\'{e}rrez, Elena and Valero, Pedro}, title = {{A Quasiorder-Based Perspective on Residual Automata}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {40:1--40:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.40}, URN = {urn:nbn:de:0030-drops-127071}, doi = {10.4230/LIPIcs.MFCS.2020.40}, annote = {Keywords: Residual Automata, Quasiorders, Double-Reversal Method, Canonical RFA, Regular Languages} }
Georg Gottlob, Matthias Lanzinger, Reinhard Pichler, and Igor Razgon. Fractional Covers of Hypergraphs with Bounded Multi-Intersection. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 41:1-41:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{gottlob_et_al:LIPIcs.MFCS.2020.41, author = {Gottlob, Georg and Lanzinger, Matthias and Pichler, Reinhard and Razgon, Igor}, title = {{Fractional Covers of Hypergraphs with Bounded Multi-Intersection}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {41:1--41:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.41}, URN = {urn:nbn:de:0030-drops-127317}, doi = {10.4230/LIPIcs.MFCS.2020.41}, annote = {Keywords: Fractional graph theory, fractional edge cover, fractional hypertree width, bounded multi-intersection, fractional cover, fractional vertex cover} }
Zeyu Guo. Factoring Polynomials over Finite Fields with Linear Galois Groups: An Additive Combinatorics Approach. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 42:1-42:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{guo:LIPIcs.MFCS.2020.42, author = {Guo, Zeyu}, title = {{Factoring Polynomials over Finite Fields with Linear Galois Groups: An Additive Combinatorics Approach}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {42:1--42:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.42}, URN = {urn:nbn:de:0030-drops-127082}, doi = {10.4230/LIPIcs.MFCS.2020.42}, annote = {Keywords: polynomial factoring, permutation group, finite field, algebraic combinatorics, additive combinatorics, derandomization} }
Chetan Gupta, Vimal Raj Sharma, and Raghunath Tewari. Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 43:1-43:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{gupta_et_al:LIPIcs.MFCS.2020.43, author = {Gupta, Chetan and Sharma, Vimal Raj and Tewari, Raghunath}, title = {{Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {43:1--43:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.43}, URN = {urn:nbn:de:0030-drops-127099}, doi = {10.4230/LIPIcs.MFCS.2020.43}, annote = {Keywords: Logspace computation, High genus, Matching isolation} }
Emirhan Gürpınar and Andrei Romashchenko. Communication Complexity of the Secret Key Agreement in Algorithmic Information Theory. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 44:1-44:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{gurpinar_et_al:LIPIcs.MFCS.2020.44, author = {G\"{u}rp{\i}nar, Emirhan and Romashchenko, Andrei}, title = {{Communication Complexity of the Secret Key Agreement in Algorithmic Information Theory}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {44:1--44:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.44}, URN = {urn:nbn:de:0030-drops-127102}, doi = {10.4230/LIPIcs.MFCS.2020.44}, annote = {Keywords: Kolmogorov complexity, mutual information, communication complexity, expander mixing lemma, finite geometry} }
Kristoffer Arnsfelt Hansen and Steffan Christ Sølvsten. ∃ℝ-Completeness of Stationary Nash Equilibria in Perfect Information Stochastic Games. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 45:1-45:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{hansen_et_al:LIPIcs.MFCS.2020.45, author = {Hansen, Kristoffer Arnsfelt and S{\o}lvsten, Steffan Christ}, title = {{\exists\mathbb{R}-Completeness of Stationary Nash Equilibria in Perfect Information Stochastic Games}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {45:1--45:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.45}, URN = {urn:nbn:de:0030-drops-127113}, doi = {10.4230/LIPIcs.MFCS.2020.45}, annote = {Keywords: Existential Theory of the Reals, Stationary Nash Equilibrium, Perfect Information Stochastic Games} }
Hiroshi Hirai and Ryuhei Mizutani. Minimum 0-Extension Problems on Directed Metrics. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 46:1-46:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{hirai_et_al:LIPIcs.MFCS.2020.46, author = {Hirai, Hiroshi and Mizutani, Ryuhei}, title = {{Minimum 0-Extension Problems on Directed Metrics}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {46:1--46:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.46}, URN = {urn:nbn:de:0030-drops-127120}, doi = {10.4230/LIPIcs.MFCS.2020.46}, annote = {Keywords: Minimum 0-extension problems, Directed metrics, Valued constraint satisfaction problems, Computational complexity} }
Svein Høgemo, Christophe Paul, and Jan Arne Telle. Hierarchical Clusterings of Unweighted Graphs. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 47:1-47:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{hgemo_et_al:LIPIcs.MFCS.2020.47, author = {H{\o}gemo, Svein and Paul, Christophe and Telle, Jan Arne}, title = {{Hierarchical Clusterings of Unweighted Graphs}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {47:1--47:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.47}, URN = {urn:nbn:de:0030-drops-127139}, doi = {10.4230/LIPIcs.MFCS.2020.47}, annote = {Keywords: Hierarchical Clustering} }
Stefan Jaax and Stefan Kiefer. On Affine Reachability Problems. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 48:1-48:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{jaax_et_al:LIPIcs.MFCS.2020.48, author = {Jaax, Stefan and Kiefer, Stefan}, title = {{On Affine Reachability Problems}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {48:1--48:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.48}, URN = {urn:nbn:de:0030-drops-127148}, doi = {10.4230/LIPIcs.MFCS.2020.48}, annote = {Keywords: Counter Machines, Matrix Semigroups, Reachability} }
Lars Jaffke, Paloma T. Lima, and Geevarghese Philip. Structural Parameterizations of Clique Coloring. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 49:1-49:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{jaffke_et_al:LIPIcs.MFCS.2020.49, author = {Jaffke, Lars and Lima, Paloma T. and Philip, Geevarghese}, title = {{Structural Parameterizations of Clique Coloring}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {49:1--49:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.49}, URN = {urn:nbn:de:0030-drops-127157}, doi = {10.4230/LIPIcs.MFCS.2020.49}, annote = {Keywords: clique coloring, treewidth, clique-width, structural parameterization, Strong Exponential Time Hypothesis} }
Lars Jaffke, Mateus de Oliveira Oliveira, and Hans Raj Tiwary. Compressing Permutation Groups into Grammars and Polytopes. A Graph Embedding Approach. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 50:1-50:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{jaffke_et_al:LIPIcs.MFCS.2020.50, author = {Jaffke, Lars and de Oliveira Oliveira, Mateus and Tiwary, Hans Raj}, title = {{Compressing Permutation Groups into Grammars and Polytopes. A Graph Embedding Approach}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {50:1--50:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.50}, URN = {urn:nbn:de:0030-drops-127161}, doi = {10.4230/LIPIcs.MFCS.2020.50}, annote = {Keywords: Permutation Groups, Context Free Grammars, Extension Complexity, Graph Embedding Complexity} }
Ismaël Jecker, Orna Kupferman, and Nicolas Mazzocchi. Unary Prime Languages. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 51:1-51:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{jecker_et_al:LIPIcs.MFCS.2020.51, author = {Jecker, Isma\"{e}l and Kupferman, Orna and Mazzocchi, Nicolas}, title = {{Unary Prime Languages}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {51:1--51:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.51}, URN = {urn:nbn:de:0030-drops-127177}, doi = {10.4230/LIPIcs.MFCS.2020.51}, annote = {Keywords: Deterministic Finite Automata (DFA), Regular Languages, Primality} }
Vít Jelínek, Michal Opler, and Jakub Pekárek. A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 52:1-52:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{jelinek_et_al:LIPIcs.MFCS.2020.52, author = {Jel{\'\i}nek, V{\'\i}t and Opler, Michal and Pek\'{a}rek, Jakub}, title = {{A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {52:1--52:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.52}, URN = {urn:nbn:de:0030-drops-127186}, doi = {10.4230/LIPIcs.MFCS.2020.52}, annote = {Keywords: permutations, pattern matching, grid classes} }
Dhawal Jethwani, François Le Gall, and Sanjay K. Singh. Quantum-Inspired Classical Algorithms for Singular Value Transformation. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 53:1-53:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{jethwani_et_al:LIPIcs.MFCS.2020.53, author = {Jethwani, Dhawal and Le Gall, Fran\c{c}ois and Singh, Sanjay K.}, title = {{Quantum-Inspired Classical Algorithms for Singular Value Transformation}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {53:1--53:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.53}, URN = {urn:nbn:de:0030-drops-127193}, doi = {10.4230/LIPIcs.MFCS.2020.53}, annote = {Keywords: Sampling algorithms, quantum-inspired algorithms, linear algebra} }
Toghrul Karimov, Joël Ouaknine, and James Worrell. On LTL Model Checking for Low-Dimensional Discrete Linear Dynamical Systems. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 54:1-54:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{karimov_et_al:LIPIcs.MFCS.2020.54, author = {Karimov, Toghrul and Ouaknine, Jo\"{e}l and Worrell, James}, title = {{On LTL Model Checking for Low-Dimensional Discrete Linear Dynamical Systems}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {54:1--54:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.54}, URN = {urn:nbn:de:0030-drops-127215}, doi = {10.4230/LIPIcs.MFCS.2020.54}, annote = {Keywords: Linear dynamical systems, Orbit Problem, LTL model checking} }
Piotr Kawałek and Jacek Krzaczkowski. Even Faster Algorithms for CSAT Over supernilpotent Algebras. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 55:1-55:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{kawalek_et_al:LIPIcs.MFCS.2020.55, author = {Kawa{\l}ek, Piotr and Krzaczkowski, Jacek}, title = {{Even Faster Algorithms for CSAT Over supernilpotent Algebras}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {55:1--55:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.55}, URN = {urn:nbn:de:0030-drops-127225}, doi = {10.4230/LIPIcs.MFCS.2020.55}, annote = {Keywords: circuit satisfiability, solving equations, supernilpotent algebras, satisfiability in groups} }
Michal Konečný, Florian Steinberg, and Holger Thies. Continuous and Monotone Machines. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 56:1-56:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{konecny_et_al:LIPIcs.MFCS.2020.56, author = {Kone\v{c}n\'{y}, Michal and Steinberg, Florian and Thies, Holger}, title = {{Continuous and Monotone Machines}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {56:1--56:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.56}, URN = {urn:nbn:de:0030-drops-127230}, doi = {10.4230/LIPIcs.MFCS.2020.56}, annote = {Keywords: Computable Analysis, exact real computation, formal proofs, proof assistant, Coq} }
Jan Kratochvíl, Tomáš Masařík, and Jana Novotná. U-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 57:1-57:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{kratochvil_et_al:LIPIcs.MFCS.2020.57, author = {Kratochv{\'\i}l, Jan and Masa\v{r}{\'\i}k, Tom\'{a}\v{s} and Novotn\'{a}, Jana}, title = {{U-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {57:1--57:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.57}, URN = {urn:nbn:de:0030-drops-127247}, doi = {10.4230/LIPIcs.MFCS.2020.57}, annote = {Keywords: Interval Graphs, Mixed Unit Interval Graphs, MaxCut Problem, Clique Width, Subexponential Algorithm, Bubble Model} }
Denis Kuperberg and Jan Martens. Regular Resynchronizability of Origin Transducers Is Undecidable. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 58:1-58:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{kuperberg_et_al:LIPIcs.MFCS.2020.58, author = {Kuperberg, Denis and Martens, Jan}, title = {{Regular Resynchronizability of Origin Transducers Is Undecidable}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {58:1--58:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.58}, URN = {urn:nbn:de:0030-drops-127255}, doi = {10.4230/LIPIcs.MFCS.2020.58}, annote = {Keywords: transducers, origin, resynchronisation, MSO, one-way, two-way, undecidability} }
Orna Kupferman and Ofer Leshkowitz. On Repetition Languages. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 59:1-59:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{kupferman_et_al:LIPIcs.MFCS.2020.59, author = {Kupferman, Orna and Leshkowitz, Ofer}, title = {{On Repetition Languages}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {59:1--59:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.59}, URN = {urn:nbn:de:0030-drops-127268}, doi = {10.4230/LIPIcs.MFCS.2020.59}, annote = {Keywords: B\"{u}chi automata, Expressive power, Succinctness} }
Kazuhiro Kurita and Yasuaki Kobayashi. Efficient Enumerations for Minimal Multicuts and Multiway Cuts. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 60:1-60:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{kurita_et_al:LIPIcs.MFCS.2020.60, author = {Kurita, Kazuhiro and Kobayashi, Yasuaki}, title = {{Efficient Enumerations for Minimal Multicuts and Multiway Cuts}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {60:1--60:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.60}, URN = {urn:nbn:de:0030-drops-127272}, doi = {10.4230/LIPIcs.MFCS.2020.60}, annote = {Keywords: Multicuts, Multiway cuts, Enumeration algorithms} }
Dietrich Kuske and Christian Schwarz. Complexity of Counting First-Order Logic for the Subword Order. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 61:1-61:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{kuske_et_al:LIPIcs.MFCS.2020.61, author = {Kuske, Dietrich and Schwarz, Christian}, title = {{Complexity of Counting First-Order Logic for the Subword Order}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {61:1--61:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.61}, URN = {urn:nbn:de:0030-drops-127297}, doi = {10.4230/LIPIcs.MFCS.2020.61}, annote = {Keywords: Counting logic, piecewise testable languages} }
Sophie Laplante, Reza Naserasr, and Anupa Sunny. Sensitivity Lower Bounds from Linear Dependencies. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 62:1-62:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{laplante_et_al:LIPIcs.MFCS.2020.62, author = {Laplante, Sophie and Naserasr, Reza and Sunny, Anupa}, title = {{Sensitivity Lower Bounds from Linear Dependencies}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {62:1--62:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.62}, URN = {urn:nbn:de:0030-drops-127320}, doi = {10.4230/LIPIcs.MFCS.2020.62}, annote = {Keywords: Boolean Functions, Polynomial Degree, Sensitivity} }
Paloma T. Lima, Erik Jan van Leeuwen, and Marieke van der Wegen. Algorithms for the Rainbow Vertex Coloring Problem on Graph Classes. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 63:1-63:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{lima_et_al:LIPIcs.MFCS.2020.63, author = {Lima, Paloma T. and van Leeuwen, Erik Jan and van der Wegen, Marieke}, title = {{Algorithms for the Rainbow Vertex Coloring Problem on Graph Classes}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {63:1--63:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.63}, URN = {urn:nbn:de:0030-drops-127331}, doi = {10.4230/LIPIcs.MFCS.2020.63}, annote = {Keywords: rainbow vertex coloring, permutation graphs, powers of trees} }
Paloma T. Lima, Vinicius F. dos Santos, Ignasi Sau, and Uéverton S. Souza. Reducing Graph Transversals via Edge Contractions. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 64:1-64:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{lima_et_al:LIPIcs.MFCS.2020.64, author = {Lima, Paloma T. and dos Santos, Vinicius F. and Sau, Ignasi and Souza, U\'{e}verton S.}, title = {{Reducing Graph Transversals via Edge Contractions}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {64:1--64:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.64}, URN = {urn:nbn:de:0030-drops-127346}, doi = {10.4230/LIPIcs.MFCS.2020.64}, annote = {Keywords: blocker problem, edge contraction, graph transversal, parameterized complexity, vertex cover, feedback vertex set, odd cycle transversal} }
Alexander Lindermayr, Sebastian Siebertz, and Alexandre Vigny. Elimination Distance to Bounded Degree on Planar Graphs. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 65:1-65:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{lindermayr_et_al:LIPIcs.MFCS.2020.65, author = {Lindermayr, Alexander and Siebertz, Sebastian and Vigny, Alexandre}, title = {{Elimination Distance to Bounded Degree on Planar Graphs}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {65:1--65:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.65}, URN = {urn:nbn:de:0030-drops-127557}, doi = {10.4230/LIPIcs.MFCS.2020.65}, annote = {Keywords: Elimination distance, parameterized complexity, structural graph theory} }
Sven Linker, Fabio Papacchini, and Michele Sevegnani. Analysing Spatial Properties on Neighbourhood Spaces. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 66:1-66:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{linker_et_al:LIPIcs.MFCS.2020.66, author = {Linker, Sven and Papacchini, Fabio and Sevegnani, Michele}, title = {{Analysing Spatial Properties on Neighbourhood Spaces}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {66:1--66:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.66}, URN = {urn:nbn:de:0030-drops-127352}, doi = {10.4230/LIPIcs.MFCS.2020.66}, annote = {Keywords: spatial logic, topology, bisimulation} }
Markus Lohrey and Georg Zetzsche. Knapsack and the Power Word Problem in Solvable Baumslag-Solitar Groups. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 67:1-67:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{lohrey_et_al:LIPIcs.MFCS.2020.67, author = {Lohrey, Markus and Zetzsche, Georg}, title = {{Knapsack and the Power Word Problem in Solvable Baumslag-Solitar Groups}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {67:1--67:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.67}, URN = {urn:nbn:de:0030-drops-127364}, doi = {10.4230/LIPIcs.MFCS.2020.67}, annote = {Keywords: computational group theory, matrix problems, Baumslag-Solitar groups} }
Raul Lopes and Ignasi Sau. A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 68:1-68:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{lopes_et_al:LIPIcs.MFCS.2020.68, author = {Lopes, Raul and Sau, Ignasi}, title = {{A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {68:1--68:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.68}, URN = {urn:nbn:de:0030-drops-127378}, doi = {10.4230/LIPIcs.MFCS.2020.68}, annote = {Keywords: Parameterized complexity, directed disjoint paths, congestion, dual parameterization, kernelization, directed tree-width} }
Vincent Michielini and Michał Skrzypczak. Regular Choice Functions and Uniformisations For countable Domains. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 69:1-69:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{michielini_et_al:LIPIcs.MFCS.2020.69, author = {Michielini, Vincent and Skrzypczak, Micha{\l}}, title = {{Regular Choice Functions and Uniformisations For countable Domains}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {69:1--69:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.69}, URN = {urn:nbn:de:0030-drops-127386}, doi = {10.4230/LIPIcs.MFCS.2020.69}, annote = {Keywords: Uniformisation, Monadic Second-order logic, Countable words} }
Pranabendu Misra, Fahad Panolan, Ashutosh Rai, Saket Saurabh, and Roohani Sharma. Quick Separation in Chordal and Split Graphs. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 70:1-70:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{misra_et_al:LIPIcs.MFCS.2020.70, author = {Misra, Pranabendu and Panolan, Fahad and Rai, Ashutosh and Saurabh, Saket and Sharma, Roohani}, title = {{Quick Separation in Chordal and Split Graphs}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {70:1--70:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.70}, URN = {urn:nbn:de:0030-drops-127391}, doi = {10.4230/LIPIcs.MFCS.2020.70}, annote = {Keywords: chordal graphs, multicut, multiway cut, FPT, kernel} }
Nils Morawietz, Carolin Rehs, and Mathias Weller. A Timecop’s Work Is Harder Than You Think. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 71:1-71:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{morawietz_et_al:LIPIcs.MFCS.2020.71, author = {Morawietz, Nils and Rehs, Carolin and Weller, Mathias}, title = {{A Timecop’s Work Is Harder Than You Think}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {71:1--71:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.71}, URN = {urn:nbn:de:0030-drops-127404}, doi = {10.4230/LIPIcs.MFCS.2020.71}, annote = {Keywords: edge-periodic temporal graphs, cops and robbers, tally-intersection, congruence satisfyability} }
Janaky Murthy, Vineet Nair, and Chandan Saha. Randomized Polynomial-Time Equivalence Between Determinant and Trace-IMM Equivalence Tests. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 72:1-72:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{murthy_et_al:LIPIcs.MFCS.2020.72, author = {Murthy, Janaky and Nair, Vineet and Saha, Chandan}, title = {{Randomized Polynomial-Time Equivalence Between Determinant and Trace-IMM Equivalence Tests}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {72:1--72:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.72}, URN = {urn:nbn:de:0030-drops-127419}, doi = {10.4230/LIPIcs.MFCS.2020.72}, annote = {Keywords: equivalence testing, determinant, trace of the matrix product, full-matrix algebra isomorphism} }
Satyadev Nandakumar and Prateek Vishnoi. Randomness and Effective Dimension of Continued Fractions. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 73:1-73:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{nandakumar_et_al:LIPIcs.MFCS.2020.73, author = {Nandakumar, Satyadev and Vishnoi, Prateek}, title = {{Randomness and Effective Dimension of Continued Fractions}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {73:1--73:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.73}, URN = {urn:nbn:de:0030-drops-127424}, doi = {10.4230/LIPIcs.MFCS.2020.73}, annote = {Keywords: Continued fractions, Martin-L\"{o}f randomness, Computable randomness, effective Fractal dimension} }
Daniel Neider, Patrick Totzke, and Martin Zimmermann. Optimally Resilient Strategies in Pushdown Safety Games. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 74:1-74:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{neider_et_al:LIPIcs.MFCS.2020.74, author = {Neider, Daniel and Totzke, Patrick and Zimmermann, Martin}, title = {{Optimally Resilient Strategies in Pushdown Safety Games}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {74:1--74:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.74}, URN = {urn:nbn:de:0030-drops-127432}, doi = {10.4230/LIPIcs.MFCS.2020.74}, annote = {Keywords: Controller Synthesis, Infinite Games, Resilient Strategies, Pushdown Games} }
Rian Neogi, M. S. Ramanujan, Saket Saurabh, and Roohani Sharma. On the Parameterized Complexity of Deletion to ℋ-Free Strong Components. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 75:1-75:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{neogi_et_al:LIPIcs.MFCS.2020.75, author = {Neogi, Rian and Ramanujan, M. S. and Saurabh, Saket and Sharma, Roohani}, title = {{On the Parameterized Complexity of Deletion to ℋ-Free Strong Components}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {75:1--75:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.75}, URN = {urn:nbn:de:0030-drops-127444}, doi = {10.4230/LIPIcs.MFCS.2020.75}, annote = {Keywords: Directed Cut Problems, Fixed-parameter Tractability, DFVS} }
Mitsunori Ogihara and Kei Uchizawa. Synchronous Boolean Finite Dynamical Systems on Directed Graphs over XOR Functions. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 76:1-76:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{ogihara_et_al:LIPIcs.MFCS.2020.76, author = {Ogihara, Mitsunori and Uchizawa, Kei}, title = {{Synchronous Boolean Finite Dynamical Systems on Directed Graphs over XOR Functions}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {76:1--76:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.76}, URN = {urn:nbn:de:0030-drops-127543}, doi = {10.4230/LIPIcs.MFCS.2020.76}, annote = {Keywords: Computational complexity, dynamical systems, Garden of Eden, predecessor, reachability} }
Louis Parlant, Jurriaan Rot, Alexandra Silva, and Bas Westerbaan. Preservation of Equations by Monoidal Monads. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 77:1-77:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{parlant_et_al:LIPIcs.MFCS.2020.77, author = {Parlant, Louis and Rot, Jurriaan and Silva, Alexandra and Westerbaan, Bas}, title = {{Preservation of Equations by Monoidal Monads}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {77:1--77:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.77}, URN = {urn:nbn:de:0030-drops-127460}, doi = {10.4230/LIPIcs.MFCS.2020.77}, annote = {Keywords: monoidal monads, algebraic theories, preservation of equations} }
Adam Paszke and Michał Pilipczuk. VC Density of Set Systems Definable in Tree-Like Graphs. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 78:1-78:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{paszke_et_al:LIPIcs.MFCS.2020.78, author = {Paszke, Adam and Pilipczuk, Micha{\l}}, title = {{VC Density of Set Systems Definable in Tree-Like Graphs}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {78:1--78:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.78}, URN = {urn:nbn:de:0030-drops-127473}, doi = {10.4230/LIPIcs.MFCS.2020.78}, annote = {Keywords: treewidth, cliquewidth, definable sets, Vapnik-Chervonenkis density} }
Jarkko Peltomäki and Markus A. Whiteland. All Growth Rates of Abelian Exponents Are Attained by Infinite Binary Words. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 79:1-79:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{peltomaki_et_al:LIPIcs.MFCS.2020.79, author = {Peltom\"{a}ki, Jarkko and Whiteland, Markus A.}, title = {{All Growth Rates of Abelian Exponents Are Attained by Infinite Binary Words}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {79:1--79:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.79}, URN = {urn:nbn:de:0030-drops-127481}, doi = {10.4230/LIPIcs.MFCS.2020.79}, annote = {Keywords: abelian equivalence, abelian power, abelian critical exponent} }
Alexander Rabinovich and Doron Tiferet. Ambiguity Hierarchy of Regular Infinite Tree Languages. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 80:1-80:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{rabinovich_et_al:LIPIcs.MFCS.2020.80, author = {Rabinovich, Alexander and Tiferet, Doron}, title = {{Ambiguity Hierarchy of Regular Infinite Tree Languages}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {80:1--80:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.80}, URN = {urn:nbn:de:0030-drops-127495}, doi = {10.4230/LIPIcs.MFCS.2020.80}, annote = {Keywords: automata on infinite trees, ambiguous automata, monadic second-order logic} }
Mikhail Rubinchik and Arseny M. Shur. Palindromic k-Factorization in Pure Linear Time. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 81:1-81:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{rubinchik_et_al:LIPIcs.MFCS.2020.81, author = {Rubinchik, Mikhail and Shur, Arseny M.}, title = {{Palindromic k-Factorization in Pure Linear Time}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {81:1--81:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.81}, URN = {urn:nbn:de:0030-drops-127508}, doi = {10.4230/LIPIcs.MFCS.2020.81}, annote = {Keywords: stringology, palindrome, palindromic factorization, online algorithm} }
Ignasi Sau and Uéverton dos Santos Souza. Hitting Forbidden Induced Subgraphs on Bounded Treewidth Graphs. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 82:1-82:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{sau_et_al:LIPIcs.MFCS.2020.82, author = {Sau, Ignasi and Souza, U\'{e}verton dos Santos}, title = {{Hitting Forbidden Induced Subgraphs on Bounded Treewidth Graphs}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {82:1--82:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.82}, URN = {urn:nbn:de:0030-drops-127511}, doi = {10.4230/LIPIcs.MFCS.2020.82}, annote = {Keywords: parameterized complexity, induced subgraphs, treewidth, hitting subgraphs, dynamic programming, lower bound, Exponential Time Hypothesis} }
Yasuhiro Takahashi, Yuki Takeuchi, and Seiichiro Tani. Classically Simulating Quantum Circuits with Local Depolarizing Noise. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 83:1-83:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{takahashi_et_al:LIPIcs.MFCS.2020.83, author = {Takahashi, Yasuhiro and Takeuchi, Yuki and Tani, Seiichiro}, title = {{Classically Simulating Quantum Circuits with Local Depolarizing Noise}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {83:1--83:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.83}, URN = {urn:nbn:de:0030-drops-127533}, doi = {10.4230/LIPIcs.MFCS.2020.83}, annote = {Keywords: Classical Simulation, Quantum Circuit, Local Depolarizing Noise} }
Nguyễn Kim Thắng. An Improved Approximation Algorithm for Scheduling Under Arborescence Precedence Constraints. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 84:1-84:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{thang:LIPIcs.MFCS.2020.84, author = {Thắng, Nguy\~{ê}n Kim}, title = {{An Improved Approximation Algorithm for Scheduling Under Arborescence Precedence Constraints}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {84:1--84:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.84}, URN = {urn:nbn:de:0030-drops-127459}, doi = {10.4230/LIPIcs.MFCS.2020.84}, annote = {Keywords: Scheduling, Precedence Constraints, Lagrangian Duality} }
Caterina Viola and Stanislav Živný. The Combined Basic LP and Affine IP Relaxation for Promise VCSPs on Infinite Domains. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 85:1-85:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{viola_et_al:LIPIcs.MFCS.2020.85, author = {Viola, Caterina and \v{Z}ivn\'{y}, Stanislav}, title = {{The Combined Basic LP and Affine IP Relaxation for Promise VCSPs on Infinite Domains}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {85:1--85:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.85}, URN = {urn:nbn:de:0030-drops-127566}, doi = {10.4230/LIPIcs.MFCS.2020.85}, annote = {Keywords: promise constraint satisfaction, valued constraint satisfaction, convex relaxations, polymorphisms} }