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
Tight RNC Approximations to Max Flow1991
Efficient Distributed Algorithms by Using the Archemedean Time Assumption1988
On Local Routing of Two-Terminal Nets1987
Area-time Optimal Division for T=Omega(log n)1+epsilon1986
A Time-Space Tradeoff for Element Distinctness1986
Input Sensitive, Optimal Parallel Randomized Algorithms for Addition and Identification1986
The Volume of the Union of Many Sheres and Point Inclusion Problems1985

« prev Page 8/8