<h2>LIPIcs, Volume 83, MFCS 2017</h2>
<ul>
<li>
<span class="authors">Kim G. Larsen, Hans L. Bodlaender, and Jean-Francois Raskin</span>
<span class="title">LIPIcs, Volume 83, MFCS'17, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017">10.4230/LIPIcs.MFCS.2017</a>
</li>
<li>
<span class="authors">Kim G. Larsen, Hans L. Bodlaender, and Jean-Francois Raskin</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.0">10.4230/LIPIcs.MFCS.2017.0</a>
</li>
<li>
<span class="authors">Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova, Pierre McKenzie, and Shadab Romani</span>
<span class="title">Does Looking Inside a Circuit Help?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.1">10.4230/LIPIcs.MFCS.2017.1</a>
</li>
<li>
<span class="authors">Nathan Grosshans, Pierre McKenzie, and Luc Segoufin</span>
<span class="title">The Power of Programs over Monoids in DA</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.2">10.4230/LIPIcs.MFCS.2017.2</a>
</li>
<li>
<span class="authors">Austin J. Parker, Kelly B. Yancey, and Matthew P. Yancey</span>
<span class="title">Regular Language Distance and Entropy</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.3">10.4230/LIPIcs.MFCS.2017.3</a>
</li>
<li>
<span class="authors">Peter Fulla and Stanislav Zivny</span>
<span class="title">The Complexity of Boolean Surjective General-Valued CSPs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.4">10.4230/LIPIcs.MFCS.2017.4</a>
</li>
<li>
<span class="authors">Bruno Durand and Andrei Romashchenko</span>
<span class="title">On the Expressive Power of Quasiperiodic SFT</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.5">10.4230/LIPIcs.MFCS.2017.5</a>
</li>
<li>
<span class="authors">Ivan Bliznets and Nikolai Karpov</span>
<span class="title">Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.6">10.4230/LIPIcs.MFCS.2017.6</a>
</li>
<li>
<span class="authors">Thijs Laarhoven</span>
<span class="title">Hypercube LSH for Approximate near Neighbors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.7">10.4230/LIPIcs.MFCS.2017.7</a>
</li>
<li>
<span class="authors">Akinori Kawachi, Mitsunori Ogihara, and Kei Uchizawa</span>
<span class="title">Generalized Predecessor Existence Problems for Boolean Finite Dynamical Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.8">10.4230/LIPIcs.MFCS.2017.8</a>
</li>
<li>
<span class="authors">Peter Damaschke</span>
<span class="title">Dividing Splittable Goods Evenly and With Limited Fragmentation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.9">10.4230/LIPIcs.MFCS.2017.9</a>
</li>
<li>
<span class="authors">Yuka Tanimura, Takaaki Nishimoto, Hideo Bannai, Shunsuke Inenaga, and Masayuki Takeda</span>
<span class="title">Small-Space LCE Data Structure with Constant-Time Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.10">10.4230/LIPIcs.MFCS.2017.10</a>
</li>
<li>
<span class="authors">Emmanuel Jeandel, Simon Perdrix, Renaud Vilmart, and Quanlong Wang</span>
<span class="title">ZX-Calculus: Cyclotomic Supplementarity and Incompleteness for Clifford+T Quantum Mechanics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.11">10.4230/LIPIcs.MFCS.2017.11</a>
</li>
<li>
<span class="authors">Christoph Haase, Stefan Kiefer, and Markus Lohrey</span>
<span class="title">Counting Problems for Parikh Images</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.12">10.4230/LIPIcs.MFCS.2017.12</a>
</li>
<li>
<span class="authors">Sudeshna Kolay, Fahad Panolan, and Saket Saurabh</span>
<span class="title">Communication Complexity of Pairs of Graph Families with Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.13">10.4230/LIPIcs.MFCS.2017.13</a>
</li>
<li>
<span class="authors">Erik Paul</span>
<span class="title">Monitor Logics for Quantitative Monitor Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.14">10.4230/LIPIcs.MFCS.2017.14</a>
</li>
<li>
<span class="authors">Hartmut Klauck</span>
<span class="title">The Complexity of Quantum Disjointness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.15">10.4230/LIPIcs.MFCS.2017.15</a>
</li>
<li>
<span class="authors">Xiaotie Deng, Yansong Gao, and Jie Zhang</span>
<span class="title">Smoothed and Average-Case Approximation Ratios of Mechanisms: Beyond the Worst-Case Analysis</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.16">10.4230/LIPIcs.MFCS.2017.16</a>
</li>
<li>
<span class="authors">Peter Jonsson, Victor Lagerkvist, and Biman Roy</span>
<span class="title">Time Complexity of Constraint Satisfaction via Universal Algebra</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.17">10.4230/LIPIcs.MFCS.2017.17</a>
</li>
<li>
<span class="authors">Joel D. Day, Florin Manea, and Dirk Nowotka</span>
<span class="title">The Hardness of Solving Simple Word Equations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.18">10.4230/LIPIcs.MFCS.2017.18</a>
</li>
<li>
<span class="authors">Laure Daviaud, Pierre Guillon, and Glenn Merlet</span>
<span class="title">Comparison of Max-Plus Automata and Joint Spectral Radius of Tropical Matrices</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.19">10.4230/LIPIcs.MFCS.2017.19</a>
</li>
<li>
<span class="authors">Argyrios Deligkas, George B. Mertzios, and Paul G. Spirakis</span>
<span class="title">Binary Search in Graphs Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.20">10.4230/LIPIcs.MFCS.2017.20</a>
</li>
<li>
<span class="authors">Bart Jacobs and Fabio Zanasi</span>
<span class="title">A Formal Semantics of Influence in Bayesian Reasoning</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.21">10.4230/LIPIcs.MFCS.2017.21</a>
</li>
<li>
<span class="authors">Ping Lu, Zhilin Wu, and Haiming Chen</span>
<span class="title">The Complexity of SORE-definability Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.22">10.4230/LIPIcs.MFCS.2017.22</a>
</li>
<li>
<span class="authors">Alexei Myasnikov and Armin Weiß</span>
<span class="title">TC^0 Circuits for Algorithmic Problems in Nilpotent Groups</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.23">10.4230/LIPIcs.MFCS.2017.23</a>
</li>
<li>
<span class="authors">Eric Allender, Andreas Krebs, and Pierre McKenzie</span>
<span class="title">Better Complexity Bounds for Cost Register Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.24">10.4230/LIPIcs.MFCS.2017.24</a>
</li>
<li>
<span class="authors">Jean-Daniel Boissonnat, Kunal Dutta, Arijit Ghosh, and Sudeshna Kolay</span>
<span class="title">Kernelization of the Subset General Position Problem in Geometry</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.25">10.4230/LIPIcs.MFCS.2017.25</a>
</li>
<li>
<span class="authors">Ludmila Glinskih and Dmitry Itsykson</span>
<span class="title">Satisfiable Tseitin Formulas Are Hard for Nondeterministic Read-Once Branching Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.26">10.4230/LIPIcs.MFCS.2017.26</a>
</li>
<li>
<span class="authors">Catarina Carvalho, Barnaby Martin, and Dmitriy Zhuk</span>
<span class="title">The Complexity of Quantified Constraints Using the Algebraic Formulation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.27">10.4230/LIPIcs.MFCS.2017.27</a>
</li>
<li>
<span class="authors">Martin Milanic, Peter Mursic, and Marcelo Mydlarz</span>
<span class="title">Induced Embeddings into Hamming Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.28">10.4230/LIPIcs.MFCS.2017.28</a>
</li>
<li>
<span class="authors">Fedor V. Fomin, Petr A. Golovach, and Dimitrios M. Thilikos</span>
<span class="title">Structured Connectivity Augmentation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.29">10.4230/LIPIcs.MFCS.2017.29</a>
</li>
<li>
<span class="authors">Katrin Casel, Henning Fernau, Alexander Grigoriev, Markus L. Schmid, and Sue Whitesides</span>
<span class="title">Combinatorial Properties and Recognition of Unit Square Visibility Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.30">10.4230/LIPIcs.MFCS.2017.30</a>
</li>
<li>
<span class="authors">Manfred Droste, Stefan Dück, Dino Mandrioli, and Matteo Pradella</span>
<span class="title">Weighted Operator Precedence Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.31">10.4230/LIPIcs.MFCS.2017.31</a>
</li>
<li>
<span class="authors">Lauri Hella, Antti Kuusisto, Arne Meier, and Jonni Virtema</span>
<span class="title">Model Checking and Validity in Propositional and Modal Inclusion Logics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.32">10.4230/LIPIcs.MFCS.2017.32</a>
</li>
<li>
<span class="authors">Dominik Barth, Moritz Beck, Titus Dose, Christian Glaßer, Larissa Michler, and Marc Technau</span>
<span class="title">Emptiness Problems for Integer Circuits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.33">10.4230/LIPIcs.MFCS.2017.33</a>
</li>
<li>
<span class="authors">Paul-Elliot Anglès d'Auriac and Benoit Monin</span>
<span class="title">Another Characterization of the Higher K-Trivials</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.34">10.4230/LIPIcs.MFCS.2017.34</a>
</li>
<li>
<span class="authors">Samson Abramsky, Rui Soares Barbosa, Nadish de Silva, and Octavio Zapata</span>
<span class="title">The Quantum Monad on Relational Structures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.35">10.4230/LIPIcs.MFCS.2017.35</a>
</li>
<li>
<span class="authors">Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, and M. S. Ramanujan</span>
<span class="title">Towards a Polynomial Kernel for Directed Feedback Vertex Set</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.36">10.4230/LIPIcs.MFCS.2017.36</a>
</li>
<li>
<span class="authors">Guy Avni, Shibashis Guha, and Orna Kupferman</span>
<span class="title">Timed Network Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.37">10.4230/LIPIcs.MFCS.2017.37</a>
</li>
<li>
<span class="authors">Vikraman Arvind, Rajit Datta, Partha Mukhopadhyay, and S. Raja</span>
<span class="title">Efficient Identity Testing and Polynomial Factorization in Nonassociative Free Rings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.38">10.4230/LIPIcs.MFCS.2017.38</a>
</li>
<li>
<span class="authors">Krishnendu Chatterjee, Monika Henzinger, and Alexander Svozil</span>
<span class="title">Faster Algorithms for Mean-Payoff Parity Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.39">10.4230/LIPIcs.MFCS.2017.39</a>
</li>
<li>
<span class="authors">Michalina Dzyga, Robert Ferens, Vladimir V. Gusev, and Marek Szykula</span>
<span class="title">Attainable Values of Reset Thresholds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.40">10.4230/LIPIcs.MFCS.2017.40</a>
</li>
<li>
<span class="authors">Guillaume Lagarde, Nutan Limaye, and Srikanth Srinivasan</span>
<span class="title">Lower Bounds and PIT for Non-Commutative Arithmetic Circuits with Restricted Parse Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.41">10.4230/LIPIcs.MFCS.2017.41</a>
</li>
<li>
<span class="authors">Michal Pilipczuk, Erik Jan van Leeuwen, and Andreas Wiese</span>
<span class="title">Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.42">10.4230/LIPIcs.MFCS.2017.42</a>
</li>
<li>
<span class="authors">Henning Urbat, Jiri Adámek, Liang-Ting Chen, and Stefan Milius</span>
<span class="title">Eilenberg Theorems for Free</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.43">10.4230/LIPIcs.MFCS.2017.43</a>
</li>
<li>
<span class="authors">Igor Potapov and Pavel Semukhin</span>
<span class="title">Membership Problem in GL(2, Z) Extended by Singular Matrices</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.44">10.4230/LIPIcs.MFCS.2017.44</a>
</li>
<li>
<span class="authors">Härmel Nestra</span>
<span class="title">Grammars for Indentation-Sensitive Parsing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.45">10.4230/LIPIcs.MFCS.2017.45</a>
</li>
<li>
<span class="authors">George B. Mertzios, André Nichterlein, and Rolf Niedermeier</span>
<span class="title">The Power of Linear-Time Data Reduction for Maximum Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.46">10.4230/LIPIcs.MFCS.2017.46</a>
</li>
<li>
<span class="authors">Michael Hoffmann and Csaba D. Tóth</span>
<span class="title">Two-Planar Graphs Are Quasiplanar</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.47">10.4230/LIPIcs.MFCS.2017.47</a>
</li>
<li>
<span class="authors">Laure Daviaud and Marianne Johnson</span>
<span class="title">The Shortest Identities for Max-Plus Automata with Two States</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.48">10.4230/LIPIcs.MFCS.2017.48</a>
</li>
<li>
<span class="authors">Mohamed Faouzi Atig, Roland Meyer, Sebastian Muskalla, and Prakash Saivasan</span>
<span class="title">On the Upward/Downward Closures of Petri Nets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.49">10.4230/LIPIcs.MFCS.2017.49</a>
</li>
<li>
<span class="authors">Chloe Ching-Yun Hsu and Chris Umans</span>
<span class="title">On Multidimensional and Monotone k-SUM</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.50">10.4230/LIPIcs.MFCS.2017.50</a>
</li>
<li>
<span class="authors">Tatsuhiko Hatanaka, Takehiro Ito, and Xiao Zhou</span>
<span class="title">Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.51">10.4230/LIPIcs.MFCS.2017.51</a>
</li>
<li>
<span class="authors">Thomas Colcombet and Daniela Petrisan</span>
<span class="title">Automata in the Category of Glued Vector Spaces</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.52">10.4230/LIPIcs.MFCS.2017.52</a>
</li>
<li>
<span class="authors">Erik Paul</span>
<span class="title">The Equivalence, Unambiguity and Sequentiality Problems of Finitely Ambiguous Max-Plus Tree Automata are Decidable</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.53">10.4230/LIPIcs.MFCS.2017.53</a>
</li>
<li>
<span class="authors">Eric Allender and Shuichi Hirahara</span>
<span class="title">New Insights on the (Non-)Hardness of Circuit Minimization and Related Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.54">10.4230/LIPIcs.MFCS.2017.54</a>
</li>
<li>
<span class="authors">Krishnendu Chatterjee, Kristoffer Arnsfelt Hansen, and Rasmus Ibsen-Jensen</span>
<span class="title">Strategy Complexity of Concurrent Safety Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.55">10.4230/LIPIcs.MFCS.2017.55</a>
</li>
<li>
<span class="authors">Filippo Cavallari, Henryk Michalewski, and Michal Skrzypczak</span>
<span class="title">A Characterisation of Pi^0_2 Regular Tree Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.56">10.4230/LIPIcs.MFCS.2017.56</a>
</li>
<li>
<span class="authors">Palash Dey and Neeldhara Misra</span>
<span class="title">On the Exact Amount of Missing Information that Makes Finding Possible Winners Hard</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.57">10.4230/LIPIcs.MFCS.2017.57</a>
</li>
<li>
<span class="authors">Neil Lutz</span>
<span class="title">Fractal Intersections and Products via Algorithmic Dimension</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.58">10.4230/LIPIcs.MFCS.2017.58</a>
</li>
<li>
<span class="authors">Matthew Hague, Roland Meyer, and Sebastian Muskalla</span>
<span class="title">Domains for Higher-Order Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.59">10.4230/LIPIcs.MFCS.2017.59</a>
</li>
<li>
<span class="authors">Akanksha Agrawal</span>
<span class="title">Fine-Grained Complexity of Rainbow Coloring and its Variants</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.60">10.4230/LIPIcs.MFCS.2017.60</a>
</li>
<li>
<span class="authors">Krishnendu Chatterjee, Rasmus Ibsen-Jensen, and Martin A. Nowak</span>
<span class="title">Faster Monte-Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.61">10.4230/LIPIcs.MFCS.2017.61</a>
</li>
<li>
<span class="authors">Tomoyuki Yamakami</span>
<span class="title">The 2CNF Boolean Formula Satisfiability Problem and the Linear Space Hypothesis</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.62">10.4230/LIPIcs.MFCS.2017.62</a>
</li>
<li>
<span class="authors">Neil Ghani, Conor McBride, Fredrik Nordvall Forsberg, and Stephan Spahn</span>
<span class="title">Variations on Inductive-Recursive Definitions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.63">10.4230/LIPIcs.MFCS.2017.63</a>
</li>
<li>
<span class="authors">Emanuel Kieronski and Antti Kuusisto</span>
<span class="title">One-Dimensional Logic over Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.64">10.4230/LIPIcs.MFCS.2017.64</a>
</li>
<li>
<span class="authors">Shaohua Li, Qilong Feng, Xiangzhong Meng, and Jianxin Wang</span>
<span class="title">An Improved FPT Algorithm for the Flip Distance Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.65">10.4230/LIPIcs.MFCS.2017.65</a>
</li>
<li>
<span class="authors">Paul Brunet</span>
<span class="title">Reversible Kleene lattices</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.66">10.4230/LIPIcs.MFCS.2017.66</a>
</li>
<li>
<span class="authors">Eduard Eiben, Danny Hermelin, and M. S. Ramanujan</span>
<span class="title">Lossy Kernels for Hitting Subgraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.67">10.4230/LIPIcs.MFCS.2017.67</a>
</li>
<li>
<span class="authors">David M. Kahn</span>
<span class="title">Undecidable Problems for Probabilistic Network Programming</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.68">10.4230/LIPIcs.MFCS.2017.68</a>
</li>
<li>
<span class="authors">Narayan Vikas</span>
<span class="title">Computational Complexity of Graph Partition under Vertex-Compaction to an Irreflexive Hexagon</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.69">10.4230/LIPIcs.MFCS.2017.69</a>
</li>
<li>
<span class="authors">Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, and Daniël Paulusma</span>
<span class="title">Recognizing Graphs Close to Bipartite Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.70">10.4230/LIPIcs.MFCS.2017.70</a>
</li>
<li>
<span class="authors">Sushmita Gupta, Sanjukta Roy, Saket Saurabh, and Meirav Zehavi</span>
<span class="title">Parameterized Algorithms and Kernels for Rainbow Matching</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.71">10.4230/LIPIcs.MFCS.2017.71</a>
</li>
<li>
<span class="authors">Ruggero Lanotte, Massimo Merro, and Simone Tini</span>
<span class="title">Compositional Weak Metrics for Group Key Update</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.72">10.4230/LIPIcs.MFCS.2017.72</a>
</li>
<li>
<span class="authors">Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson, Vadim V. Lozin, Daniël Paulusma, and Viktor Zamaraev</span>
<span class="title">Clique-Width for Graph Classes Closed under Complementation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.73">10.4230/LIPIcs.MFCS.2017.73</a>
</li>
<li>
<span class="authors">Meena Mahajan, Prajakta Nimbhorkar, and Anuj Tawari</span>
<span class="title">Computing the Maximum using (min, +) Formulas</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.74">10.4230/LIPIcs.MFCS.2017.74</a>
</li>
<li>
<span class="authors">Gianlorenzo D'Angelo, Lorenzo Severini, and Yllka Velaj</span>
<span class="title">Selecting Nodes and Buying Links to Maximize the Information Diffusion in a Network</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.75">10.4230/LIPIcs.MFCS.2017.75</a>
</li>
<li>
<span class="authors">Enric Cosme Llópez and Damien Pous</span>
<span class="title">K4-free Graphs as a Free Algebra</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.76">10.4230/LIPIcs.MFCS.2017.76</a>
</li>
<li>
<span class="authors">Shankara Narayanan Krishna, Khushraj Madnani, and Paritosh K. Pandya</span>
<span class="title">Making Metric Temporal Logic Rational</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.77">10.4230/LIPIcs.MFCS.2017.77</a>
</li>
<li>
<span class="authors">Akshay S., Nikhil Balaji, and Nikhil Vyas</span>
<span class="title">Complexity of Restricted Variants of Skolem and Related Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.78">10.4230/LIPIcs.MFCS.2017.78</a>
</li>
<li>
<span class="authors">Irene Muzi, Michael P. O'Brien, Felix Reidl, and Blair D. Sullivan</span>
<span class="title">Being Even Slightly Shallow Makes Life Hard</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.79">10.4230/LIPIcs.MFCS.2017.79</a>
</li>
<li>
<span class="authors">Simina Brânzei, Aris Filos-Ratsikas, Peter Bro Miltersen, and Yulong Zeng</span>
<span class="title">Walrasian Pricing in Multi-Unit Auctions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.80">10.4230/LIPIcs.MFCS.2017.80</a>
</li>
<li>
<span class="authors">Simon Castellan, Pierre Clairambault, and Glynn Winskel</span>
<span class="title">Distributed Strategies Made Easy</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.81">10.4230/LIPIcs.MFCS.2017.81</a>
</li>
<li>
<span class="authors">Michal Pilipczuk</span>
<span class="title">On Definable and Recognizable Properties of Graphs of Bounded Treewidth (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.82">10.4230/LIPIcs.MFCS.2017.82</a>
</li>
<li>
<span class="authors">Rasmus Pagh</span>
<span class="title">Hardness and Approximation of High-Dimensional Search Problems (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.83">10.4230/LIPIcs.MFCS.2017.83</a>
</li>
<li>
<span class="authors">Nicolas Markey</span>
<span class="title">Temporal Logics for Multi-Agent Systems (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.84">10.4230/LIPIcs.MFCS.2017.84</a>
</li>
<li>
<span class="authors">Philippe Schnoebelen</span>
<span class="title">Ideal-Based Algorithms for the Symbolic Verification of Well-Structured Systems (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2017.85">10.4230/LIPIcs.MFCS.2017.85</a>
</li>
</ul>
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