default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID37th STACS 2020: Montpellier, France
- Christophe Paul
, Markus Bläser:
37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, Montpellier, France, March 10-13, 2020. LIPIcs 154, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-140-5 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:12
- Dana Randall:
Statistical Physics and Algorithms (Invited Talk). 1:1-1:6 - Martin Grohe:
Weisfeiler and Leman's Unlikely Journey from Graph Isomorphism to Neural Networks (Invited Talk). 2:1-2:1 - Olivier Bournez:
Computability, Complexity and Programming with Ordinary Differential Equations (Invited Talk). 3:1-3:13 - Martin C. Cooper, Simon de Givry, Thomas Schiex:
Graphical Models: Queries, Complexity, Algorithms (Tutorial). 4:1-4:22 - Marten Maack, Klaus Jansen:
Inapproximability Results for Scheduling with Interval and Resource Restrictions. 5:1-5:18 - Jan Philipp Wächter, Armin Weiß:
An Automaton Group with PSPACE-Complete Word Problem. 6:1-6:17 - Wim Martens, Matthias Niewerth, Tina Trautner:
A Trichotomy for Regular Trail Queries. 7:1-7:16 - Antonin Callard, Mathieu Hoyrup:
Descriptive Complexity on Non-Polish Spaces. 8:1-8:16 - Titus Dose, Christian Glaßer:
NP-Completeness, Proof Systems, and Disjoint NP-Pairs. 9:1-9:18 - Philip Bille, Inge Li Gørtz, Teresa Anna Steiner:
String Indexing with Compressed Patterns. 10:1-10:13 - Yusuke Kobayashi:
An FPT Algorithm for Minimum Additive Spanner Problem. 11:1-11:16 - Susanne Albers, Maximilian Janke:
New Bounds for Randomized List Update in the Paid Exchange Model. 12:1-12:17 - Dan Bergren, Eduard Eiben, Robert Ganian, Iyad Kanj:
On Covering Segments with Unit Intervals. 13:1-13:17 - Jarkko Kari, Etienne Moutot:
Decidability and Periodicity of Low Complexity Tilings. 14:1-14:12 - Manuel Lafond, Binhai Zhu, Peng Zou:
The Tandem Duplication Distance Is NP-Hard. 15:1-15:15 - Pawel Gawrychowski, Martin Lange, Narad Rampersad, Jeffrey O. Shallit, Marek Szykula:
Existential Length Universality. 16:1-16:14 - Walter Hussak, Amitabh Trehan:
On the Termination of Flooding. 17:1-17:13 - Bartlomiej Dudek, Pawel Gawrychowski, Tatiana Starikovskaya:
Generalised Pattern Matching Revisited. 18:1-18:18 - Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlström:
Parameterized Pre-Coloring Extension and List Coloring Problems. 19:1-19:18 - Sevag Gharibian, Stephen Piddock, Justin Yirka:
Oracle Complexity Classes and Local Measurements on Physical Hamiltonians. 20:1-20:37 - Marius Zimand:
Secret Key Agreement from Correlated Data, with No Prior Information. 21:1-21:12 - Michal Ganczorz:
Using Statistical Encoding to Achieve Tree Succinctness Never Seen Before. 22:1-22:29 - Taisuke Izumi, François Le Gall, Frédéric Magniez:
Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model. 23:1-23:13 - Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann, Olivier Serre:
Lower Bounds for Arithmetic Circuits via the Hankel Matrix. 24:1-24:17 - Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich, Maximilian Katzmann:
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs. 25:1-25:14 - Nathalie Aubrun, Julien Esnay, Mathieu Sablik:
Domino Problem Under Horizontal Constraints. 26:1-26:15 - George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev, Philipp Zschoche:
Computing Maximum Matchings in Temporal Graphs. 27:1-27:14 - Brieuc Guinard, Amos Korman:
Tight Bounds for the Cover Times of Random Walks with Heterogeneous Step Lengths. 28:1-28:14 - Falko Hegerfeld, Stefan Kratsch:
Solving Connectivity Problems Parameterized by Treedepth in Single-Exponential Time and Polynomial Space. 29:1-29:16 - Mitsuru Funakoshi, Julian Pape-Lange:
Non-Rectangular Convolutions and (Sub-)Cadences with Three Elements. 30:1-30:16 - Édouard Bonnet, Sergio Cabello, Wolfgang Mulzer:
Maximum Matchings in Geometric Intersection Graphs. 31:1-31:17 - Thomas Colcombet, Sylvain Lombardy:
Unambiguous Separators for Tropical Tree Automata. 32:1-32:13 - Mirmahdi Rahgoshay, Mohammad R. Salavatipour:
Asymptotic Quasi-Polynomial Time Approximation Scheme for Resource Minimization for Fire Containment. 33:1-33:14 - Yi-Jun Chang, Martin Farach-Colton, Tsan-sheng Hsu, Meng-Tsung Tsai:
Streaming Complexity of Spanning Tree Computation. 34:1-34:19 - Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, Kunihiro Wasa:
Shortest Reconfiguration of Colorings Under Kempe Changes. 35:1-35:14 - Eva-Maria C. Hols, Stefan Kratsch, Astrid Pieterse:
Elimination Distances, Blocking Sets, and Kernels for Vertex Cover. 36:1-36:14 - S. Akshay, Nikhil Balaji, Aniket Murhekar, Rohith Varma, Nikhil Vyas:
Near-Optimal Complexity Bounds for Fragments of the Skolem Problem. 37:1-37:18 - Stefan Kratsch, Florian Nelles:
Efficient Parameterized Algorithms for Computing All-Pairs Shortest Paths. 38:1-38:15 - Michal Wrona:
Relational Width of First-Order Expansions of Homogeneous Graphs with Bounded Strict Width. 39:1-39:16 - Michael Blondin, Javier Esparza, Blaise Genest, Martin Helfrich, Stefan Jaax:
Succinct Population Protocols for Presburger Arithmetic. 40:1-40:15 - Lech Duraj:
A Sub-Quadratic Algorithm for the Longest Common Increasing Subsequence Problem. 41:1-41:18 - Andrés Cristi, Mathieu Mari, Andreas Wiese:
Fixed-Parameter Algorithms for Unsplittable Flow Cover. 42:1-42:17 - Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky:
Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm. 43:1-43:18 - Andrés Cristi, Andreas Wiese:
Better Approximations for General Caching and UFP-Cover Under Resource Augmentation. 44:1-44:14 - Srinivasan Arunachalam, Sourav Chakraborty, Michal Koucký, Nitin Saurabh, Ronald de Wolf:
Improved Bounds on Fourier Entropy and Min-Entropy. 45:1-45:19 - Bruno Bauwens:
Information Distance Revisited. 46:1-46:14 - Suryajith Chillara:
On Computing Multilinear Polynomials Using Multi-r-ic Depth Four Circuits. 47:1-47:16 - Dietmar Berwanger, Laurent Doyen:
Observation and Distinction. Representing Information in Infinite Games. 48:1-48:17 - Julian D'Costa, Engel Lefaucheux, Joël Ouaknine, James Worrell:
How Fast Can You Escape a Compact Polytope? 49:1-49:11 - Sidhanth Mohanty, Ryan O'Donnell, Pedro Paredes:
The SDP Value for Random Two-Eigenvalue CSPs. 50:1-50:45 - Xiang Huang, Jack H. Lutz, Elvira Mayordomo, Donald M. Stull:
Asymptotic Divergences and Strong Dichotomy. 51:1-51:15 - S. M. Dhannya, N. S. Narayanaswamy:
Perfect Resolution of Conflict-Free Colouring of Interval Hypergraphs. 52:1-52:16 - Monika Henzinger, Pan Peng:
Constant-Time Dynamic (Δ+1)-Coloring. 53:1-53:18 - Marcelo Arenas, Juan L. Reutter, Etienne Toussaint, Martín Ugarte, Francisco José Vial Prado, Domagoj Vrgoc:
Cryptocurrency Mining Games with Economic Discount and Decreasing Rewards. 54:1-54:16 - André Nies, Frank Stephan:
Randomness and Initial Segment Complexity for Probability Measures. 55:1-55:14 - Jakub Gajarský, Stephan Kreutzer:
Computing Shrub-Depth Decompositions. 56:1-56:17 - Hans L. Bodlaender, Lars Jaffke, Jan Arne Telle:
Typical Sequences Revisited - Computing Width Parameters of Graphs. 57:1-57:16 - Pierre Aboulker, Édouard Bonnet, Eun Jung Kim, Florian Sikora:
Grundy Coloring & Friends, Half-Graphs, Bicliques. 58:1-58:18 - Nikhil Vyas, R. Ryan Williams:
Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms. 59:1-59:17 - Jacobo Torán, Florian Wörz:
Reversible Pebble Games and the Relation Between Tree-Like and General Resolution Space. 60:1-60:18
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-02-11 23:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
