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
On the Complexity of Affine Image Matching2007
Randomly Rounding Rationals with Cardinality Constraints and Derandomizations2007
Symmetries and the Complexity of Pure Nash Equilibrium2007
Wavelength Management in WDM Rings to Maximize the Number of Connections2007
Combining Multiple Heuristics2006
Convergence and Approximation in Potential Games2006
External String Sorting: Faster and Cache-Oblivious2006
Generating Randomized Roundings with Cardinality Constraints and Derandomizations2006
Linear Advice for Randomized Logarithmic Space2006
Markov Decision Processes with Multiple Objectives2006
Memoryless Facility Location in One Pass2006
Optimal Node Routing2006
Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems2006
Redundancy in Complete Sets2006
Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games2006
A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs2005
Characterizing TC0 in Terms of Infinite Groups2005
Cost Sharing and Strategyproof Mechanisms for Set Cover Games2005
Cycle Cover with Short Cycles2005
Information Theory in Property Testing and Monotonicity Testing in Higher Dimension2005
On Nash Equilibria in Non-cooperative All-Optical Networks2005
Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size2005
Regular Tree Languages Definable in FO2005
Roundings Respecting Hard Constraints2005
Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation Algorithms2005
Truthful Approximation Mechanisms for Scheduling Selfish Related Machines2005
A Lower Bound on the Competitive Ratio of Truthful Auctions2004
Approximate Path Coloring with Applications to Wavelength Assignment in WDM Optical Networks2004
Approximation Algorithms for Minimizing Average Distortion2004
A Randomized Competitive Algorithm for Evaluating Priced AND/OR Trees2004
Deterministic Truthful Approximation Mechanisms for Scheduling Related Machines2004
Matching Algorithms Are Fast in Sparse Random Graphs2004
Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem2004
The Complexity of Boolean Constraint Isomorphism2004
Algebras of Minimal Rank over Arbitrary Fields2003
Alternative Algorithms for Counting All Matchings in Graphs2003
Competing Provers Yield Improved Karp-Lipton Collapse Results2003
Computing Shortest Paths with Uncertainty2003
Cryptographically Sound and Machine-Assisted Verification of Security Protocols2003
Faster Deterministic Broadcasting in Ad Hoc Radio Networks2003
On the Confluence of Linear Shallow Term Rewrite Systems2003
Private Computations in Networks: Topology versus Randomness2003
Representing Graph Metrics with Fewest Edges2003
Some Results on Derandomization2003
Space Efficient Hash Tables with Worst Case Constant Access Time2003
The Complexity of Resolution with Generalized Symmetry Rules2003
The Price of Truth: Frugality in Truthful Mechanisms2003
A New Diagram from Disks in the Plane2002
Balanced Coloring: Equally Easy for All Numbers of Colors?2002
Bi-Immunity Separates Strong NP-Completeness Notions2002

« prev Page 6/8 next »