Stacs

357 papers131 directions

Papers by Year

2026 16
2025 10
2024 13
2023 10
2022 16
2021 14
2020 10
2019 13
2018 14
2017 17
2016 13
2015 19
2014 14
2013 14
2012 15
2011 11
2010 8
2009 8
2008 10
2007 11
2006 11
2005 11
2004 8
2003 13
2002 6
2001 6
2000 4
1999 9
1998 6
1997 3
1996 5
1995 4
1994 2
1993 4
1992 3
1991 2
1988 1
1987 1
1986 3
1985 1

Top Research Directions

Research directions most represented by papers from this venue.

Proving Computational Intractability Through Hardness Reductions 11
The Empirical Validation Gap 9
Transitioning from Monte Carlo to Deterministic Graph Algorithms 6
From Fractional Solutions to Discrete Decisions 5
Limits of Polynomial Kernelization 4
Complexity Dichotomies for Constraint Satisfaction and Counting Problems 3
Resource Augmentation for Online Algorithms 3
Dynamic Programming on Tree Decompositions 3
Recursive Graph Partitioning 3
Managing Hidden Constant Overhead in Algorithm Design 3
Scaling Model Counting via Universal Hashing 3
Irrevocable Decisions in Online Resource Allocation 3
The Empirical Validation Gap in Algorithmic Design 3
Iterative Partial Coloring and the Nibble Method 2
Approximate Model Counting via Universal Hashing 2

Top Authors

AuthorPapers
Georg Zetzsche9
Kurt Mehlhorn9
Paul G. Spirakis8
Robert Ganian7
Benjamin Doerr6
Haim Kaplan6
Iyad A. Kanj6
Maciej Liskiewicz6
A. Pavan5
Christoph Dürr5
Eduard Eiben5
Haitao Wang5
Heribert Vollmer5
Markus Bläser5
Monika Henzinger5
Pinyan Lu5
Saket Saurabh5
Antonios Antoniadis4
Giuseppe Persiano4
Hans U. Simon4

Impactful Papers

Papers from this venue that shaped research clusters.

Foundational

Influential

Related Venues

Venues with the most similar research cluster distributions.

Papers

TitleYear
Describing Parameterized Complexity Classes2002
How Many Missing Answers Can Be Tolerated by Query Learners?2002
Learnability and Definability in Trees and Similar Structures2002
A (5/2)n-Lower Bound for the Multiplicative Complexity of n×n-Matrix Multiplication2001
Approximation Algorithms for Minimum Size 2-Connectivity Problems2001
Generalized Model-Checking Problems for First-Order Logic2001
Optimal and Approximate Station Placement in Networks (With Applications to Multicasting and Space Efficient Traversals)2001
Recursive Randomized Coloring Beats Fair Dice Random Colorings2001
Space Efficient Algorithms for Series-Parallel Graphs2001
A Classification of Symbolic Transition Systems2000
An Approximation Algorithm for the Precedence Constrained Scheduling Problem with Hierarchical Communications2000
On the Performance of WEAK-HEAPSORT2000
Polynomial Time Approximation Schemes for the Multiprocessor Open and Flow Shop Scheduling Problem2000
Algorithms for Selfish Agents1999
In How Many Steps the k Peg Version of the Towers of Hanoi Game Can Be Solved?1999
New Branchwidth Territories1999
On the Difference of Horn Theories1999
On the Hardness of Permanent1999
Scheduling Dynamic Graphs1999
Supporting Increment and Decrement Operations in Balancing Networks1999
The Descriptive Complexity Approach to LOGCFL1999
Worst-case Equilibria1999
Cell Flipping in Permutation Diagrams1998
Complexity of Problems on Graphs Represented as OBDDs (Extended Abstract)1998
On Disguised Double Horn Functions and Extensions1998
Searching Constant Width Mazes Captures the AC0 Hierarchy1998
Searching Constant Width Mazes Captures the ACHierarchy1998
Uniformly Defining Complexity Classes of Functions1998
Deadlock-Free Interval Routing Schemes1997
Interactive Proof Systems with Public Coin: Lower Space Bounds and Hierarchies of Complexity Classes1997
Methods and Applications of (MAX, +) Linear Algebra1997
A Decision Procedure for Well-Formed Linear Quantum Cellular Automata1996
Hypothesis Testing in Perfect Phylogeny for a Bounded Number of Characters1996
On Word-Level Parallelism in Fault-Tolerant Computing1996
Optimal Schedules for d-D Grid Graphs with Communication Delays (Extended Abstract)1996
Solvable Black-Box Group Problems Are Low for PP1996
Communication Complexity of Key Agreement on Small Ranges1995
Expander Properties in Random Regular Graphs with Edge Faults1995
Interval Routing Schemes1995
Optimal Simulation of Automata by Neural Nets1995
On Different Reducibility Notions for Function Classes1994
Towards a Theory of Recursive Structures1994
Exact Algorithms for a Geometric Packing Problem (Extended Abstract)1993
Separating the Lower Levels of the Sublogarithmic Space Hierarchy1993
Solving Systems of Set Constraints using Tree Automata1993
The Complexity of Logic-Based Abduction1993
Communication Efficient Zero-Knowledge Proofs of Knowledge (With Applications to Electronic Cash)1992
Distributed System Simulator (DSS)1992
Four Results on Randomized Incremental Constructions1992
Tight Bounds on the Path Length of Binary Trees1991

« prev Page 7/8 next »