| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Patrice Ossona de Mendez |
First-Order Transductions of Graphs (Invited Talk).  |
STACS  |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Guilhem Gamard, Pierre Guillon 0001, Kévin Perrot, Guillaume Theyssier |
Rice-Like Theorems for Automata Networks. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos |
Digraph Coloring and Distance to Acyclicity. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | William Lochet, Daniel Lokshtanov, Saket Saurabh 0001, Meirav Zehavi |
Exploiting Dense Structures in Parameterized Complexity. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Jugal Garg, Edin Husic, László A. Végh |
Auction Algorithms for Market Equilibrium with Weak Gross Substitute Demands and Their Applications. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Keren Censor-Hillel, Dean Leitersdorf, Volodymyr Polosukhin |
Distance Computations in the Hybrid Network Model via Oracle Simulations. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Ce Jin 0001, Jelani Nelson, Kewen Wu 0001 |
An Improved Sketching Algorithm for Edit Distance. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Simon Apers, András Gilyén, Stacey Jeffery |
A Unified Framework of Quantum Walk Search. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans-Joachim Böckenhauer, Elisabet Burjons, Juraj Hromkovic, Henri Lotze, Peter Rossmanith |
Online Simple Knapsack with Reservation Costs. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Ulrich A. Brodowsky, Stefan Hougardy |
The Approximation Ratio of the 2-Opt Heuristic for the Euclidean Traveling Salesman Problem. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Lohrey |
Subgroup Membership in GL(2, Z). |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan, Saladi Rahul |
Simple Multi-Pass Streaming Algorithms for Skyline Points and Extreme Points. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Mahdi Cheraghchi, Shuichi Hirahara, Dimitrios Myrisiotis, Yuichi Yoshida |
One-Tape Turing Machine and Branching Program Lower Bounds for MCSP. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Sujoy Bhore, Csaba D. Tóth |
On Euclidean Steiner (1+ε)-Spanners. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Ferens, Artur Jez |
Solving One Variable Word Equations in the Free Group in Cubic Time. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Göller, Mathieu Hilaire |
Reachability in Two-Parametric Timed Automata with One Parameter Is EXPSPACE-Complete. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Shaohua Li 0005, Marcin Pilipczuk, Manuel Sorge |
Cluster Editing Parameterized Above Modification-Disjoint P₃-Packings. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Édouard Bonnet |
Inapproximability of Diameter in Super-Linear Time: Beyond the 5/3 Ratio. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Harry Buhrman, Subhasree Patro, Florian Speelman |
A Framework of Quantum Strong Exponential-Time Hypotheses. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Olga Martynova 0001, Alexander Okhotin |
Lower Bounds for Graph-Walking Automata. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Corentin Barloy, Lorenzo Clemente |
Bidimensional Linear Recursive Sequences and Universality of Unambiguous Register Automata. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Bürgisser |
Optimization, Complexity and Invariant Theory (Invited Talk). |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Ramgopal Venkateswaran, Ryan O'Donnell |
Quantum Approximate Counting with Nonadaptive Grover Iterations. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikhail V. Berlinkov, Robert Ferens, Andrew Ryzhikov, Marek Szykula |
Synchronizing Strongly Connected Partial DFAs. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Gibney, Sharma V. Thankachan |
Finding an Optimal Alphabet Ordering for Lyndon Factorization Is Hard. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Joel D. Day, Pamela Fleischmann, Maria Kosche, Tore Koß, Florin Manea, Stefan Siemer |
The Edit Distance to k-Subsequence Universality. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Benjamin Monmege (eds.) |
38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference). |
STACS |
2021 |
DBLP BibTeX RDF |
|
| 1 | Pascal Bergsträßer, Moses Ganardi, Georg Zetzsche |
A Characterization of Wreath Products Where Knapsack Is Decidable. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Christian Komusiewicz, Dieter Kratsch, Van Bang Le |
Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Florent Koechlin, Pablo Rotondo |
Absorbing Patterns in BST-Like Expression-Trees. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Jaffke, Paloma T. Lima, Daniel Lokshtanov |
b-Coloring Parameterized by Clique-Width. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Md Lutfar Rahman, Thomas Watson 0001 |
6-Uniform Maker-Breaker Game Is PSPACE-Complete. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Lidia Tendera |
On the Fluted Fragment (Invited Talk). |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | John Fearnley, Rahul Savani |
A Faster Algorithm for Finding Tarski Fixed Points. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Anselm Haak, Arne Meier, Om Prakash 0002, B. V. Raghavendra Rao |
Parameterised Counting in Logspace. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Joshua A. Grochow, Youming Qiao, Gang Tang |
Average-Case Algorithms for Testing Isomorphism of Polynomials, Algebras, and Multilinear Forms. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, Saket Saurabh 0001 |
Diverse Collections in Matroids and Graphs. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomohiro Koana, Vincent Froese, Rolf Niedermeier |
Binary Matrix Completion Under Diameter Constraints. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Pedro Paredes 0002 |
Spectrum Preserving Short Cycle Removal on Regular Graphs. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Karolina Okrasa, Pawel Rzazewski |
Complexity of the List Homomorphism Problem in Hereditary Graph Classes. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavel Dvorák, Michal Koucký 0001 |
Barrington Plays Cards: The Complexity of Card-Based Protocols. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Dan Bergren, Eduard Eiben, Robert Ganian, Iyad Kanj |
On Covering Segments with Unit Intervals. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Sevag Gharibian, Stephen Piddock, Justin Yirka |
Oracle Complexity Classes and Local Measurements on Physical Hamiltonians. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Dietmar Berwanger, Laurent Doyen 0001 |
Observation and Distinction. Representing Information in Infinite Games. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Susanne Albers, Maximilian Janke |
New Bounds for Randomized List Update in the Paid Exchange Model. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Yusuke Kobayashi 0001 |
An FPT Algorithm for Minimum Additive Spanner Problem. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Olivier Bournez |
Computability, Complexity and Programming with Ordinary Differential Equations (Invited Talk). |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrés Cristi, Andreas Wiese |
Better Approximations for General Caching and UFP-Cover Under Resource Augmentation. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe |
Weisfeiler and Leman's Unlikely Journey from Graph Isomorphism to Neural Networks (Invited Talk). |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Xiang Huang 0001, Jack H. Lutz, Elvira Mayordomo, Donald M. Stull |
Asymptotic Divergences and Strong Dichotomy. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Kratsch, Florian Nelles |
Efficient Parameterized Algorithms for Computing All-Pairs Shortest Paths. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Yi-Jun Chang, Martin Farach-Colton, Tsan-sheng Hsu, Meng-Tsung Tsai |
Streaming Complexity of Spanning Tree Computation. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Lafond, Binhai Zhu, Peng Zou |
The Tandem Duplication Distance Is NP-Hard. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Julian D'Costa, Engel Lefaucheux, Joël Ouaknine, James Worrell 0001 |
How Fast Can You Escape a Compact Polytope? |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Blondin, Javier Esparza, Blaise Genest, Martin Helfrich, Stefan Jaax |
Succinct Population Protocols for Presburger Arithmetic. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | S. Akshay 0001, Nikhil Balaji, Aniket Murhekar, Rohith Varma, Nikhil Vyas 0001 |
Near-Optimal Complexity Bounds for Fragments of the Skolem Problem. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Bläsius, Philipp Fischbeck, Tobias Friedrich 0001, Maximilian Katzmann |
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi 0001, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, Kunihiro Wasa |
Shortest Reconfiguration of Colorings Under Kempe Changes. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | |
Front Matter, Table of Contents, Preface, Conference Organization. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcelo Arenas, Juan L. Reutter, Etienne Toussaint, Martín Ugarte, Francisco José Vial Prado, Domagoj Vrgoc |
Cryptocurrency Mining Games with Economic Discount and Decreasing Rewards. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Mitsuru Funakoshi, Julian Pape-Lange |
Non-Rectangular Convolutions and (Sub-)Cadences with Three Elements. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Titus Dose, Christian Glaßer |
NP-Completeness, Proof Systems, and Disjoint NP-Pairs. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Mirmahdi Rahgoshay, Mohammad R. Salavatipour |
Asymptotic Quasi-Polynomial Time Approximation Scheme for Resource Minimization for Fire Containment. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Bauwens |
Information Distance Revisited. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Marten Maack, Klaus Jansen |
Inapproximability Results for Scheduling with Interval and Resource Restrictions. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Philipp Wächter, Armin Weiß |
An Automaton Group with PSPACE-Complete Word Problem. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Lars Jaffke, Jan Arne Telle |
Typical Sequences Revisited - Computing Width Parameters of Graphs. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | George B. Mertzios, Hendrik Molter, Rolf Niedermeier, Viktor Zamaraev, Philipp Zschoche |
Computing Maximum Matchings in Temporal Graphs. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Marius Zimand |
Secret Key Agreement from Correlated Data, with No Prior Information. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Eva-Maria C. Hols, Stefan Kratsch, Astrid Pieterse |
Elimination Distances, Blocking Sets, and Kernels for Vertex Cover. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Srinivasan Arunachalam, Sourav Chakraborty 0001, Michal Koucký 0001, Nitin Saurabh, Ronald de Wolf |
Improved Bounds on Fourier Entropy and Min-Entropy. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann, Olivier Serre |
Lower Bounds for Arithmetic Circuits via the Hankel Matrix. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Lech Duraj |
A Sub-Quadratic Algorithm for the Longest Common Increasing Subsequence Problem. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Christophe Paul, Markus Bläser (eds.) |
37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, March 10-13, 2020, Montpellier, France. |
STACS |
2020 |
DBLP BibTeX RDF |
|
| 1 | Sidhanth Mohanty, Ryan O'Donnell, Pedro Paredes 0002 |
The SDP Value for Random Two-Eigenvalue CSPs. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Taisuke Izumi, François Le Gall, Frédéric Magniez |
Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Suryajith Chillara |
On Computing Multilinear Polynomials Using Multi-r-ic Depth Four Circuits. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | André Nies, Frank Stephan 0001 |
Randomness and Initial Segment Complexity for Probability Measures. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Vyas 0001, R. Ryan Williams |
Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Jacobo Torán, Florian Wörz |
Reversible Pebble Games and the Relation Between Tree-Like and General Resolution Space. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Édouard Bonnet, Sergio Cabello, Wolfgang Mulzer |
Maximum Matchings in Geometric Intersection Graphs. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Jakub Gajarský, Stephan Kreutzer |
Computing Shrub-Depth Decompositions. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Monika Henzinger, Pan Peng 0001 |
Constant-Time Dynamic (Δ+1)-Coloring. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Pawel Gawrychowski, Martin Lange, Narad Rampersad, Jeffrey O. Shallit, Marek Szykula |
Existential Length Universality. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Ganczorz |
Using Statistical Encoding to Achieve Tree Succinctness Never Seen Before. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Wim Martens, Matthias Niewerth, Tina Trautner |
A Trichotomy for Regular Trail Queries. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Falko Hegerfeld, Stefan Kratsch |
Solving Connectivity Problems Parameterized by Treedepth in Single-Exponential Time and Polynomial Space. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Philip Bille, Inge Li Gørtz, Teresa Anna Steiner |
String Indexing with Compressed Patterns. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrés Cristi, Mathieu Mari, Andreas Wiese |
Fixed-Parameter Algorithms for Unsplittable Flow Cover. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky 0001 |
Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | S. M. Dhannya, N. S. Narayanaswamy |
Perfect Resolution of Conflict-Free Colouring of Interval Hypergraphs. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathalie Aubrun, Julien Esnay, Mathieu Sablik |
Domino Problem Under Horizontal Constraints. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlström |
Parameterized Pre-Coloring Extension and List Coloring Problems. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Brieuc Guinard, Amos Korman |
Tight Bounds for the Cover Times of Random Walks with Heterogeneous Step Lengths. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Antonin Callard, Mathieu Hoyrup |
Descriptive Complexity on Non-Polish Spaces. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Jarkko Kari, Etienne Moutot |
Decidability and Periodicity of Low Complexity Tilings. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin C. Cooper, Simon de Givry, Thomas Schiex |
Graphical Models: Queries, Complexity, Algorithms (Tutorial). |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Bartlomiej Dudek 0001, Pawel Gawrychowski, Tatiana Starikovskaya |
Generalised Pattern Matching Revisited. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Wrona |
Relational Width of First-Order Expansions of Homogeneous Graphs with Bounded Strict Width. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Aboulker, Édouard Bonnet, Eun Jung Kim 0002, Florian Sikora |
Grundy Coloring & Friends, Half-Graphs, Bicliques. |
STACS |
2020 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license