default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID38th STACS 2021: Saarbrücken, Germany (Virtual Conference)
- Markus Bläser, Benjamin Monmege
:
38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, Saarbrücken, Germany (Virtual Conference), March 16-19, 2021. LIPIcs 187, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-180-1 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:16
- Peter Bürgisser:
Optimization, Complexity and Invariant Theory (Invited Talk). 1:1-1:20 - Patrice Ossona de Mendez:
First-Order Transductions of Graphs (Invited Talk). 2:1-2:7 - Lidia Tendera:
On the Fluted Fragment (Invited Talk). 3:1-3:1 - Divesh Aggarwal, Yanlin Chen, Rajendra Kumar, Yixin Shen:
Improved (Provable) Algorithms for the Shortest Vector Problem via Bounded Distance Decoding. 4:1-4:20 - Akanksha Agrawal, Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, Saket Saurabh:
An FPT Algorithm for Elimination Distance to Bounded Degree Graphs. 5:1-5:11 - Simon Apers, András Gilyén, Stacey Jeffery:
A Unified Framework of Quantum Walk Search. 6:1-6:13 - Anna Arutyunova, Melanie Schmidt:
Achieving Anonymity via Weak Lower Bound Constraints for k-Median and k-Means. 7:1-7:17 - Corentin Barloy, Lorenzo Clemente:
Bidimensional Linear Recursive Sequences and Universality of Unambiguous Register Automata. 8:1-8:15 - Siddharth Barman, Omar Fawzi, Paul Fermé:
Tight Approximation Guarantees for Concave Coverage Problems. 9:1-9:17 - Libor Barto, Diego Battistelli, Kevin M. Berg:
Symmetric Promise Constraint Satisfaction Problems: Beyond the Boolean Case. 10:1-10:16 - Pascal Bergsträßer, Moses Ganardi, Georg Zetzsche:
A Characterization of Wreath Products Where Knapsack Is Decidable. 11:1-11:17 - Mikhail V. Berlinkov, Robert Ferens, Andrew Ryzhikov, Marek Szykula:
Synchronizing Strongly Connected Partial DFAs. 12:1-12:16 - Sujoy Bhore, Csaba D. Tóth:
On Euclidean Steiner (1+ε)-Spanners. 13:1-13:16 - Marcin Bienkowski, Björn Feldkord, Pawel Schmidt:
A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location. 14:1-14:17 - Andreas Björklund:
An Asymptotically Fast Polynomial Space Algorithm for Hamiltonicity Detection in Sparse Directed Graphs. 15:1-15:12 - Hans-Joachim Böckenhauer, Elisabet Burjons, Juraj Hromkovic, Henri Lotze, Peter Rossmanith:
Online Simple Knapsack with Reservation Costs. 16:1-16:18 - Édouard Bonnet:
Inapproximability of Diameter in Super-Linear Time: Beyond the 5/3 Ratio. 17:1-17:13 - Ulrich A. Brodowsky, Stefan Hougardy:
The Approximation Ratio of the 2-Opt Heuristic for the Euclidean Traveling Salesman Problem. 18:1-18:15 - Harry Buhrman, Subhasree Patro, Florian Speelman:
A Framework of Quantum Strong Exponential-Time Hypotheses. 19:1-19:19 - Silvia Butti, Victor Dalmau:
The Complexity of the Distributed Constraint Satisfaction Problem. 20:1-20:18 - Keren Censor-Hillel, Dean Leitersdorf, Volodymyr Polosukhin:
Distance Computations in the Hybrid Network Model via Oracle Simulations. 21:1-21:19 - Timothy M. Chan, Saladi Rahul:
Simple Multi-Pass Streaming Algorithms for Skyline Points and Extreme Points. 22:1-22:14 - Mahdi Cheraghchi, Shuichi Hirahara, Dimitrios Myrisiotis, Yuichi Yoshida:
One-Tape Turing Machine and Branching Program Lower Bounds for MCSP. 23:1-23:19 - Amin Coja-Oghlan, Max Hahn-Klimroth, Philipp Loick, Noëla Müller, Konstantinos Panagiotou, Matija Pasch:
Inference and Mutual Information on Random Factor Graphs. 24:1-24:15 - Joel D. Day, Pamela Fleischmann, Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer:
The Edit Distance to k-Subsequence Universality. 25:1-25:19 - Pavel Dvorák, Michal Koucký:
Barrington Plays Cards: The Complexity of Card-Based Protocols. 26:1-26:17 - Thomas Erlebach, Michael Hoffmann, Murilo Santos de Lima:
Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries. 27:1-27:18 - Léo Exibard, Emmanuel Filiot, Ayrat Khalimov:
Church Synthesis on Register Automata over Linearly Ordered Data Domains. 28:1-28:16 - John Fearnley, Rahul Savani:
A Faster Algorithm for Finding Tarski Fixed Points. 29:1-29:16 - Robert Ferens, Artur Jez:
Solving One Variable Word Equations in the Free Group in Cubic Time. 30:1-30:17 - Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh:
Diverse Collections in Matroids and Graphs. 31:1-31:14 - Guilhem Gamard, Pierre Guillon, Kévin Perrot, Guillaume Theyssier:
Rice-Like Theorems for Automata Networks. 32:1-32:17 - Jugal Garg, Edin Husic, László A. Végh:
Auction Algorithms for Market Equilibrium with Weak Gross Substitute Demands and Their Applications. 33:1-33:19 - Pawel Gawrychowski, Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer:
Efficiently Testing Simon's Congruence. 34:1-34:18 - Daniel Gibney, Sharma V. Thankachan:
Finding an Optimal Alphabet Ordering for Lyndon Factorization Is Hard. 35:1-35:15 - Stefan Göller, Mathieu Hilaire:
Reachability in Two-Parametric Timed Automata with One Parameter Is EXPSPACE-Complete. 36:1-36:18 - Petr A. Golovach, Christian Komusiewicz, Dieter Kratsch, Van Bang Le:
Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration. 37:1-37:18 - Joshua A. Grochow, Youming Qiao, Gang Tang:
Average-Case Algorithms for Testing Isomorphism of Polynomials, Algebras, and Multilinear Forms. 38:1-38:17 - Zhengyang Guo, Yi Li:
Geometric Cover with Outliers Removal. 39:1-39:15 - Anselm Haak, Arne Meier, Om Prakash, B. V. Raghavendra Rao:
Parameterised Counting in Logspace. 40:1-40:17 - Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos:
Digraph Coloring and Distance to Acyclicity. 41:1-41:15 - Jacob Holm, Eva Rotenberg:
Good r-Divisions Imply Optimal Amortized Decremental Biconnectivity. 42:1-42:18 - Lars Jaffke, Paloma T. Lima, Daniel Lokshtanov:
b-Coloring Parameterized by Clique-Width. 43:1-43:15 - Ismaël Jecker:
A Ramsey Theorem for Finite Monoids. 44:1-44:13 - Ce Jin, Jelani Nelson, Kewen Wu:
An Improved Sketching Algorithm for Edit Distance. 45:1-45:16 - Haim Kaplan, Jay Tenenbaum:
Locality Sensitive Hashing for Efficient Similar Polygon Retrieval. 46:1-46:16 - Tomohiro Koana, Vincent Froese, Rolf Niedermeier:
Binary Matrix Completion Under Diameter Constraints. 47:1-47:14 - Florent Koechlin, Pablo Rotondo:
Absorbing Patterns in BST-Like Expression-Trees. 48:1-48:15 - Shaohua Li, Marcin Pilipczuk, Manuel Sorge:
Cluster Editing Parameterized Above Modification-Disjoint P₃-Packings. 49:1-49:16 - William Lochet, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Exploiting Dense Structures in Parameterized Complexity. 50:1-50:17 - Markus Lohrey:
Subgroup Membership in GL(2, Z). 51:1-51:17 - Olga Martynova, Alexander Okhotin:
Lower Bounds for Graph-Walking Automata. 52:1-52:13 - Meike Neuwohner:
An Improved Approximation Algorithm for the Maximum Weight Independent Set Problem in d-Claw Free Graphs. 53:1-53:20 - Karolina Okrasa, Pawel Rzazewski:
Complexity of the List Homomorphism Problem in Hereditary Graph Classes. 54:1-54:17 - Pedro Paredes:
Spectrum Preserving Short Cycle Removal on Regular Graphs. 55:1-55:19 - Marta Piecyk, Pawel Rzazewski:
Fine-Grained Complexity of the List Homomorphism Problem: Feedback Vertex Set and Cutwidth. 56:1-56:17 - Md Lutfar Rahman, Thomas Watson:
6-Uniform Maker-Breaker Game Is PSPACE-Complete. 57:1-57:15 - Pascal Schweitzer, Constantin Seebach:
Resolution with Symmetry Rule Applied to Linear Equations. 58:1-58:16 - Ramgopal Venkateswaran, Ryan O'Donnell:
Quantum Approximate Counting with Nonadaptive Grover Iterations. 59:1-59:12
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-05-17 00:02 CEST 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:
