<h2>LIPIcs, Volume 117, MFCS 2018</h2>
<ul>
<li>
<span class="authors">Igor Potapov, Paul Spirakis, and James Worrell</span>
<span class="title">LIPIcs, Volume 117, MFCS'18, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018">10.4230/LIPIcs.MFCS.2018</a>
</li>
<li>
<span class="authors">Igor Potapov, Paul Spirakis, and James Worrell</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.0">10.4230/LIPIcs.MFCS.2018.0</a>
</li>
<li>
<span class="authors">Laurent Bulteau and Markus L. Schmid</span>
<span class="title">Consensus Strings with Small Maximum Distance and Small Distance Sum</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.1">10.4230/LIPIcs.MFCS.2018.1</a>
</li>
<li>
<span class="authors">Mikhail Andreev, Gleb Posobin, and Alexander Shen</span>
<span class="title">Plain Stopping Time and Conditional Complexities Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.2">10.4230/LIPIcs.MFCS.2018.2</a>
</li>
<li>
<span class="authors">Hasan Abasi</span>
<span class="title">Error-Tolerant Non-Adaptive Learning of a Hidden Hypergraph</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.3">10.4230/LIPIcs.MFCS.2018.3</a>
</li>
<li>
<span class="authors">Alexander Kozachinskiy</span>
<span class="title">From Expanders to Hitting Distributions and Simulation Theorems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.4">10.4230/LIPIcs.MFCS.2018.4</a>
</li>
<li>
<span class="authors">Titus Dose</span>
<span class="title">Balance Problems for Integer Circuits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.5">10.4230/LIPIcs.MFCS.2018.5</a>
</li>
<li>
<span class="authors">Louis-Marie Dando and Sylvain Lombardy</span>
<span class="title">On Hadamard Series and Rotating Q-Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.6">10.4230/LIPIcs.MFCS.2018.6</a>
</li>
<li>
<span class="authors">Egor Klenin and Alexander Kozachinskiy</span>
<span class="title">One-Sided Error Communication Complexity of Gap Hamming Distance</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.7">10.4230/LIPIcs.MFCS.2018.7</a>
</li>
<li>
<span class="authors">Spyros Angelopoulos, Christoph Dürr, and Shendan Jin</span>
<span class="title">Online Maximum Matching with Recourse</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.8">10.4230/LIPIcs.MFCS.2018.8</a>
</li>
<li>
<span class="authors">Guillaume Burel</span>
<span class="title">Linking Focusing and Resolution with Selection</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.9">10.4230/LIPIcs.MFCS.2018.9</a>
</li>
<li>
<span class="authors">Andreas Krebs, Arne Meier, Jonni Virtema, and Martin Zimmermann</span>
<span class="title">Team Semantics for the Specification and Verification of Hyperproperties</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.10">10.4230/LIPIcs.MFCS.2018.10</a>
</li>
<li>
<span class="authors">Florent R. Madelaine and Barnaby Martin</span>
<span class="title">Consistency for Counting Quantifiers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.11">10.4230/LIPIcs.MFCS.2018.11</a>
</li>
<li>
<span class="authors">Naonori Kakimura, Naoyuki Kamiyama, and Kenjiro Takazawa</span>
<span class="title">The b-Branching Problem in Digraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.12">10.4230/LIPIcs.MFCS.2018.12</a>
</li>
<li>
<span class="authors">Dani Dorfman, Haim Kaplan, László Kozma, and Uri Zwick</span>
<span class="title">Pairing heaps: the forward variant</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.13">10.4230/LIPIcs.MFCS.2018.13</a>
</li>
<li>
<span class="authors">Yassine Hamoudi</span>
<span class="title">Simultaneous Multiparty Communication Protocols for Composed Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.14">10.4230/LIPIcs.MFCS.2018.14</a>
</li>
<li>
<span class="authors">Moses Ganardi, Artur Jez, and Markus Lohrey</span>
<span class="title">Sliding Windows over Context-Free Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.15">10.4230/LIPIcs.MFCS.2018.15</a>
</li>
<li>
<span class="authors">Louisa Seelbach Benkner and Markus Lohrey</span>
<span class="title">Average Case Analysis of Leaf-Centric Binary Tree Sources</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.16">10.4230/LIPIcs.MFCS.2018.16</a>
</li>
<li>
<span class="authors">Pawel M. Idziak, Piotr Kawalek, and Jacek Krzaczkowski</span>
<span class="title">Expressive Power, Satisfiability and Equivalence of Circuits over Nilpotent Algebras</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.17">10.4230/LIPIcs.MFCS.2018.17</a>
</li>
<li>
<span class="authors">P. Madhusudan, Dirk Nowotka, Aayush Rajasekaran, and Jeffrey Shallit</span>
<span class="title">Lagrange's Theorem for Binary Squares</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.18">10.4230/LIPIcs.MFCS.2018.18</a>
</li>
<li>
<span class="authors">Hendrik Fichtenberger and Yadu Vasudev</span>
<span class="title">A Two-Sided Error Distributed Property Tester For Conductance</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.19">10.4230/LIPIcs.MFCS.2018.19</a>
</li>
<li>
<span class="authors">Martin Grohe, Gaurav Rattan, and Gerhard J. Woeginger</span>
<span class="title">Graph Similarity and Approximate Isomorphism</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.20">10.4230/LIPIcs.MFCS.2018.20</a>
</li>
<li>
<span class="authors">Andrew Ryzhikov and Marek Szykula</span>
<span class="title">Finding Short Synchronizing Words for Prefix Codes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.21">10.4230/LIPIcs.MFCS.2018.21</a>
</li>
<li>
<span class="authors">Bill Fefferman and Shelby Kimmel</span>
<span class="title">Quantum vs. Classical Proofs and Subset Verification</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.22">10.4230/LIPIcs.MFCS.2018.22</a>
</li>
<li>
<span class="authors">Guy Avni, Shibashis Guha, and Orna Kupferman</span>
<span class="title">Timed Network Games with Clocks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.23">10.4230/LIPIcs.MFCS.2018.23</a>
</li>
<li>
<span class="authors">Aris Filos-Ratsikas, Søren Kristoffer Stiil Frederiksen, Paul W. Goldberg, and Jie Zhang</span>
<span class="title">Hardness Results for Consensus-Halving</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.24">10.4230/LIPIcs.MFCS.2018.24</a>
</li>
<li>
<span class="authors">Ioannis Lamprou, Russell Martin, Sven Schewe, Ioannis Sigalas, and Vassilis Zissimopoulos</span>
<span class="title">Maximum Rooted Connected Expansion</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.25">10.4230/LIPIcs.MFCS.2018.25</a>
</li>
<li>
<span class="authors">François Le Gall, Tomoyuki Morimae, Harumichi Nishimura, and Yuki Takeuchi</span>
<span class="title">Interactive Proofs with Polynomial-Time Quantum Prover for Computing the Order of Solvable Groups</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.26">10.4230/LIPIcs.MFCS.2018.26</a>
</li>
<li>
<span class="authors">Martin Lück</span>
<span class="title">On the Complexity of Team Logic and Its Two-Variable Fragment</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.27">10.4230/LIPIcs.MFCS.2018.27</a>
</li>
<li>
<span class="authors">Andrea Clementi, Mohsen Ghaffari, Luciano Gualà, Emanuele Natale, Francesco Pasquale, and Giacomo Scornavacca</span>
<span class="title">A Tight Analysis of the Parallel Undecided-State Dynamics with Two Colors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.28">10.4230/LIPIcs.MFCS.2018.28</a>
</li>
<li>
<span class="authors">Jakub Gajarský and Daniel Král'</span>
<span class="title">Recovering Sparse Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.29">10.4230/LIPIcs.MFCS.2018.29</a>
</li>
<li>
<span class="authors">Akitoshi Kawamura, Holger Thies, and Martin Ziegler</span>
<span class="title">Average-Case Polynomial-Time Computability of Hamiltonian Dynamics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.30">10.4230/LIPIcs.MFCS.2018.30</a>
</li>
<li>
<span class="authors">Francesco Cellinese, Gianlorenzo D'Angelo, Gianpiero Monaco, and Yllka Velaj</span>
<span class="title">Generalized Budgeted Submodular Set Function Maximization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.31">10.4230/LIPIcs.MFCS.2018.31</a>
</li>
<li>
<span class="authors">Mikhail V. Berlinkov, Robert Ferens, and Marek Szykula</span>
<span class="title">Complexity of Preimage Problems for Deterministic Finite Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.32">10.4230/LIPIcs.MFCS.2018.32</a>
</li>
<li>
<span class="authors">Manuel Bodirsky, Barnaby Martin, Marcello Mamino, and Antoine Mottet</span>
<span class="title">The Complexity of Disjunctive Linear Diophantine Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.33">10.4230/LIPIcs.MFCS.2018.33</a>
</li>
<li>
<span class="authors">Ran Ben Basat, Gil Einziger, and Roy Friedman</span>
<span class="title">Give Me Some Slack: Efficient Network Measurements</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.34">10.4230/LIPIcs.MFCS.2018.34</a>
</li>
<li>
<span class="authors">Dan Hefetz, Orna Kupferman, Amir Lellouche, and Gal Vardi</span>
<span class="title">Spanning-Tree Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.35">10.4230/LIPIcs.MFCS.2018.35</a>
</li>
<li>
<span class="authors">Thomas Erlebach and Jakob T. Spooner</span>
<span class="title">Faster Exploration of Degree-Bounded Temporal Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.36">10.4230/LIPIcs.MFCS.2018.36</a>
</li>
<li>
<span class="authors">Sayan Bandyapadhyay, Anil Maheshwari, Saeed Mehrabi, and Subhash Suri</span>
<span class="title">Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.37">10.4230/LIPIcs.MFCS.2018.37</a>
</li>
<li>
<span class="authors">Marco Aldi, Niel de Beaudrap, Sevag Gharibian, and Seyran Saeedi</span>
<span class="title">On Efficiently Solvable Cases of Quantum k-SAT</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.38">10.4230/LIPIcs.MFCS.2018.38</a>
</li>
<li>
<span class="authors">Cedric Berenger, Peter Niebert, and Kevin Perrot</span>
<span class="title">Balanced Connected Partitioning of Unweighted Grid Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.39">10.4230/LIPIcs.MFCS.2018.39</a>
</li>
<li>
<span class="authors">Stéphane Le Roux</span>
<span class="title">Concurrent Games and Semi-Random Determinacy</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.40">10.4230/LIPIcs.MFCS.2018.40</a>
</li>
<li>
<span class="authors">Chen Dan, Kristoffer Arnsfelt Hansen, He Jiang, Liwei Wang, and Yuchen Zhou</span>
<span class="title">Low Rank Approximation of Binary Matrices: Column Subset Selection and Generalizations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.41">10.4230/LIPIcs.MFCS.2018.41</a>
</li>
<li>
<span class="authors">Arnaud Carayol and Matthew Hague</span>
<span class="title">Optimal Strategies in Pushdown Reachability Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.42">10.4230/LIPIcs.MFCS.2018.42</a>
</li>
<li>
<span class="authors">Peter Jonsson and Victor Lagerkvist</span>
<span class="title">Why are CSPs Based on Partition Schemes Computationally Hard?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.43">10.4230/LIPIcs.MFCS.2018.43</a>
</li>
<li>
<span class="authors">Argyrios Deligkas and Reshef Meir</span>
<span class="title">Directed Graph Minors and Serial-Parallel Width</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.44">10.4230/LIPIcs.MFCS.2018.44</a>
</li>
<li>
<span class="authors">Philipp Zschoche, Till Fluschnik, Hendrik Molter, and Rolf Niedermeier</span>
<span class="title">The Complexity of Finding Small Separators in Temporal Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.45">10.4230/LIPIcs.MFCS.2018.45</a>
</li>
<li>
<span class="authors">Léo Exibard, Emmanuel Filiot, and Ismaël Jecker</span>
<span class="title">The Complexity of Transducer Synthesis from Multi-Sequential Specifications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.46">10.4230/LIPIcs.MFCS.2018.46</a>
</li>
<li>
<span class="authors">Vittorio Bilò, Michele Flammini, Gianpiero Monaco, and Luca Moscardelli</span>
<span class="title">Pricing Problems with Buyer Preselection</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.47">10.4230/LIPIcs.MFCS.2018.47</a>
</li>
<li>
<span class="authors">Costanza Catalano and Raphaël M. Jungers</span>
<span class="title">On Randomized Generation of Slowly Synchronizing Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.48">10.4230/LIPIcs.MFCS.2018.48</a>
</li>
<li>
<span class="authors">Andreas Göbel, J. A. Gregor Lagodzinski, and Karen Seidel</span>
<span class="title">Counting Homomorphisms to Trees Modulo a Prime</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.49">10.4230/LIPIcs.MFCS.2018.49</a>
</li>
<li>
<span class="authors">Kelin Luo, Thomas Erlebach, and Yinfeng Xu</span>
<span class="title">Car-Sharing between Two Locations: Online Scheduling with Two Servers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.50">10.4230/LIPIcs.MFCS.2018.50</a>
</li>
<li>
<span class="authors">Edith Hemaspaandra, Lane A. Hemaspaandra, Holger Spakowski, and Osamu Watanabe</span>
<span class="title">The Robustness of LWPP and WPP, with an Application to Graph Reconstruction</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.51">10.4230/LIPIcs.MFCS.2018.51</a>
</li>
<li>
<span class="authors">Robert Gmyr, Kristian Hinnenthal, Irina Kostitsyna, Fabian Kuhn, Dorian Rudolph, and Christian Scheideler</span>
<span class="title">Shape Recognition by a Finite Automaton Robot</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.52">10.4230/LIPIcs.MFCS.2018.52</a>
</li>
<li>
<span class="authors">Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Daniel Lokshtanov, and Saket Saurabh</span>
<span class="title">Conflict Free Feedback Vertex Set: A Parameterized Dichotomy</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.53">10.4230/LIPIcs.MFCS.2018.53</a>
</li>
<li>
<span class="authors">Andre Droschinsky, Nils M. Kriege, and Petra Mutzel</span>
<span class="title">Largest Weight Common Subtree Embeddings with Distance Penalties</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.54">10.4230/LIPIcs.MFCS.2018.54</a>
</li>
<li>
<span class="authors">Mamadou M. Kanté, Kaveh Khoshkhah, and Mozhgan Pourmoradnasseri</span>
<span class="title">Enumerating Minimal Transversals of Hypergraphs without Small Holes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.55">10.4230/LIPIcs.MFCS.2018.55</a>
</li>
<li>
<span class="authors">Andreas Bärtschi, Daniel Graf, and Matús Mihalák</span>
<span class="title">Collective Fast Delivery by Energy-Efficient Agents</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.56">10.4230/LIPIcs.MFCS.2018.56</a>
</li>
<li>
<span class="authors">Matthew Hague, Roland Meyer, Sebastian Muskalla, and Martin Zimmermann</span>
<span class="title">Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.57">10.4230/LIPIcs.MFCS.2018.57</a>
</li>
<li>
<span class="authors">Sevag Gharibian, Miklos Santha, Jamie Sikora, Aarthi Sundaram, and Justin Yirka</span>
<span class="title">Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.58">10.4230/LIPIcs.MFCS.2018.58</a>
</li>
<li>
<span class="authors">Martin Dietzfelbinger, Philipp Schlag, and Stefan Walzer</span>
<span class="title">A Subquadratic Algorithm for 3XOR</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.59">10.4230/LIPIcs.MFCS.2018.59</a>
</li>
<li>
<span class="authors">Christian Doczkal and Damien Pous</span>
<span class="title">Treewidth-Two Graphs as a Free Algebra</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.60">10.4230/LIPIcs.MFCS.2018.60</a>
</li>
<li>
<span class="authors">Peter Dixon, A. Pavan, and N. V. Vinodchandran</span>
<span class="title">On Pseudodeterministic Approximation Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.61">10.4230/LIPIcs.MFCS.2018.61</a>
</li>
<li>
<span class="authors">Lukas Fleischer and Manfred Kufleitner</span>
<span class="title">Testing Simon's congruence</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.62">10.4230/LIPIcs.MFCS.2018.62</a>
</li>
<li>
<span class="authors">Konrad K. Dabrowski, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, and Viktor Zamaraev</span>
<span class="title">On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.63">10.4230/LIPIcs.MFCS.2018.63</a>
</li>
<li>
<span class="authors">Paolo D'Arco, Roberto De Prisco, Alfredo De Santis, Angel Pérez del Pozo, and Ugo Vaccaro</span>
<span class="title">Probabilistic Secret Sharing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.64">10.4230/LIPIcs.MFCS.2018.64</a>
</li>
<li>
<span class="authors">Frank Kammer and Andrej Sajenko</span>
<span class="title">Extra Space during Initialization of Succinct Data Structures and Dynamical Initializable Arrays</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.65">10.4230/LIPIcs.MFCS.2018.65</a>
</li>
<li>
<span class="authors">Pawel Gawrychowski, Gad M. Landau, and Tatiana Starikovskaya</span>
<span class="title">Fast Entropy-Bounded String Dictionary Look-Up with Mismatches</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.66">10.4230/LIPIcs.MFCS.2018.66</a>
</li>
<li>
<span class="authors">Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim, and Michael Lampis</span>
<span class="title">New Results on Directed Edge Dominating Set</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.67">10.4230/LIPIcs.MFCS.2018.67</a>
</li>
<li>
<span class="authors">Pavol Hell, Jing Huang, Ross M. McConnell, and Arash Rafiey</span>
<span class="title">Interval-Like Graphs and Digraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.68">10.4230/LIPIcs.MFCS.2018.68</a>
</li>
<li>
<span class="authors">Peter Hamburger, Ross M. McConnell, Attila Pór, Jeremy P. Spinrad, and Zhisheng Xu</span>
<span class="title">Double Threshold Digraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.69">10.4230/LIPIcs.MFCS.2018.69</a>
</li>
<li>
<span class="authors">Jenish C. Mehta</span>
<span class="title">Tree Tribes and Lower Bounds for Switching Lemmas</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.70">10.4230/LIPIcs.MFCS.2018.70</a>
</li>
<li>
<span class="authors">Neil Lutz and Donald M. Stull</span>
<span class="title">Projection Theorems Using Effective Dimension</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.71">10.4230/LIPIcs.MFCS.2018.71</a>
</li>
<li>
<span class="authors">Andrzej S. Murawski, Steven J. Ramsay, and Nikos Tzevelekos</span>
<span class="title">Polynomial-Time Equivalence Testing for Deterministic Fresh-Register Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.72">10.4230/LIPIcs.MFCS.2018.72</a>
</li>
<li>
<span class="authors">Ralph Christian Bottesch</span>
<span class="title">On W[1]-Hardness as Evidence for Intractability</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.73">10.4230/LIPIcs.MFCS.2018.73</a>
</li>
<li>
<span class="authors">Christian Konrad</span>
<span class="title">A Simple Augmentation Method for Matchings with Applications to Streaming Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.74">10.4230/LIPIcs.MFCS.2018.74</a>
</li>
<li>
<span class="authors">Benjamin Moore, Naomi Nishimura, and Vijay Subramanya</span>
<span class="title">Reconfiguration of Graph Minors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.75">10.4230/LIPIcs.MFCS.2018.75</a>
</li>
<li>
<span class="authors">Manfred Droste and Erik Paul</span>
<span class="title">A Feferman-Vaught Decomposition Theorem for Weighted MSO Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.76">10.4230/LIPIcs.MFCS.2018.76</a>
</li>
<li>
<span class="authors">Hugo A. Akitaya, Matthew D. Jones, David Stalfa, and Csaba D. Tóth</span>
<span class="title">Maximum Area Axis-Aligned Square Packings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.77">10.4230/LIPIcs.MFCS.2018.77</a>
</li>
<li>
<span class="authors">Ninad Rajgopal, Rahul Santhanam, and Srikanth Srinivasan</span>
<span class="title">Deterministically Counting Satisfying Assignments for Constant-Depth Circuits with Parity Gates, with Implications for Lower Bounds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.78">10.4230/LIPIcs.MFCS.2018.78</a>
</li>
<li>
<span class="authors">Donald M. Stull</span>
<span class="title">Results on the Dimension Spectra of Planar Lines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.79">10.4230/LIPIcs.MFCS.2018.79</a>
</li>
<li>
<span class="authors">Aris Pagourtzis and Tomasz Radzik</span>
<span class="title">Tight Bounds for Deterministic h-Shot Broadcast in Ad-Hoc Directed Radio Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.80">10.4230/LIPIcs.MFCS.2018.80</a>
</li>
<li>
<span class="authors">Kazuyuki Amano</span>
<span class="title">Depth Two Majority Circuits for Majority and List Expanders</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.81">10.4230/LIPIcs.MFCS.2018.81</a>
</li>
<li>
<span class="authors">Mareike Dressler, Adam Kurpisz, and Timo de Wolff</span>
<span class="title">Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit Polynomials</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.82">10.4230/LIPIcs.MFCS.2018.82</a>
</li>
<li>
<span class="authors">Pinar Heggernes, Davis Issac, Juho Lauri, Paloma T. Lima, and Erik Jan van Leeuwen</span>
<span class="title">Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.83">10.4230/LIPIcs.MFCS.2018.83</a>
</li>
<li>
<span class="authors">Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, and Luca Versari</span>
<span class="title">Listing Subgraphs by Cartesian Decomposition</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.MFCS.2018.84">10.4230/LIPIcs.MFCS.2018.84</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