43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@Proceedings{potapov_et_al:LIPIcs.MFCS.2018, title = {{LIPIcs, Volume 117, MFCS'18, Complete Volume}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018}, URN = {urn:nbn:de:0030-drops-97459}, doi = {10.4230/LIPIcs.MFCS.2018}, annote = {Keywords: Theory of computation} }
43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 0:i-0:xx, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{potapov_et_al:LIPIcs.MFCS.2018.0, author = {Potapov, Igor and Spirakis, Paul and Worrell, James}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {0:i--0:xx}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.0}, URN = {urn:nbn:de:0030-drops-95824}, doi = {10.4230/LIPIcs.MFCS.2018.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Laurent Bulteau and Markus L. Schmid. Consensus Strings with Small Maximum Distance and Small Distance Sum. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 1:1-1:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{bulteau_et_al:LIPIcs.MFCS.2018.1, author = {Bulteau, Laurent and Schmid, Markus L.}, title = {{Consensus Strings with Small Maximum Distance and Small Distance Sum}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {1:1--1:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.1}, URN = {urn:nbn:de:0030-drops-95834}, doi = {10.4230/LIPIcs.MFCS.2018.1}, annote = {Keywords: Consensus String Problems, Closest String, Closest Substring, Parameterised Complexity, Kernelisation} }
Mikhail Andreev, Gleb Posobin, and Alexander Shen. Plain Stopping Time and Conditional Complexities Revisited. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 2:1-2:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{andreev_et_al:LIPIcs.MFCS.2018.2, author = {Andreev, Mikhail and Posobin, Gleb and Shen, Alexander}, title = {{Plain Stopping Time and Conditional Complexities Revisited}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {2:1--2:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.2}, URN = {urn:nbn:de:0030-drops-95842}, doi = {10.4230/LIPIcs.MFCS.2018.2}, annote = {Keywords: Kolmogorov complexity, stopping time complexity, structured conditional complexity, algorithmic information theory} }
Hasan Abasi. Error-Tolerant Non-Adaptive Learning of a Hidden Hypergraph. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 3:1-3:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{abasi:LIPIcs.MFCS.2018.3, author = {Abasi, Hasan}, title = {{Error-Tolerant Non-Adaptive Learning of a Hidden Hypergraph}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {3:1--3:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.3}, URN = {urn:nbn:de:0030-drops-95854}, doi = {10.4230/LIPIcs.MFCS.2018.3}, annote = {Keywords: Error Tolerant Algorithm, Hidden Hypergraph, Montone DNF, Group Testing, Non-Adaptive Learning} }
Alexander Kozachinskiy. From Expanders to Hitting Distributions and Simulation Theorems. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 4:1-4:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{kozachinskiy:LIPIcs.MFCS.2018.4, author = {Kozachinskiy, Alexander}, title = {{From Expanders to Hitting Distributions and Simulation Theorems}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {4:1--4:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.4}, URN = {urn:nbn:de:0030-drops-95863}, doi = {10.4230/LIPIcs.MFCS.2018.4}, annote = {Keywords: simulation theorems, hitting distributions, expanders} }
Titus Dose. Balance Problems for Integer Circuits. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 5:1-5:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{dose:LIPIcs.MFCS.2018.5, author = {Dose, Titus}, title = {{Balance Problems for Integer Circuits}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {5:1--5:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.5}, URN = {urn:nbn:de:0030-drops-95874}, doi = {10.4230/LIPIcs.MFCS.2018.5}, annote = {Keywords: computational complexity, integer expressions, integer circuits} }
Louis-Marie Dando and Sylvain Lombardy. On Hadamard Series and Rotating Q-Automata. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 6:1-6:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{dando_et_al:LIPIcs.MFCS.2018.6, author = {Dando, Louis-Marie and Lombardy, Sylvain}, title = {{On Hadamard Series and Rotating Q-Automata}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {6:1--6:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.6}, URN = {urn:nbn:de:0030-drops-95881}, doi = {10.4230/LIPIcs.MFCS.2018.6}, annote = {Keywords: Rational series, Hadamard operations, Rotating automata, Two-way automata} }
Egor Klenin and Alexander Kozachinskiy. One-Sided Error Communication Complexity of Gap Hamming Distance. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 7:1-7:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{klenin_et_al:LIPIcs.MFCS.2018.7, author = {Klenin, Egor and Kozachinskiy, Alexander}, title = {{One-Sided Error Communication Complexity of Gap Hamming Distance}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {7:1--7:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.7}, URN = {urn:nbn:de:0030-drops-95893}, doi = {10.4230/LIPIcs.MFCS.2018.7}, annote = {Keywords: Communication Complexity, Gap Hamming Distance, one-sided error} }
Spyros Angelopoulos, Christoph Dürr, and Shendan Jin. Online Maximum Matching with Recourse. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 8:1-8:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{angelopoulos_et_al:LIPIcs.MFCS.2018.8, author = {Angelopoulos, Spyros and D\"{u}rr, Christoph and Jin, Shendan}, title = {{Online Maximum Matching with Recourse}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {8:1--8:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.8}, URN = {urn:nbn:de:0030-drops-95908}, doi = {10.4230/LIPIcs.MFCS.2018.8}, annote = {Keywords: Competitive ratio, maximum cardinality matching, recourse} }
Guillaume Burel. Linking Focusing and Resolution with Selection. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 9:1-9:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{burel:LIPIcs.MFCS.2018.9, author = {Burel, Guillaume}, title = {{Linking Focusing and Resolution with Selection}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {9:1--9:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.9}, URN = {urn:nbn:de:0030-drops-95917}, doi = {10.4230/LIPIcs.MFCS.2018.9}, annote = {Keywords: logic in computer science, automated deduction, proof theory, sequent calculus, refinements of resolution, deduction modulo theory, polarization} }
Andreas Krebs, Arne Meier, Jonni Virtema, and Martin Zimmermann. Team Semantics for the Specification and Verification of Hyperproperties. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 10:1-10:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{krebs_et_al:LIPIcs.MFCS.2018.10, author = {Krebs, Andreas and Meier, Arne and Virtema, Jonni and Zimmermann, Martin}, title = {{Team Semantics for the Specification and Verification of Hyperproperties}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {10:1--10:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.10}, URN = {urn:nbn:de:0030-drops-95926}, doi = {10.4230/LIPIcs.MFCS.2018.10}, annote = {Keywords: LTL, Hyperproperties, Team Semantics, Model Checking, Satisfiability} }
Florent R. Madelaine and Barnaby Martin. Consistency for Counting Quantifiers. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 11:1-11:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{madelaine_et_al:LIPIcs.MFCS.2018.11, author = {Madelaine, Florent R. and Martin, Barnaby}, title = {{Consistency for Counting Quantifiers}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {11:1--11:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.11}, URN = {urn:nbn:de:0030-drops-95931}, doi = {10.4230/LIPIcs.MFCS.2018.11}, annote = {Keywords: Quantified Constraints, Constraint Satisfaction, Logic in Computer Science, Universal Algebra, Computational Complexity} }
Naonori Kakimura, Naoyuki Kamiyama, and Kenjiro Takazawa. The b-Branching Problem in Digraphs. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 12:1-12:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{kakimura_et_al:LIPIcs.MFCS.2018.12, author = {Kakimura, Naonori and Kamiyama, Naoyuki and Takazawa, Kenjiro}, title = {{The b-Branching Problem in Digraphs}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {12:1--12:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.12}, URN = {urn:nbn:de:0030-drops-95948}, doi = {10.4230/LIPIcs.MFCS.2018.12}, annote = {Keywords: Greedy Algorithm, Packing, Matroid Intersection, Sparsity Matroid, Arborescence} }
Dani Dorfman, Haim Kaplan, László Kozma, and Uri Zwick. Pairing heaps: the forward variant. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 13:1-13:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{dorfman_et_al:LIPIcs.MFCS.2018.13, author = {Dorfman, Dani and Kaplan, Haim and Kozma, L\'{a}szl\'{o} and Zwick, Uri}, title = {{Pairing heaps: the forward variant}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {13:1--13:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.13}, URN = {urn:nbn:de:0030-drops-95956}, doi = {10.4230/LIPIcs.MFCS.2018.13}, annote = {Keywords: data structure, priority queue, pairing heap} }
Yassine Hamoudi. Simultaneous Multiparty Communication Protocols for Composed Functions. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 14:1-14:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{hamoudi:LIPIcs.MFCS.2018.14, author = {Hamoudi, Yassine}, title = {{Simultaneous Multiparty Communication Protocols for Composed Functions}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {14:1--14:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.14}, URN = {urn:nbn:de:0030-drops-95969}, doi = {10.4230/LIPIcs.MFCS.2018.14}, annote = {Keywords: Communication complexity, Number On the Forehead model, Simultaneous Message Passing, Log n barrier, Symmetric Composed functions} }
Moses Ganardi, Artur Jez, and Markus Lohrey. Sliding Windows over Context-Free Languages. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 15:1-15:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{ganardi_et_al:LIPIcs.MFCS.2018.15, author = {Ganardi, Moses and Jez, Artur and Lohrey, Markus}, title = {{Sliding Windows over Context-Free Languages}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {15:1--15:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.15}, URN = {urn:nbn:de:0030-drops-95973}, doi = {10.4230/LIPIcs.MFCS.2018.15}, annote = {Keywords: sliding windows, streaming algorithms, context-free languages} }
Louisa Seelbach Benkner and Markus Lohrey. Average Case Analysis of Leaf-Centric Binary Tree Sources. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 16:1-16:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{seelbachbenkner_et_al:LIPIcs.MFCS.2018.16, author = {Seelbach Benkner, Louisa and Lohrey, Markus}, title = {{Average Case Analysis of Leaf-Centric Binary Tree Sources}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {16:1--16:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.16}, URN = {urn:nbn:de:0030-drops-95982}, doi = {10.4230/LIPIcs.MFCS.2018.16}, annote = {Keywords: Directed acylic graphs, average case analysis, tree compression} }
Pawel M. Idziak, Piotr Kawalek, and Jacek Krzaczkowski. Expressive Power, Satisfiability and Equivalence of Circuits over Nilpotent Algebras. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 17:1-17:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{idziak_et_al:LIPIcs.MFCS.2018.17, author = {Idziak, Pawel M. and Kawalek, Piotr and Krzaczkowski, Jacek}, title = {{Expressive Power, Satisfiability and Equivalence of Circuits over Nilpotent Algebras}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {17:1--17:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.17}, URN = {urn:nbn:de:0030-drops-95993}, doi = {10.4230/LIPIcs.MFCS.2018.17}, annote = {Keywords: circuit satisfiability, solving equations, Constraint Satisfaction Problem, structure theory} }
P. Madhusudan, Dirk Nowotka, Aayush Rajasekaran, and Jeffrey Shallit. Lagrange's Theorem for Binary Squares. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 18:1-18:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{madhusudan_et_al:LIPIcs.MFCS.2018.18, author = {Madhusudan, P. and Nowotka, Dirk and Rajasekaran, Aayush and Shallit, Jeffrey}, title = {{Lagrange's Theorem for Binary Squares}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {18:1--18:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.18}, URN = {urn:nbn:de:0030-drops-96003}, doi = {10.4230/LIPIcs.MFCS.2018.18}, annote = {Keywords: binary square, theorem-proving, finite automaton, decision procedure, decidable theory, additive number theory} }
Hendrik Fichtenberger and Yadu Vasudev. A Two-Sided Error Distributed Property Tester For Conductance. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 19:1-19:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{fichtenberger_et_al:LIPIcs.MFCS.2018.19, author = {Fichtenberger, Hendrik and Vasudev, Yadu}, title = {{A Two-Sided Error Distributed Property Tester For Conductance}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {19:1--19:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.19}, URN = {urn:nbn:de:0030-drops-96019}, doi = {10.4230/LIPIcs.MFCS.2018.19}, annote = {Keywords: property testing, distributed algorithms, conductance} }
Martin Grohe, Gaurav Rattan, and Gerhard J. Woeginger. Graph Similarity and Approximate Isomorphism. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 20:1-20:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{grohe_et_al:LIPIcs.MFCS.2018.20, author = {Grohe, Martin and Rattan, Gaurav and Woeginger, Gerhard J.}, title = {{Graph Similarity and Approximate Isomorphism}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {20:1--20:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.20}, URN = {urn:nbn:de:0030-drops-96021}, doi = {10.4230/LIPIcs.MFCS.2018.20}, annote = {Keywords: Graph Similarity, Quadratic Assignment Problem, Approximate Graph Isomorphism} }
Andrew Ryzhikov and Marek Szykula. Finding Short Synchronizing Words for Prefix Codes. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 21:1-21:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{ryzhikov_et_al:LIPIcs.MFCS.2018.21, author = {Ryzhikov, Andrew and Szykula, Marek}, title = {{Finding Short Synchronizing Words for Prefix Codes}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {21:1--21:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.21}, URN = {urn:nbn:de:0030-drops-96037}, doi = {10.4230/LIPIcs.MFCS.2018.21}, annote = {Keywords: synchronizing word, mortal word, avoiding word, Huffman decoder, inapproximability} }
Bill Fefferman and Shelby Kimmel. Quantum vs. Classical Proofs and Subset Verification. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 22:1-22:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{fefferman_et_al:LIPIcs.MFCS.2018.22, author = {Fefferman, Bill and Kimmel, Shelby}, title = {{Quantum vs. Classical Proofs and Subset Verification}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {22:1--22:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.22}, URN = {urn:nbn:de:0030-drops-96040}, doi = {10.4230/LIPIcs.MFCS.2018.22}, annote = {Keywords: Quantum Complexity Theory, Quantum Proofs} }
Guy Avni, Shibashis Guha, and Orna Kupferman. Timed Network Games with Clocks. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 23:1-23:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{avni_et_al:LIPIcs.MFCS.2018.23, author = {Avni, Guy and Guha, Shibashis and Kupferman, Orna}, title = {{Timed Network Games with Clocks}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {23:1--23:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.23}, URN = {urn:nbn:de:0030-drops-96053}, doi = {10.4230/LIPIcs.MFCS.2018.23}, annote = {Keywords: Network games, Timed automata, Nash equilibrium, Equilibrium inefficiency} }
Aris Filos-Ratsikas, Søren Kristoffer Stiil Frederiksen, Paul W. Goldberg, and Jie Zhang. Hardness Results for Consensus-Halving. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 24:1-24:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{filosratsikas_et_al:LIPIcs.MFCS.2018.24, author = {Filos-Ratsikas, Aris and Frederiksen, S{\o}ren Kristoffer Stiil and Goldberg, Paul W. and Zhang, Jie}, title = {{Hardness Results for Consensus-Halving}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {24:1--24:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.24}, URN = {urn:nbn:de:0030-drops-96069}, doi = {10.4230/LIPIcs.MFCS.2018.24}, annote = {Keywords: PPAD, PPA, consensus halving, generalized-circuit, reduction} }
Ioannis Lamprou, Russell Martin, Sven Schewe, Ioannis Sigalas, and Vassilis Zissimopoulos. Maximum Rooted Connected Expansion. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 25:1-25:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{lamprou_et_al:LIPIcs.MFCS.2018.25, author = {Lamprou, Ioannis and Martin, Russell and Schewe, Sven and Sigalas, Ioannis and Zissimopoulos, Vassilis}, title = {{Maximum Rooted Connected Expansion}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {25:1--25:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.25}, URN = {urn:nbn:de:0030-drops-96076}, doi = {10.4230/LIPIcs.MFCS.2018.25}, annote = {Keywords: prefetching, domination, expansion, ratio} }
François Le Gall, Tomoyuki Morimae, Harumichi Nishimura, and Yuki Takeuchi. Interactive Proofs with Polynomial-Time Quantum Prover for Computing the Order of Solvable Groups. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 26:1-26:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{legall_et_al:LIPIcs.MFCS.2018.26, author = {Le Gall, Fran\c{c}ois and Morimae, Tomoyuki and Nishimura, Harumichi and Takeuchi, Yuki}, title = {{Interactive Proofs with Polynomial-Time Quantum Prover for Computing the Order of Solvable Groups}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {26:1--26:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.26}, URN = {urn:nbn:de:0030-drops-96087}, doi = {10.4230/LIPIcs.MFCS.2018.26}, annote = {Keywords: Quantum computing, interactive proofs, group-theoretic problems} }
Martin Lück. On the Complexity of Team Logic and Its Two-Variable Fragment. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 27:1-27:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{luck:LIPIcs.MFCS.2018.27, author = {L\"{u}ck, Martin}, title = {{On the Complexity of Team Logic and Its Two-Variable Fragment}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {27:1--27:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.27}, URN = {urn:nbn:de:0030-drops-96094}, doi = {10.4230/LIPIcs.MFCS.2018.27}, annote = {Keywords: team logic, two-variable logic, complexity, satisfiability, model checking} }
Andrea Clementi, Mohsen Ghaffari, Luciano Gualà, Emanuele Natale, Francesco Pasquale, and Giacomo Scornavacca. A Tight Analysis of the Parallel Undecided-State Dynamics with Two Colors. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 28:1-28:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{clementi_et_al:LIPIcs.MFCS.2018.28, author = {Clementi, Andrea and Ghaffari, Mohsen and Gual\`{a}, Luciano and Natale, Emanuele and Pasquale, Francesco and Scornavacca, Giacomo}, title = {{A Tight Analysis of the Parallel Undecided-State Dynamics with Two Colors}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {28:1--28:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.28}, URN = {urn:nbn:de:0030-drops-96107}, doi = {10.4230/LIPIcs.MFCS.2018.28}, annote = {Keywords: Distributed Consensus, Self-Stabilization, PULL Model, Markov Chains} }
Jakub Gajarský and Daniel Král'. Recovering Sparse Graphs. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 29:1-29:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{gajarsky_et_al:LIPIcs.MFCS.2018.29, author = {Gajarsk\'{y}, Jakub and Kr\'{a}l', Daniel}, title = {{Recovering Sparse Graphs}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {29:1--29:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.29}, URN = {urn:nbn:de:0030-drops-96111}, doi = {10.4230/LIPIcs.MFCS.2018.29}, annote = {Keywords: model checking, degenerate graphs, interpretations, bounded expansion} }
Akitoshi Kawamura, Holger Thies, and Martin Ziegler. Average-Case Polynomial-Time Computability of Hamiltonian Dynamics. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 30:1-30:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{kawamura_et_al:LIPIcs.MFCS.2018.30, author = {Kawamura, Akitoshi and Thies, Holger and Ziegler, Martin}, title = {{Average-Case Polynomial-Time Computability of Hamiltonian Dynamics}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {30:1--30:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.30}, URN = {urn:nbn:de:0030-drops-96125}, doi = {10.4230/LIPIcs.MFCS.2018.30}, annote = {Keywords: Computable Analysis, Real computation, Dynamical systems, Average-case complexity, Computation in physics} }
Francesco Cellinese, Gianlorenzo D'Angelo, Gianpiero Monaco, and Yllka Velaj. Generalized Budgeted Submodular Set Function Maximization. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 31:1-31:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{cellinese_et_al:LIPIcs.MFCS.2018.31, author = {Cellinese, Francesco and D'Angelo, Gianlorenzo and Monaco, Gianpiero and Velaj, Yllka}, title = {{Generalized Budgeted Submodular Set Function Maximization}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {31:1--31:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.31}, URN = {urn:nbn:de:0030-drops-96138}, doi = {10.4230/LIPIcs.MFCS.2018.31}, annote = {Keywords: Submodular set function, Approximation algorithms, Budgeted Maximum Coverage} }
Mikhail V. Berlinkov, Robert Ferens, and Marek Szykula. Complexity of Preimage Problems for Deterministic Finite Automata. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 32:1-32:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{berlinkov_et_al:LIPIcs.MFCS.2018.32, author = {Berlinkov, Mikhail V. and Ferens, Robert and Szykula, Marek}, title = {{Complexity of Preimage Problems for Deterministic Finite Automata}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {32:1--32:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.32}, URN = {urn:nbn:de:0030-drops-96149}, doi = {10.4230/LIPIcs.MFCS.2018.32}, annote = {Keywords: avoiding word, extending word, extensible subset, reset word, synchronizing automaton} }
Manuel Bodirsky, Barnaby Martin, Marcello Mamino, and Antoine Mottet. The Complexity of Disjunctive Linear Diophantine Constraints. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 33:1-33:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{bodirsky_et_al:LIPIcs.MFCS.2018.33, author = {Bodirsky, Manuel and Martin, Barnaby and Mamino, Marcello and Mottet, Antoine}, title = {{The Complexity of Disjunctive Linear Diophantine Constraints}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {33:1--33:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.33}, URN = {urn:nbn:de:0030-drops-96150}, doi = {10.4230/LIPIcs.MFCS.2018.33}, annote = {Keywords: Constraint Satisfaction, Presburger Arithmetic, Computational Complexity} }
Ran Ben Basat, Gil Einziger, and Roy Friedman. Give Me Some Slack: Efficient Network Measurements. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 34:1-34:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{benbasat_et_al:LIPIcs.MFCS.2018.34, author = {Ben Basat, Ran and Einziger, Gil and Friedman, Roy}, title = {{Give Me Some Slack: Efficient Network Measurements}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {34:1--34:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.34}, URN = {urn:nbn:de:0030-drops-96165}, doi = {10.4230/LIPIcs.MFCS.2018.34}, annote = {Keywords: Streaming, Network Measurements, Statistics, Lower Bounds} }
Dan Hefetz, Orna Kupferman, Amir Lellouche, and Gal Vardi. Spanning-Tree Games. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 35:1-35:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{hefetz_et_al:LIPIcs.MFCS.2018.35, author = {Hefetz, Dan and Kupferman, Orna and Lellouche, Amir and Vardi, Gal}, title = {{Spanning-Tree Games}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {35:1--35:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.35}, URN = {urn:nbn:de:0030-drops-96171}, doi = {10.4230/LIPIcs.MFCS.2018.35}, annote = {Keywords: Algorithms, Games, Minimum/maximum spanning tree, Greedy algorithms} }
Thomas Erlebach and Jakob T. Spooner. Faster Exploration of Degree-Bounded Temporal Graphs. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 36:1-36:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{erlebach_et_al:LIPIcs.MFCS.2018.36, author = {Erlebach, Thomas and Spooner, Jakob T.}, title = {{Faster Exploration of Degree-Bounded Temporal Graphs}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {36:1--36:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.36}, URN = {urn:nbn:de:0030-drops-96181}, doi = {10.4230/LIPIcs.MFCS.2018.36}, annote = {Keywords: temporal graph exploration, algorithmic graph theory, NP-complete problem} }
Sayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi, and Subhash Suri. Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 37:1-37:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{bandyapadhyay_et_al:LIPIcs.MFCS.2018.37, author = {Bandyapadhyay, Sayan and Maheshwari, Anil and Mehrabi, Saeed and Suri, Subhash}, title = {{Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {37:1--37:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.37}, URN = {urn:nbn:de:0030-drops-96198}, doi = {10.4230/LIPIcs.MFCS.2018.37}, annote = {Keywords: Minimum dominating set, Rectangles and L-frames, Approximation schemes, Local search, APX-hardness} }
Marco Aldi, Niel de Beaudrap, Sevag Gharibian, and Seyran Saeedi. On Efficiently Solvable Cases of Quantum k-SAT. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 38:1-38:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{aldi_et_al:LIPIcs.MFCS.2018.38, author = {Aldi, Marco and de Beaudrap, Niel and Gharibian, Sevag and Saeedi, Seyran}, title = {{On Efficiently Solvable Cases of Quantum k-SAT}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {38:1--38:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.38}, URN = {urn:nbn:de:0030-drops-96201}, doi = {10.4230/LIPIcs.MFCS.2018.38}, annote = {Keywords: search complexity, local Hamiltonian, Quantum SAT, algebraic geometry} }
Cedric Berenger, Peter Niebert, and Kevin Perrot. Balanced Connected Partitioning of Unweighted Grid Graphs. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 39:1-39:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{berenger_et_al:LIPIcs.MFCS.2018.39, author = {Berenger, Cedric and Niebert, Peter and Perrot, Kevin}, title = {{Balanced Connected Partitioning of Unweighted Grid Graphs}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {39:1--39:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.39}, URN = {urn:nbn:de:0030-drops-96213}, doi = {10.4230/LIPIcs.MFCS.2018.39}, annote = {Keywords: grid graphs, connected partitioning, NP-completeness, graph algorithm} }
Stéphane Le Roux. Concurrent Games and Semi-Random Determinacy. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 40:1-40:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{leroux:LIPIcs.MFCS.2018.40, author = {Le Roux, St\'{e}phane}, title = {{Concurrent Games and Semi-Random Determinacy}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {40:1--40:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.40}, URN = {urn:nbn:de:0030-drops-96220}, doi = {10.4230/LIPIcs.MFCS.2018.40}, annote = {Keywords: Two-player win/lose, graph, infinite duration, abstract winning condition} }
Chen Dan, Kristoffer Arnsfelt Hansen, He Jiang, Liwei Wang, and Yuchen Zhou. Low Rank Approximation of Binary Matrices: Column Subset Selection and Generalizations. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 41:1-41:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{dan_et_al:LIPIcs.MFCS.2018.41, author = {Dan, Chen and Hansen, Kristoffer Arnsfelt and Jiang, He and Wang, Liwei and Zhou, Yuchen}, title = {{Low Rank Approximation of Binary Matrices: Column Subset Selection and Generalizations}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {41:1--41:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.41}, URN = {urn:nbn:de:0030-drops-96239}, doi = {10.4230/LIPIcs.MFCS.2018.41}, annote = {Keywords: Approximation Algorithms, Low Rank Approximation, Binary Matrices} }
Arnaud Carayol and Matthew Hague. Optimal Strategies in Pushdown Reachability Games. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 42:1-42:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{carayol_et_al:LIPIcs.MFCS.2018.42, author = {Carayol, Arnaud and Hague, Matthew}, title = {{Optimal Strategies in Pushdown Reachability Games}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {42:1--42:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.42}, URN = {urn:nbn:de:0030-drops-96248}, doi = {10.4230/LIPIcs.MFCS.2018.42}, annote = {Keywords: Pushdown Systems, Reachability Games, Optimal Strategies, Formal Methods, Context Free} }
Peter Jonsson and Victor Lagerkvist. Why are CSPs Based on Partition Schemes Computationally Hard?. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 43:1-43:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{jonsson_et_al:LIPIcs.MFCS.2018.43, author = {Jonsson, Peter and Lagerkvist, Victor}, title = {{Why are CSPs Based on Partition Schemes Computationally Hard?}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {43:1--43:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.43}, URN = {urn:nbn:de:0030-drops-96257}, doi = {10.4230/LIPIcs.MFCS.2018.43}, annote = {Keywords: Constraint satisfaction problems, infinite domains, partition schemes, lower bounds} }
Argyrios Deligkas and Reshef Meir. Directed Graph Minors and Serial-Parallel Width. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 44:1-44:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{deligkas_et_al:LIPIcs.MFCS.2018.44, author = {Deligkas, Argyrios and Meir, Reshef}, title = {{Directed Graph Minors and Serial-Parallel Width}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {44:1--44:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.44}, URN = {urn:nbn:de:0030-drops-96261}, doi = {10.4230/LIPIcs.MFCS.2018.44}, annote = {Keywords: directed minors, pathwidth} }
Philipp Zschoche, Till Fluschnik, Hendrik Molter, and Rolf Niedermeier. The Complexity of Finding Small Separators in Temporal Graphs. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 45:1-45:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{zschoche_et_al:LIPIcs.MFCS.2018.45, author = {Zschoche, Philipp and Fluschnik, Till and Molter, Hendrik and Niedermeier, Rolf}, title = {{The Complexity of Finding Small Separators in Temporal Graphs}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {45:1--45:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.45}, URN = {urn:nbn:de:0030-drops-96277}, doi = {10.4230/LIPIcs.MFCS.2018.45}, annote = {Keywords: (non-)strict temporal paths, temporal core, single-source shortest paths, node multiway cut, length-bounded cuts, parameterized complexity} }
Léo Exibard, Emmanuel Filiot, and Ismaël Jecker. The Complexity of Transducer Synthesis from Multi-Sequential Specifications. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 46:1-46:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{exibard_et_al:LIPIcs.MFCS.2018.46, author = {Exibard, L\'{e}o and Filiot, Emmanuel and Jecker, Isma\"{e}l}, title = {{The Complexity of Transducer Synthesis from Multi-Sequential Specifications}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {46:1--46:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.46}, URN = {urn:nbn:de:0030-drops-96286}, doi = {10.4230/LIPIcs.MFCS.2018.46}, annote = {Keywords: Transducers, Multi-Sequentiality, Synthesis} }
Vittorio Bilò, Michele Flammini, Gianpiero Monaco, and Luca Moscardelli. Pricing Problems with Buyer Preselection. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 47:1-47:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{bilo_et_al:LIPIcs.MFCS.2018.47, author = {Bil\`{o}, Vittorio and Flammini, Michele and Monaco, Gianpiero and Moscardelli, Luca}, title = {{Pricing Problems with Buyer Preselection}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {47:1--47:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.47}, URN = {urn:nbn:de:0030-drops-96292}, doi = {10.4230/LIPIcs.MFCS.2018.47}, annote = {Keywords: Pricing problems, Envy-freeness, Revenue maximization, Social Welfare maximization} }
Costanza Catalano and Raphaël M. Jungers. On Randomized Generation of Slowly Synchronizing Automata. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 48:1-48:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{catalano_et_al:LIPIcs.MFCS.2018.48, author = {Catalano, Costanza and Jungers, Rapha\"{e}l M.}, title = {{On Randomized Generation of Slowly Synchronizing Automata}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {48:1--48:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.48}, URN = {urn:nbn:de:0030-drops-96305}, doi = {10.4230/LIPIcs.MFCS.2018.48}, annote = {Keywords: Synchronizing automata, random automata, Cern\'{y} conjecture, automata with simple idempotents, primitive sets of matrices} }
Andreas Göbel, J. A. Gregor Lagodzinski, and Karen Seidel. Counting Homomorphisms to Trees Modulo a Prime. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 49:1-49:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{gobel_et_al:LIPIcs.MFCS.2018.49, author = {G\"{o}bel, Andreas and Lagodzinski, J. A. Gregor and Seidel, Karen}, title = {{Counting Homomorphisms to Trees Modulo a Prime}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {49:1--49:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.49}, URN = {urn:nbn:de:0030-drops-96315}, doi = {10.4230/LIPIcs.MFCS.2018.49}, annote = {Keywords: Algorithms, Theory, Graph Homomorphisms, Counting Modulo a Prime, Complexity Dichotomy} }
Kelin Luo, Thomas Erlebach, and Yinfeng Xu. Car-Sharing between Two Locations: Online Scheduling with Two Servers. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 50:1-50:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{luo_et_al:LIPIcs.MFCS.2018.50, author = {Luo, Kelin and Erlebach, Thomas and Xu, Yinfeng}, title = {{Car-Sharing between Two Locations: Online Scheduling with Two Servers}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {50:1--50:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.50}, URN = {urn:nbn:de:0030-drops-96325}, doi = {10.4230/LIPIcs.MFCS.2018.50}, annote = {Keywords: Car-sharing system, Competitive analysis, On-line scheduling} }
Edith Hemaspaandra, Lane A. Hemaspaandra, Holger Spakowski, and Osamu Watanabe. The Robustness of LWPP and WPP, with an Application to Graph Reconstruction. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 51:1-51:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{hemaspaandra_et_al:LIPIcs.MFCS.2018.51, author = {Hemaspaandra, Edith and Hemaspaandra, Lane A. and Spakowski, Holger and Watanabe, Osamu}, title = {{The Robustness of LWPP and WPP, with an Application to Graph Reconstruction}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {51:1--51:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.51}, URN = {urn:nbn:de:0030-drops-96330}, doi = {10.4230/LIPIcs.MFCS.2018.51}, annote = {Keywords: structural complexity theory, robustness of counting classes, the legitimate deck problem, PP-lowness, the Reconstruction Conjecture} }
Robert Gmyr, Kristian Hinnenthal, Irina Kostitsyna, Fabian Kuhn, Dorian Rudolph, and Christian Scheideler. Shape Recognition by a Finite Automaton Robot. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 52:1-52:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{gmyr_et_al:LIPIcs.MFCS.2018.52, author = {Gmyr, Robert and Hinnenthal, Kristian and Kostitsyna, Irina and Kuhn, Fabian and Rudolph, Dorian and Scheideler, Christian}, title = {{Shape Recognition by a Finite Automaton Robot}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {52:1--52:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.52}, URN = {urn:nbn:de:0030-drops-96347}, doi = {10.4230/LIPIcs.MFCS.2018.52}, annote = {Keywords: finite automata, shape recognition, computational geometry} }
Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Daniel Lokshtanov, and Saket Saurabh. Conflict Free Feedback Vertex Set: A Parameterized Dichotomy. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 53:1-53:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{agrawal_et_al:LIPIcs.MFCS.2018.53, author = {Agrawal, Akanksha and Jain, Pallavi and Kanesh, Lawqueen and Lokshtanov, Daniel and Saurabh, Saket}, title = {{Conflict Free Feedback Vertex Set: A Parameterized Dichotomy}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {53:1--53:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.53}, URN = {urn:nbn:de:0030-drops-96355}, doi = {10.4230/LIPIcs.MFCS.2018.53}, annote = {Keywords: Conflict-free, Feedback Vertex Set, FPT algorithm, W\lbrack1\rbrack-hardness} }
Andre Droschinsky, Nils M. Kriege, and Petra Mutzel. Largest Weight Common Subtree Embeddings with Distance Penalties. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 54:1-54:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{droschinsky_et_al:LIPIcs.MFCS.2018.54, author = {Droschinsky, Andre and Kriege, Nils M. and Mutzel, Petra}, title = {{Largest Weight Common Subtree Embeddings with Distance Penalties}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {54:1--54:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.54}, URN = {urn:nbn:de:0030-drops-96367}, doi = {10.4230/LIPIcs.MFCS.2018.54}, annote = {Keywords: maximum common subtree, largest embeddable subtree, topological embedding, maximum weight matching, subtree homeomorphism} }
Mamadou M. Kanté, Kaveh Khoshkhah, and Mozhgan Pourmoradnasseri. Enumerating Minimal Transversals of Hypergraphs without Small Holes. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 55:1-55:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{kante_et_al:LIPIcs.MFCS.2018.55, author = {Kant\'{e}, Mamadou M. and Khoshkhah, Kaveh and Pourmoradnasseri, Mozhgan}, title = {{Enumerating Minimal Transversals of Hypergraphs without Small Holes}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {55:1--55:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.55}, URN = {urn:nbn:de:0030-drops-96372}, doi = {10.4230/LIPIcs.MFCS.2018.55}, annote = {Keywords: Triangle-free Hypergraph, Minimal Transversal, Balanced Matrix, Minimal Dominating Set} }
Andreas Bärtschi, Daniel Graf, and Matús Mihalák. Collective Fast Delivery by Energy-Efficient Agents. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 56:1-56:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{bartschi_et_al:LIPIcs.MFCS.2018.56, author = {B\"{a}rtschi, Andreas and Graf, Daniel and Mihal\'{a}k, Mat\'{u}s}, title = {{Collective Fast Delivery by Energy-Efficient Agents}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {56:1--56:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.56}, URN = {urn:nbn:de:0030-drops-96381}, doi = {10.4230/LIPIcs.MFCS.2018.56}, annote = {Keywords: delivery, mobile agents, time/energy optimization, complexity, algorithms} }
Matthew Hague, Roland Meyer, Sebastian Muskalla, and Martin Zimmermann. Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 57:1-57:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{hague_et_al:LIPIcs.MFCS.2018.57, author = {Hague, Matthew and Meyer, Roland and Muskalla, Sebastian and Zimmermann, Martin}, title = {{Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {57:1--57:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.57}, URN = {urn:nbn:de:0030-drops-96396}, doi = {10.4230/LIPIcs.MFCS.2018.57}, annote = {Keywords: Parity Games, Safety Games, Pushdown Systems, Collapsible Pushdown Systems, Higher-Order Recursion Schemes, Model Checking} }
Sevag Gharibian, Miklos Santha, Jamie Sikora, Aarthi Sundaram, and Justin Yirka. Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2). In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 58:1-58:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{gharibian_et_al:LIPIcs.MFCS.2018.58, author = {Gharibian, Sevag and Santha, Miklos and Sikora, Jamie and Sundaram, Aarthi and Yirka, Justin}, title = {{Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2)}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {58:1--58:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.58}, URN = {urn:nbn:de:0030-drops-96409}, doi = {10.4230/LIPIcs.MFCS.2018.58}, annote = {Keywords: Complexity Theory, Quantum Computing, Polynomial Hierarchy, Semidefinite Programming, QMA(2), Quantum Complexity} }
Martin Dietzfelbinger, Philipp Schlag, and Stefan Walzer. A Subquadratic Algorithm for 3XOR. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 59:1-59:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{dietzfelbinger_et_al:LIPIcs.MFCS.2018.59, author = {Dietzfelbinger, Martin and Schlag, Philipp and Walzer, Stefan}, title = {{A Subquadratic Algorithm for 3XOR}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {59:1--59:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.59}, URN = {urn:nbn:de:0030-drops-96417}, doi = {10.4230/LIPIcs.MFCS.2018.59}, annote = {Keywords: 3SUM, 3XOR, Randomized Algorithms, Reductions, Conditional Lower Time Bounds} }
Christian Doczkal and Damien Pous. Treewidth-Two Graphs as a Free Algebra. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 60:1-60:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{doczkal_et_al:LIPIcs.MFCS.2018.60, author = {Doczkal, Christian and Pous, Damien}, title = {{Treewidth-Two Graphs as a Free Algebra}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {60:1--60:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.60}, URN = {urn:nbn:de:0030-drops-96429}, doi = {10.4230/LIPIcs.MFCS.2018.60}, annote = {Keywords: Treewidth, Universal Algebra, Rewriting} }
Peter Dixon, A. Pavan, and N. V. Vinodchandran. On Pseudodeterministic Approximation Algorithms. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 61:1-61:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{dixon_et_al:LIPIcs.MFCS.2018.61, author = {Dixon, Peter and Pavan, A. and Vinodchandran, N. V.}, title = {{On Pseudodeterministic Approximation Algorithms}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {61:1--61:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.61}, URN = {urn:nbn:de:0030-drops-96431}, doi = {10.4230/LIPIcs.MFCS.2018.61}, annote = {Keywords: Approximation Algorithms, Circuit lower bounds, Pseudodeterminism} }
Lukas Fleischer and Manfred Kufleitner. Testing Simon's congruence. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 62:1-62:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{fleischer_et_al:LIPIcs.MFCS.2018.62, author = {Fleischer, Lukas and Kufleitner, Manfred}, title = {{Testing Simon's congruence}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {62:1--62:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.62}, URN = {urn:nbn:de:0030-drops-96445}, doi = {10.4230/LIPIcs.MFCS.2018.62}, annote = {Keywords: regular language, scattered subword, piecewise testability, string algorithm} }
Konrad K. Dabrowski, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, and Viktor Zamaraev. On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 63:1-63:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{dabrowski_et_al:LIPIcs.MFCS.2018.63, author = {Dabrowski, Konrad K. and Johnson, Matthew and Paesani, Giacomo and Paulusma, Dani\"{e}l and Zamaraev, Viktor}, title = {{On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {63:1--63:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.63}, URN = {urn:nbn:de:0030-drops-96452}, doi = {10.4230/LIPIcs.MFCS.2018.63}, annote = {Keywords: vertex cover, feedback vertex set, odd cycle transversal, price of independence} }
Paolo D'Arco, Roberto De Prisco, Alfredo De Santis, Angel Pérez del Pozo, and Ugo Vaccaro. Probabilistic Secret Sharing. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 64:1-64:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{darco_et_al:LIPIcs.MFCS.2018.64, author = {D'Arco, Paolo and De Prisco, Roberto and De Santis, Alfredo and P\'{e}rez del Pozo, Angel and Vaccaro, Ugo}, title = {{Probabilistic Secret Sharing}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {64:1--64:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.64}, URN = {urn:nbn:de:0030-drops-96464}, doi = {10.4230/LIPIcs.MFCS.2018.64}, annote = {Keywords: Secret sharing, probabilistic secret sharing, evolving secret sharing} }
Frank Kammer and Andrej Sajenko. Extra Space during Initialization of Succinct Data Structures and Dynamical Initializable Arrays. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 65:1-65:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{kammer_et_al:LIPIcs.MFCS.2018.65, author = {Kammer, Frank and Sajenko, Andrej}, title = {{Extra Space during Initialization of Succinct Data Structures and Dynamical Initializable Arrays}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {65:1--65:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.65}, URN = {urn:nbn:de:0030-drops-96478}, doi = {10.4230/LIPIcs.MFCS.2018.65}, annote = {Keywords: space efficiency, succinct c-ary memory, dynamic graph representation} }
Pawel Gawrychowski, Gad M. Landau, and Tatiana Starikovskaya. Fast Entropy-Bounded String Dictionary Look-Up with Mismatches. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 66:1-66:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{gawrychowski_et_al:LIPIcs.MFCS.2018.66, author = {Gawrychowski, Pawel and Landau, Gad M. and Starikovskaya, Tatiana}, title = {{Fast Entropy-Bounded String Dictionary Look-Up with Mismatches}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {66:1--66:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.66}, URN = {urn:nbn:de:0030-drops-96486}, doi = {10.4230/LIPIcs.MFCS.2018.66}, annote = {Keywords: Dictionary look-up, Hamming distance, compact data structures} }
Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim, and Michael Lampis. New Results on Directed Edge Dominating Set. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 67:1-67:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{belmonte_et_al:LIPIcs.MFCS.2018.67, author = {Belmonte, R\'{e}my and Hanaka, Tesshu and Katsikarelis, Ioannis and Kim, Eun Jung and Lampis, Michael}, title = {{New Results on Directed Edge Dominating Set}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {67:1--67:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.67}, URN = {urn:nbn:de:0030-drops-96490}, doi = {10.4230/LIPIcs.MFCS.2018.67}, annote = {Keywords: Edge Dominating Set, Tournaments, Treewidth} }
Pavol Hell, Jing Huang, Ross M. McConnell, and Arash Rafiey. Interval-Like Graphs and Digraphs. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 68:1-68:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{hell_et_al:LIPIcs.MFCS.2018.68, author = {Hell, Pavol and Huang, Jing and McConnell, Ross M. and Rafiey, Arash}, title = {{Interval-Like Graphs and Digraphs}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {68:1--68:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.68}, URN = {urn:nbn:de:0030-drops-96503}, doi = {10.4230/LIPIcs.MFCS.2018.68}, annote = {Keywords: graph theory, interval graphs, interval bigraphs, min ordering, co-TT graph} }
Peter Hamburger, Ross M. McConnell, Attila Pór, Jeremy P. Spinrad, and Zhisheng Xu. Double Threshold Digraphs. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 69:1-69:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{hamburger_et_al:LIPIcs.MFCS.2018.69, author = {Hamburger, Peter and McConnell, Ross M. and P\'{o}r, Attila and Spinrad, Jeremy P. and Xu, Zhisheng}, title = {{Double Threshold Digraphs}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {69:1--69:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.69}, URN = {urn:nbn:de:0030-drops-96519}, doi = {10.4230/LIPIcs.MFCS.2018.69}, annote = {Keywords: posets, preference relations, approximation algorithms} }
Jenish C. Mehta. Tree Tribes and Lower Bounds for Switching Lemmas. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 70:1-70:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{mehta:LIPIcs.MFCS.2018.70, author = {Mehta, Jenish C.}, title = {{Tree Tribes and Lower Bounds for Switching Lemmas}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {70:1--70:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.70}, URN = {urn:nbn:de:0030-drops-96524}, doi = {10.4230/LIPIcs.MFCS.2018.70}, annote = {Keywords: Tree Tribes, Resilience, Switching lemmas, lower bounds, decision tree} }
Neil Lutz and Donald M. Stull. Projection Theorems Using Effective Dimension. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 71:1-71:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{lutz_et_al:LIPIcs.MFCS.2018.71, author = {Lutz, Neil and Stull, Donald M.}, title = {{Projection Theorems Using Effective Dimension}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {71:1--71:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.71}, URN = {urn:nbn:de:0030-drops-96532}, doi = {10.4230/LIPIcs.MFCS.2018.71}, annote = {Keywords: algorithmic randomness, geometric measure theory, Hausdorff dimension, Kolmogorov complexity} }
Andrzej S. Murawski, Steven J. Ramsay, and Nikos Tzevelekos. Polynomial-Time Equivalence Testing for Deterministic Fresh-Register Automata. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 72:1-72:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{murawski_et_al:LIPIcs.MFCS.2018.72, author = {Murawski, Andrzej S. and Ramsay, Steven J. and Tzevelekos, Nikos}, title = {{Polynomial-Time Equivalence Testing for Deterministic Fresh-Register Automata}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {72:1--72:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.72}, URN = {urn:nbn:de:0030-drops-96544}, doi = {10.4230/LIPIcs.MFCS.2018.72}, annote = {Keywords: automata over infinite alphabets, language equivalence, bisimilarity, computational group theory} }
Ralph Christian Bottesch. On W[1]-Hardness as Evidence for Intractability. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 73:1-73:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{bottesch:LIPIcs.MFCS.2018.73, author = {Bottesch, Ralph Christian}, title = {{On W\lbrack1\rbrack-Hardness as Evidence for Intractability}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {73:1--73:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.73}, URN = {urn:nbn:de:0030-drops-96559}, doi = {10.4230/LIPIcs.MFCS.2018.73}, annote = {Keywords: Parameterized complexity, Relativization} }
Christian Konrad. A Simple Augmentation Method for Matchings with Applications to Streaming Algorithms. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 74:1-74:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{konrad:LIPIcs.MFCS.2018.74, author = {Konrad, Christian}, title = {{A Simple Augmentation Method for Matchings with Applications to Streaming Algorithms}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {74:1--74:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.74}, URN = {urn:nbn:de:0030-drops-96560}, doi = {10.4230/LIPIcs.MFCS.2018.74}, annote = {Keywords: Matchings, augmenting paths, streaming algorithms, random order} }
Benjamin Moore, Naomi Nishimura, and Vijay Subramanya. Reconfiguration of Graph Minors. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 75:1-75:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{moore_et_al:LIPIcs.MFCS.2018.75, author = {Moore, Benjamin and Nishimura, Naomi and Subramanya, Vijay}, title = {{Reconfiguration of Graph Minors}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {75:1--75:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.75}, URN = {urn:nbn:de:0030-drops-96573}, doi = {10.4230/LIPIcs.MFCS.2018.75}, annote = {Keywords: reconfiguration, graph minors, graph algorithms} }
Manfred Droste and Erik Paul. A Feferman-Vaught Decomposition Theorem for Weighted MSO Logic. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 76:1-76:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{droste_et_al:LIPIcs.MFCS.2018.76, author = {Droste, Manfred and Paul, Erik}, title = {{A Feferman-Vaught Decomposition Theorem for Weighted MSO Logic}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {76:1--76:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.76}, URN = {urn:nbn:de:0030-drops-96581}, doi = {10.4230/LIPIcs.MFCS.2018.76}, annote = {Keywords: Quantitative Logic, Quantitative Model Theory, Feferman-Vaught Theorem, Translation Scheme, Transduction} }
Hugo A. Akitaya, Matthew D. Jones, David Stalfa, and Csaba D. Tóth. Maximum Area Axis-Aligned Square Packings. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 77:1-77:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{akitaya_et_al:LIPIcs.MFCS.2018.77, author = {Akitaya, Hugo A. and Jones, Matthew D. and Stalfa, David and T\'{o}th, Csaba D.}, title = {{Maximum Area Axis-Aligned Square Packings}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {77:1--77:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.77}, URN = {urn:nbn:de:0030-drops-96594}, doi = {10.4230/LIPIcs.MFCS.2018.77}, annote = {Keywords: square packing, geometric optimization} }
Ninad Rajgopal, Rahul Santhanam, and Srikanth Srinivasan. Deterministically Counting Satisfying Assignments for Constant-Depth Circuits with Parity Gates, with Implications for Lower Bounds. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 78:1-78:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{rajgopal_et_al:LIPIcs.MFCS.2018.78, author = {Rajgopal, Ninad and Santhanam, Rahul and Srinivasan, Srikanth}, title = {{Deterministically Counting Satisfying Assignments for Constant-Depth Circuits with Parity Gates, with Implications for Lower Bounds}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {78:1--78:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.78}, URN = {urn:nbn:de:0030-drops-96607}, doi = {10.4230/LIPIcs.MFCS.2018.78}, annote = {Keywords: circuit satisfiability, circuit lower bounds, polynomial method, derandomization} }
Donald M. Stull. Results on the Dimension Spectra of Planar Lines. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 79:1-79:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{stull:LIPIcs.MFCS.2018.79, author = {Stull, Donald M.}, title = {{Results on the Dimension Spectra of Planar Lines}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {79:1--79:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.79}, URN = {urn:nbn:de:0030-drops-96611}, doi = {10.4230/LIPIcs.MFCS.2018.79}, annote = {Keywords: algorithmic randomness, geometric measure theory, Hausdorff dimension, Kolmogorov complexity} }
Aris Pagourtzis and Tomasz Radzik. Tight Bounds for Deterministic h-Shot Broadcast in Ad-Hoc Directed Radio Networks. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 80:1-80:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{pagourtzis_et_al:LIPIcs.MFCS.2018.80, author = {Pagourtzis, Aris and Radzik, Tomasz}, title = {{Tight Bounds for Deterministic h-Shot Broadcast in Ad-Hoc Directed Radio Networks}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {80:1--80:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.80}, URN = {urn:nbn:de:0030-drops-96629}, doi = {10.4230/LIPIcs.MFCS.2018.80}, annote = {Keywords: Ad-hoc radio networks, wireless networks, deterministic broadcast, adaptive protocols, limited transmissions} }
Kazuyuki Amano. Depth Two Majority Circuits for Majority and List Expanders. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 81:1-81:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{amano:LIPIcs.MFCS.2018.81, author = {Amano, Kazuyuki}, title = {{Depth Two Majority Circuits for Majority and List Expanders}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {81:1--81:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.81}, URN = {urn:nbn:de:0030-drops-96633}, doi = {10.4230/LIPIcs.MFCS.2018.81}, annote = {Keywords: Boolean function, majority function, constant depth circuit, expander graph} }
Mareike Dressler, Adam Kurpisz, and Timo de Wolff. Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit Polynomials. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 82:1-82:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{dressler_et_al:LIPIcs.MFCS.2018.82, author = {Dressler, Mareike and Kurpisz, Adam and de Wolff, Timo}, title = {{Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit Polynomials}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {82:1--82:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.82}, URN = {urn:nbn:de:0030-drops-96643}, doi = {10.4230/LIPIcs.MFCS.2018.82}, annote = {Keywords: nonnegativity certificate, hypercube optimization, sums of nonnegative circuit polynomials, relative entropy programming, sums of squares} }
Pinar Heggernes, Davis Issac, Juho Lauri, Paloma T. Lima, and Erik Jan van Leeuwen. Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 83:1-83:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{heggernes_et_al:LIPIcs.MFCS.2018.83, author = {Heggernes, Pinar and Issac, Davis and Lauri, Juho and Lima, Paloma T. and van Leeuwen, Erik Jan}, title = {{Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {83:1--83:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.83}, URN = {urn:nbn:de:0030-drops-96657}, doi = {10.4230/LIPIcs.MFCS.2018.83}, annote = {Keywords: Rainbow coloring, graph classes, polynomial-time algorithms, approximation algorithms} }
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, and Luca Versari. Listing Subgraphs by Cartesian Decomposition. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 84:1-84:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{conte_et_al:LIPIcs.MFCS.2018.84, author = {Conte, Alessio and Grossi, Roberto and Marino, Andrea and Rizzi, Romeo and Versari, Luca}, title = {{Listing Subgraphs by Cartesian Decomposition}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {84:1--84:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.84}, URN = {urn:nbn:de:0030-drops-96666}, doi = {10.4230/LIPIcs.MFCS.2018.84}, annote = {Keywords: Graph algorithms, listing, minimum spanning trees, constant delay} }
Feedback for Dagstuhl Publishing