LIPIcs, Volume 83, MFCS 2017

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