41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@Proceedings{faliszewski_et_al:LIPIcs.MFCS.2016, title = {{LIPIcs, Volume 58, MFCS'16, Complete Volume}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016}, URN = {urn:nbn:de:0030-drops-65861}, doi = {10.4230/LIPIcs.MFCS.2016}, annote = {Keywords: Theory of Computation} }
41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 0:i-0:xvi, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{faliszewski_et_al:LIPIcs.MFCS.2016.0, author = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, title = {{Front Matter, Foreword, Conference Organization, External Reviewers, Table of Contents}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {0:i--0:xvi}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.0}, URN = {urn:nbn:de:0030-drops-64225}, doi = {10.4230/LIPIcs.MFCS.2016.0}, annote = {Keywords: front matter, foreword, conference organization, external reviewers, table of contents} }
Shai Ben-David. How Far Are We From Having a Satisfactory Theory of Clustering? (Invited Talk). In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, p. 1:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{bendavid:LIPIcs.MFCS.2016.1, author = {Ben-David, Shai}, title = {{How Far Are We From Having a Satisfactory Theory of Clustering?}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {1:1--1:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.1}, URN = {urn:nbn:de:0030-drops-65078}, doi = {10.4230/LIPIcs.MFCS.2016.1}, annote = {Keywords: clustering, theory, algorithm tuning, computational complexity} }
Mikolaj Bojanczyk. Decidable Extensions of MSO (Invited Talk). In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, p. 2:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{bojanczyk:LIPIcs.MFCS.2016.2, author = {Bojanczyk, Mikolaj}, title = {{Decidable Extensions of MSO}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {2:1--2:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.2}, URN = {urn:nbn:de:0030-drops-65089}, doi = {10.4230/LIPIcs.MFCS.2016.2}, annote = {Keywords: monadic second-order logic, extensions, decidability, automata} }
Patricia Bouyer-Decitre. Optimal Reachability in Weighted Timed Automata and Games (Invited Talk). In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 3:1-3:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{bouyerdecitre:LIPIcs.MFCS.2016.3, author = {Bouyer-Decitre, Patricia}, title = {{Optimal Reachability in Weighted Timed Automata and Games}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {3:1--3:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.3}, URN = {urn:nbn:de:0030-drops-65090}, doi = {10.4230/LIPIcs.MFCS.2016.3}, annote = {Keywords: timed automata, model-checking, optimization} }
Tobias Friedrich. Scale-Free Networks, Hyperbolic Geometry, and Efficient Algorithms (Invited Talk). In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 4:1-4:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{friedrich:LIPIcs.MFCS.2016.4, author = {Friedrich, Tobias}, title = {{Scale-Free Networks, Hyperbolic Geometry, and Efficient Algorithms}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {4:1--4:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.4}, URN = {urn:nbn:de:0030-drops-65106}, doi = {10.4230/LIPIcs.MFCS.2016.4}, annote = {Keywords: power-law graphs, scale-free graphs, random graphs, distributed algorithms} }
Virginia Vassilevska Williams. RNA-Folding - From Hardness to Algorithms (Invited Talk). In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, p. 5:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{vassilevskawilliams:LIPIcs.MFCS.2016.5, author = {Vassilevska Williams, Virginia}, title = {{RNA-Folding - From Hardness to Algorithms}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {5:1--5:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.5}, URN = {urn:nbn:de:0030-drops-65115}, doi = {10.4230/LIPIcs.MFCS.2016.5}, annote = {Keywords: RNA folding, matrix multiplication} }
Manindra Agrawal, Nitin Saxena, and Shubham Sahai Srivastava. Integer Factoring Using Small Algebraic Dependencies. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 6:1-6:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{agrawal_et_al:LIPIcs.MFCS.2016.6, author = {Agrawal, Manindra and Saxena, Nitin and Srivastava, Shubham Sahai}, title = {{Integer Factoring Using Small Algebraic Dependencies}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {6:1--6:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.6}, URN = {urn:nbn:de:0030-drops-64234}, doi = {10.4230/LIPIcs.MFCS.2016.6}, annote = {Keywords: integer, factorization, factoring integers, algebraic dependence, dependencies} }
Saeed Akhoondian Amiri, Stephan Kreutzer, Dániel Marx, and Roman Rabinovich. Routing with Congestion in Acyclic Digraphs. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 7:1-7:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{amiri_et_al:LIPIcs.MFCS.2016.7, author = {Amiri, Saeed Akhoondian and Kreutzer, Stephan and Marx, D\'{a}niel and Rabinovich, Roman}, title = {{Routing with Congestion in Acyclic Digraphs}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {7:1--7:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.7}, URN = {urn:nbn:de:0030-drops-64244}, doi = {10.4230/LIPIcs.MFCS.2016.7}, annote = {Keywords: algorithms, disjoint paths, congestion, acyclic digraphs, XP, W\lbrack1\rbrack-hard} }
S. Akshay, Patricia Bouyer, Shankara Narayanan Krishna, Lakshmi Manasa, and Ashutosh Trivedi. Stochastic Timed Games Revisited. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 8:1-8:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{akshay_et_al:LIPIcs.MFCS.2016.8, author = {Akshay, S. and Bouyer, Patricia and Krishna, Shankara Narayanan and Manasa, Lakshmi and Trivedi, Ashutosh}, title = {{Stochastic Timed Games Revisited}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {8:1--8:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.8}, URN = {urn:nbn:de:0030-drops-64985}, doi = {10.4230/LIPIcs.MFCS.2016.8}, annote = {Keywords: timed automata, stochastic games, two-counter machines} }
Georgios Amanatidis, Evangelos Markakis, and Krzysztof Sornat. Inequity Aversion Pricing over Social Networks: Approximation Algorithms and Hardness Results. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 9:1-9:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{amanatidis_et_al:LIPIcs.MFCS.2016.9, author = {Amanatidis, Georgios and Markakis, Evangelos and Sornat, Krzysztof}, title = {{Inequity Aversion Pricing over Social Networks: Approximation Algorithms and Hardness Results}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {9:1--9:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.9}, URN = {urn:nbn:de:0030-drops-64254}, doi = {10.4230/LIPIcs.MFCS.2016.9}, annote = {Keywords: inequity aversion, social networks, revenue maximization} }
Vivek Anand T Kallampally and Raghunath Tewari. Trading Determinism for Time in Space Bounded Computations. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 10:1-10:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{kallampally_et_al:LIPIcs.MFCS.2016.10, author = {Kallampally, Vivek Anand T and Tewari, Raghunath}, title = {{Trading Determinism for Time in Space Bounded Computations}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {10:1--10:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.10}, URN = {urn:nbn:de:0030-drops-64268}, doi = {10.4230/LIPIcs.MFCS.2016.10}, annote = {Keywords: space complexity, unambiguous computations, Savitch's Theorem} }
Dana Angluin, Udi Boker, and Dana Fisman. Families of DFAs as Acceptors of omega-Regular Languages. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 11:1-11:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{angluin_et_al:LIPIcs.MFCS.2016.11, author = {Angluin, Dana and Boker, Udi and Fisman, Dana}, title = {{Families of DFAs as Acceptors of omega-Regular Languages}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {11:1--11:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.11}, URN = {urn:nbn:de:0030-drops-64274}, doi = {10.4230/LIPIcs.MFCS.2016.11}, annote = {Keywords: finite automata, omega regular languages} }
Itai Arad, Adam Bouland, Daniel Grier, Miklos Santha, Aarthi Sundaram, and Shengyu Zhang. On the Complexity of Probabilistic Trials for Hidden Satisfiability Problems. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 12:1-12:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{arad_et_al:LIPIcs.MFCS.2016.12, author = {Arad, Itai and Bouland, Adam and Grier, Daniel and Santha, Miklos and Sundaram, Aarthi and Zhang, Shengyu}, title = {{On the Complexity of Probabilistic Trials for Hidden Satisfiability Problems}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {12:1--12:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.12}, URN = {urn:nbn:de:0030-drops-64284}, doi = {10.4230/LIPIcs.MFCS.2016.12}, annote = {Keywords: computational complexity, satisfiability problems, trial and error, quantum computing, learning theory} }
Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Sebastian Kuhnert, and Gaurav Rattan. The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 13:1-13:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{arvind_et_al:LIPIcs.MFCS.2016.13, author = {Arvind, Vikraman and Fuhlbr\"{u}ck, Frank and K\"{o}bler, Johannes and Kuhnert, Sebastian and Rattan, Gaurav}, title = {{The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {13:1--13:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.13}, URN = {urn:nbn:de:0030-drops-64294}, doi = {10.4230/LIPIcs.MFCS.2016.13}, annote = {Keywords: parameterized complexity, graph automorphism, fixing number, base size, individualization} }
Martijn Baartse and Klaus Meer. Real Interactive Proofs for VPSPACE. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 14:1-14:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{baartse_et_al:LIPIcs.MFCS.2016.14, author = {Baartse, Martijn and Meer, Klaus}, title = {{Real Interactive Proofs for VPSPACE}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {14:1--14:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.14}, URN = {urn:nbn:de:0030-drops-64300}, doi = {10.4230/LIPIcs.MFCS.2016.14}, annote = {Keywords: interactive proofs, real number computation, Shamir's theorem} }
Parvaneh Babari, Karin Quaas, and Mahsa Shirmohammadi. Synchronizing Data Words for Register Automata. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 15:1-15:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{babari_et_al:LIPIcs.MFCS.2016.15, author = {Babari, Parvaneh and Quaas, Karin and Shirmohammadi, Mahsa}, title = {{Synchronizing Data Words for Register Automata}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {15:1--15:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.15}, URN = {urn:nbn:de:0030-drops-64996}, doi = {10.4230/LIPIcs.MFCS.2016.15}, annote = {Keywords: data words, register automata, synchronizing problem, Ackermann-completeness, bounded universality, regular-like expressions with squaring} }
Mitali Bafna, Satyanarayana V. Lokam, Sébastien Tavenas, and Ameya Velingker. On the Sensitivity Conjecture for Read-k Formulas. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 16:1-16:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{bafna_et_al:LIPIcs.MFCS.2016.16, author = {Bafna, Mitali and Lokam, Satyanarayana V. and Tavenas, S\'{e}bastien and Velingker, Ameya}, title = {{On the Sensitivity Conjecture for Read-k Formulas}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {16:1--16:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.16}, URN = {urn:nbn:de:0030-drops-64317}, doi = {10.4230/LIPIcs.MFCS.2016.16}, annote = {Keywords: sensitivity conjecture, read-k formulas, analysis of Boolean functions} }
Nikhil Balaji, Samir Datta, Raghav Kulkarni, and Supartha Podder. Graph Properties in Node-Query Setting: Effect of Breaking Symmetry. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 17:1-17:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{balaji_et_al:LIPIcs.MFCS.2016.17, author = {Balaji, Nikhil and Datta, Samir and Kulkarni, Raghav and Podder, Supartha}, title = {{Graph Properties in Node-Query Setting: Effect of Breaking Symmetry}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {17:1--17:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.17}, URN = {urn:nbn:de:0030-drops-64329}, doi = {10.4230/LIPIcs.MFCS.2016.17}, annote = {Keywords: query complexity, graph properties, symmetry and computation, forbidden subgraph} }
Volker Betz and Stéphane Le Roux. Stable States of Perturbed Markov Chains. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 18:1-18:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{betz_et_al:LIPIcs.MFCS.2016.18, author = {Betz, Volker and Le Roux, St\'{e}phane}, title = {{Stable States of Perturbed Markov Chains}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {18:1--18:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.18}, URN = {urn:nbn:de:0030-drops-64335}, doi = {10.4230/LIPIcs.MFCS.2016.18}, annote = {Keywords: evolution, metastability, tropical, shortest path, SCC, cubic time} }
Markus Bläser and Vladimir Lysikov. On Degeneration of Tensors and Algebras. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 19:1-19:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{blaser_et_al:LIPIcs.MFCS.2016.19, author = {Bl\"{a}ser, Markus and Lysikov, Vladimir}, title = {{On Degeneration of Tensors and Algebras}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {19:1--19:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.19}, URN = {urn:nbn:de:0030-drops-64343}, doi = {10.4230/LIPIcs.MFCS.2016.19}, annote = {Keywords: bilinear complexity, border rank, commutative algebras, lower bounds} }
Paul Bonsma and Daniël Paulusma. Using Contracted Solution Graphs for Solving Reconfiguration Problems. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 20:1-20:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{bonsma_et_al:LIPIcs.MFCS.2016.20, author = {Bonsma, Paul and Paulusma, Dani\"{e}l}, title = {{Using Contracted Solution Graphs for Solving Reconfiguration Problems}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {20:1--20:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.20}, URN = {urn:nbn:de:0030-drops-64351}, doi = {10.4230/LIPIcs.MFCS.2016.20}, annote = {Keywords: reconfiguration, contraction, dynamic programming, graph coloring} }
Alex B. Grilo, Iordanis Kerenidis, and Attila Pereszlényi. Pointer Quantum PCPs and Multi-Prover Games. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 21:1-21:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{grilo_et_al:LIPIcs.MFCS.2016.21, author = {Grilo, Alex B. and Kerenidis, Iordanis and Pereszl\'{e}nyi, Attila}, title = {{Pointer Quantum PCPs and Multi-Prover Games}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {21:1--21:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.21}, URN = {urn:nbn:de:0030-drops-64364}, doi = {10.4230/LIPIcs.MFCS.2016.21}, annote = {Keywords: computational complexity, quantum computation, PCP theorem} }
Paul Brunet and Damien Pous. A Formal Exploration of Nominal Kleene Algebra. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 22:1-22:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{brunet_et_al:LIPIcs.MFCS.2016.22, author = {Brunet, Paul and Pous, Damien}, title = {{A Formal Exploration of Nominal Kleene Algebra}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {22:1--22:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.22}, URN = {urn:nbn:de:0030-drops-64379}, doi = {10.4230/LIPIcs.MFCS.2016.22}, annote = {Keywords: Nominal sets, Kleene algebra, equational theory, Coq} }
Maurice Chandoo. On the Implicit Graph Conjecture. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 23:1-23:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{chandoo:LIPIcs.MFCS.2016.23, author = {Chandoo, Maurice}, title = {{On the Implicit Graph Conjecture}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {23:1--23:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.23}, URN = {urn:nbn:de:0030-drops-64389}, doi = {10.4230/LIPIcs.MFCS.2016.23}, annote = {Keywords: adjacency labeling scheme, complexity classes, diagonalization, logic} }
Krishnendu Chatterjee, Thomas A. Henzinger, and Jan Otop. Nested Weighted Limit-Average Automata of Bounded Width. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 24:1-24:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{chatterjee_et_al:LIPIcs.MFCS.2016.24, author = {Chatterjee, Krishnendu and Henzinger, Thomas A. and Otop, Jan}, title = {{Nested Weighted Limit-Average Automata of Bounded Width}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {24:1--24:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.24}, URN = {urn:nbn:de:0030-drops-64397}, doi = {10.4230/LIPIcs.MFCS.2016.24}, annote = {Keywords: weighted automata, nested weighted automata, complexity, mean-payoff} }
Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, and Veronika Loitzenbauer. Conditionally Optimal Algorithms for Generalized Büchi Games. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 25:1-25:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{chatterjee_et_al:LIPIcs.MFCS.2016.25, author = {Chatterjee, Krishnendu and Dvor\'{a}k, Wolfgang and Henzinger, Monika and Loitzenbauer, Veronika}, title = {{Conditionally Optimal Algorithms for Generalized B\"{u}chi Games}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {25:1--25:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.25}, URN = {urn:nbn:de:0030-drops-64403}, doi = {10.4230/LIPIcs.MFCS.2016.25}, annote = {Keywords: generalized B\"{u}chi objective, GR(1) objective, conditional lower bounds, graph games, graph algorithms, computer-aided verification} }
Dimitris Chatzidimitriou, Archontia C. Giannopoulou, Spyridon Maniatis, Clément Requilé, Dimitrios M. Thilikos, and Dimitris Zoros. FPT Algorithms for Plane Completion Problems. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 26:1-26:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{chatzidimitriou_et_al:LIPIcs.MFCS.2016.26, author = {Chatzidimitriou, Dimitris and Giannopoulou, Archontia C. and Maniatis, Spyridon and Requil\'{e}, Cl\'{e}ment and Thilikos, Dimitrios M. and Zoros, Dimitris}, title = {{FPT Algorithms for Plane Completion Problems}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {26:1--26:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.26}, URN = {urn:nbn:de:0030-drops-64418}, doi = {10.4230/LIPIcs.MFCS.2016.26}, annote = {Keywords: completion problems, FPT, plane graphs, topological isomorphism} }
Yijia Chen and Jörg Flum. Some Lower Bounds in Parameterized AC^0. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 27:1-27:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{chen_et_al:LIPIcs.MFCS.2016.27, author = {Chen, Yijia and Flum, J\"{o}rg}, title = {{Some Lower Bounds in Parameterized AC^0}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {27:1--27:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.27}, URN = {urn:nbn:de:0030-drops-64423}, doi = {10.4230/LIPIcs.MFCS.2016.27}, annote = {Keywords: parameterized AC^0, lower bound, clique, halting problem} }
Samir Datta, Raghav Kulkarni, and Anish Mukherjee. Space-Efficient Approximation Scheme for Maximum Matching in Sparse Graphs. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 28:1-28:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{datta_et_al:LIPIcs.MFCS.2016.28, author = {Datta, Samir and Kulkarni, Raghav and Mukherjee, Anish}, title = {{Space-Efficient Approximation Scheme for Maximum Matching in Sparse Graphs}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {28:1--28:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.28}, URN = {urn:nbn:de:0030-drops-64436}, doi = {10.4230/LIPIcs.MFCS.2016.28}, annote = {Keywords: maximum matching, approximation scheme, logspace, planar graphs} }
Matias David Lee and Erik P. de Vink. Logical Characterization of Bisimulation for Transition Relations over Probability Distributions with Internal Actions. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 29:1-29:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{lee_et_al:LIPIcs.MFCS.2016.29, author = {Lee, Matias David and de Vink, Erik P.}, title = {{Logical Characterization of Bisimulation for Transition Relations over Probability Distributions with Internal Actions}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {29:1--29:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.29}, URN = {urn:nbn:de:0030-drops-64441}, doi = {10.4230/LIPIcs.MFCS.2016.29}, annote = {Keywords: probabilistic transition systems, weak bisimulations, logical characterization, transition relation over distributions, modal logics} }
Will Dison, Eduard Einstein, and Timothy R. Riley. Ackermannian Integer Compression and the Word Problem for Hydra Groups. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 30:1-30:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{dison_et_al:LIPIcs.MFCS.2016.30, author = {Dison, Will and Einstein, Eduard and Riley, Timothy R.}, title = {{Ackermannian Integer Compression and the Word Problem for Hydra Groups}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {30:1--30:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.30}, URN = {urn:nbn:de:0030-drops-64458}, doi = {10.4230/LIPIcs.MFCS.2016.30}, annote = {Keywords: Ackermann functions, hydra, word problem} }
Peter Dixon, Debasis Mandal, A. Pavan, and N. V. Vinodchandran. A Note on the Advice Complexity of Multipass Randomized Logspace. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 31:1-31:7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{dixon_et_al:LIPIcs.MFCS.2016.31, author = {Dixon, Peter and Mandal, Debasis and Pavan, A. and Vinodchandran, N. V.}, title = {{A Note on the Advice Complexity of Multipass Randomized Logspace}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {31:1--31:7}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.31}, URN = {urn:nbn:de:0030-drops-65003}, doi = {10.4230/LIPIcs.MFCS.2016.31}, annote = {Keywords: space-bounded computations, randomized machines, advice} }
Titus Dose. Complexity of Constraint Satisfaction Problems over Finite Subsets of Natural Numbers. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 32:1-32:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{dose:LIPIcs.MFCS.2016.32, author = {Dose, Titus}, title = {{Complexity of Constraint Satisfaction Problems over Finite Subsets of Natural Numbers}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {32:1--32:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.32}, URN = {urn:nbn:de:0030-drops-64461}, doi = {10.4230/LIPIcs.MFCS.2016.32}, annote = {Keywords: computational complexity, constraint satisfaction problems, integer expressions and circuits} }
Andre Droschinsky, Nils M. Kriege, and Petra Mutzel. Faster Algorithms for the Maximum Common Subtree Isomorphism Problem. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 33:1-33:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{droschinsky_et_al:LIPIcs.MFCS.2016.33, author = {Droschinsky, Andre and Kriege, Nils M. and Mutzel, Petra}, title = {{Faster Algorithms for the Maximum Common Subtree Isomorphism Problem}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {33:1--33:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.33}, URN = {urn:nbn:de:0030-drops-64475}, doi = {10.4230/LIPIcs.MFCS.2016.33}, annote = {Keywords: MCS, maximum common subtree, enumeration algorithms, maximum weight bipartite matchings} }
Eduard Eiben, Robert Ganian, and O-joung Kwon. A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 34:1-34:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{eiben_et_al:LIPIcs.MFCS.2016.34, author = {Eiben, Eduard and Ganian, Robert and Kwon, O-joung}, title = {{A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {34:1--34:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.34}, URN = {urn:nbn:de:0030-drops-64483}, doi = {10.4230/LIPIcs.MFCS.2016.34}, annote = {Keywords: distance-hereditary graphs, fixed-parameter algorithms, rank-width} }
Stefan Fafianie, Eva-Maria C. Hols, Stefan Kratsch, and Vuong Anh Quyen. Preprocessing Under Uncertainty: Matroid Intersection. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 35:1-35:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{fafianie_et_al:LIPIcs.MFCS.2016.35, author = {Fafianie, Stefan and Hols, Eva-Maria C. and Kratsch, Stefan and Quyen, Vuong Anh}, title = {{Preprocessing Under Uncertainty: Matroid Intersection}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {35:1--35:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.35}, URN = {urn:nbn:de:0030-drops-64490}, doi = {10.4230/LIPIcs.MFCS.2016.35}, annote = {Keywords: preprocessing, uncertainty, maximum flow, matroid intersection} }
Angelo Fanelli and Greco Gianluigi. Ride Sharing with a Vehicle of Unlimited Capacity. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 36:1-36:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{fanelli_et_al:LIPIcs.MFCS.2016.36, author = {Fanelli, Angelo and Gianluigi, Greco}, title = {{Ride Sharing with a Vehicle of Unlimited Capacity}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {36:1--36:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.36}, URN = {urn:nbn:de:0030-drops-64506}, doi = {10.4230/LIPIcs.MFCS.2016.36}, annote = {Keywords: vehicle routing, ride sharing, pick up and delivery problem} }
Chenglin Fan, Omrit Filtser, Matthew J. Katz, and Binhai Zhu. On the General Chain Pair Simplification Problem. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 37:1-37:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{fan_et_al:LIPIcs.MFCS.2016.37, author = {Fan, Chenglin and Filtser, Omrit and Katz, Matthew J. and Zhu, Binhai}, title = {{On the General Chain Pair Simplification Problem}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {37:1--37:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.37}, URN = {urn:nbn:de:0030-drops-64510}, doi = {10.4230/LIPIcs.MFCS.2016.37}, annote = {Keywords: chain simplification, discrete Frechet distance, dynamic programming, geometric arrangements, protein structural resemblance} }
Yuta Fujishige, Yuki Tsujimaru, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda. Computing DAWGs and Minimal Absent Words in Linear Time for Integer Alphabets. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 38:1-38:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{fujishige_et_al:LIPIcs.MFCS.2016.38, author = {Fujishige, Yuta and Tsujimaru, Yuki and Inenaga, Shunsuke and Bannai, Hideo and Takeda, Masayuki}, title = {{Computing DAWGs and Minimal Absent Words in Linear Time for Integer Alphabets}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {38:1--38:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.38}, URN = {urn:nbn:de:0030-drops-64528}, doi = {10.4230/LIPIcs.MFCS.2016.38}, annote = {Keywords: string algorithms, DAWGs, suffix trees, minimal absent words} }
Peter Fulla and Stanislav Zivny. On Planar Valued CSPs. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 39:1-39:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{fulla_et_al:LIPIcs.MFCS.2016.39, author = {Fulla, Peter and Zivny, Stanislav}, title = {{On Planar Valued CSPs}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {39:1--39:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.39}, URN = {urn:nbn:de:0030-drops-64537}, doi = {10.4230/LIPIcs.MFCS.2016.39}, annote = {Keywords: constraint satisfaction, valued constraint satisfaction, planarity, polymorphisms, multimorphisms} }
Guilhem Gamard and Gwenaël Richomme. Determining Sets of Quasiperiods of Infinite Words. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 40:1-40:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{gamard_et_al:LIPIcs.MFCS.2016.40, author = {Gamard, Guilhem and Richomme, Gwena\"{e}l}, title = {{Determining Sets of Quasiperiods of Infinite Words}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {40:1--40:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.40}, URN = {urn:nbn:de:0030-drops-64540}, doi = {10.4230/LIPIcs.MFCS.2016.40}, annote = {Keywords: combinatorics on Words, quasiperiodicity, Sturmian words} }
Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, and M. S. Ramanujan. On the Complexity Landscape of Connected f-Factor Problems. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 41:1-41:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{ganian_et_al:LIPIcs.MFCS.2016.41, author = {Ganian, Robert and Narayanaswamy, N. S. and Ordyniak, Sebastian and Rahul, C. S. and Ramanujan, M. S.}, title = {{On the Complexity Landscape of Connected f-Factor Problems}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {41:1--41:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.41}, URN = {urn:nbn:de:0030-drops-65013}, doi = {10.4230/LIPIcs.MFCS.2016.41}, annote = {Keywords: f-factors, connected f-factors, quasi-polynomial time algorithms, randomized algorithms} }
Robert Ganian, Ronald de Haan, Iyad Kanj, and Stefan Szeider. On Existential MSO and its Relation to ETH. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 42:1-42:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{ganian_et_al:LIPIcs.MFCS.2016.42, author = {Ganian, Robert and de Haan, Ronald and Kanj, Iyad and Szeider, Stefan}, title = {{On Existential MSO and its Relation to ETH}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {42:1--42:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.42}, URN = {urn:nbn:de:0030-drops-64556}, doi = {10.4230/LIPIcs.MFCS.2016.42}, annote = {Keywords: exponential time hypothesis (ETH), monadic second order logic, subexponential time complexity, serf-reducibility, logic games} }
Cody Geary, Pierre-Etienne Meunier, Nicolas Schabanel, and Shinnosuke Seki. Programming Biomolecules That Fold Greedily During Transcription. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 43:1-43:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{geary_et_al:LIPIcs.MFCS.2016.43, author = {Geary, Cody and Meunier, Pierre-Etienne and Schabanel, Nicolas and Seki, Shinnosuke}, title = {{Programming Biomolecules That Fold Greedily During Transcription}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {43:1--43:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.43}, URN = {urn:nbn:de:0030-drops-64567}, doi = {10.4230/LIPIcs.MFCS.2016.43}, annote = {Keywords: natural computing, self-assembly, molecular folding} }
Thibault Godin and Ines Klimann. Connected Reversible Mealy Automata of Prime Size Cannot Generate Infinite Burnside Groups. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 44:1-44:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{godin_et_al:LIPIcs.MFCS.2016.44, author = {Godin, Thibault and Klimann, Ines}, title = {{Connected Reversible Mealy Automata of Prime Size Cannot Generate Infinite Burnside Groups}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {44:1--44:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.44}, URN = {urn:nbn:de:0030-drops-64570}, doi = {10.4230/LIPIcs.MFCS.2016.44}, annote = {Keywords: Burnside problem, automaton groups, reversibility, orbit trees} }
Alexander Golovnev, Alexander S. Kulikov, Alexander V. Smal, and Suguru Tamaki. Circuit Size Lower Bounds and #SAT Upper Bounds Through a General Framework. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 45:1-45:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{golovnev_et_al:LIPIcs.MFCS.2016.45, author = {Golovnev, Alexander and Kulikov, Alexander S. and Smal, Alexander V. and Tamaki, Suguru}, title = {{Circuit Size Lower Bounds and #SAT Upper Bounds Through a General Framework}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {45:1--45:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.45}, URN = {urn:nbn:de:0030-drops-64588}, doi = {10.4230/LIPIcs.MFCS.2016.45}, annote = {Keywords: circuit complexity, lower bounds, exponential time algorithms, satisfiability} }
Alexander Golovnev, Edward A. Hirsch, Alexander Knop, and Alexander S. Kulikov. On the Limits of Gate Elimination. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 46:1-46:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{golovnev_et_al:LIPIcs.MFCS.2016.46, author = {Golovnev, Alexander and Hirsch, Edward A. and Knop, Alexander and Kulikov, Alexander S.}, title = {{On the Limits of Gate Elimination}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {46:1--46:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.46}, URN = {urn:nbn:de:0030-drops-64593}, doi = {10.4230/LIPIcs.MFCS.2016.46}, annote = {Keywords: circuit complexity, lower bounds, gate elimination} }
Zeyu Guo, Anand Kumar Narayanan, and Chris Umans. Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 47:1-47:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{guo_et_al:LIPIcs.MFCS.2016.47, author = {Guo, Zeyu and Narayanan, Anand Kumar and Umans, Chris}, title = {{Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {47:1--47:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.47}, URN = {urn:nbn:de:0030-drops-64609}, doi = {10.4230/LIPIcs.MFCS.2016.47}, annote = {Keywords: algorithms, complexity, finite fields, polynomials, factorization} }
Vladimir V. Gusev and Elena V. Pribavkina. On Synchronizing Colorings and the Eigenvectors of Digraphs. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 48:1-48:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{gusev_et_al:LIPIcs.MFCS.2016.48, author = {Gusev, Vladimir V. and Pribavkina, Elena V.}, title = {{On Synchronizing Colorings and the Eigenvectors of Digraphs}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {48:1--48:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.48}, URN = {urn:nbn:de:0030-drops-64611}, doi = {10.4230/LIPIcs.MFCS.2016.48}, annote = {Keywords: the road coloring problem, synchronizing automata, edge-colorings of digraphs, Perron-Frobenius eigenvector, primitive digraphs} }
Tobias Harks, Britta Peis, Daniel Schmand, and Laura Vargas Koch. Competitive Packet Routing with Priority Lists. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 49:1-49:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{harks_et_al:LIPIcs.MFCS.2016.49, author = {Harks, Tobias and Peis, Britta and Schmand, Daniel and Vargas Koch, Laura}, title = {{Competitive Packet Routing with Priority Lists}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {49:1--49:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.49}, URN = {urn:nbn:de:0030-drops-64622}, doi = {10.4230/LIPIcs.MFCS.2016.49}, annote = {Keywords: packet routing, Nash equilibrium, price of anarchy, priority policy, complexity} }
Irving van Heuven van Staereling, Bart de Keijzer, and Guido Schäfer. The Ground-Set-Cost Budgeted Maximum Coverage Problem. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 50:1-50:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{vanheuvenvanstaereling_et_al:LIPIcs.MFCS.2016.50, author = {van Heuven van Staereling, Irving and de Keijzer, Bart and Sch\"{a}fer, Guido}, title = {{The Ground-Set-Cost Budgeted Maximum Coverage Problem}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {50:1--50:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.50}, URN = {urn:nbn:de:0030-drops-65020}, doi = {10.4230/LIPIcs.MFCS.2016.50}, annote = {Keywords: maximum coverage problem, approximation algorithms, hypergraphs, submodular optimization, sponsored search} }
Dmitry Itsykson, Alexander Okhotin, and Vsevolod Oparin. Computational and Proof Complexity of Partial String Avoidability. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 51:1-51:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{itsykson_et_al:LIPIcs.MFCS.2016.51, author = {Itsykson, Dmitry and Okhotin, Alexander and Oparin, Vsevolod}, title = {{Computational and Proof Complexity of Partial String Avoidability}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {51:1--51:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.51}, URN = {urn:nbn:de:0030-drops-64637}, doi = {10.4230/LIPIcs.MFCS.2016.51}, annote = {Keywords: partial strings, partial words, avoidability, proof complexity, PSPACE-completeness} }
Petr Jancar. Deciding Semantic Finiteness of Pushdown Processes and First-Order Grammars w.r.t. Bisimulation Equivalence. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 52:1-52:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{jancar:LIPIcs.MFCS.2016.52, author = {Jancar, Petr}, title = {{Deciding Semantic Finiteness of Pushdown Processes and First-Order Grammars w.r.t. Bisimulation Equivalence}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {52:1--52:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.52}, URN = {urn:nbn:de:0030-drops-64649}, doi = {10.4230/LIPIcs.MFCS.2016.52}, annote = {Keywords: pushdown processes, first-order grammars, bisimulation, regularity} }
Jesper Jansson and Wing-Kin Sung. Minimal Phylogenetic Supertrees and Local Consensus Trees. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 53:1-53:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{jansson_et_al:LIPIcs.MFCS.2016.53, author = {Jansson, Jesper and Sung, Wing-Kin}, title = {{Minimal Phylogenetic Supertrees and Local Consensus Trees}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {53:1--53:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.53}, URN = {urn:nbn:de:0030-drops-64653}, doi = {10.4230/LIPIcs.MFCS.2016.53}, annote = {Keywords: phylogenetic tree, rooted triplet, local consensus, minimal supertree, computational complexity, bioinformatics} }
Stacey Jeffery and François Le Gall. Quantum Communication Complexity of Distributed Set Joins. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 54:1-54:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{jeffery_et_al:LIPIcs.MFCS.2016.54, author = {Jeffery, Stacey and Le Gall, Fran\c{c}ois}, title = {{Quantum Communication Complexity of Distributed Set Joins}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {54:1--54:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.54}, URN = {urn:nbn:de:0030-drops-64663}, doi = {10.4230/LIPIcs.MFCS.2016.54}, annote = {Keywords: quantum communication complexity, distributed quantum computing, database joins} }
Dominik Kaaser, Frederik Mallmann-Trenn, and Emanuele Natale. On the Voting Time of the Deterministic Majority Process. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 55:1-55:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{kaaser_et_al:LIPIcs.MFCS.2016.55, author = {Kaaser, Dominik and Mallmann-Trenn, Frederik and Natale, Emanuele}, title = {{On the Voting Time of the Deterministic Majority Process}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {55:1--55:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.55}, URN = {urn:nbn:de:0030-drops-64675}, doi = {10.4230/LIPIcs.MFCS.2016.55}, annote = {Keywords: distributed voting, majority rule} }
Frank Kammer, Dieter Kratsch, and Moritz Laudahn. Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 56:1-56:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{kammer_et_al:LIPIcs.MFCS.2016.56, author = {Kammer, Frank and Kratsch, Dieter and Laudahn, Moritz}, title = {{Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {56:1--56:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.56}, URN = {urn:nbn:de:0030-drops-64683}, doi = {10.4230/LIPIcs.MFCS.2016.56}, annote = {Keywords: graph algorithms, space efficiency, cut vertices, maximal outerplanar graphs} }
Iordanis Kerenidis, Adi Rosén, and Florent Urrutia. Multi-Party Protocols, Information Complexity and Privacy. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 57:1-57:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{kerenidis_et_al:LIPIcs.MFCS.2016.57, author = {Kerenidis, Iordanis and Ros\'{e}n, Adi and Urrutia, Florent}, title = {{Multi-Party Protocols, Information Complexity and Privacy}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {57:1--57:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.57}, URN = {urn:nbn:de:0030-drops-64696}, doi = {10.4230/LIPIcs.MFCS.2016.57}, annote = {Keywords: multi-party protocols, information theory, communication complexity, multi-party private computation (MPC), randomness} }
Takayuki Kihara and Arno Pauly. Dividing by Zero - How Bad Is It, Really?. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 58:1-58:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{kihara_et_al:LIPIcs.MFCS.2016.58, author = {Kihara, Takayuki and Pauly, Arno}, title = {{Dividing by Zero - How Bad Is It, Really?}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {58:1--58:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.58}, URN = {urn:nbn:de:0030-drops-64702}, doi = {10.4230/LIPIcs.MFCS.2016.58}, annote = {Keywords: computable analysis, Weihrauch reducibility, recursion theory, linear algebra} }
Dennis Komm, Rastislav Královic, Richard Královic, and Christian Kudahl. Advice Complexity of the Online Induced Subgraph Problem. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 59:1-59:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{komm_et_al:LIPIcs.MFCS.2016.59, author = {Komm, Dennis and Kr\'{a}lovic, Rastislav and Kr\'{a}lovic, Richard and Kudahl, Christian}, title = {{Advice Complexity of the Online Induced Subgraph Problem}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {59:1--59:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.59}, URN = {urn:nbn:de:0030-drops-64713}, doi = {10.4230/LIPIcs.MFCS.2016.59}, annote = {Keywords: online algorithms, advice complexity, induced subgraph problem} }
Juha Kontinen, Antti Kuusisto, and Jonni Virtema. Decidability of Predicate Logics with Team Semantics. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 60:1-60:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{kontinen_et_al:LIPIcs.MFCS.2016.60, author = {Kontinen, Juha and Kuusisto, Antti and Virtema, Jonni}, title = {{Decidability of Predicate Logics with Team Semantics}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {60:1--60:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.60}, URN = {urn:nbn:de:0030-drops-64726}, doi = {10.4230/LIPIcs.MFCS.2016.60}, annote = {Keywords: team semantics, dependence logic, complexity, two-variable logic} }
Markus Krötzsch, Tomás Masopust, and Michaël Thomazo. On the Complexity of Universality for Partially Ordered NFAs. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 61:1-61:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{krotzsch_et_al:LIPIcs.MFCS.2016.61, author = {Kr\"{o}tzsch, Markus and Masopust, Tom\'{a}s and Thomazo, Micha\"{e}l}, title = {{On the Complexity of Universality for Partially Ordered NFAs}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {61:1--61:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.61}, URN = {urn:nbn:de:0030-drops-64738}, doi = {10.4230/LIPIcs.MFCS.2016.61}, annote = {Keywords: automata, nondeterminism, partial order, universality} }
Orna Kupferman and Gal Vardi. Eulerian Paths with Regular Constraints. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 62:1-62:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{kupferman_et_al:LIPIcs.MFCS.2016.62, author = {Kupferman, Orna and Vardi, Gal}, title = {{Eulerian Paths with Regular Constraints}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {62:1--62:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.62}, URN = {urn:nbn:de:0030-drops-64747}, doi = {10.4230/LIPIcs.MFCS.2016.62}, annote = {Keywords: Eulerian paths, regular languages} }
Nadia Labai and Johann A. Makowsky. On the Exact Learnability of Graph Parameters: The Case of Partition Functions. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 63:1-63:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{labai_et_al:LIPIcs.MFCS.2016.63, author = {Labai, Nadia and Makowsky, Johann A.}, title = {{On the Exact Learnability of Graph Parameters: The Case of Partition Functions}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {63:1--63:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.63}, URN = {urn:nbn:de:0030-drops-64750}, doi = {10.4230/LIPIcs.MFCS.2016.63}, annote = {Keywords: exact learning, partition function, weighted homomorphism, connection matrices} }
Victor Lagerkvist and Biman Roy. A Preliminary Investigation of Satisfiability Problems Not Harder than 1-in-3-SAT. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 64:1-64:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{lagerkvist_et_al:LIPIcs.MFCS.2016.64, author = {Lagerkvist, Victor and Roy, Biman}, title = {{A Preliminary Investigation of Satisfiability Problems Not Harder than 1-in-3-SAT}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {64:1--64:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.64}, URN = {urn:nbn:de:0030-drops-64769}, doi = {10.4230/LIPIcs.MFCS.2016.64}, annote = {Keywords: clone theory, universal algebra, satisfiability problems} }
Christof Löding and Sarah Winter. Uniformization Problems for Tree-Automatic Relations and Top-Down Tree Transducers. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 65:1-65:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{loding_et_al:LIPIcs.MFCS.2016.65, author = {L\"{o}ding, Christof and Winter, Sarah}, title = {{Uniformization Problems for Tree-Automatic Relations and Top-Down Tree Transducers}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {65:1--65:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.65}, URN = {urn:nbn:de:0030-drops-64771}, doi = {10.4230/LIPIcs.MFCS.2016.65}, annote = {Keywords: tree transducers, tree automatic relation, uniformization} }
Amaldev Manuel and A. V. Sreejith. Two-Variable Logic over Countable Linear Orderings. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 66:1-66:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{manuel_et_al:LIPIcs.MFCS.2016.66, author = {Manuel, Amaldev and Sreejith, A. V.}, title = {{Two-Variable Logic over Countable Linear Orderings}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {66:1--66:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.66}, URN = {urn:nbn:de:0030-drops-64788}, doi = {10.4230/LIPIcs.MFCS.2016.66}, annote = {Keywords: circ-monoids, countable linear orderings, FO^2} }
Tomás Masopust. Piecewise Testable Languages and Nondeterministic Automata. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 67:1-67:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{masopust:LIPIcs.MFCS.2016.67, author = {Masopust, Tom\'{a}s}, title = {{Piecewise Testable Languages and Nondeterministic Automata}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {67:1--67:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.67}, URN = {urn:nbn:de:0030-drops-64799}, doi = {10.4230/LIPIcs.MFCS.2016.67}, annote = {Keywords: automata, logics, languages, k-piecewise testability, nondeterminism} }
George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, and Paul G. Spirakis. Stably Computing Order Statistics with Arithmetic Population Protocols. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 68:1-68:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{mertzios_et_al:LIPIcs.MFCS.2016.68, author = {Mertzios, George B. and Nikoletseas, Sotiris E. and Raptopoulos, Christoforos L. and Spirakis, Paul G.}, title = {{Stably Computing Order Statistics with Arithmetic Population Protocols}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {68:1--68:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.68}, URN = {urn:nbn:de:0030-drops-64805}, doi = {10.4230/LIPIcs.MFCS.2016.68}, annote = {Keywords: arithmetic population protocols, order statistics, median, k-minimum element} }
Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda. Shortest Unique Substring Queries on Run-Length Encoded Strings. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 69:1-69:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{mieno_et_al:LIPIcs.MFCS.2016.69, author = {Mieno, Takuya and Inenaga, Shunsuke and Bannai, Hideo and Takeda, Masayuki}, title = {{Shortest Unique Substring Queries on Run-Length Encoded Strings}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {69:1--69:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.69}, URN = {urn:nbn:de:0030-drops-65033}, doi = {10.4230/LIPIcs.MFCS.2016.69}, annote = {Keywords: string algorithms, shortest unique substring, run-length encoding} }
Shay Moran and Cyrus Rashtchian. Shattered Sets and the Hilbert Function. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 70:1-70:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{moran_et_al:LIPIcs.MFCS.2016.70, author = {Moran, Shay and Rashtchian, Cyrus}, title = {{Shattered Sets and the Hilbert Function}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {70:1--70:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.70}, URN = {urn:nbn:de:0030-drops-64814}, doi = {10.4230/LIPIcs.MFCS.2016.70}, annote = {Keywords: VC dimension, shattered sets, sandwich theorem, Hilbert function, polynomial method, linear programming, Chvatal's conjecture, downward-closed sets} }
Bart M. P. Jansen and Astrid Pieterse. Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 71:1-71:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{jansen_et_al:LIPIcs.MFCS.2016.71, author = {Jansen, Bart M. P. and Pieterse, Astrid}, title = {{Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {71:1--71:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.71}, URN = {urn:nbn:de:0030-drops-64821}, doi = {10.4230/LIPIcs.MFCS.2016.71}, annote = {Keywords: constraint satisfaction problem, sparsification, satisfiability, kernelization} }
Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda. Fully Dynamic Data Structure for LCE Queries in Compressed Space. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 72:1-72:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{nishimoto_et_al:LIPIcs.MFCS.2016.72, author = {Nishimoto, Takaaki and I, Tomohiro and Inenaga, Shunsuke and Bannai, Hideo and Takeda, Masayuki}, title = {{Fully Dynamic Data Structure for LCE Queries in Compressed Space}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {72:1--72:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.72}, URN = {urn:nbn:de:0030-drops-65045}, doi = {10.4230/LIPIcs.MFCS.2016.72}, annote = {Keywords: dynamic texts, longest common extension (LCE) queries, straight-line program} }
Reino Niskanen, Igor Potapov, and Julien Reichert. Undecidability of Two-dimensional Robot Games. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 73:1-73:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{niskanen_et_al:LIPIcs.MFCS.2016.73, author = {Niskanen, Reino and Potapov, Igor and Reichert, Julien}, title = {{Undecidability of Two-dimensional Robot Games}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {73:1--73:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.73}, URN = {urn:nbn:de:0030-drops-64839}, doi = {10.4230/LIPIcs.MFCS.2016.73}, annote = {Keywords: reachability games, vector addition game, decidability, winning strategy} }
Anurag Pandey, Nitin Saxena, and Amit Sinhababu. Algebraic Independence over Positive Characteristic: New Criterion and Applications to Locally Low Algebraic Rank Circuits. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 74:1-74:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{pandey_et_al:LIPIcs.MFCS.2016.74, author = {Pandey, Anurag and Saxena, Nitin and Sinhababu, Amit}, title = {{Algebraic Independence over Positive Characteristic: New Criterion and Applications to Locally Low Algebraic Rank Circuits}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {74:1--74:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.74}, URN = {urn:nbn:de:0030-drops-65057}, doi = {10.4230/LIPIcs.MFCS.2016.74}, annote = {Keywords: independence, transcendence, finite field, Hasse-Schmidt, Jacobian, differential, inseparable, circuit, identity testing, lower bound, depth-4, shifte} }
Sudeshna Kolay, Fahad Panolan, Venkatesh Raman, and Saket Saurabh. Parameterized Algorithms on Perfect Graphs for Deletion to (r,l)-Graphs. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 75:1-75:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{kolay_et_al:LIPIcs.MFCS.2016.75, author = {Kolay, Sudeshna and Panolan, Fahad and Raman, Venkatesh and Saurabh, Saket}, title = {{Parameterized Algorithms on Perfect Graphs for Deletion to (r,l)-Graphs}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {75:1--75:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.75}, URN = {urn:nbn:de:0030-drops-64846}, doi = {10.4230/LIPIcs.MFCS.2016.75}, annote = {Keywords: graph deletion, FPT algorithms, polynomial kernels} }
Simon Perdrix and Quanlong Wang. Supplementarity is Necessary for Quantum Diagram Reasoning. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 76:1-76:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{perdrix_et_al:LIPIcs.MFCS.2016.76, author = {Perdrix, Simon and Wang, Quanlong}, title = {{Supplementarity is Necessary for Quantum Diagram Reasoning}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {76:1--76:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.76}, URN = {urn:nbn:de:0030-drops-65062}, doi = {10.4230/LIPIcs.MFCS.2016.76}, annote = {Keywords: quantum diagram reasoning, completeness, ZX-calculus, quantum computing, categorical quantum mechanics} }
Thomas Place and Marc Zeitoun. The Covering Problem: A Unified Approach for Investigating the Expressive Power of Logics. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 77:1-77:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{place_et_al:LIPIcs.MFCS.2016.77, author = {Place, Thomas and Zeitoun, Marc}, title = {{The Covering Problem: A Unified Approach for Investigating the Expressive Power of Logics}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {77:1--77:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.77}, URN = {urn:nbn:de:0030-drops-64857}, doi = {10.4230/LIPIcs.MFCS.2016.77}, annote = {Keywords: membership problem, separation problem, covering problem, regular languages, logics, decidable characterizations} }
Marcin Przybylko and Michal Skrzypczak. On the Complexity of Branching Games with Regular Conditions. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 78:1-78:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{przybylko_et_al:LIPIcs.MFCS.2016.78, author = {Przybylko, Marcin and Skrzypczak, Michal}, title = {{On the Complexity of Branching Games with Regular Conditions}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {78:1--78:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.78}, URN = {urn:nbn:de:0030-drops-64865}, doi = {10.4230/LIPIcs.MFCS.2016.78}, annote = {Keywords: stochastic games, meta-parity games, infinite trees, regular languages, parity automata} }
Paola Quaglia. Symbolic Lookaheads for Bottom-up Parsing. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 79:1-79:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{quaglia:LIPIcs.MFCS.2016.79, author = {Quaglia, Paola}, title = {{Symbolic Lookaheads for Bottom-up Parsing}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {79:1--79:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.79}, URN = {urn:nbn:de:0030-drops-64876}, doi = {10.4230/LIPIcs.MFCS.2016.79}, annote = {Keywords: LALR(1) grammars; LR(1) grammars; bottom-up parsing} }
Anja Rey and Jörg Rothe. Structural Control in Weighted Voting Games. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 80:1-80:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{rey_et_al:LIPIcs.MFCS.2016.80, author = {Rey, Anja and Rothe, J\"{o}rg}, title = {{Structural Control in Weighted Voting Games}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {80:1--80:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.80}, URN = {urn:nbn:de:0030-drops-64883}, doi = {10.4230/LIPIcs.MFCS.2016.80}, annote = {Keywords: algorithmic games theory, weighted voting games, structural control, power indices, computational complexity} }
Matthieu Rosenfeld. Every Binary Pattern of Length Greater Than 14 Is Abelian-2-Avoidable. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 81:1-81:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{rosenfeld:LIPIcs.MFCS.2016.81, author = {Rosenfeld, Matthieu}, title = {{Every Binary Pattern of Length Greater Than 14 Is Abelian-2-Avoidable}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {81:1--81:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.81}, URN = {urn:nbn:de:0030-drops-64892}, doi = {10.4230/LIPIcs.MFCS.2016.81}, annote = {Keywords: combinatorics on words, pattern avoidance, abelian repetitions} }
Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, and Junichi Teruyama. Bounded Depth Circuits with Weighted Symmetric Gates: Satisfiability, Lower Bounds and Compression. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 82:1-82:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{sakai_et_al:LIPIcs.MFCS.2016.82, author = {Sakai, Takayuki and Seto, Kazuhisa and Tamaki, Suguru and Teruyama, Junichi}, title = {{Bounded Depth Circuits with Weighted Symmetric Gates: Satisfiability, Lower Bounds and Compression}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {82:1--82:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.82}, URN = {urn:nbn:de:0030-drops-64905}, doi = {10.4230/LIPIcs.MFCS.2016.82}, annote = {Keywords: exponential time algorithm, circuit complexity, circuit minimization, maximum satisfiability} }
Martin Schuster. Transducer-Based Rewriting Games for Active XML. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 83:1-83:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{schuster:LIPIcs.MFCS.2016.83, author = {Schuster, Martin}, title = {{Transducer-Based Rewriting Games for Active XML}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {83:1--83:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.83}, URN = {urn:nbn:de:0030-drops-64910}, doi = {10.4230/LIPIcs.MFCS.2016.83}, annote = {Keywords: active XML, computational complexity, nested words, transducers, rewriting games} }
Igor Potapov and Pavel Semukhin. Vector Reachability Problem in SL(2, Z). In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 84:1-84:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{potapov_et_al:LIPIcs.MFCS.2016.84, author = {Potapov, Igor and Semukhin, Pavel}, title = {{Vector Reachability Problem in SL(2, Z)}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {84:1--84:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.84}, URN = {urn:nbn:de:0030-drops-64925}, doi = {10.4230/LIPIcs.MFCS.2016.84}, annote = {Keywords: matrix semigroup, vector reachability problem, special linear group, linear fractional transformation, automata and formal languages} }
Stephan Kreutzer, Michal Pilipczuk, Roman Rabinovich, and Sebastian Siebertz. The Generalised Colouring Numbers on Classes of Bounded Expansion. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 85:1-85:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{kreutzer_et_al:LIPIcs.MFCS.2016.85, author = {Kreutzer, Stephan and Pilipczuk, Michal and Rabinovich, Roman and Siebertz, Sebastian}, title = {{The Generalised Colouring Numbers on Classes of Bounded Expansion}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {85:1--85:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.85}, URN = {urn:nbn:de:0030-drops-64937}, doi = {10.4230/LIPIcs.MFCS.2016.85}, annote = {Keywords: graph structure theory, nowhere dense graphs, generalised colouring numbers, splitter game, first-order model-checking} }
Xiang Huang and Donald M. Stull. Polynomial Space Randomness in Analysis. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 86:1-86:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{huang_et_al:LIPIcs.MFCS.2016.86, author = {Huang, Xiang and Stull, Donald M.}, title = {{Polynomial Space Randomness in Analysis}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {86:1--86:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.86}, URN = {urn:nbn:de:0030-drops-64943}, doi = {10.4230/LIPIcs.MFCS.2016.86}, annote = {Keywords: algorithmic randomness, computable analysis, resource-bounded randomness, complexity theory} }
Kenjiro Takazawa. Finding a Maximum 2-Matching Excluding Prescribed Cycles in Bipartite Graphs. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 87:1-87:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{takazawa:LIPIcs.MFCS.2016.87, author = {Takazawa, Kenjiro}, title = {{Finding a Maximum 2-Matching Excluding Prescribed Cycles in Bipartite Graphs}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {87:1--87:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.87}, URN = {urn:nbn:de:0030-drops-64950}, doi = {10.4230/LIPIcs.MFCS.2016.87}, annote = {Keywords: optimization algorithms, matching theory, traveling salesman problem, restricted 2-matchings, Hamilton-laceable graphs} }
Christof Löding and Andreas Tollkötter. Transformation Between Regular Expressions and omega-Automata. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 88:1-88:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{loding_et_al:LIPIcs.MFCS.2016.88, author = {L\"{o}ding, Christof and Tollk\"{o}tter, Andreas}, title = {{Transformation Between Regular Expressions and omega-Automata}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {88:1--88:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.88}, URN = {urn:nbn:de:0030-drops-64962}, doi = {10.4230/LIPIcs.MFCS.2016.88}, annote = {Keywords: infinity regular expressions, parity automata} }
Mingyu Xiao and Shaowei Kou. An Improved Approximation Algorithm for the Traveling Tournament Problem with Maximum Trip Length Two. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 89:1-89:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{xiao_et_al:LIPIcs.MFCS.2016.89, author = {Xiao, Mingyu and Kou, Shaowei}, title = {{An Improved Approximation Algorithm for the Traveling Tournament Problem with Maximum Trip Length Two}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {89:1--89:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.89}, URN = {urn:nbn:de:0030-drops-64976}, doi = {10.4230/LIPIcs.MFCS.2016.89}, annote = {Keywords: sports scheduling, traveling tournament problem, approximation algorithms, timetabling combinatorial optimization} }