| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Walter Hussak, Amitabh Trehan |
On the Termination of Flooding.  |
STACS  |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Dana Randall |
Statistical Physics and Algorithms (Invited Talk). |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Colcombet, Sylvain Lombardy |
Unambiguous Separators for Tropical Tree Automata. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Felix Hommelsheim, Moritz Mühlenthaler, Oliver Schaudt |
How to Secure Matchings Against Edge Failures. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Niklas Hjuler, Giuseppe F. Italiano, Nikos Parotsidis, David Saulpic |
Dominating Sets and Connected Dominating Sets in Dynamic Graphs. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Emmanuel Jeandel, Pascal Vanier |
A Characterization of Subshifts with Computable Language. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Tom Bannink, Jop Briët, Harry Buhrman, Farrokh Labib, Troy Lee |
Bounding Quantum-Classical Separations for Classes of Nonlocal Games. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Florent Capelli, Stefan Mengel |
Tractable QBF by Knowledge Compilation. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Ágnes Cseh, Attila Juhos |
Pairwise Preferences in the Stable Marriage Problem. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Shaull Almagor, Joël Ouaknine, James Worrell 0001 |
The Semialgebraic Orbit Problem. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrick Landwehr, Christof Löding |
Tree Automata with Global Constraints for Infinite Trees. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephan Kreutzer, Irene Muzi, Patrice Ossona de Mendez, Roman Rabinovich 0001, Sebastian Siebertz |
Algorithmic Properties of Sparse Digraphs. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos |
Modification to Planarity is Fixed Parameter Tractable. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Enoch Peserico |
Paging with Dynamic Memory Capacity. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Derek F. Holt, Markus Lohrey, Saul Schleimer |
Compressed Decision Problems in Hyperbolic Groups. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Stasys Jukna, Andrzej Lingas |
Lower Bounds for DeMorgan Circuits of Bounded Negation Width. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Leslie Ann Goldberg |
Computational Complexity and Partition Functions (Invited Talk). |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Rolf Niedermeier, Christophe Paul (eds.) |
36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany |
STACS |
2019 |
DBLP BibTeX RDF |
|
| 1 | Stefan Kiefer, Corto Mascle |
On Finite Monoids over Nonnegative Integer Matrices and Short Killing Words. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Stefan Walzer |
Constant-Time Retrieval with O(log m) Extra Bits. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Ganardi |
Visibly Pushdown Languages over Sliding Windows. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Gleb Posobin, Alexander Shen |
Random Noise Increases Kolmogorov Complexity and Hausdorff Dimension. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Shahbaz Khan 0004, Shashank K. Mehta |
Depth First Search in the Semi-streaming Model. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | María Emilia Descotte, Diego Figueira, Santiago Figueira |
Closure Properties of Synchronized Relations. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Bart M. P. Jansen, Marcin Pilipczuk, Erik Jan van Leeuwen |
A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | David Auger, Pierre Coucheney, Yann Strozecki |
Solving Simple Stochastic Games with Few Random Nodes Faster Using Bland's Rule. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Pawel Gawrychowski, Florin Manea, Radoslaw Serafin |
Fast and Longest Rollercoasters. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | François Le Gall, Harumichi Nishimura, Ansis Rosmanis |
Quantum Advantage for the LOCAL Model in Distributed Computing. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Gregor Matl, Stanislav Zivný |
Beyond Boolean Surjective VCSPs. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Petra Mutzel |
Algorithmic Data Science (Invited Talk). |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | |
Front Matter, Table of Contents, Preface, Conference Organization. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger |
Dispersing Obnoxious Facilities on a Graph. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Tobias Friedrich 0001 |
From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial). |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Étienne Bamas, Louis Esperet |
Distributed Coloring of Graphs with an Optimal Number of Colors. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Boris Aronov, Omrit Filtser, Matthew J. Katz, Khadijeh Sheikhan |
Bipartite Diameter and Other Measures Under Translation. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos |
Lean Tree-Cut Decompositions: Obstructions and Algorithms. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Kasper Green Larsen |
Constructive Discrepancy Minimization with Hereditary L2 Guarantees. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Birx, Yann Disser |
Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Krauthgamer, Ohad Trabelsi |
The Set Cover Conjecture and Subgraph Isomorphism with a Tree Pattern. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthew Cook 0001, Turlough Neary |
Average-Case Completeness in Tag Systems. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Sandeep Sen |
A Unified Approach to Tail Estimates for Randomized Incremental Construction. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Eva-Maria C. Hols, Stefan Kratsch |
On Kernelization for Edge Dominating Set under Structural Parameters. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Anca Muscholl, Gabriele Puppis |
The Many Facets of String Transducers (Invited Talk). |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Erik Paul |
Finite Sequentiality of Unambiguous Max-Plus Tree Automata. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Max Bannach, Till Tantau |
On the Descriptive Complexity of Color Coding. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Faith Ellen, Rati Gelashvili, Philipp Woelfel, Leqi Zhu |
Space Lower Bounds for the Signal Detection Problem. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Dusan Knop, Michal Pilipczuk, Marcin Wrochna |
Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Chetan Gupta 0002, Vimal Raj Sharma, Raghunath Tewari |
Reachability in O(log n) Genus Graphs is in Unambiguous Logspace. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Spyros Angelopoulos 0001, Christoph Dürr, Shendan Jin |
Best-Of-Two-Worlds Analysis of Online Search. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Julien Destombes, Andrei E. Romashchenko |
Resource-Bounded Kolmogorov Complexity Provides an Obstacle to Soficness of Multidimensional Shifts. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Rémy Belmonte, Eun Jung Kim 0002, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora |
Token Sliding on Split Graphs. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Pál András Papp, Roger Wattenhofer |
Stabilization Time in Weighted Minority Processes. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Eduard Eiben, Dusan Knop, Fahad Panolan, Ondrej Suchý |
Complexity of the Steiner Network Problem with Respect to the Number of Terminals. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan |
Building Strategies into QBF Proofs. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Marthe Bonamy, Oscar Defrain, Marc Heinrich, Jean-Florent Raymond |
Enumerating Minimal Dominating Sets in Triangle-Free Graphs. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Silvia Butti, Stanislav Zivný |
Sparsification of Binary CSPs. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Kurtulus Gemici, Elias Koutsoupias, Barnabé Monnot, Christos H. Papadimitriou, Georgios Piliouras |
Wealth Inequality and the Price of Anarchy. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Kelin Luo, Thomas Erlebach, Yinfeng Xu |
Car-Sharing on a Star Network: On-Line Scheduling with k Servers. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Loff, Sagnik Mukhopadhyay |
Lifting Theorems for Equality. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Antoine Mottet, Karin Quaas |
The Containment Problem for Unambiguous Register Automata. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Watson 0001 |
A ZPPNP[1] Lifting Theorem. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Parinya Chalermsook, Andreas Schmid 0003, Sumedha Uniyal |
A Tight Extremal Bound on the Lovász Cactus Number in Planar Graphs. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Grzegorz Fabianski, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk |
Progressive Algorithms for Domination and Independence. |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Karl Bringmann |
Fine-Grained Complexity Theory (Tutorial). |
STACS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Barbara Geissmann, Stefano Leucci 0001, Chih-Hung Liu 0001, Paolo Penna |
Optimal Dislocation with Persistent Errors in Subquadratic Time. |
STACS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Isolde Adler, Frederik Harwath |
Property Testing for Bounded Degree Databases. |
STACS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Erik D. Demaine, Sarah Eisenstat, Mikhail Rudoy |
Solving the Rubik's Cube Optimally is NP-complete. |
STACS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Clément Carbonnel, David A. Cohen, Martin C. Cooper, Stanislav Zivný |
On Singleton Arc Consistency for CSPs Defined by Monotone Patterns. |
STACS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Damien Pous |
On the Positive Calculus of Relations with Transitive Closure. |
STACS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Yasuhiro Takahashi, Seiichiro Tani |
Power of Uninitialized Qubits in Shallow Quantum Circuits. |
STACS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | André Nies, Frank Stephan 0001 |
Closure of Resource-Bounded Randomness Notions Under Polynomial-Time Permutations. |
STACS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Masashi Kiyomi, Hirotaka Ono 0001, Yota Otachi, Pascal Schweitzer, Jun Tarui |
Space-Efficient Algorithms for Longest Increasing Subsequence. |
STACS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Denis Kuperberg, Anirban Majumdar 0002 |
Width of Non-deterministic Automata. |
STACS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Olaf Beyersdorff, Joshua Blinkhorn |
Genuine Lower Bounds for QBF Expansion. |
STACS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Max Bannach, Till Tantau |
Computing Hitting Set Kernels By AC^0-Circuits. |
STACS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Rémy Belmonte, Michael Lampis, Valia Mitsou |
Parameterized (Approximate) Defective Coloring. |
STACS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | George Giakkoupis, Philipp Woelfel |
An Improved Bound for Random Binary Search Trees with Concurrent Insertions. |
STACS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Arseny M. Shur, Tomasz Walen |
String Periods in the Order-Preserving Model. |
STACS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Pawel Parys |
Recursion Schemes and the WMSO+U Logic. |
STACS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurent Bienvenu, Rodney G. Downey |
On Low for Speed Oracles. |
STACS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Szykula |
Improving the Upper Bound on the Length of the Shortest Reset Word. |
STACS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Hiroshi Hirai 0001, Yuni Iwamasa, Kazuo Murota, Stanislav Zivný |
Beyond JWP: A Tractable Class of Binary VCSPs via M-Convex Intersection. |
STACS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoichi Iwata, Tomoaki Ogasawara, Naoto Ohsaka |
On the Power of Tree-Depth for Fully Polynomial FPT Algorithms. |
STACS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Davide Bilò, Pascal Lenzner |
On the Tree Conjecture for the Network Creation Game. |
STACS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Meena Mahajan |
Lower Bound Techniques for QBF Proof Systems. |
STACS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Bernadette Charron-Bost, Shlomo Moran |
The Firing Squad Problem Revisited. |
STACS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Benedikt Bollig, Marie Fortin, Paul Gastin |
Communicating Finite-State Machines and Two-Variable Logic. |
STACS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Eduard Eiben, Mithilesh Kumar 0001, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz |
Lossy Kernels for Connected Dominating Set on Sparse Graphs. |
STACS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavel Dvorák, Andreas Emil Feldmann, Dusan Knop, Tomás Masarík, Tomas Toufar, Pavel Veselý 0001 |
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. |
STACS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Ganardi, Daniel König, Markus Lohrey, Georg Zetzsche |
Knapsack Problems for Wreath Products. |
STACS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Akanksha Agrawal 0001, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh 0001, Meirav Zehavi |
Erdös-Pósa Property of Obstructions to Interval Graphs. |
STACS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna Adamaszek, Antonios Antoniadis 0001, Amit Kumar 0001, Tobias Mömke |
Approximating Airports and Railways. |
STACS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Jaffke, O-joung Kwon, Jan Arne Telle |
A Unified Polynomial-Time Algorithm for Feedback Vertex Set on Graphs of Bounded Mim-Width. |
STACS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Blondin, Javier Esparza, Stefan Jaax |
Large Flocks of Small Birds: on the Minimal Size of Population Protocols. |
STACS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Taku Onodera, Tetsuo Shibuya |
Succinct Oblivious RAM. |
STACS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Davide Bilò, Keerti Choudhary, Luciano Gualà, Stefano Leucci 0001, Merav Parter, Guido Proietti |
Efficient Oracles and Routing Schemes for Replacement Paths. |
STACS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Ganardi, Danny Hucke, Daniel König, Markus Lohrey, Konstantinos Mamouras |
Automata Theory on Sliding Windows. |
STACS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | |
Front Matter, Table of Contents, Preface, Conference Organization. |
STACS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans Ulrich Simon |
On the Containment Problem for Linear Sets. |
STACS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Lukas Fleischer, Manfred Kufleitner |
The Intersection Problem for Finite Monoids. |
STACS |
2018 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license