default search action
39th STACS 2022: Marseille, France (Virtual Conference)
- Petra Berenbrink, Benjamin Monmege
:
39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference). LIPIcs 219, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-222-8 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:16
- Marie Albenque:
Local Limit of Random Discrete Surface with (Or Without!) a Statistical Physics Model (Invited Talk). 1:1-1:2 - Maria-Florina Balcan:
Generalization Guarantees for Data-Driven Mechanism Design (Invited Talk). 2:1-2:1 - Fabian Kuhn:
Deterministic Distributed Symmetry Breaking at the Example of Distributed Graph Coloring (Invited Talk). 3:1-3:1 - Ramtin Afshar, Michael T. Goodrich, Pedro Matias, Martha C. Osegueda:
Mapping Networks via Parallel kth-Hop Traceroute Queries. 4:1-4:21 - S. Akshay, Hugo Bazille, Blaise Genest, Mihir Vahanwala
On Robustness for the Skolem and Positivity Problems. 5:1-5:20 - Yacine Al-Najjar, Walid Ben-Ameur, Jérémie Leguay:
Approximability of Robust Network Design: The Directed Case. 6:1-6:16 - Pascal Baumann
Existential Definability over the Subword Ordering. 7:1-7:15 - Nikolay Bazhenov, Dariusz Kalocinski, Michal Wroclawski:
Intrinsic Complexity of Recursive Functions on Natural Numbers with Standard Order. 8:1-8:20 - Pierre Bergé, Guillaume Ducoffe, Michel Habib:
Subquadratic-Time Algorithm for the Diameter and All Eccentricities on Median Graphs. 9:1-9:21 - Anup Bhattacharya, Arijit Bishnu, Arijit Ghosh, Gopinath Mishra:
Faster Counting and Sampling Algorithms Using Colorful Decision Oracle. 10:1-10:16 - Laurent Bienvenu, Valentino Delle Rose
Probabilistic vs Deterministic Gamblers. 11:1-11:13 - Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Guido Proietti
Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers. 12:1-12:21 - Ahmad Biniaz, Majid Daliri
A 10-Approximation of the π/2-MST. 13:1-13:15 - Jeremiah Blocki
On Explicit Constructions of Extremely Depth Robust Graphs. 14:1-14:11 - Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa:
Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint. 15:1-15:21 - Patricia Bouyer, Mickael Randour, Pierre Vandenhove
Characterizing Omega-Regularity Through Finite-Memory Determinacy of Games on Infinite Graphs. 16:1-16:16 - Nader H. Bshouty, Catherine A. Haddad-Zaknoon:
On Testing Decision Tree. 17:1-17:16 - Andrei A. Bulatov, Akbar Rafiey:
The Ideal Membership Problem and Abelian Groups. 18:1-18:16 - Antonin Callard
The Aperiodic Domino Problem in Higher Dimension. 19:1-19:15 - Sourav Chakraborty, Arkadev Chattopadhyay, Peter Høyer
Symmetry and Quantum Query-To-Communication Simulation. 20:1-20:23 - Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia:
Near-Optimal Algorithms for Point-Line Covering Problems. 21:1-21:18 - Leroy Chew
Towards Uniform Certification in QBF. 22:1-22:23 - Yung-Chung Chiu, Hsueh-I Lu:
Blazing a Trail via Matrix Multiplications: A Faster Algorithm for Non-Shortest Induced Paths. 23:1-23:16 - Stefan S. Dantchev, Nicola Galesi, Abdul Ghani, Barnaby Martin:
Depth Lower Bounds in Stabbing Planes for Combinatorial Principles. 24:1-24:18 - Bireswar Das, Anant Kumar, Shivdutt Sharma, Dhara Thakkar:
Linear Space Data Structures for Finite Groups with Constant Query-Time. 25:1-25:17 - Heiko Dietrich
The Isomorphism Problem for Plain Groups Is in Σ₃𝖯. 26:1-26:14 - Michael Elkin, Ofer Neiman:
Centralized, Parallel, and Distributed Multi-Source Shortest Paths via Hopsets and Rectangular Matrix Multiplication. 27:1-27:22 - Leah Epstein, Alexandra Lassota
Cardinality Constrained Scheduling in Online Models. 28:1-28:15 - Fedor V. Fomin
Detours in Directed Graphs. 29:1-29:16 - Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, Malte Renken
Delay-Robust Routes in Temporal Graphs. 30:1-30:15 - Hiromichi Goko, Kazuhisa Makino, Shuichi Miyazaki, Yu Yokoi:
Maximally Satisfying Lower Quotas in the Hospitals/Residents Problem with Ties. 31:1-31:20 - Hiromichi Goko, Akitoshi Kawamura, Yasushi Kawase, Kazuhisa Makino, Hanna Sumita:
Online Scheduling on Identical Machines with a Metric State Space. 32:1-32:21 - Éric Goubault, Jérémy Ledent
A Simplicial Model for KB4_n: Epistemic Logic with Agents That May Die. 33:1-33:20 - Petr Gregor
Star Transposition Gray Codes for Multiset Permutations. 34:1-34:14 - Sander Gribling, Harold Nieuwboer
Improved Quantum Lower and Upper Bounds for Matrix Scaling. 35:1-35:23 - Carla Groenland
Tight Bounds for Counting Colorings and Connected Edge Sets Parameterized by Cutwidth. 36:1-36:20 - Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski
Satisfiability of Circuits and Equations over Finite Malcev Algebras. 37:1-37:14 - Lars Jaffke, O-joung Kwon, Jan Arne Telle:
Classes of Intersection Digraphs with Good Algorithmic Properties. 38:1-38:18 - Lawqueen Kanesh, Jayakrishnan Madathil, Sanjukta Roy
Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems. 39:1-39:20 - Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Sang-il Oum:
Obstructions for Matroids of Path-Width at most k and Graphs of Linear Rank-Width at most k. 40:1-40:14 - Telikepalli Kavitha:
Fairly Popular Matchings and Optimality. 41:1-41:22 - Tomohiro Koana, Christian Komusiewicz, André Nichterlein, Frank Sommer:
Covering Many (Or Few) Edges with k Vertices in Sparse Graphs. 42:1-42:18 - Alexander Kozachinskiy:
One-To-Two-Player Lifting for Mildly Growing Memory. 43:1-43:21 - Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse:
If VNP Is Hard, Then so Are Equations for It. 44:1-44:13 - Michael Lampis:
Determining a Slater Winner Is Complete for Parallel Access to NP. 45:1-45:14 - Slawomir Lasota:
Improved Ackermannian Lower Bound for the Petri Nets Reachability Problem. 46:1-46:15 - Quanquan C. Liu, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang:
Scheduling with Communication Delay in Near-Linear Time. 47:1-47:23 - Jack H. Lutz, Neil Lutz, Elvira Mayordomo:
Extending the Reach of the Point-To-Set Principle. 48:1-48:14 - Nikhil S. Mande
One-Way Communication Complexity and Non-Adaptive Decision Trees. 49:1-49:24 - Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki
Isolation Schemes for Problems on Decomposable Graphs. 50:1-50:20 - Daria Pchelina
Oritatami Systems Assemble Shapes No Less Complex Than Tile Assembly Model (ATAM). 51:1-51:23 - Michal Pilipczuk, Marek Sokolowski, Anna Zych-Pawlewicz
Compact Representation for Matrices of Bounded Twin-Width. 52:1-52:14 - C. Ramya, Anamay Tengse:
On Finer Separations Between Subclasses of Read-Once Oblivious ABPs. 53:1-53:23 - Hanlin Ren, Rahul Santhanam
A Relativization Perspective on Meta-Complexity. 54:1-54:13 - András Z. Salamon
Superlinear Lower Bounds Based on ETH. 55:1-55:16 - Martin Skoviera, Peter Varsa:
NP-Completeness of Perfect Matching Index of Cubic Graphs. 56:1-56:12 - Donald M. Stull:
Optimal Oracles for Point-To-Set Principles. 57:1-57:17 - Takeshi Tokuyama
High Quality Consistent Digital Curved Rays via Vector Field Rounding. 58:1-58:17 - Christopher Williamson:
Sharp Indistinguishability Bounds from Non-Uniform Approximations. 59:1-59:15 - Xinyu Wu:
Analyzing XOR-Forrelation Through Stochastic Calculus. 60:1-60:7
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 2024-12-13 19:00 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: