LIPIcs, Volume 170, MFCS 2020

• Javier Esparza and Daniel Král' LIPIcs, Volume 170, MFCS 2020, Complete Volume 10.4230/LIPIcs.MFCS.2020
• Javier Esparza and Daniel Král' Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.MFCS.2020.0
• Nathalie Bertrand Concurrent Games with Arbitrarily Many Players (Invited Talk) 10.4230/LIPIcs.MFCS.2020.1
• Sergio Cabello Some Open Problems in Computational Geometry (Invited Talk) 10.4230/LIPIcs.MFCS.2020.2
• Mary Wootters List-Decodability of Structured Ensembles of Codes (Invited Talk) 10.4230/LIPIcs.MFCS.2020.3
• Deniz Ağaoğlu and Petr Hliněný Isomorphism Problem for S_d-Graphs 10.4230/LIPIcs.MFCS.2020.4
• Jungho Ahn, Eduard Eiben, O-joung Kwon, and Sang-il Oum A Polynomial Kernel for 3-Leaf Power Deletion 10.4230/LIPIcs.MFCS.2020.5
• Saeed Akhoondian Amiri, Alexandru Popa, Mohammad Roghani, Golnoosh Shahkarami, Reza Soltani, and Hossein Vahidi Complexity of Computing the Anti-Ramsey Numbers for Paths 10.4230/LIPIcs.MFCS.2020.6
• Susanne Albers, Arindam Khan, and Leon Ladewig Best Fit Bin Packing with Random Order Revisited 10.4230/LIPIcs.MFCS.2020.7
• Andris Ambainis, Kaspars Balodis, Jānis Iraids, Kamil Khadiev, Vladislavs Kļevickis, Krišjānis Prūsis, Yixin Shen, Juris Smotrovs, and Jevgēnijs Vihrovs Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language 10.4230/LIPIcs.MFCS.2020.8
• Boris Aronov, Matthew J. Katz, and Elad Sulami Dynamic Time Warping-Based Proximity Problems 10.4230/LIPIcs.MFCS.2020.9
• V. Arvind, Abhranil Chatterjee, Rajit Datta, and Partha Mukhopadhyay A Special Case of Rational Identity Testing and the Brešar-Klep Theorem 10.4230/LIPIcs.MFCS.2020.10
• Max Bannach, Sebastian Berndt, Marten Maack, Matthias Mnich, Alexandra Lassota, Malin Rau, and Malte Skambath Solving Packing Problems with Few Small Items Using Rainbow Matchings 10.4230/LIPIcs.MFCS.2020.11
• Pierre Béaur and Jarkko Kari Decidability in Group Shifts and Group Cellular Automata 10.4230/LIPIcs.MFCS.2020.12
• Arpitha P. Bharathi and Monaldo Mastrolilli Ideal Membership Problem and a Majority Polymorphism over the Ternary Domain 10.4230/LIPIcs.MFCS.2020.13
• Therese Biedl, Steven Chaplick, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, and Chrysanthi Raftopoulou Layered Fan-Planar Graph Drawings 10.4230/LIPIcs.MFCS.2020.14
• Davide Bilò, Vittorio Bilò, Pascal Lenzner, and Louise Molitor Topological Influence and Locality in Swap Schelling Games 10.4230/LIPIcs.MFCS.2020.15
• Arindam Biswas, Venkatesh Raman, and Saket Saurabh Approximation in (Poly-) Logarithmic Space 10.4230/LIPIcs.MFCS.2020.16
• Markus Bläser and Vladimir Lysikov Slice Rank of Block Tensors and Irreversibility of Structure Tensors of Algebras 10.4230/LIPIcs.MFCS.2020.17
• Martin Böhm, Ruben Hoeksma, Nicole Megow, Lukas Nölke, and Bertrand Simon Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics 10.4230/LIPIcs.MFCS.2020.18
• Mikołaj Bojańczyk and Janusz Schmude Some Remarks on Deciding Equivalence for Graph-To-Graph Transducers 10.4230/LIPIcs.MFCS.2020.19
• Jan Bok, Richard Brewster, Tomás Feder, Pavol Hell, and Nikola Jedličková List Homomorphism Problems for Signed Graphs 10.4230/LIPIcs.MFCS.2020.20
• Laura Bozzelli, Angelo Montanari, Adriano Peron, and Pietro Sala On a Temporal Logic of Prefixes and Infixes 10.4230/LIPIcs.MFCS.2020.21
• Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Ismaël Jecker, and Jakub Svoboda Simplified Game of Life: Algorithms and Complexity 10.4230/LIPIcs.MFCS.2020.22
• Nai-Hui Chia, Tongyang Li, Han-Hsuan Lin, and Chunhao Wang Quantum-Inspired Sublinear Algorithm for Solving Low-Rank Semidefinite Programming 10.4230/LIPIcs.MFCS.2020.23
• Alexandre Clément and Simon Perdrix PBS-Calculus: A Graphical Language for Coherent Control of Quantum Computations 10.4230/LIPIcs.MFCS.2020.24
• Alessio Conte, Pierluigi Crescenzi, Andrea Marino, and Giulia Punzi Enumeration of s-d Separators in DAGs with Application to Reliability Analysis in Temporal Graphs 10.4230/LIPIcs.MFCS.2020.25
• Arjan Cornelissen, Stacey Jeffery, Maris Ozols, and Alvaro Piedrafita Span Programs and Quantum Time Complexity 10.4230/LIPIcs.MFCS.2020.26
• Argyrios Deligkas, George B. Mertzios, Paul G. Spirakis, and Viktor Zamaraev Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle 10.4230/LIPIcs.MFCS.2020.27
• Palash Dey, Jaikumar Radhakrishnan, and Santhoshini Velusamy Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes 10.4230/LIPIcs.MFCS.2020.28
• Gaëtan Douéneau-Tabot, Emmanuel Filiot, and Paul Gastin Register Transducers Are Marble Transducers 10.4230/LIPIcs.MFCS.2020.29
• Pavol Ďuriš, Rastislav Královič, Richard Královič, Dana Pardubská, Martin Pašen, and Peter Rossmanith Randomization in Non-Uniform Finite Automata 10.4230/LIPIcs.MFCS.2020.30
• Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, and Martin Nöllenburg Extending Nearly Complete 1-Planar Drawings in Polynomial Time 10.4230/LIPIcs.MFCS.2020.31
• Yury Elkin and Vitaliy Kurlin The Mergegram of a Dendrogram and Its Stability 10.4230/LIPIcs.MFCS.2020.32
• Henning Fernau, Petra Wolf, and Tomoyuki Yamakami Synchronizing Deterministic Push-Down Automata Can Be Really Hard 10.4230/LIPIcs.MFCS.2020.33
• Nathanaël Fijalkow, Paweł Gawrychowski, and Pierre Ohlmann Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games 10.4230/LIPIcs.MFCS.2020.34
• Fedor V. Fomin, Danil Sagunov, and Kirill Simonov Building Large k-Cores from Sparse Graphs 10.4230/LIPIcs.MFCS.2020.35
• Andreas Galanis, Leslie Ann Goldberg, and Andrés Herrera-Poyatos The Complexity of Approximating the Complex-Valued Potts Model 10.4230/LIPIcs.MFCS.2020.36
• Andreas Galanis, Leslie Ann Goldberg, and James Stewart Fast Algorithms for General Spin Systems on Bipartite Expanders 10.4230/LIPIcs.MFCS.2020.37
• Paul D. Gallot, Aurélien Lemay, and Sylvain Salvati Linear High-Order Deterministic Tree Transducers with Regular Look-Ahead 10.4230/LIPIcs.MFCS.2020.38
• Junhao Gan, David F. Gleich, Nate Veldt, Anthony Wirth, and Xin Zhang Graph Clustering in All Parameter Regimes 10.4230/LIPIcs.MFCS.2020.39
• Pierre Ganty, Elena Gutiérrez, and Pedro Valero A Quasiorder-Based Perspective on Residual Automata 10.4230/LIPIcs.MFCS.2020.40
• Georg Gottlob, Matthias Lanzinger, Reinhard Pichler, and Igor Razgon Fractional Covers of Hypergraphs with Bounded Multi-Intersection 10.4230/LIPIcs.MFCS.2020.41
• Zeyu Guo Factoring Polynomials over Finite Fields with Linear Galois Groups: An Additive Combinatorics Approach 10.4230/LIPIcs.MFCS.2020.42
• Chetan Gupta, Vimal Raj Sharma, and Raghunath Tewari Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs 10.4230/LIPIcs.MFCS.2020.43
• Emirhan Gürpınar and Andrei Romashchenko Communication Complexity of the Secret Key Agreement in Algorithmic Information Theory 10.4230/LIPIcs.MFCS.2020.44
• Kristoffer Arnsfelt Hansen and Steffan Christ Sølvsten ∃ℝ-Completeness of Stationary Nash Equilibria in Perfect Information Stochastic Games 10.4230/LIPIcs.MFCS.2020.45
• Hiroshi Hirai and Ryuhei Mizutani Minimum 0-Extension Problems on Directed Metrics 10.4230/LIPIcs.MFCS.2020.46
• Svein Høgemo, Christophe Paul, and Jan Arne Telle Hierarchical Clusterings of Unweighted Graphs 10.4230/LIPIcs.MFCS.2020.47
• Stefan Jaax and Stefan Kiefer On Affine Reachability Problems 10.4230/LIPIcs.MFCS.2020.48
• Lars Jaffke, Paloma T. Lima, and Geevarghese Philip Structural Parameterizations of Clique Coloring 10.4230/LIPIcs.MFCS.2020.49
• Lars Jaffke, Mateus de Oliveira Oliveira, and Hans Raj Tiwary Compressing Permutation Groups into Grammars and Polytopes. A Graph Embedding Approach 10.4230/LIPIcs.MFCS.2020.50
• Ismaël Jecker, Orna Kupferman, and Nicolas Mazzocchi Unary Prime Languages 10.4230/LIPIcs.MFCS.2020.51
• Vít Jelínek, Michal Opler, and Jakub Pekárek A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes 10.4230/LIPIcs.MFCS.2020.52
• Dhawal Jethwani, François Le Gall, and Sanjay K. Singh Quantum-Inspired Classical Algorithms for Singular Value Transformation 10.4230/LIPIcs.MFCS.2020.53
• Toghrul Karimov, Joël Ouaknine, and James Worrell On LTL Model Checking for Low-Dimensional Discrete Linear Dynamical Systems 10.4230/LIPIcs.MFCS.2020.54
• Piotr Kawałek and Jacek Krzaczkowski Even Faster Algorithms for CSAT Over supernilpotent Algebras 10.4230/LIPIcs.MFCS.2020.55
• Michal Konečný, Florian Steinberg, and Holger Thies Continuous and Monotone Machines 10.4230/LIPIcs.MFCS.2020.56
• Jan Kratochvíl, Tomáš Masařík, and Jana Novotná U-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited 10.4230/LIPIcs.MFCS.2020.57
• Denis Kuperberg and Jan Martens Regular Resynchronizability of Origin Transducers Is Undecidable 10.4230/LIPIcs.MFCS.2020.58
• Orna Kupferman and Ofer Leshkowitz On Repetition Languages 10.4230/LIPIcs.MFCS.2020.59
• Kazuhiro Kurita and Yasuaki Kobayashi Efficient Enumerations for Minimal Multicuts and Multiway Cuts 10.4230/LIPIcs.MFCS.2020.60
• Dietrich Kuske and Christian Schwarz Complexity of Counting First-Order Logic for the Subword Order 10.4230/LIPIcs.MFCS.2020.61
• Sophie Laplante, Reza Naserasr, and Anupa Sunny Sensitivity Lower Bounds from Linear Dependencies 10.4230/LIPIcs.MFCS.2020.62
• Paloma T. Lima, Erik Jan van Leeuwen, and Marieke van der Wegen Algorithms for the Rainbow Vertex Coloring Problem on Graph Classes 10.4230/LIPIcs.MFCS.2020.63
• Paloma T. Lima, Vinicius F. dos Santos, Ignasi Sau, and Uéverton S. Souza Reducing Graph Transversals via Edge Contractions 10.4230/LIPIcs.MFCS.2020.64
• Alexander Lindermayr, Sebastian Siebertz, and Alexandre Vigny Elimination Distance to Bounded Degree on Planar Graphs 10.4230/LIPIcs.MFCS.2020.65
• Sven Linker, Fabio Papacchini, and Michele Sevegnani Analysing Spatial Properties on Neighbourhood Spaces 10.4230/LIPIcs.MFCS.2020.66
• Markus Lohrey and Georg Zetzsche Knapsack and the Power Word Problem in Solvable Baumslag-Solitar Groups 10.4230/LIPIcs.MFCS.2020.67
• Raul Lopes and Ignasi Sau A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps 10.4230/LIPIcs.MFCS.2020.68
• Vincent Michielini and Michał Skrzypczak Regular Choice Functions and Uniformisations For countable Domains 10.4230/LIPIcs.MFCS.2020.69
• Pranabendu Misra, Fahad Panolan, Ashutosh Rai, Saket Saurabh, and Roohani Sharma Quick Separation in Chordal and Split Graphs 10.4230/LIPIcs.MFCS.2020.70
• Nils Morawietz, Carolin Rehs, and Mathias Weller A Timecop’s Work Is Harder Than You Think 10.4230/LIPIcs.MFCS.2020.71
• Janaky Murthy, Vineet Nair, and Chandan Saha Randomized Polynomial-Time Equivalence Between Determinant and Trace-IMM Equivalence Tests 10.4230/LIPIcs.MFCS.2020.72
• Satyadev Nandakumar and Prateek Vishnoi Randomness and Effective Dimension of Continued Fractions 10.4230/LIPIcs.MFCS.2020.73
• Daniel Neider, Patrick Totzke, and Martin Zimmermann Optimally Resilient Strategies in Pushdown Safety Games 10.4230/LIPIcs.MFCS.2020.74
• Rian Neogi, M. S. Ramanujan, Saket Saurabh, and Roohani Sharma On the Parameterized Complexity of Deletion to ℋ-Free Strong Components 10.4230/LIPIcs.MFCS.2020.75
• Mitsunori Ogihara and Kei Uchizawa Synchronous Boolean Finite Dynamical Systems on Directed Graphs over XOR Functions 10.4230/LIPIcs.MFCS.2020.76
• Louis Parlant, Jurriaan Rot, Alexandra Silva, and Bas Westerbaan Preservation of Equations by Monoidal Monads 10.4230/LIPIcs.MFCS.2020.77
• Adam Paszke and Michał Pilipczuk VC Density of Set Systems Definable in Tree-Like Graphs 10.4230/LIPIcs.MFCS.2020.78
• Jarkko Peltomäki and Markus A. Whiteland All Growth Rates of Abelian Exponents Are Attained by Infinite Binary Words 10.4230/LIPIcs.MFCS.2020.79
• Alexander Rabinovich and Doron Tiferet Ambiguity Hierarchy of Regular Infinite Tree Languages 10.4230/LIPIcs.MFCS.2020.80
• Mikhail Rubinchik and Arseny M. Shur Palindromic k-Factorization in Pure Linear Time 10.4230/LIPIcs.MFCS.2020.81
• Ignasi Sau and Uéverton dos Santos Souza Hitting Forbidden Induced Subgraphs on Bounded Treewidth Graphs 10.4230/LIPIcs.MFCS.2020.82
• Yasuhiro Takahashi, Yuki Takeuchi, and Seiichiro Tani Classically Simulating Quantum Circuits with Local Depolarizing Noise 10.4230/LIPIcs.MFCS.2020.83
• Nguyễn Kim Thắng An Improved Approximation Algorithm for Scheduling Under Arborescence Precedence Constraints 10.4230/LIPIcs.MFCS.2020.84
• Caterina Viola and Stanislav Živný The Combined Basic LP and Affine IP Relaxation for Promise VCSPs on Infinite Domains 10.4230/LIPIcs.MFCS.2020.85