International Symposium on Theoretical Aspects of Computer Science
STACS
A
CORE rank
CORE rank (raw)
A
Fields of research
Theory of Computation
Papers indexed
2,384
1984–2026
Papers per year
198482 peak2026
Most published authors
STACS papers
2,384 records sourced from DBLP. Search titles, filter by year, sort by recency.
| Year | Title | Authors |
|---|---|---|
| 2017 | On the Complexity of Partial Derivatives. | Ignacio Garca-Marco, Pascal Koiran, Timothe Pecatte, Stphan Thomass |
| 2017 | Combining Treewidth and Backdoors for CSP. | Robert Ganian, M. S. Ramanujan, Stefan Szeider |
| 2017 | Circuit Evaluation for Finite Semirings. | Moses Ganardi, Danny Hucke, Daniel Knig, Markus Lohrey |
| 2017 | On the Decomposition of Finite-Valued Streaming String Transducers. | Paul Gallot, Anca Muscholl, Gabriele Puppis, Sylvain Salvati |
| 2017 | Deterministic Regular Expressions with Back-References. | Dominik D. Freydenberger, Markus L. Schmid |
| 2017 | Matrix Rigidity from the Viewpoint of Parameterized Complexity. | Fedor V. Fomin, Daniel Lokshtanov, Syed Mohammad Meesum, Saket Saurabh, Meirav Zehavi |
| 2017 | Improving and Extending the Testing of Distributions for Shape-Restricted Properties. | Eldar Fischer, Oded Lachish, Yadu Vasudev |
| 2017 | The First-Order Logic of Hyperproperties. | Bernd Finkbeiner, Martin Zimmermann |
| 2017 | Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem. | Nathanal Fijalkow, Pierre Ohlmann, Jol Ouaknine, Amaury Pouly, James Worrell |
| 2017 | Independent Sets near the Lower Bound in Bounded Degree Graphs. | Zdenek Dvork, Bernard Lidick |
| 2017 | Graphic TSP in Cubic Graphs. | Zdenek Dvork, Daniel Krl, Bojan Mohar |
| 2017 | Robust and Adaptive Search. | Yann Disser, Stefan Kratsch |
| 2017 | Counting Edge-Injective Homomorphisms and Matchings on Restricted Graph Classes. | Radu Curticapean, Holger Dell, Marc Roth |
| 2017 | Separability of Reachability Sets of Vector Addition Systems. | Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, Charles Paperman |
| 2017 | Fractional Coverings, Greedy Coverings, and Rectifier Networks. | Dmitry Chistikov, Szabolcs Ivn, Anna Lubiw, Jeffrey O. Shallit |
| 2017 | Lower Bounds for Elimination via Weak Regularity. | Arkadev Chattopadhyay, Pavel Dvork, Michal Kouck, Bruno Loff, Sagnik Mukhopadhyay |
| 2017 | Extended Learning Graphs for Triangle Finding. | Titouan Carette, Mathieu Laurire, Frdric Magniez |
| 2017 | On Long Words Avoiding Zimin Patterns. | Arnaud Carayol, Stefan Gller |
| 2017 | The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex. | Benjamin A. Burton, Sergio Cabello, Stefan Kratsch, William Pettersson |
| 2017 | Monte Carlo Computability. | Vasco Brattka, Rupert Hlzl, Rutger Kuyper |
| 2017 | Complexity of Token Swapping and its Variants. | douard Bonnet, Tillmann Miltzow, Pawel Rzazewski |
| 2017 | Optimizing Tree Decompositions in MSO. | Mikolaj Bojanczyk, Michal Pilipczuk |
| 2017 | On Bchi One-Counter Automata. | Stanislav Bhm, Stefan Gller, Simon Halfon, Piotr Hofman |
| 2017 | Existential-R-Complete Decision Problems about Symmetric Nash Equilibria in Symmetric Multi-Player Games. | Vittorio Bil, Marios Mavronicolas |
| 2017 | On Polynomial Approximations Over Z/2^kZ*. | Abhishek Bhrushundi, Prahladh Harsha, Srikanth Srinivasan |
601–625 of 2,384← PreviousNext →
Comparable venues
Other A*/A conferences filed under the same field of research.
- A*SODAACM/SIAM Symposium on Discrete Algorithms
- A*ICALPInternational Colloquium on Automata Languages and Programming
- A*STOCACM Symposium on Theory of Computing
- A*FOCSIEEE Symposium on Foundations of Computer Science
- AESAEuropean Symposium on Algorithms
- A*LICSIEEE Symposium on Logic in Computer Science
- AGDGraph Drawing
- AALENEXWorkshop on Algorithm Engineering and Experiments