LIPIcs, Volume 117, MFCS 2018

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