@Proceedings{larsen_et_al:LIPIcs.MFCS.2017,
title = {{LIPIcs, Volume 83, MFCS'17, Complete Volume}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017},
URN = {urn:nbn:de:0030-drops-82073},
doi = {10.4230/LIPIcs.MFCS.2017},
annote = {Keywords: Theory of Computation}
}
@InProceedings{larsen_et_al:LIPIcs.MFCS.2017.0,
author = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {0:i--0:xvi},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.0},
URN = {urn:nbn:de:0030-drops-80564},
doi = {10.4230/LIPIcs.MFCS.2017.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{impagliazzo_et_al:LIPIcs.MFCS.2017.1,
author = {Impagliazzo, Russell and Kabanets, Valentine and Kolokolova, Antonina and McKenzie, Pierre and Romani, Shadab},
title = {{Does Looking Inside a Circuit Help?}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {1:1--1:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.1},
URN = {urn:nbn:de:0030-drops-80975},
doi = {10.4230/LIPIcs.MFCS.2017.1},
annote = {Keywords: Black-Box Hypothesis, Rice's theorem, circuit complexity, SAT, sensitivity of boolean functions, decision tree complexity}
}
@InProceedings{grosshans_et_al:LIPIcs.MFCS.2017.2,
author = {Grosshans, Nathan and McKenzie, Pierre and Segoufin, Luc},
title = {{The Power of Programs over Monoids in DA}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {2:1--2:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.2},
URN = {urn:nbn:de:0030-drops-80909},
doi = {10.4230/LIPIcs.MFCS.2017.2},
annote = {Keywords: Programs over monoids, DA, lower-bounds}
}
@InProceedings{parker_et_al:LIPIcs.MFCS.2017.3,
author = {Parker, Austin J. and Yancey, Kelly B. and Yancey, Matthew P.},
title = {{Regular Language Distance and Entropy}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {3:1--3:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.3},
URN = {urn:nbn:de:0030-drops-80945},
doi = {10.4230/LIPIcs.MFCS.2017.3},
annote = {Keywords: regular languages, channel capacity, entropy, Jaccard, symbolic dynamics}
}
@InProceedings{fulla_et_al:LIPIcs.MFCS.2017.4,
author = {Fulla, Peter and Zivny, Stanislav},
title = {{The Complexity of Boolean Surjective General-Valued CSPs}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {4:1--4:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.4},
URN = {urn:nbn:de:0030-drops-80623},
doi = {10.4230/LIPIcs.MFCS.2017.4},
annote = {Keywords: constraint satisfaction problems, surjective CSP, valued CSP, min-cut, polymorphisms, multimorphisms}
}
@InProceedings{durand_et_al:LIPIcs.MFCS.2017.5,
author = {Durand, Bruno and Romashchenko, Andrei},
title = {{On the Expressive Power of Quasiperiodic SFT}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {5:1--5:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.5},
URN = {urn:nbn:de:0030-drops-80985},
doi = {10.4230/LIPIcs.MFCS.2017.5},
annote = {Keywords: minimal SFT, tilings, quasiperiodicityIn this paper we study the shifts, which are the shift-invariant and topologically closed sets of configurations}
}
@InProceedings{bliznets_et_al:LIPIcs.MFCS.2017.6,
author = {Bliznets, Ivan and Karpov, Nikolai},
title = {{Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {6:1--6:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.6},
URN = {urn:nbn:de:0030-drops-80728},
doi = {10.4230/LIPIcs.MFCS.2017.6},
annote = {Keywords: clustering, parameterized complexity, highly connected}
}
@InProceedings{laarhoven:LIPIcs.MFCS.2017.7,
author = {Laarhoven, Thijs},
title = {{Hypercube LSH for Approximate near Neighbors}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {7:1--7:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.7},
URN = {urn:nbn:de:0030-drops-80926},
doi = {10.4230/LIPIcs.MFCS.2017.7},
annote = {Keywords: (approximate) near neighbors, locality-sensitive hashing, large deviations, dimensionality reduction, lattice algorithms}
}
@InProceedings{kawachi_et_al:LIPIcs.MFCS.2017.8,
author = {Kawachi, Akinori and Ogihara, Mitsunori and Uchizawa, Kei},
title = {{Generalized Predecessor Existence Problems for Boolean Finite Dynamical Systems}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {8:1--8:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.8},
URN = {urn:nbn:de:0030-drops-81078},
doi = {10.4230/LIPIcs.MFCS.2017.8},
annote = {Keywords: Computational complexity, dynamical systems, Garden of Eden, predecessor}
}
@InProceedings{damaschke:LIPIcs.MFCS.2017.9,
author = {Damaschke, Peter},
title = {{Dividing Splittable Goods Evenly and With Limited Fragmentation}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {9:1--9:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.9},
URN = {urn:nbn:de:0030-drops-80579},
doi = {10.4230/LIPIcs.MFCS.2017.9},
annote = {Keywords: packing, load balancing, weighted graph, linear-time algorithm, parameterized algorithm}
}
@InProceedings{tanimura_et_al:LIPIcs.MFCS.2017.10,
author = {Tanimura, Yuka and Nishimoto, Takaaki and Bannai, Hideo and Inenaga, Shunsuke and Takeda, Masayuki},
title = {{Small-Space LCE Data Structure with Constant-Time Queries}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {10:1--10:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.10},
URN = {urn:nbn:de:0030-drops-81021},
doi = {10.4230/LIPIcs.MFCS.2017.10},
annote = {Keywords: longest common extension, truncated suffix trees, t-covers}
}
@InProceedings{jeandel_et_al:LIPIcs.MFCS.2017.11,
author = {Jeandel, Emmanuel and Perdrix, Simon and Vilmart, Renaud and Wang, Quanlong},
title = {{ZX-Calculus: Cyclotomic Supplementarity and Incompleteness for Clifford+T Quantum Mechanics}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {11:1--11:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.11},
URN = {urn:nbn:de:0030-drops-81173},
doi = {10.4230/LIPIcs.MFCS.2017.11},
annote = {Keywords: Categorical Quantum Mechanincs, ZX-Calculus, Completeness, Cyclotomic Supplmentarity, Clifford+T}
}
@InProceedings{haase_et_al:LIPIcs.MFCS.2017.12,
author = {Haase, Christoph and Kiefer, Stefan and Lohrey, Markus},
title = {{Counting Problems for Parikh Images}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {12:1--12:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.12},
URN = {urn:nbn:de:0030-drops-80597},
doi = {10.4230/LIPIcs.MFCS.2017.12},
annote = {Keywords: Parikh images, finite automata, counting problems}
}
@InProceedings{kolay_et_al:LIPIcs.MFCS.2017.13,
author = {Kolay, Sudeshna and Panolan, Fahad and Saurabh, Saket},
title = {{Communication Complexity of Pairs of Graph Families with Applications}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {13:1--13:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.13},
URN = {urn:nbn:de:0030-drops-80849},
doi = {10.4230/LIPIcs.MFCS.2017.13},
annote = {Keywords: Communication Complexity, Separating Family, FPT algorithms}
}
@InProceedings{paul:LIPIcs.MFCS.2017.14,
author = {Paul, Erik},
title = {{Monitor Logics for Quantitative Monitor Automata}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {14:1--14:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.14},
URN = {urn:nbn:de:0030-drops-81133},
doi = {10.4230/LIPIcs.MFCS.2017.14},
annote = {Keywords: Quantitative Monitor Automata, Nested Weighted Automata, Monitor Logics, Weighted Logics}
}
@InProceedings{klauck:LIPIcs.MFCS.2017.15,
author = {Klauck, Hartmut},
title = {{The Complexity of Quantum Disjointness}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {15:1--15:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.15},
URN = {urn:nbn:de:0030-drops-81010},
doi = {10.4230/LIPIcs.MFCS.2017.15},
annote = {Keywords: Communication Complexity, Quantum Proof Systems}
}
@InProceedings{deng_et_al:LIPIcs.MFCS.2017.16,
author = {Deng, Xiaotie and Gao, Yansong and Zhang, Jie},
title = {{Smoothed and Average-Case Approximation Ratios of Mechanisms: Beyond the Worst-Case Analysis}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {16:1--16:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.16},
URN = {urn:nbn:de:0030-drops-80936},
doi = {10.4230/LIPIcs.MFCS.2017.16},
annote = {Keywords: mechanism design, approximation ratio, smoothed analysis, average-case analysis}
}
@InProceedings{jonsson_et_al:LIPIcs.MFCS.2017.17,
author = {Jonsson, Peter and Lagerkvist, Victor and Roy, Biman},
title = {{Time Complexity of Constraint Satisfaction via Universal Algebra}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {17:1--17:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.17},
URN = {urn:nbn:de:0030-drops-80710},
doi = {10.4230/LIPIcs.MFCS.2017.17},
annote = {Keywords: Clone Theory, Universal Algebra, Constraint Satisfaction Problems}
}
@InProceedings{day_et_al:LIPIcs.MFCS.2017.18,
author = {Day, Joel D. and Manea, Florin and Nowotka, Dirk},
title = {{The Hardness of Solving Simple Word Equations}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {18:1--18:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.18},
URN = {urn:nbn:de:0030-drops-81233},
doi = {10.4230/LIPIcs.MFCS.2017.18},
annote = {Keywords: Word Equations, Regular Patterns, Regular Constraints}
}
@InProceedings{daviaud_et_al:LIPIcs.MFCS.2017.19,
author = {Daviaud, Laure and Guillon, Pierre and Merlet, Glenn},
title = {{Comparison of Max-Plus Automata and Joint Spectral Radius of Tropical Matrices}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {19:1--19:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.19},
URN = {urn:nbn:de:0030-drops-81052},
doi = {10.4230/LIPIcs.MFCS.2017.19},
annote = {Keywords: max-plus automata, max-plus matrices, weighted automata, tropical semiring, joint spectral radius, ultimate rank}
}
@InProceedings{deligkas_et_al:LIPIcs.MFCS.2017.20,
author = {Deligkas, Argyrios and Mertzios, George B. and Spirakis, Paul G.},
title = {{Binary Search in Graphs Revisited}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {20:1--20:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.20},
URN = {urn:nbn:de:0030-drops-80589},
doi = {10.4230/LIPIcs.MFCS.2017.20},
annote = {Keywords: binary search, graph, approximate query, probabilistic algorithm, lower bound.}
}
@InProceedings{jacobs_et_al:LIPIcs.MFCS.2017.21,
author = {Jacobs, Bart and Zanasi, Fabio},
title = {{A Formal Semantics of Influence in Bayesian Reasoning}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {21:1--21:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.21},
URN = {urn:nbn:de:0030-drops-80896},
doi = {10.4230/LIPIcs.MFCS.2017.21},
annote = {Keywords: probability distribution, Bayesian network, influence}
}
@InProceedings{lu_et_al:LIPIcs.MFCS.2017.22,
author = {Lu, Ping and Wu, Zhilin and Chen, Haiming},
title = {{The Complexity of SORE-definability Problems}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {22:1--22:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.22},
URN = {urn:nbn:de:0030-drops-80822},
doi = {10.4230/LIPIcs.MFCS.2017.22},
annote = {Keywords: Single occurrence regular expressions, Definability, Complexity}
}
@InProceedings{myasnikov_et_al:LIPIcs.MFCS.2017.23,
author = {Myasnikov, Alexei and Wei{\ss}, Armin},
title = {{TC^0 Circuits for Algorithmic Problems in Nilpotent Groups}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {23:1--23:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.23},
URN = {urn:nbn:de:0030-drops-81089},
doi = {10.4230/LIPIcs.MFCS.2017.23},
annote = {Keywords: nilpotent groups, TC^0, abelian groups, word problem, conjugacy problem, subgroup membership problem, greatest common divisors}
}
@InProceedings{allender_et_al:LIPIcs.MFCS.2017.24,
author = {Allender, Eric and Krebs, Andreas and McKenzie, Pierre},
title = {{Better Complexity Bounds for Cost Register Automata}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {24:1--24:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.24},
URN = {urn:nbn:de:0030-drops-80661},
doi = {10.4230/LIPIcs.MFCS.2017.24},
annote = {Keywords: computational complexity, cost registers}
}
@InProceedings{boissonnat_et_al:LIPIcs.MFCS.2017.25,
author = {Boissonnat, Jean-Daniel and Dutta, Kunal and Ghosh, Arijit and Kolay, Sudeshna},
title = {{Kernelization of the Subset General Position Problem in Geometry}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {25:1--25:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.25},
URN = {urn:nbn:de:0030-drops-80863},
doi = {10.4230/LIPIcs.MFCS.2017.25},
annote = {Keywords: Incidence Geometry, Kernel Lower bounds, Hyperplanes, Bounded degree polynomials}
}
@InProceedings{glinskih_et_al:LIPIcs.MFCS.2017.26,
author = {Glinskih, Ludmila and Itsykson, Dmitry},
title = {{Satisfiable Tseitin Formulas Are Hard for Nondeterministic Read-Once Branching Programs}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {26:1--26:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.26},
URN = {urn:nbn:de:0030-drops-80767},
doi = {10.4230/LIPIcs.MFCS.2017.26},
annote = {Keywords: Tseitin formula, read-once branching program, expander}
}
@InProceedings{carvalho_et_al:LIPIcs.MFCS.2017.27,
author = {Carvalho, Catarina and Martin, Barnaby and Zhuk, Dmitriy},
title = {{The Complexity of Quantified Constraints Using the Algebraic Formulation}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {27:1--27:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.27},
URN = {urn:nbn:de:0030-drops-80793},
doi = {10.4230/LIPIcs.MFCS.2017.27},
annote = {Keywords: Quantified Constraints, Computational Complexity, Universal Algebra, Constraint Satisfaction}
}
@InProceedings{milanic_et_al:LIPIcs.MFCS.2017.28,
author = {Milanic, Martin and Mursic, Peter and Mydlarz, Marcelo},
title = {{Induced Embeddings into Hamming Graphs}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {28:1--28:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.28},
URN = {urn:nbn:de:0030-drops-81289},
doi = {10.4230/LIPIcs.MFCS.2017.28},
annote = {Keywords: gridline graph, Hamming graph, induced embedding, NP-completeness, chordal graph}
}
@InProceedings{fomin_et_al:LIPIcs.MFCS.2017.29,
author = {Fomin, Fedor V. and Golovach, Petr A. and Thilikos, Dimitrios M.},
title = {{Structured Connectivity Augmentation}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {29:1--29:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.29},
URN = {urn:nbn:de:0030-drops-80603},
doi = {10.4230/LIPIcs.MFCS.2017.29},
annote = {Keywords: connectivity augmentation, graph superposition, complexity}
}
@InProceedings{casel_et_al:LIPIcs.MFCS.2017.30,
author = {Casel, Katrin and Fernau, Henning and Grigoriev, Alexander and Schmid, Markus L. and Whitesides, Sue},
title = {{Combinatorial Properties and Recognition of Unit Square Visibility Graphs}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {30:1--30:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.30},
URN = {urn:nbn:de:0030-drops-80770},
doi = {10.4230/LIPIcs.MFCS.2017.30},
annote = {Keywords: Visibility graphs, visibility layout, NP-completeness, exact algorithms}
}
@InProceedings{droste_et_al:LIPIcs.MFCS.2017.31,
author = {Droste, Manfred and D\"{u}ck, Stefan and Mandrioli, Dino and Pradella, Matteo},
title = {{Weighted Operator Precedence Languages}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {31:1--31:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.31},
URN = {urn:nbn:de:0030-drops-81150},
doi = {10.4230/LIPIcs.MFCS.2017.31},
annote = {Keywords: Quantitative automata, operator precedence languages, input-driven languages, visibly pushdown languages, quantitative logic}
}
@InProceedings{hella_et_al:LIPIcs.MFCS.2017.32,
author = {Hella, Lauri and Kuusisto, Antti and Meier, Arne and Virtema, Jonni},
title = {{Model Checking and Validity in Propositional and Modal Inclusion Logics}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {32:1--32:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.32},
URN = {urn:nbn:de:0030-drops-81007},
doi = {10.4230/LIPIcs.MFCS.2017.32},
annote = {Keywords: Inclusion Logic, Model Checking, Complexity}
}
@InProceedings{barth_et_al:LIPIcs.MFCS.2017.33,
author = {Barth, Dominik and Beck, Moritz and Dose, Titus and Gla{\ss}er, Christian and Michler, Larissa and Technau, Marc},
title = {{Emptiness Problems for Integer Circuits}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {33:1--33:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.33},
URN = {urn:nbn:de:0030-drops-80641},
doi = {10.4230/LIPIcs.MFCS.2017.33},
annote = {Keywords: computational complexity, integer expressions, integer circuits, polynomial identity testing}
}
@InProceedings{anglesdauriac_et_al:LIPIcs.MFCS.2017.34,
author = {Angl\`{e}s d'Auriac, Paul-Elliot and Monin, Benoit},
title = {{Another Characterization of the Higher K-Trivials}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {34:1--34:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.34},
URN = {urn:nbn:de:0030-drops-80837},
doi = {10.4230/LIPIcs.MFCS.2017.34},
annote = {Keywords: Algorithmic randomness, higher computability, K-triviality, effective descriptive set theory, Kolmogorov complexity}
}
@InProceedings{abramsky_et_al:LIPIcs.MFCS.2017.35,
author = {Abramsky, Samson and Barbosa, Rui Soares and de Silva, Nadish and Zapata, Octavio},
title = {{The Quantum Monad on Relational Structures}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {35:1--35:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.35},
URN = {urn:nbn:de:0030-drops-81290},
doi = {10.4230/LIPIcs.MFCS.2017.35},
annote = {Keywords: non-local games, quantum computation, monads}
}
@InProceedings{bergougnoux_et_al:LIPIcs.MFCS.2017.36,
author = {Bergougnoux, Benjamin and Eiben, Eduard and Ganian, Robert and Ordyniak, Sebastian and Ramanujan, M. S.},
title = {{Towards a Polynomial Kernel for Directed Feedback Vertex Set}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {36:1--36:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.36},
URN = {urn:nbn:de:0030-drops-81126},
doi = {10.4230/LIPIcs.MFCS.2017.36},
annote = {Keywords: parameterized algorithms, kernelization, (directed) feedback vertex set}
}
@InProceedings{avni_et_al:LIPIcs.MFCS.2017.37,
author = {Avni, Guy and Guha, Shibashis and Kupferman, Orna},
title = {{Timed Network Games}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {37:1--37:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.37},
URN = {urn:nbn:de:0030-drops-80675},
doi = {10.4230/LIPIcs.MFCS.2017.37},
annote = {Keywords: Network Games, Timed Automata, Nash Equilibrium, Equilibrium Inefficiency}
}
@InProceedings{arvind_et_al:LIPIcs.MFCS.2017.38,
author = {Arvind, Vikraman and Datta, Rajit and Mukhopadhyay, Partha and Raja, S.},
title = {{Efficient Identity Testing and Polynomial Factorization in Nonassociative Free Rings}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {38:1--38:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.38},
URN = {urn:nbn:de:0030-drops-80690},
doi = {10.4230/LIPIcs.MFCS.2017.38},
annote = {Keywords: Circuits, Nonassociative, Noncommutative, Polynomial Identity Testing, Factorization}
}
@InProceedings{chatterjee_et_al:LIPIcs.MFCS.2017.39,
author = {Chatterjee, Krishnendu and Henzinger, Monika and Svozil, Alexander},
title = {{Faster Algorithms for Mean-Payoff Parity Games}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {39:1--39:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.39},
URN = {urn:nbn:de:0030-drops-80809},
doi = {10.4230/LIPIcs.MFCS.2017.39},
annote = {Keywords: graph games, mean-payoff parity games}
}
@InProceedings{dzyga_et_al:LIPIcs.MFCS.2017.40,
author = {Dzyga, Michalina and Ferens, Robert and Gusev, Vladimir V. and Szykula, Marek},
title = {{Attainable Values of Reset Thresholds}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {40:1--40:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.40},
URN = {urn:nbn:de:0030-drops-81220},
doi = {10.4230/LIPIcs.MFCS.2017.40},
annote = {Keywords: Cerny conjecture, exponent, primitive digraph, reset word, synchronizing automaton}
}
@InProceedings{lagarde_et_al:LIPIcs.MFCS.2017.41,
author = {Lagarde, Guillaume and Limaye, Nutan and Srinivasan, Srikanth},
title = {{Lower Bounds and PIT for Non-Commutative Arithmetic Circuits with Restricted Parse Trees}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {41:1--41:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.41},
URN = {urn:nbn:de:0030-drops-81094},
doi = {10.4230/LIPIcs.MFCS.2017.41},
annote = {Keywords: Non-commutative Arithemetic circuits, Partial derivatives, restrictions}
}
@InProceedings{pilipczuk_et_al:LIPIcs.MFCS.2017.42,
author = {Pilipczuk, Michal and van Leeuwen, Erik Jan and Wiese, Andreas},
title = {{Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {42:1--42:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.42},
URN = {urn:nbn:de:0030-drops-80917},
doi = {10.4230/LIPIcs.MFCS.2017.42},
annote = {Keywords: Combinatorial optimization, Approximation algorithms, Fixed-parameter algorithms}
}
@InProceedings{urbat_et_al:LIPIcs.MFCS.2017.43,
author = {Urbat, Henning and Ad\'{a}mek, Jiri and Chen, Liang-Ting and Milius, Stefan},
title = {{Eilenberg Theorems for Free}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {43:1--43:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.43},
URN = {urn:nbn:de:0030-drops-81032},
doi = {10.4230/LIPIcs.MFCS.2017.43},
annote = {Keywords: Eilenberg's theorem, variety of languages, pseudovariety, monad, duality}
}
@InProceedings{potapov_et_al:LIPIcs.MFCS.2017.44,
author = {Potapov, Igor and Semukhin, Pavel},
title = {{Membership Problem in GL(2, Z) Extended by Singular Matrices}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {44:1--44:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.44},
URN = {urn:nbn:de:0030-drops-80737},
doi = {10.4230/LIPIcs.MFCS.2017.44},
annote = {Keywords: Matrix Semigroups, Membership Problem, General Linear Group, Singular Matrices, Automata and Formal Languages}
}
@InProceedings{nestra:LIPIcs.MFCS.2017.45,
author = {Nestra, H\"{a}rmel},
title = {{Grammars for Indentation-Sensitive Parsing}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {45:1--45:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.45},
URN = {urn:nbn:de:0030-drops-80788},
doi = {10.4230/LIPIcs.MFCS.2017.45},
annote = {Keywords: Parsing expression grammars, indentation, grammar transformation}
}
@InProceedings{mertzios_et_al:LIPIcs.MFCS.2017.46,
author = {Mertzios, George B. and Nichterlein, Andr\'{e} and Niedermeier, Rolf},
title = {{The Power of Linear-Time Data Reduction for Maximum Matching}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {46:1--46:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.46},
URN = {urn:nbn:de:0030-drops-81166},
doi = {10.4230/LIPIcs.MFCS.2017.46},
annote = {Keywords: Maximum-cardinality matching, bipartite graphs, linear-time algorithms, kernelization, parameterized complexity analysis, FPT in P}
}
@InProceedings{hoffmann_et_al:LIPIcs.MFCS.2017.47,
author = {Hoffmann, Michael and T\'{o}th, Csaba D.},
title = {{Two-Planar Graphs Are Quasiplanar}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {47:1--47:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.47},
URN = {urn:nbn:de:0030-drops-80811},
doi = {10.4230/LIPIcs.MFCS.2017.47},
annote = {Keywords: graph drawing, near-planar graph, simple topological plane graph}
}
@InProceedings{daviaud_et_al:LIPIcs.MFCS.2017.48,
author = {Daviaud, Laure and Johnson, Marianne},
title = {{The Shortest Identities for Max-Plus Automata with Two States}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {48:1--48:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.48},
URN = {urn:nbn:de:0030-drops-81048},
doi = {10.4230/LIPIcs.MFCS.2017.48},
annote = {Keywords: Max-plus automata, Weighted automata, Identities, Tropical matrices}
}
@InProceedings{atig_et_al:LIPIcs.MFCS.2017.49,
author = {Atig, Mohamed Faouzi and Meyer, Roland and Muskalla, Sebastian and Saivasan, Prakash},
title = {{On the Upward/Downward Closures of Petri Nets}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {49:1--49:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.49},
URN = {urn:nbn:de:0030-drops-81278},
doi = {10.4230/LIPIcs.MFCS.2017.49},
annote = {Keywords: Petri nets, BPP nets, downward closure, upward closure}
}
@InProceedings{hsu_et_al:LIPIcs.MFCS.2017.50,
author = {Hsu, Chloe Ching-Yun and Umans, Chris},
title = {{On Multidimensional and Monotone k-SUM}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {50:1--50:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.50},
URN = {urn:nbn:de:0030-drops-80618},
doi = {10.4230/LIPIcs.MFCS.2017.50},
annote = {Keywords: 3SUM, kSUM, monotone 3SUM, strong 3SUM conjecture}
}
@InProceedings{hatanaka_et_al:LIPIcs.MFCS.2017.51,
author = {Hatanaka, Tatsuhiko and Ito, Takehiro and Zhou, Xiao},
title = {{Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {51:1--51:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.51},
URN = {urn:nbn:de:0030-drops-81060},
doi = {10.4230/LIPIcs.MFCS.2017.51},
annote = {Keywords: combinatorial reconfiguration, fixed-parameter tractability, graph algorithm, list coloring, W\lbrack1\rbrack-hardness}
}
@InProceedings{colcombet_et_al:LIPIcs.MFCS.2017.52,
author = {Colcombet, Thomas and Petrisan, Daniela},
title = {{Automata in the Category of Glued Vector Spaces}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {52:1--52:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.52},
URN = {urn:nbn:de:0030-drops-81324},
doi = {10.4230/LIPIcs.MFCS.2017.52},
annote = {Keywords: hybrid set-vector automata, automata minimization in a category}
}
@InProceedings{paul:LIPIcs.MFCS.2017.53,
author = {Paul, Erik},
title = {{The Equivalence, Unambiguity and Sequentiality Problems of Finitely Ambiguous Max-Plus Tree Automata are Decidable}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {53:1--53:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.53},
URN = {urn:nbn:de:0030-drops-81147},
doi = {10.4230/LIPIcs.MFCS.2017.53},
annote = {Keywords: Tree Automata, Max-Plus Automata, Equivalence, Unambiguity, Sequentiality, Decidability}
}
@InProceedings{allender_et_al:LIPIcs.MFCS.2017.54,
author = {Allender, Eric and Hirahara, Shuichi},
title = {{New Insights on the (Non-)Hardness of Circuit Minimization and Related Problems}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {54:1--54:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.54},
URN = {urn:nbn:de:0030-drops-80636},
doi = {10.4230/LIPIcs.MFCS.2017.54},
annote = {Keywords: computational complexity, Kolmogorov complexity, circuit size}
}
@InProceedings{chatterjee_et_al:LIPIcs.MFCS.2017.55,
author = {Chatterjee, Krishnendu and Hansen, Kristoffer Arnsfelt and Ibsen-Jensen, Rasmus},
title = {{Strategy Complexity of Concurrent Safety Games}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {55:1--55:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.55},
URN = {urn:nbn:de:0030-drops-81203},
doi = {10.4230/LIPIcs.MFCS.2017.55},
annote = {Keywords: Concurrent games, Reachability and safety, Patience of strategies}
}
@InProceedings{cavallari_et_al:LIPIcs.MFCS.2017.56,
author = {Cavallari, Filippo and Michalewski, Henryk and Skrzypczak, Michal},
title = {{A Characterisation of Pi^0\underline2 Regular Tree Languages}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {56:1--56:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.56},
URN = {urn:nbn:de:0030-drops-80683},
doi = {10.4230/LIPIcs.MFCS.2017.56},
annote = {Keywords: infinite trees, Rabin-Mostowski hierarchy, regular languages}
}
@InProceedings{dey_et_al:LIPIcs.MFCS.2017.57,
author = {Dey, Palash and Misra, Neeldhara},
title = {{On the Exact Amount of Missing Information that Makes Finding Possible Winners Hard}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {57:1--57:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.57},
URN = {urn:nbn:de:0030-drops-81354},
doi = {10.4230/LIPIcs.MFCS.2017.57},
annote = {Keywords: Computational Social Choice, Dichotomy, NP-completeness, Maxflow, Voting, Possible winner}
}
@InProceedings{lutz:LIPIcs.MFCS.2017.58,
author = {Lutz, Neil},
title = {{Fractal Intersections and Products via Algorithmic Dimension}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {58:1--58:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.58},
URN = {urn:nbn:de:0030-drops-80875},
doi = {10.4230/LIPIcs.MFCS.2017.58},
annote = {Keywords: algorithmic randomness, geometric measure theory, Hausdorff dimension, Kolmogorov complexity}
}
@InProceedings{hague_et_al:LIPIcs.MFCS.2017.59,
author = {Hague, Matthew and Meyer, Roland and Muskalla, Sebastian},
title = {{Domains for Higher-Order Games}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {59:1--59:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.59},
URN = {urn:nbn:de:0030-drops-81409},
doi = {10.4230/LIPIcs.MFCS.2017.59},
annote = {Keywords: higher-order recursion schemes, games, semantics, abstract interpretation, fixed points}
}
@InProceedings{agrawal:LIPIcs.MFCS.2017.60,
author = {Agrawal, Akanksha},
title = {{Fine-Grained Complexity of Rainbow Coloring and its Variants}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {60:1--60:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.60},
URN = {urn:nbn:de:0030-drops-80990},
doi = {10.4230/LIPIcs.MFCS.2017.60},
annote = {Keywords: Rainbow Coloring, Lower bound, ETH, Fine-grained Complexity}
}
@InProceedings{chatterjee_et_al:LIPIcs.MFCS.2017.61,
author = {Chatterjee, Krishnendu and Ibsen-Jensen, Rasmus and Nowak, Martin A.},
title = {{Faster Monte-Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {61:1--61:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.61},
URN = {urn:nbn:de:0030-drops-81213},
doi = {10.4230/LIPIcs.MFCS.2017.61},
annote = {Keywords: Graph algorithms, Evolutionary biology, Monte-Carlo algorithms}
}
@InProceedings{yamakami:LIPIcs.MFCS.2017.62,
author = {Yamakami, Tomoyuki},
title = {{The 2CNF Boolean Formula Satisfiability Problem and the Linear Space Hypothesis}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {62:1--62:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.62},
URN = {urn:nbn:de:0030-drops-81344},
doi = {10.4230/LIPIcs.MFCS.2017.62},
annote = {Keywords: sub-linear space, linear space hypothesis, short reduction, Boolean formula satisfiability problem, NL search, NL optimization, Syntactic NL}
}
@InProceedings{ghani_et_al:LIPIcs.MFCS.2017.63,
author = {Ghani, Neil and McBride, Conor and Nordvall Forsberg, Fredrik and Spahn, Stephan},
title = {{Variations on Inductive-Recursive Definitions}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {63:1--63:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.63},
URN = {urn:nbn:de:0030-drops-81184},
doi = {10.4230/LIPIcs.MFCS.2017.63},
annote = {Keywords: Type Theory, induction-recursion, initial-algebra semantics}
}
@InProceedings{kieronski_et_al:LIPIcs.MFCS.2017.64,
author = {Kieronski, Emanuel and Kuusisto, Antti},
title = {{One-Dimensional Logic over Trees}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {64:1--64:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.64},
URN = {urn:nbn:de:0030-drops-80658},
doi = {10.4230/LIPIcs.MFCS.2017.64},
annote = {Keywords: satisfiability, expressivity, trees, fragments of first-order logic}
}
@InProceedings{li_et_al:LIPIcs.MFCS.2017.65,
author = {Li, Shaohua and Feng, Qilong and Meng, Xiangzhong and Wang, Jianxin},
title = {{An Improved FPT Algorithm for the Flip Distance Problem}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {65:1--65:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.65},
URN = {urn:nbn:de:0030-drops-81100},
doi = {10.4230/LIPIcs.MFCS.2017.65},
annote = {Keywords: triangulation, flip distance, FPT algorithm}
}
@InProceedings{brunet:LIPIcs.MFCS.2017.66,
author = {Brunet, Paul},
title = {{Reversible Kleene lattices}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {66:1--66:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.66},
URN = {urn:nbn:de:0030-drops-81334},
doi = {10.4230/LIPIcs.MFCS.2017.66},
annote = {Keywords: Kleene algebra, Automata, Petri nets, Decidability, Complexity, Formal languages, Lattice}
}
@InProceedings{eiben_et_al:LIPIcs.MFCS.2017.67,
author = {Eiben, Eduard and Hermelin, Danny and Ramanujan, M. S.},
title = {{Lossy Kernels for Hitting Subgraphs}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {67:1--67:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.67},
URN = {urn:nbn:de:0030-drops-80955},
doi = {10.4230/LIPIcs.MFCS.2017.67},
annote = {Keywords: parameterized algorithms, lossy kernelization, graph theory}
}
@InProceedings{kahn:LIPIcs.MFCS.2017.68,
author = {Kahn, David M.},
title = {{Undecidable Problems for Probabilistic Network Programming}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {68:1--68:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.68},
URN = {urn:nbn:de:0030-drops-80969},
doi = {10.4230/LIPIcs.MFCS.2017.68},
annote = {Keywords: Software-defined networking, NetKAT, ProbNetKAT, Undecidability, Probabilistic finite automata}
}
@InProceedings{vikas:LIPIcs.MFCS.2017.69,
author = {Vikas, Narayan},
title = {{Computational Complexity of Graph Partition under Vertex-Compaction to an Irreflexive Hexagon}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {69:1--69:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.69},
URN = {urn:nbn:de:0030-drops-81374},
doi = {10.4230/LIPIcs.MFCS.2017.69},
annote = {Keywords: computational complexity, algorithms, graph, partition, colouring, homomorphism, retraction, compaction, vertex-compaction}
}
@InProceedings{bonamy_et_al:LIPIcs.MFCS.2017.70,
author = {Bonamy, Marthe and Dabrowski, Konrad K. and Feghali, Carl and Johnson, Matthew and Paulusma, Dani\"{e}l},
title = {{Recognizing Graphs Close to Bipartite Graphs}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {70:1--70:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.70},
URN = {urn:nbn:de:0030-drops-80740},
doi = {10.4230/LIPIcs.MFCS.2017.70},
annote = {Keywords: degenerate graphs, near-bipartite graphs, reconfiguration graphs}
}
@InProceedings{gupta_et_al:LIPIcs.MFCS.2017.71,
author = {Gupta, Sushmita and Roy, Sanjukta and Saurabh, Saket and Zehavi, Meirav},
title = {{Parameterized Algorithms and Kernels for Rainbow Matching}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {71:1--71:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.71},
URN = {urn:nbn:de:0030-drops-81245},
doi = {10.4230/LIPIcs.MFCS.2017.71},
annote = {Keywords: Rainbow Matching, Parameterized Algorithm, Bounded Search Trees, Divide-and-Conquer, 3-Set Packing, 3-Dimensional Matching}
}
@InProceedings{lanotte_et_al:LIPIcs.MFCS.2017.72,
author = {Lanotte, Ruggero and Merro, Massimo and Tini, Simone},
title = {{Compositional Weak Metrics for Group Key Update}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {72:1--72:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.72},
URN = {urn:nbn:de:0030-drops-81262},
doi = {10.4230/LIPIcs.MFCS.2017.72},
annote = {Keywords: Behavioural metric, compositional reasoning, group key update}
}
@InProceedings{blanche_et_al:LIPIcs.MFCS.2017.73,
author = {Blanch\'{e}, Alexandre and Dabrowski, Konrad K. and Johnson, Matthew and Lozin, Vadim V. and Paulusma, Dani\"{e}l and Zamaraev, Viktor},
title = {{Clique-Width for Graph Classes Closed under Complementation}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {73:1--73:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.73},
URN = {urn:nbn:de:0030-drops-80756},
doi = {10.4230/LIPIcs.MFCS.2017.73},
annote = {Keywords: clique-width, self-complementary graph, forbidden induced subgraph}
}
@InProceedings{mahajan_et_al:LIPIcs.MFCS.2017.74,
author = {Mahajan, Meena and Nimbhorkar, Prajakta and Tawari, Anuj},
title = {{Computing the Maximum using (min, +) Formulas}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {74:1--74:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.74},
URN = {urn:nbn:de:0030-drops-80706},
doi = {10.4230/LIPIcs.MFCS.2017.74},
annote = {Keywords: Formulas, Circuits, Lower bounds, Tropical semiring}
}
@InProceedings{dangelo_et_al:LIPIcs.MFCS.2017.75,
author = {D'Angelo, Gianlorenzo and Severini, Lorenzo and Velaj, Yllka},
title = {{Selecting Nodes and Buying Links to Maximize the Information Diffusion in a Network}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {75:1--75:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.75},
URN = {urn:nbn:de:0030-drops-80853},
doi = {10.4230/LIPIcs.MFCS.2017.75},
annote = {Keywords: Approximation algorithms, information diffusion, complex networks, independent cascade model, network augmentation}
}
@InProceedings{cosmellopez_et_al:LIPIcs.MFCS.2017.76,
author = {Cosme Ll\'{o}pez, Enric and Pous, Damien},
title = {{K4-free Graphs as a Free Algebra}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {76:1--76:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.76},
URN = {urn:nbn:de:0030-drops-80883},
doi = {10.4230/LIPIcs.MFCS.2017.76},
annote = {Keywords: Universal Algebra, Graph theory, Axiomatisation, Tree decompositions, Graph minors}
}
@InProceedings{krishna_et_al:LIPIcs.MFCS.2017.77,
author = {Krishna, Shankara Narayanan and Madnani, Khushraj and Pandya, Paritosh K.},
title = {{Making Metric Temporal Logic Rational}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {77:1--77:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.77},
URN = {urn:nbn:de:0030-drops-81112},
doi = {10.4230/LIPIcs.MFCS.2017.77},
annote = {Keywords: Metric Temporal Logic, Timed Automata, Regular Expression, Equisatisfiability, Expressiveness}
}
@InProceedings{s._et_al:LIPIcs.MFCS.2017.78,
author = {S., Akshay and Balaji, Nikhil and Vyas, Nikhil},
title = {{Complexity of Restricted Variants of Skolem and Related Problems}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {78:1--78:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.78},
URN = {urn:nbn:de:0030-drops-81306},
doi = {10.4230/LIPIcs.MFCS.2017.78},
annote = {Keywords: Linear recurrence sequences, Skolem problem, NP-completeness, Program termination}
}
@InProceedings{muzi_et_al:LIPIcs.MFCS.2017.79,
author = {Muzi, Irene and O'Brien, Michael P. and Reidl, Felix and Sullivan, Blair D.},
title = {{Being Even Slightly Shallow Makes Life Hard}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {79:1--79:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.79},
URN = {urn:nbn:de:0030-drops-81257},
doi = {10.4230/LIPIcs.MFCS.2017.79},
annote = {Keywords: Topological minors, NP Completeness, Treewidth, ETH, FPT algorithms}
}
@InProceedings{branzei_et_al:LIPIcs.MFCS.2017.80,
author = {Br\^{a}nzei, Simina and Filos-Ratsikas, Aris and Miltersen, Peter Bro and Zeng, Yulong},
title = {{Walrasian Pricing in Multi-Unit Auctions}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {80:1--80:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.80},
URN = {urn:nbn:de:0030-drops-81197},
doi = {10.4230/LIPIcs.MFCS.2017.80},
annote = {Keywords: mechanism design, multi-unit auctions, Walrasian pricing, market share}
}
@InProceedings{castellan_et_al:LIPIcs.MFCS.2017.81,
author = {Castellan, Simon and Clairambault, Pierre and Winskel, Glynn},
title = {{Distributed Strategies Made Easy}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {81:1--81:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.81},
URN = {urn:nbn:de:0030-drops-81315},
doi = {10.4230/LIPIcs.MFCS.2017.81},
annote = {Keywords: Games, Strategies, Event Structures, Probability}
}
@InProceedings{pilipczuk:LIPIcs.MFCS.2017.82,
author = {Pilipczuk, Michal},
title = {{On Definable and Recognizable Properties of Graphs of Bounded Treewidth}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {82:1--82:2},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.82},
URN = {urn:nbn:de:0030-drops-81384},
doi = {10.4230/LIPIcs.MFCS.2017.82},
annote = {Keywords: monadic second-order logic, treewidth, recognizability}
}
@InProceedings{pagh:LIPIcs.MFCS.2017.83,
author = {Pagh, Rasmus},
title = {{Hardness and Approximation of High-Dimensional Search Problems}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {83:1--83:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.83},
URN = {urn:nbn:de:0030-drops-81416},
doi = {10.4230/LIPIcs.MFCS.2017.83},
annote = {Keywords: Hardness, high-dimensional search}
}
@InProceedings{markey:LIPIcs.MFCS.2017.84,
author = {Markey, Nicolas},
title = {{Temporal Logics for Multi-Agent Systems}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {84:1--84:3},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.84},
URN = {urn:nbn:de:0030-drops-81368},
doi = {10.4230/LIPIcs.MFCS.2017.84},
annote = {Keywords: Temporal logics, verification, game theory, strategic reasoning.}
}
@InProceedings{schnoebelen:LIPIcs.MFCS.2017.85,
author = {Schnoebelen, Philippe},
title = {{Ideal-Based Algorithms for the Symbolic Verification of Well-Structured Systems}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {85:1--85:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.85},
URN = {urn:nbn:de:0030-drops-81393},
doi = {10.4230/LIPIcs.MFCS.2017.85},
annote = {Keywords: Well-structured systems and verification, Order theory}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing