| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Petra Berenbrink, Patricia Bouyer, Anuj Dawar, Mamadou Moustapha Kanté (eds.) |
40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany.  |
STACS  |
2023 |
DBLP BibTeX RDF |
|
| 1 | Ruiwen Dong 0001 |
Semigroup Intersection Problems in the Heisenberg Groups. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Lévêque, Moritz Mühlenthaler, Thomas Suzan |
Reconfiguration of Digraph Homomorphisms. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Sravanthi Chede, Anil Shukla |
Extending Merge Resolution to a Family of QBF-Proof Systems. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas El Maalouly |
Exact Matching: Algorithms and Related Problems. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Bergougnoux, Tuukka Korhonen, Jesper Nederlof |
Tight Lower Bounds for Problems Parameterized by Rank-Width. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Charles Paperman, Sylvain Salvati, Claire Soyez-Martin |
An Algebraic Approach to Vectorial Programs. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxim Akhmedov, Maxim A. Babenko |
Packing Odd Walks and Trails in Multiterminal Networks. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Naoto Ohsaka |
Gap Preserving Reductions Between Reconfiguration Problems. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Georgios Amanatidis, Pieter Kleer |
Approximate Sampling and Counting of Graphs with Near-Regular Degree Intervals. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Stéphan Thomassé |
Twin-Width V: Linear Minors, Modular Counting, and Matrix Multiplication. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Lorenzo Clemente, Maria Donten-Bury, Filip Mazowiecki, Michal Pilipczuk |
On Rational Recursive Sequences. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Monika Henzinger, Stefan Neumann 0003, Harald Räcke, Stefan Schmid 0001 |
Dynamic Maintenance of Monotone Dynamic Programs and Applications. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Dufay, Claire Mathieu, Hang Zhou 0001 |
An Approximation Algorithm for Distance-Constrained Vehicle Routing on Trees. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Jedrzej Olkowski, Michal Pilipczuk, Mateusz Rychlicki, Karol Wegrzycki, Anna Zych-Pawlewicz |
Dynamic Data Structures for Parameterized String Problems. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Ora Nova Fandina, Mikael Møller Høgsgaard, Kasper Green Larsen |
Barriers for Faster Dimensionality Reduction. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | François Le Gall, Masayuki Miyamoto, Harumichi Nishimura |
Distributed Quantum Interactive Proofs. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Chrobak, Samuel Haney, Mehraneh Liaee, Debmalya Panigrahi, Rajmohan Rajaraman, Ravi Sundaram, Neal E. Young |
Online Paging with Heterogeneous Cache Slots. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Bireswar Das, Anant Kumar, Shivdutt Sharma, Dhara Thakkar |
Linear Space Data Structures for Finite Groups with Constant Query-Time. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, Malte Renken |
Delay-Robust Routes in Temporal Graphs. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Catherine A. Haddad-Zaknoon |
On Testing Decision Tree. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Heiko Dietrich, Murray Elder, Adam Piggott, Youming Qiao, Armin Weiß |
The Isomorphism Problem for Plain Groups Is in Σ₃. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Donald M. Stull |
Optimal Oracles for Point-To-Set Principles. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Mamadou Moustapha Kanté, Eun Jung Kim 0002, O-joung Kwon, Sang-il Oum |
Obstructions for Matroids of Path-Width at most k and Graphs of Linear Rank-Width at most k. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi 0001, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa |
Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil S. Mande, Swagato Sanyal, Suhail Sherif |
One-Way Communication Complexity and Non-Adaptive Decision Trees. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Ahmad Biniaz, Majid Daliri, Amir Hossein Moradpour |
A 10-Approximation of the π/2-MST. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | S. Akshay 0001, Hugo Bazille, Blaise Genest, Mihir Vahanwala |
On Robustness for the Skolem and Positivity Problems. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Leroy Chew, Friedrich Slivovsky |
Towards Uniform Certification in QBF. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Fabian Kuhn |
Deterministic Distributed Symmetry Breaking at the Example of Distributed Graph Coloring (Invited Talk). |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Marie Albenque |
Local Limit of Random Discrete Surface with (Or Without!) a Statistical Physics Model (Invited Talk). |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Elkin, Ofer Neiman |
Centralized, Parallel, and Distributed Multi-Source Shortest Paths via Hopsets and Rectangular Matrix Multiplication. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiromichi Goko, Akitoshi Kawamura, Yasushi Kawase, Kazuhisa Makino, Hanna Sumita |
Online Scheduling on Identical Machines with a Metric State Space. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Mickael Randour, Pierre Vandenhove |
Characterizing Omega-Regularity Through Finite-Memory Determinacy of Games on Infinite Graphs. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Lawqueen Kanesh, Jayakrishnan Madathil, Sanjukta Roy, Abhishek Sahu, Saket Saurabh 0001 |
Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Bergé, Guillaume Ducoffe, Michel Habib |
Subquadratic-Time Algorithm for the Diameter and All Eccentricities on Median Graphs. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Anup Bhattacharya, Arijit Bishnu, Arijit Ghosh, Gopinath Mishra |
Faster Counting and Sampling Algorithms Using Colorful Decision Oracle. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Jaffke, O-joung Kwon, Jan Arne Telle |
Classes of Intersection Digraphs with Good Algorithmic Properties. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Gregor, Torsten Mütze, Arturo I. Merino |
Star Transposition Gray Codes for Multiset Permutations. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Kirill Simonov, Saket Saurabh 0001 |
Detours in Directed Graphs. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Kozachinskiy |
One-To-Two-Player Lifting for Mildly Growing Memory. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Pilipczuk, Marek Sokolowski 0001, Anna Zych-Pawlewicz |
Compact Representation for Matrices of Bounded Twin-Width. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Hanlin Ren, Rahul Santhanam |
A Relativization Perspective on Meta-Complexity. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Telikepalli Kavitha |
Fairly Popular Matchings and Optimality. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrei A. Bulatov, Akbar Rafiey |
The Ideal Membership Problem and Abelian Groups. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder |
Cardinality Constrained Scheduling in Online Models. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Ramtin Afshar, Michael T. Goodrich, Pedro Matias 0001, Martha C. Osegueda |
Mapping Networks via Parallel kth-Hop Traceroute Queries. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Skoviera, Peter Varsa |
NP-Completeness of Perfect Matching Index of Cubic Graphs. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Jianer Chen, Qin Huang, Iyad Kanj, Ge Xia |
Near-Optimal Algorithms for Point-Line Covering Problems. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Pascal Baumann 0001, Moses Ganardi, Ramanathan S. Thinniyam, Georg Zetzsche |
Existential Definability over the Subword Ordering. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Antonin Callard, Benjamin Hellouin de Menibus |
The Aperiodic Domino Problem in Higher Dimension. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Mrinal Kumar 0001, C. Ramya, Ramprasad Saptharishi, Anamay Tengse |
If VNP Is Hard, Then so Are Equations for It. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Lampis |
Determining a Slater Winner Is Complete for Parallel Access to NP. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikolay Bazhenov 0001, Dariusz Kalocinski, Michal Wroclawski |
Intrinsic Complexity of Recursive Functions on Natural Numbers with Standard Order. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Jack H. Lutz, Neil Lutz, Elvira Mayordomo |
Extending the Reach of the Point-To-Set Principle. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria-Florina Balcan |
Generalization Guarantees for Data-Driven Mechanism Design (Invited Talk). |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Slawomir Lasota 0001 |
Improved Ackermannian Lower Bound for the Petri Nets Reachability Problem. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurent Bienvenu, Valentino Delle Rose, Tomasz Steifer |
Probabilistic vs Deterministic Gamblers. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Sander Gribling, Harold Nieuwboer |
Improved Quantum Lower and Upper Bounds for Matrix Scaling. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Sourav Chakraborty 0001, Arkadev Chattopadhyay, Peter Høyer, Nikhil S. Mande, Manaswi Paraashar, Ronald de Wolf |
Symmetry and Quantum Query-To-Communication Simulation. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | C. Ramya, Anamay Tengse |
On Finer Separations Between Subclasses of Read-Once Oblivious ABPs. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Christopher Williamson |
Sharp Indistinguishability Bounds from Non-Uniform Approximations. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Yacine Al-Najjar, Walid Ben-Ameur, Jérémie Leguay |
Approximability of Robust Network Design: The Directed Case. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Carla Groenland, Isja Mannens, Jesper Nederlof, Krisztina Szilágyi |
Tight Bounds for Counting Colorings and Connected Edge Sets Parameterized by Cutwidth. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Xinyu Wu |
Analyzing XOR-Forrelation Through Stochastic Calculus. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Yung-Chung Chiu 0001, Hsueh-I Lu |
Blazing a Trail via Matrix Multiplications: A Faster Algorithm for Non-Shortest Induced Paths. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Éric Goubault, Jérémy Ledent, Sergio Rajsbaum |
A Simplicial Model for KB4_n: Epistemic Logic with Agents That May Die. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Petra Berenbrink, Benjamin Monmege (eds.) |
39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference). |
STACS |
2022 |
DBLP BibTeX RDF |
|
| 1 | Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci 0001, Guido Proietti, Mirko Rossi |
Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski |
Satisfiability of Circuits and Equations over Finite Malcev Algebras. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan S. Dantchev, Nicola Galesi, Abdul Ghani 0001, Barnaby Martin |
Depth Lower Bounds in Stabbing Planes for Combinatorial Principles. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki |
Isolation Schemes for Problems on Decomposable Graphs. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Daria Pchelina, Nicolas Schabanel, Shinnosuke Seki, Guillaume Theyssier |
Oritatami Systems Assemble Shapes No Less Complex Than Tile Assembly Model (ATAM). |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Quanquan C. Liu, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang |
Scheduling with Communication Delay in Near-Linear Time. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | |
Front Matter, Table of Contents, Preface, Conference Organization. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | András Z. Salamon, Michael Wehar |
Superlinear Lower Bounds Based on ETH. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeremiah Blocki, Mike Cinkoske, Seunghoon Lee, Jin Young Son |
On Explicit Constructions of Extremely Depth Robust Graphs. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Takeshi Tokuyama, Ryo Yoshimura |
High Quality Consistent Digital Curved Rays via Vector Field Rounding. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiromichi Goko, Kazuhisa Makino, Shuichi Miyazaki, Yu Yokoi |
Maximally Satisfying Lower Quotas in the Hospitals/Residents Problem with Ties. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomohiro Koana, Christian Komusiewicz, André Nichterlein, Frank Sommer |
Covering Many (Or Few) Edges with k Vertices in Sparse Graphs. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Erlebach, Michael Hoffmann 0002, Murilo Santos de Lima |
Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Björklund |
An Asymptotically Fast Polynomial Space Algorithm for Hamiltonicity Detection in Sparse Directed Graphs. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Léo Exibard, Emmanuel Filiot, Ayrat Khalimov 0001 |
Church Synthesis on Register Automata over Linearly Ordered Data Domains. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Libor Barto, Diego Battistelli, Kevin M. Berg |
Symmetric Promise Constraint Satisfaction Problems: Beyond the Boolean Case. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Jacob Holm, Eva Rotenberg |
Good r-Divisions Imply Optimal Amortized Decremental Biconnectivity. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Max Hahn-Klimroth, Philipp Loick, Noëla Müller, Konstantinos Panagiotou, Matija Pasch |
Inference and Mutual Information on Random Factor Graphs. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Ismaël Jecker |
A Ramsey Theorem for Finite Monoids. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Jay Tenenbaum |
Locality Sensitive Hashing for Efficient Similar Polygon Retrieval. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcin Bienkowski, Björn Feldkord, Pawel Schmidt |
A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Siddharth Barman, Omar Fawzi, Paul Fermé |
Tight Approximation Guarantees for Concave Coverage Problems. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Meike Neuwohner |
An Improved Approximation Algorithm for the Maximum Weight Independent Set Problem in d-Claw Free Graphs. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Akanksha Agrawal 0001, Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan 0001, Saket Saurabh 0001 |
An FPT Algorithm for Elimination Distance to Bounded Degree Graphs. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Pascal Schweitzer, Constantin Seebach |
Resolution with Symmetry Rule Applied to Linear Equations. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Pawel Gawrychowski, Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer |
Efficiently Testing Simon's Congruence. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna Arutyunova, Melanie Schmidt 0001 |
Achieving Anonymity via Weak Lower Bound Constraints for k-Median and k-Means. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Marta Piecyk, Pawel Rzazewski |
Fine-Grained Complexity of the List Homomorphism Problem: Feedback Vertex Set and Cutwidth. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhengyang Guo, Yi Li 0002 |
Geometric Cover with Outliers Removal. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Divesh Aggarwal, Yanlin Chen, Rajendra Kumar 0002, Yixin Shen 0001 |
Improved (Provable) Algorithms for the Shortest Vector Problem via Bounded Distance Decoding. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | |
Front Matter, Table of Contents, Preface, Conference Organization. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Silvia Butti, Victor Dalmau |
The Complexity of the Distributed Constraint Satisfaction Problem. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license