researchr
explore
Tags
Journals
Conferences
Authors
Profiles
Groups
calendar
New Conferences
Events
Deadlines
search
search
You are not signed in
Sign in
Sign up
Links
Filter by Year
[-]
OR
AND
NOT
1
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
Filter by Tag
[+]
OR
AND
NOT
1
algebra
C++
Meta-Environment
Pascal
analysis
completeness
constraints
context-aware
data-flow
e-science
graph-rewriting
logic
meta-model
programming
rewriting
routing
rule-based
search
semantics
testing
Filter by Author
[+]
OR
AND
NOT
1
Andris Ambainis
Daniel Lokshtanov
Denis Thérien
Fedor V. Fomin
Friedhelm Meyer auf der Heide
Harry Buhrman
Jack H. Lutz
Jin-yi Cai
Johannes Köbler
Juraj Hromkovic
Lance Fortnow
Markus Lohrey
Michal Pilipczuk
Rolf Niedermeier
Ronald de Wolf
Saket Saurabh
Stefan Kratsch
Thomas Schwentick
Vikraman Arvind
Volker Diekert
Filter by Top terms
[+]
OR
AND
NOT
1
abstract
algorithm
algorithms
approximation
automata
bounded
bounds
complexity
extended
graphs
languages
linear
lower
optimal
polynomial
problem
problems
systems
time
tree
STACS (STACS)
Editions
Publications
Viewing Publication 1 - 100 from 2261
2024
A Faster Algorithm for Vertex Cover Parameterized by Solution Size
David G. Harris 0001
,
N. S. Narayanaswamy
.
STACS 2024
:
[doi]
Algorithms for Computing Closest Points for Segments
Haitao Wang 0001
.
STACS 2024
:
[doi]
Algorithms for Claims Trading
Martin Hoefer 0001
,
Carmine Ventre
,
Lisa Wilhelmi
.
STACS 2024
:
[doi]
A Faster Algorithm for Constructing the Frequency Difference Consensus Tree
Jesper Jansson 0001
,
Wing-Kin Sung
,
Seyed Ali Tabatabaee
,
Yutong Yang
.
STACS 2024
:
[doi]
Front Matter, Table of Contents, Preface, Conference Organization
STACS 2024
:
[doi]
Max Weight Independent Set in Sparse Graphs with No Long Claws
Tara Abrishami
,
Maria Chudnovsky
,
Marcin Pilipczuk
,
Pawel Rzazewski
.
STACS 2024
:
[doi]
Satisfiability of Context-Free String Constraints with Subword-Ordering and Transducers
C. Aiswarya
,
Soumodev Mal
,
Prakash Saivasan
.
STACS 2024
:
[doi]
On a Hierarchy of Spectral Invariants for Graphs
Vikraman Arvind
,
Frank Fuhlbrück
,
Johannes Köbler
,
Oleg Verbitsky 0001
.
STACS 2024
:
[doi]
Computing Twin-Width Parameterized by the Feedback Edge Number
Jakub Balabán
,
Robert Ganian
,
Mathis Rocton
.
STACS 2024
:
[doi]
Faster Graph Algorithms Through DAG Compression
Max Bannach
,
Florian Andreas Marwitz
,
Till Tantau
.
STACS 2024
:
[doi]
Testing Equivalence to Design Polynomials
Omkar Baraskar
,
Agrim Dewan
,
Chandan Saha 0001
.
STACS 2024
:
[doi]
Expressive Quantale-Valued Logics for Coalgebras: An Adjunction-Based Approach
Harsh Beohar
,
Sebastian Gurke
,
Barbara König 0001
,
Karla Messing
,
Jonas Forster
,
Lutz Schröder
,
Paul Wild
.
STACS 2024
:
[doi]
Modal Logic Is More Succinct Iff Bi-Implication Is Available in Some Form
Christoph Berkholz
,
Dietrich Kuske
,
Christian Schwarz
.
STACS 2024
:
[doi]
A Characterization of Efficiently Compilable Constraint Languages
Christoph Berkholz
,
Stefan Mengel
,
Hermann Wilhelm
.
STACS 2024
:
[doi]
Temporalizing Digraphs via Linear-Size Balanced Bi-Trees
Stéphane Bessy
,
Stéphan Thomassé
,
Laurent Viennot
.
STACS 2024
:
[doi]
41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France
Olaf Beyersdorff
,
Mamadou Moustapha Kanté
,
Orna Kupferman
,
Daniel Lokshtanov
, editors,
Volume 289 of
LIPIcs
, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2024.
[doi]
An Improved Approximation Algorithm for Dynamic Minimum Linear Arrangement
Marcin Bienkowski
,
Guy Even
.
STACS 2024
:
[doi]
A Subquadratic Bound for Online Bisection
Marcin Bienkowski
,
Stefan Schmid 0001
.
STACS 2024
:
[doi]
Gapped String Indexing in Subquadratic Space and Sublinear Query Time
Philip Bille
,
Inge Li Gørtz
,
Moshe Lewenstein
,
Solon P. Pissis
,
Eva Rotenberg
,
Teresa Anna Steiner
.
STACS 2024
:
[doi]
Contributions to the Domino Problem: Seeding, Recurrence and Satisfiability
Nicolás Bitar
.
STACS 2024
:
[doi]
Solving Discontinuous Initial Value Problems with Unique Solutions Is Equivalent to Computing over the Transfinite
Olivier Bournez
,
Riccardo Gozzi
.
STACS 2024
:
[doi]
Local Certification of Local Properties: Tight Bounds, Trade-Offs and New Parameters
Nicolas Bousquet
,
Laurent Feuilloley
,
Sébastien Zeitoun
.
STACS 2024
:
[doi]
Removable Online Knapsack and Advice
Hans-Joachim Böckenhauer
,
Fabian Frei
,
Peter Rossmanith
.
STACS 2024
:
[doi]
The Complexity of Homomorphism Reconstructibility
Jan Böker
,
Louis Härtel
,
Nina Runde
,
Tim Seppelt
,
Christoph Standke
.
STACS 2024
:
[doi]
Spectral Approach to the Communication Complexity of Multi-Party Key Agreement
Geoffroy Caillat-Grenier
,
Andrei E. Romashchenko
.
STACS 2024
:
[doi]
Fault-tolerant k-Supplier with Outliers
Deeparnab Chakrabarty
,
Luc Côté
,
Ankita Sarkar
.
STACS 2024
:
[doi]
Approximate Circular Pattern Matching Under Edit Distance
Panagiotis Charalampopoulos
,
Solon P. Pissis
,
Jakub Radoszewski
,
Wojciech Rytter
,
Tomasz Walen
,
Wiktor Zuba
.
STACS 2024
:
[doi]
Depth-3 Circuit Lower Bounds for k-OV
Tameem Choudhury
,
Karteek Sreenivasaiah
.
STACS 2024
:
[doi]
A Myhill-Nerode Theorem for Generalized Automata, with Applications to Pattern Matching and Compression
Nicola Cotumaccio
.
STACS 2024
:
[doi]
Nonnegativity Problems for Matrix Semigroups
Julian D'Costa
,
Joël Ouaknine
,
James Worrell 0001
.
STACS 2024
:
[doi]
One n Remains to Settle the Tree Conjecture
Jack Dippel
,
Adrian Vetta
.
STACS 2024
:
[doi]
Semënov Arithmetic, Affine {VASS}, and String Constraints
Andrei Draghici
,
Christoph Haase
,
Florin Manea
.
STACS 2024
:
[doi]
On the Power of Border Width-2 ABPs over Fields of Characteristic 2
Pranjal Dutta
,
Christian Ikenmeyer
,
Balagopal Komarath
,
Harshil Mittal
,
Saraswati Girish Nanoti
,
Dhara Thakkar
.
STACS 2024
:
[doi]
Fixed-Parameter Debordering of Waring Rank
Pranjal Dutta
,
Fulvio Gesmundo
,
Christian Ikenmeyer
,
Gorav Jindal
,
Vladimir Lysikov
.
STACS 2024
:
[doi]
O(1/ε) Is the Answer in Online Weighted Throughput Maximization
Franziska Eberle
.
STACS 2024
:
[doi]
Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs
Marek Filakovský
,
Tamio-Vesa Nakajima
,
Jakub Oprsal
,
Gianluca Tasinato
,
Uli Wagner 0001
.
STACS 2024
:
[doi]
The 2-Attractor Problem Is NP-Complete
Janosch Fuchs
,
Philip Whittington
.
STACS 2024
:
[doi]
Directed Regular and Context-Free Languages
Moses Ganardi
,
Irmak Saglam
,
Georg Zetzsche
.
STACS 2024
:
[doi]
Online Simple Knapsack with Bounded Predictions
Matthias Gehnen
,
Henri Lotze
,
Peter Rossmanith
.
STACS 2024
:
[doi]
Quantum and Classical Communication Complexity of Permutation-Invariant Functions
Ziyi Guan
,
Yunqi Huang
,
Penghui Yao
,
Zekun Ye
.
STACS 2024
:
[doi]
The AC⁰-Complexity of Visibly Pushdown Languages
Stefan Göller
,
Nathan Grosshans
.
STACS 2024
:
[doi]
Linear Loop Synthesis for Quadratic Invariants
S. Hitarth
,
George Kenison
,
Laura Kovács
,
Anton Varonka
.
STACS 2024
:
[doi]
Decremental Sensitivity Oracles for Covering and Packing Minors
Lawqueen Kanesh
,
Fahad Panolan
,
M. S. Ramanujan 0001
,
Peter Strulo
.
STACS 2024
:
[doi]
Circuit Equivalence in 2-Nilpotent Algebras
Piotr Kawalek
,
Michael Kompatscher
,
Jacek Krzaczkowski
.
STACS 2024
:
[doi]
The Subpower Membership Problem of 2-Nilpotent Algebras
Michael Kompatscher
.
STACS 2024
:
[doi]
Parameterized and Approximation Algorithms for Coverings Points with Segments in the Plane
Katarzyna Anna Kowalska
,
Michal Pilipczuk
.
STACS 2024
:
[doi]
FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs
Matthias Lanzinger
,
Igor Razgon
.
STACS 2024
:
[doi]
Sub-Exponential Time Lower Bounds for #VC and #Matching on 3-Regular Graphs
Ying Liu
,
Shiteng Chen
.
STACS 2024
:
[doi]
On the Exact Matching Problem in Dense Graphs
Nicolas El Maalouly
,
Sebastian Haslebacher
,
Lasse Wulf
.
STACS 2024
:
[doi]
Arena-Independent Memory Bounds for Nash Equilibria in Reachability Games
James C. A. Main
.
STACS 2024
:
[doi]
Weighted HOM-Problem for Nonnegative Integers
Andreas Maletti
,
Andreea-Teodora Nász
,
Erik Paul
.
STACS 2024
:
[doi]
Worst-Case and Smoothed Analysis of the Hartigan-Wong Method for k-Means Clustering
Bodo Manthey
,
Jesse van Rhijn
.
STACS 2024
:
[doi]
Homomorphism-Distinguishing Closedness for Graphs of Bounded Tree-Width
Daniel Neuen
.
STACS 2024
:
[doi]
Positionality in Σ⁰₂ and a Completeness Result
Pierre Ohlmann
,
Michal Skrzypczak
.
STACS 2024
:
[doi]
Polynomial-Time Pseudodeterministic Constructions (Invited Talk)
Igor C. Oliveira
.
STACS 2024
:
[doi]
Tree-Layout Based Graph Classes: Proper Chordal Graphs
Christophe Paul
,
Evangelos Protopapas
.
STACS 2024
:
[doi]
The Role of Local Algorithms in Privacy (Invited Talk)
Sofya Raskhodnikova
.
STACS 2024
:
[doi]
Randomized Query Composition and Product Distributions
Swagato Sanyal
.
STACS 2024
:
[doi]
Shortest Two Disjoint Paths in Conservative Graphs
Ildikó Schlotter
.
STACS 2024
:
[doi]
Structurally Tractable Graph Classes (Invited Talk)
Szymon Torunczyk
.
STACS 2024
:
[doi]
Lower Bounds for Set-Blocked Clauses Proofs
Emre Yolcu
.
STACS 2024
:
[doi]
2023
Regular Separability in Büchi VASS
Pascal Baumann 0001
,
Roland Meyer 0001
,
Georg Zetzsche
.
STACS 2023
:
[doi]
Front Matter, Table of Contents, Preface, Conference Organization
STACS 2023
:
[doi]
The Complexity of Checking Quasi-Identities over Finite Algebras with a Mal'cev Term
Erhard Aichinger
,
Simon Grünbacher
.
STACS 2023
:
[doi]
Packing Odd Walks and Trails in Multiterminal Networks
Maxim Akhmedov
,
Maxim A. Babenko
.
STACS 2023
:
[doi]
Improved Weighted Matching in the Sliding Window Model
Cezar-Mihail Alexandru
,
Pavel Dvorák
,
Christian Konrad 0001
,
Kheeran K. Naidu
.
STACS 2023
:
[doi]
Approximate Sampling and Counting of Graphs with Near-Regular Degree Intervals
Georgios Amanatidis
,
Pieter Kleer
.
STACS 2023
:
[doi]
Enumerating Regular Languages with Bounded Delay
Antoine Amarilli
,
Mikaël Monet
.
STACS 2023
:
[doi]
40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany
Petra Berenbrink
,
Patricia Bouyer
,
Anuj Dawar
,
Mamadou Moustapha Kanté
, editors,
Volume 254 of
LIPIcs
, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2023.
[doi]
Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width
Pierre Bergé
,
Édouard Bonnet
,
Hugues Déprés
,
Rémi Watrigant
.
STACS 2023
:
[doi]
On the Multilinear Complexity of Associative Algebras
Markus Bläser
,
Hendrik Mayer
,
Devansh Shringi
.
STACS 2023
:
[doi]
Tight Bounds for Connectivity Problems Parameterized by Cutwidth
Narek Bojikian
,
Vera Chekan
,
Falko Hegerfeld
,
Stefan Kratsch
.
STACS 2023
:
[doi]
Non-Adaptive Proper Learning Polynomials
Nader H. Bshouty
.
STACS 2023
:
[doi]
Cut Paths and Their Remainder Structure, with Applications
Massimo Cairo
,
Shahbaz Khan 0004
,
Romeo Rizzi
,
Sebastian S. Schmidt
,
Alexandru I. Tomescu
,
Elia C. Zirondelli
.
STACS 2023
:
[doi]
Geometric Amortization of Enumeration Algorithms
Florent Capelli
,
Yann Strozecki
.
STACS 2023
:
[doi]
One Drop of Non-Determinism in a Random Deterministic Automaton
Arnaud Carayol
,
Philippe Duchon
,
Florent Koechlin
,
Cyril Nicaud
.
STACS 2023
:
[doi]
Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank
Dror Chawin
,
Ishay Haviv
.
STACS 2023
:
[doi]
Extending Merge Resolution to a Family of QBF-Proof Systems
Sravanthi Chede
,
Anil Shukla
.
STACS 2023
:
[doi]
On Hardness of Testing Equivalence to Sparse Polynomials Under Shifts
Suryajith Chillara
,
Coral Grichener
,
Amir Shpilka
.
STACS 2023
:
[doi]
An Approximation Algorithm for Distance-Constrained Vehicle Routing on Trees
Marc Dufay
,
Claire Mathieu
,
Hang Zhou 0001
.
STACS 2023
:
[doi]
Representation of Short Distances in Structurally Sparse Graphs
Zdenek Dvorák
.
STACS 2023
:
[doi]
Counting Temporal Paths
Jessica A. Enright
,
Kitty Meeks
,
Hendrik Molter
.
STACS 2023
:
[doi]
Barriers for Faster Dimensionality Reduction
Ora Nova Fandina
,
Mikael Møller Høgsgaard
,
Kasper Green Larsen
.
STACS 2023
:
[doi]
A Regular and Complete Notion of Delay for Streaming String Transducers
Emmanuel Filiot
,
Ismaël Jecker
,
Christof Löding
,
Sarah Winter
.
STACS 2023
:
[doi]
New Clocks, Optimal Line Formation and Self-Replication Population Protocols
Leszek Gasieniec
,
Paul G. Spirakis
,
Grzegorz Stachowiak
.
STACS 2023
:
[doi]
Avoidance Games Are PSPACE-Complete
Valentin Gledel
,
Nacim Oijid
.
STACS 2023
:
[doi]
Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-Compositions
Klaus Heeger
,
André Nichterlein
,
Rolf Niedermeier
.
STACS 2023
:
[doi]
Relating Description Complexity to Entropy
Reijo Jaakkola
,
Antti Kuusisto
,
Miikka Vilander
.
STACS 2023
:
[doi]
Finding and Counting Patterns in Sparse Graphs
Balagopal Komarath
,
Anant Kumar
,
Suchismita Mishra
,
Aditi Sethia
.
STACS 2023
:
[doi]
A Brief History of History-Determinism (Invited Talk)
Karoliina Lehtinen
.
STACS 2023
:
[doi]
k) Time FPT Algorithm for Convex Flip Distance
Haohong Li
,
Ge Xia
.
STACS 2023
:
[doi]
Tight Bounds for Repeated Balls-Into-Bins
Dimitrios Los
,
Thomas Sauerwald
.
STACS 2023
:
[doi]
Reconfiguration of Digraph Homomorphisms
Benjamin Lévêque
,
Moritz Mühlenthaler
,
Thomas Suzan
.
STACS 2023
:
[doi]
Exact Matching: Algorithms and Related Problems
Nicolas El Maalouly
.
STACS 2023
:
[doi]
Sublinear-Time Probabilistic Cellular Automata
Augusto Modanese
.
STACS 2023
:
[doi]
Real Numbers Equally Compressible in Every Base
Satyadev Nandakumar
,
Subin Pulari
.
STACS 2023
:
[doi]
An Algebraic Approach to Vectorial Programs
Charles Paperman
,
Sylvain Salvati
,
Claire Soyez-Martin
.
STACS 2023
:
[doi]
Reconstructing Words Using Queries on Subwords or Factors
Gwénaël Richomme
,
Matthieu Rosenfeld
.
STACS 2023
:
[doi]
Logical Algorithmics: From Theory to Practice (Invited Talk)
Moshe Y. Vardi
.
STACS 2023
:
[doi]
The Complexity of Translationally Invariant Problems Beyond Ground State Energies
James D. Watson
,
Johannes Bausch
,
Sevag Gharibian
.
STACS 2023
:
[doi]
Sign in
or
sign up
to see more results.