<h2>LIPIcs, Volume 58, MFCS 2016</h2>
<ul>
<li>
<span class="authors">Piotr Faliszewski, Anca Muscholl, and Rolf Niedermeier</span>
<span class="title">LIPIcs, Volume 58, MFCS'16, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016">10.4230/LIPIcs.MFCS.2016</a>
</li>
<li>
<span class="authors">Piotr Faliszewski, Anca Muscholl, and Rolf Niedermeier</span>
<span class="title">Front Matter, Foreword, Conference Organization, External Reviewers, Table of Contents</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.0">10.4230/LIPIcs.MFCS.2016.0</a>
</li>
<li>
<span class="authors">Shai Ben-David</span>
<span class="title">How Far Are We From Having a Satisfactory Theory of Clustering? (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.1">10.4230/LIPIcs.MFCS.2016.1</a>
</li>
<li>
<span class="authors">Mikolaj Bojanczyk</span>
<span class="title">Decidable Extensions of MSO (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.2">10.4230/LIPIcs.MFCS.2016.2</a>
</li>
<li>
<span class="authors">Patricia Bouyer-Decitre</span>
<span class="title">Optimal Reachability in Weighted Timed Automata and Games (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.3">10.4230/LIPIcs.MFCS.2016.3</a>
</li>
<li>
<span class="authors">Tobias Friedrich</span>
<span class="title">Scale-Free Networks, Hyperbolic Geometry, and Efficient Algorithms (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.4">10.4230/LIPIcs.MFCS.2016.4</a>
</li>
<li>
<span class="authors">Virginia Vassilevska Williams</span>
<span class="title">RNA-Folding - From Hardness to Algorithms (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.5">10.4230/LIPIcs.MFCS.2016.5</a>
</li>
<li>
<span class="authors">Manindra Agrawal, Nitin Saxena, and Shubham Sahai Srivastava</span>
<span class="title">Integer Factoring Using Small Algebraic Dependencies</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.6">10.4230/LIPIcs.MFCS.2016.6</a>
</li>
<li>
<span class="authors">Saeed Akhoondian Amiri, Stephan Kreutzer, Dániel Marx, and Roman Rabinovich</span>
<span class="title">Routing with Congestion in Acyclic Digraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.7">10.4230/LIPIcs.MFCS.2016.7</a>
</li>
<li>
<span class="authors">S. Akshay, Patricia Bouyer, Shankara Narayanan Krishna, Lakshmi Manasa, and Ashutosh Trivedi</span>
<span class="title">Stochastic Timed Games Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.8">10.4230/LIPIcs.MFCS.2016.8</a>
</li>
<li>
<span class="authors">Georgios Amanatidis, Evangelos Markakis, and Krzysztof Sornat</span>
<span class="title">Inequity Aversion Pricing over Social Networks: Approximation Algorithms and Hardness Results</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.9">10.4230/LIPIcs.MFCS.2016.9</a>
</li>
<li>
<span class="authors">Vivek Anand T Kallampally and Raghunath Tewari</span>
<span class="title">Trading Determinism for Time in Space Bounded Computations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.10">10.4230/LIPIcs.MFCS.2016.10</a>
</li>
<li>
<span class="authors">Dana Angluin, Udi Boker, and Dana Fisman</span>
<span class="title">Families of DFAs as Acceptors of omega-Regular Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.11">10.4230/LIPIcs.MFCS.2016.11</a>
</li>
<li>
<span class="authors">Itai Arad, Adam Bouland, Daniel Grier, Miklos Santha, Aarthi Sundaram, and Shengyu Zhang</span>
<span class="title">On the Complexity of Probabilistic Trials for Hidden Satisfiability Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.12">10.4230/LIPIcs.MFCS.2016.12</a>
</li>
<li>
<span class="authors">Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Sebastian Kuhnert, and Gaurav Rattan</span>
<span class="title">The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.13">10.4230/LIPIcs.MFCS.2016.13</a>
</li>
<li>
<span class="authors">Martijn Baartse and Klaus Meer</span>
<span class="title">Real Interactive Proofs for VPSPACE</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.14">10.4230/LIPIcs.MFCS.2016.14</a>
</li>
<li>
<span class="authors">Parvaneh Babari, Karin Quaas, and Mahsa Shirmohammadi</span>
<span class="title">Synchronizing Data Words for Register Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.15">10.4230/LIPIcs.MFCS.2016.15</a>
</li>
<li>
<span class="authors">Mitali Bafna, Satyanarayana V. Lokam, Sébastien Tavenas, and Ameya Velingker</span>
<span class="title">On the Sensitivity Conjecture for Read-k Formulas</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.16">10.4230/LIPIcs.MFCS.2016.16</a>
</li>
<li>
<span class="authors">Nikhil Balaji, Samir Datta, Raghav Kulkarni, and Supartha Podder</span>
<span class="title">Graph Properties in Node-Query Setting: Effect of Breaking Symmetry</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.17">10.4230/LIPIcs.MFCS.2016.17</a>
</li>
<li>
<span class="authors">Volker Betz and Stéphane Le Roux</span>
<span class="title">Stable States of Perturbed Markov Chains</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.18">10.4230/LIPIcs.MFCS.2016.18</a>
</li>
<li>
<span class="authors">Markus Bläser and Vladimir Lysikov</span>
<span class="title">On Degeneration of Tensors and Algebras</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.19">10.4230/LIPIcs.MFCS.2016.19</a>
</li>
<li>
<span class="authors">Paul Bonsma and Daniël Paulusma</span>
<span class="title">Using Contracted Solution Graphs for Solving Reconfiguration Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.20">10.4230/LIPIcs.MFCS.2016.20</a>
</li>
<li>
<span class="authors">Alex B. Grilo, Iordanis Kerenidis, and Attila Pereszlényi</span>
<span class="title">Pointer Quantum PCPs and Multi-Prover Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.21">10.4230/LIPIcs.MFCS.2016.21</a>
</li>
<li>
<span class="authors">Paul Brunet and Damien Pous</span>
<span class="title">A Formal Exploration of Nominal Kleene Algebra</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.22">10.4230/LIPIcs.MFCS.2016.22</a>
</li>
<li>
<span class="authors">Maurice Chandoo</span>
<span class="title">On the Implicit Graph Conjecture</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.23">10.4230/LIPIcs.MFCS.2016.23</a>
</li>
<li>
<span class="authors">Krishnendu Chatterjee, Thomas A. Henzinger, and Jan Otop</span>
<span class="title">Nested Weighted Limit-Average Automata of Bounded Width</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.24">10.4230/LIPIcs.MFCS.2016.24</a>
</li>
<li>
<span class="authors">Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, and Veronika Loitzenbauer</span>
<span class="title">Conditionally Optimal Algorithms for Generalized Büchi Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.25">10.4230/LIPIcs.MFCS.2016.25</a>
</li>
<li>
<span class="authors">Dimitris Chatzidimitriou, Archontia C. Giannopoulou, Spyridon Maniatis, Clément Requilé, Dimitrios M. Thilikos, and Dimitris Zoros</span>
<span class="title">FPT Algorithms for Plane Completion Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.26">10.4230/LIPIcs.MFCS.2016.26</a>
</li>
<li>
<span class="authors">Yijia Chen and Jörg Flum</span>
<span class="title">Some Lower Bounds in Parameterized AC^0</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.27">10.4230/LIPIcs.MFCS.2016.27</a>
</li>
<li>
<span class="authors">Samir Datta, Raghav Kulkarni, and Anish Mukherjee</span>
<span class="title">Space-Efficient Approximation Scheme for Maximum Matching in Sparse Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.28">10.4230/LIPIcs.MFCS.2016.28</a>
</li>
<li>
<span class="authors">Matias David Lee and Erik P. de Vink</span>
<span class="title">Logical Characterization of Bisimulation for Transition Relations over Probability Distributions with Internal Actions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.29">10.4230/LIPIcs.MFCS.2016.29</a>
</li>
<li>
<span class="authors">Will Dison, Eduard Einstein, and Timothy R. Riley</span>
<span class="title">Ackermannian Integer Compression and the Word Problem for Hydra Groups</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.30">10.4230/LIPIcs.MFCS.2016.30</a>
</li>
<li>
<span class="authors">Peter Dixon, Debasis Mandal, A. Pavan, and N. V. Vinodchandran</span>
<span class="title">A Note on the Advice Complexity of Multipass Randomized Logspace</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.31">10.4230/LIPIcs.MFCS.2016.31</a>
</li>
<li>
<span class="authors">Titus Dose</span>
<span class="title">Complexity of Constraint Satisfaction Problems over Finite Subsets of Natural Numbers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.32">10.4230/LIPIcs.MFCS.2016.32</a>
</li>
<li>
<span class="authors">Andre Droschinsky, Nils M. Kriege, and Petra Mutzel</span>
<span class="title">Faster Algorithms for the Maximum Common Subtree Isomorphism Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.33">10.4230/LIPIcs.MFCS.2016.33</a>
</li>
<li>
<span class="authors">Eduard Eiben, Robert Ganian, and O-joung Kwon</span>
<span class="title">A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.34">10.4230/LIPIcs.MFCS.2016.34</a>
</li>
<li>
<span class="authors">Stefan Fafianie, Eva-Maria C. Hols, Stefan Kratsch, and Vuong Anh Quyen</span>
<span class="title">Preprocessing Under Uncertainty: Matroid Intersection</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.35">10.4230/LIPIcs.MFCS.2016.35</a>
</li>
<li>
<span class="authors">Angelo Fanelli and Greco Gianluigi</span>
<span class="title">Ride Sharing with a Vehicle of Unlimited Capacity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.36">10.4230/LIPIcs.MFCS.2016.36</a>
</li>
<li>
<span class="authors">Chenglin Fan, Omrit Filtser, Matthew J. Katz, and Binhai Zhu</span>
<span class="title">On the General Chain Pair Simplification Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.37">10.4230/LIPIcs.MFCS.2016.37</a>
</li>
<li>
<span class="authors">Yuta Fujishige, Yuki Tsujimaru, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda</span>
<span class="title">Computing DAWGs and Minimal Absent Words in Linear Time for Integer Alphabets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.38">10.4230/LIPIcs.MFCS.2016.38</a>
</li>
<li>
<span class="authors">Peter Fulla and Stanislav Zivny</span>
<span class="title">On Planar Valued CSPs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.39">10.4230/LIPIcs.MFCS.2016.39</a>
</li>
<li>
<span class="authors">Guilhem Gamard and Gwenaël Richomme</span>
<span class="title">Determining Sets of Quasiperiods of Infinite Words</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.40">10.4230/LIPIcs.MFCS.2016.40</a>
</li>
<li>
<span class="authors">Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, and M. S. Ramanujan</span>
<span class="title">On the Complexity Landscape of Connected f-Factor Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.41">10.4230/LIPIcs.MFCS.2016.41</a>
</li>
<li>
<span class="authors">Robert Ganian, Ronald de Haan, Iyad Kanj, and Stefan Szeider</span>
<span class="title">On Existential MSO and its Relation to ETH</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.42">10.4230/LIPIcs.MFCS.2016.42</a>
</li>
<li>
<span class="authors">Cody Geary, Pierre-Etienne Meunier, Nicolas Schabanel, and Shinnosuke Seki</span>
<span class="title">Programming Biomolecules That Fold Greedily During Transcription</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.43">10.4230/LIPIcs.MFCS.2016.43</a>
</li>
<li>
<span class="authors">Thibault Godin and Ines Klimann</span>
<span class="title">Connected Reversible Mealy Automata of Prime Size Cannot Generate Infinite Burnside Groups</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.44">10.4230/LIPIcs.MFCS.2016.44</a>
</li>
<li>
<span class="authors">Alexander Golovnev, Alexander S. Kulikov, Alexander V. Smal, and Suguru Tamaki</span>
<span class="title">Circuit Size Lower Bounds and #SAT Upper Bounds Through a General Framework</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.45">10.4230/LIPIcs.MFCS.2016.45</a>
</li>
<li>
<span class="authors">Alexander Golovnev, Edward A. Hirsch, Alexander Knop, and Alexander S. Kulikov</span>
<span class="title">On the Limits of Gate Elimination</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.46">10.4230/LIPIcs.MFCS.2016.46</a>
</li>
<li>
<span class="authors">Zeyu Guo, Anand Kumar Narayanan, and Chris Umans</span>
<span class="title">Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.47">10.4230/LIPIcs.MFCS.2016.47</a>
</li>
<li>
<span class="authors">Vladimir V. Gusev and Elena V. Pribavkina</span>
<span class="title">On Synchronizing Colorings and the Eigenvectors of Digraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.48">10.4230/LIPIcs.MFCS.2016.48</a>
</li>
<li>
<span class="authors">Tobias Harks, Britta Peis, Daniel Schmand, and Laura Vargas Koch</span>
<span class="title">Competitive Packet Routing with Priority Lists</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.49">10.4230/LIPIcs.MFCS.2016.49</a>
</li>
<li>
<span class="authors">Irving van Heuven van Staereling, Bart de Keijzer, and Guido Schäfer</span>
<span class="title">The Ground-Set-Cost Budgeted Maximum Coverage Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.50">10.4230/LIPIcs.MFCS.2016.50</a>
</li>
<li>
<span class="authors">Dmitry Itsykson, Alexander Okhotin, and Vsevolod Oparin</span>
<span class="title">Computational and Proof Complexity of Partial String Avoidability</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.51">10.4230/LIPIcs.MFCS.2016.51</a>
</li>
<li>
<span class="authors">Petr Jancar</span>
<span class="title">Deciding Semantic Finiteness of Pushdown Processes and First-Order Grammars w.r.t. Bisimulation Equivalence</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.52">10.4230/LIPIcs.MFCS.2016.52</a>
</li>
<li>
<span class="authors">Jesper Jansson and Wing-Kin Sung</span>
<span class="title">Minimal Phylogenetic Supertrees and Local Consensus Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.53">10.4230/LIPIcs.MFCS.2016.53</a>
</li>
<li>
<span class="authors">Stacey Jeffery and François Le Gall</span>
<span class="title">Quantum Communication Complexity of Distributed Set Joins</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.54">10.4230/LIPIcs.MFCS.2016.54</a>
</li>
<li>
<span class="authors">Dominik Kaaser, Frederik Mallmann-Trenn, and Emanuele Natale</span>
<span class="title">On the Voting Time of the Deterministic Majority Process</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.55">10.4230/LIPIcs.MFCS.2016.55</a>
</li>
<li>
<span class="authors">Frank Kammer, Dieter Kratsch, and Moritz Laudahn</span>
<span class="title">Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.56">10.4230/LIPIcs.MFCS.2016.56</a>
</li>
<li>
<span class="authors">Iordanis Kerenidis, Adi Rosén, and Florent Urrutia</span>
<span class="title">Multi-Party Protocols, Information Complexity and Privacy</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.57">10.4230/LIPIcs.MFCS.2016.57</a>
</li>
<li>
<span class="authors">Takayuki Kihara and Arno Pauly</span>
<span class="title">Dividing by Zero - How Bad Is It, Really?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.58">10.4230/LIPIcs.MFCS.2016.58</a>
</li>
<li>
<span class="authors">Dennis Komm, Rastislav Královic, Richard Královic, and Christian Kudahl</span>
<span class="title">Advice Complexity of the Online Induced Subgraph Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.59">10.4230/LIPIcs.MFCS.2016.59</a>
</li>
<li>
<span class="authors">Juha Kontinen, Antti Kuusisto, and Jonni Virtema</span>
<span class="title">Decidability of Predicate Logics with Team Semantics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.60">10.4230/LIPIcs.MFCS.2016.60</a>
</li>
<li>
<span class="authors">Markus Krötzsch, Tomás Masopust, and Michaël Thomazo</span>
<span class="title">On the Complexity of Universality for Partially Ordered NFAs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.61">10.4230/LIPIcs.MFCS.2016.61</a>
</li>
<li>
<span class="authors">Orna Kupferman and Gal Vardi</span>
<span class="title">Eulerian Paths with Regular Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.62">10.4230/LIPIcs.MFCS.2016.62</a>
</li>
<li>
<span class="authors">Nadia Labai and Johann A. Makowsky</span>
<span class="title">On the Exact Learnability of Graph Parameters: The Case of Partition Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.63">10.4230/LIPIcs.MFCS.2016.63</a>
</li>
<li>
<span class="authors">Victor Lagerkvist and Biman Roy</span>
<span class="title">A Preliminary Investigation of Satisfiability Problems Not Harder than 1-in-3-SAT</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.64">10.4230/LIPIcs.MFCS.2016.64</a>
</li>
<li>
<span class="authors">Christof Löding and Sarah Winter</span>
<span class="title">Uniformization Problems for Tree-Automatic Relations and Top-Down Tree Transducers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.65">10.4230/LIPIcs.MFCS.2016.65</a>
</li>
<li>
<span class="authors">Amaldev Manuel and A. V. Sreejith</span>
<span class="title">Two-Variable Logic over Countable Linear Orderings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.66">10.4230/LIPIcs.MFCS.2016.66</a>
</li>
<li>
<span class="authors">Tomás Masopust</span>
<span class="title">Piecewise Testable Languages and Nondeterministic Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.67">10.4230/LIPIcs.MFCS.2016.67</a>
</li>
<li>
<span class="authors">George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, and Paul G. Spirakis</span>
<span class="title">Stably Computing Order Statistics with Arithmetic Population Protocols</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.68">10.4230/LIPIcs.MFCS.2016.68</a>
</li>
<li>
<span class="authors">Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda</span>
<span class="title">Shortest Unique Substring Queries on Run-Length Encoded Strings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.69">10.4230/LIPIcs.MFCS.2016.69</a>
</li>
<li>
<span class="authors">Shay Moran and Cyrus Rashtchian</span>
<span class="title">Shattered Sets and the Hilbert Function</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.70">10.4230/LIPIcs.MFCS.2016.70</a>
</li>
<li>
<span class="authors">Bart M. P. Jansen and Astrid Pieterse</span>
<span class="title">Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.71">10.4230/LIPIcs.MFCS.2016.71</a>
</li>
<li>
<span class="authors">Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda</span>
<span class="title">Fully Dynamic Data Structure for LCE Queries in Compressed Space</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.72">10.4230/LIPIcs.MFCS.2016.72</a>
</li>
<li>
<span class="authors">Reino Niskanen, Igor Potapov, and Julien Reichert</span>
<span class="title">Undecidability of Two-dimensional Robot Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.73">10.4230/LIPIcs.MFCS.2016.73</a>
</li>
<li>
<span class="authors">Anurag Pandey, Nitin Saxena, and Amit Sinhababu</span>
<span class="title">Algebraic Independence over Positive Characteristic: New Criterion and Applications to Locally Low Algebraic Rank Circuits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.74">10.4230/LIPIcs.MFCS.2016.74</a>
</li>
<li>
<span class="authors">Sudeshna Kolay, Fahad Panolan, Venkatesh Raman, and Saket Saurabh</span>
<span class="title">Parameterized Algorithms on Perfect Graphs for Deletion to (r,l)-Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.75">10.4230/LIPIcs.MFCS.2016.75</a>
</li>
<li>
<span class="authors">Simon Perdrix and Quanlong Wang</span>
<span class="title">Supplementarity is Necessary for Quantum Diagram Reasoning</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.76">10.4230/LIPIcs.MFCS.2016.76</a>
</li>
<li>
<span class="authors">Thomas Place and Marc Zeitoun</span>
<span class="title">The Covering Problem: A Unified Approach for Investigating the Expressive Power of Logics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.77">10.4230/LIPIcs.MFCS.2016.77</a>
</li>
<li>
<span class="authors">Marcin Przybylko and Michal Skrzypczak</span>
<span class="title">On the Complexity of Branching Games with Regular Conditions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.78">10.4230/LIPIcs.MFCS.2016.78</a>
</li>
<li>
<span class="authors">Paola Quaglia</span>
<span class="title">Symbolic Lookaheads for Bottom-up Parsing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.79">10.4230/LIPIcs.MFCS.2016.79</a>
</li>
<li>
<span class="authors">Anja Rey and Jörg Rothe</span>
<span class="title">Structural Control in Weighted Voting Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.80">10.4230/LIPIcs.MFCS.2016.80</a>
</li>
<li>
<span class="authors">Matthieu Rosenfeld</span>
<span class="title">Every Binary Pattern of Length Greater Than 14 Is Abelian-2-Avoidable</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.81">10.4230/LIPIcs.MFCS.2016.81</a>
</li>
<li>
<span class="authors">Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, and Junichi Teruyama</span>
<span class="title">Bounded Depth Circuits with Weighted Symmetric Gates: Satisfiability, Lower Bounds and Compression</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.82">10.4230/LIPIcs.MFCS.2016.82</a>
</li>
<li>
<span class="authors">Martin Schuster</span>
<span class="title">Transducer-Based Rewriting Games for Active XML</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.83">10.4230/LIPIcs.MFCS.2016.83</a>
</li>
<li>
<span class="authors">Igor Potapov and Pavel Semukhin</span>
<span class="title">Vector Reachability Problem in SL(2, Z)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.84">10.4230/LIPIcs.MFCS.2016.84</a>
</li>
<li>
<span class="authors">Stephan Kreutzer, Michal Pilipczuk, Roman Rabinovich, and Sebastian Siebertz</span>
<span class="title">The Generalised Colouring Numbers on Classes of Bounded Expansion</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.85">10.4230/LIPIcs.MFCS.2016.85</a>
</li>
<li>
<span class="authors">Xiang Huang and Donald M. Stull</span>
<span class="title">Polynomial Space Randomness in Analysis</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.86">10.4230/LIPIcs.MFCS.2016.86</a>
</li>
<li>
<span class="authors">Kenjiro Takazawa</span>
<span class="title">Finding a Maximum 2-Matching Excluding Prescribed Cycles in Bipartite Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.87">10.4230/LIPIcs.MFCS.2016.87</a>
</li>
<li>
<span class="authors">Christof Löding and Andreas Tollkötter</span>
<span class="title">Transformation Between Regular Expressions and omega-Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.88">10.4230/LIPIcs.MFCS.2016.88</a>
</li>
<li>
<span class="authors">Mingyu Xiao and Shaowei Kou</span>
<span class="title">An Improved Approximation Algorithm for the Traveling Tournament Problem with Maximum Trip Length Two</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2016.89">10.4230/LIPIcs.MFCS.2016.89</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