Filter Results:
- Full text PDF available (26)
Publication Year
1998
2019
- This year (7)
- Last 5 years (30)
- Last 10 years (51)
Publication Type
Co-author
Journals and Conferences
Learn More
- Holger Dell, Dieter van Melkebeek
- STOC
- 2009
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computationally unbounded… (More)
- Marek Cygan, Holger Dell, +6 authors Magnus Wahlström
- IEEE Conference on Computational Complexity
- 2012
- Holger Dell, Dániel Marx
- SODA
- 2012
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching for integers d ≥ 3 is… (More)
- Holger Dell, Thore Husfeldt, Martin Wahlen
- ICALP
- 2010
The Exponential Time Hypothesis (ETH) says that deciding the satisfiability of n-variable 3-CNF formulas requires time exp(Ω(n)). We relax this hypothesis by introducing its counting version #;ETH,… (More)
Abstract A correct representation of the plastic deformation and failure of individual component parts is essential to obtaining accurate crashworthiness simulation results. The aim of this paper is… (More)
In this article, the Program Committee of the Second Parameterized Algorithms and Computational Experiments challenge (PACE 2017) reports on the second iteration of the PACE challenge. Track A… (More)
- Holger Dell, Dieter van Melkebeek
- J. ACM
- 2014
Consider the following two-player communication process to decide a language <i>L</i>: The first player holds the entire input <i>x</i> but is polynomially bounded; the second player is… (More)
- Markus Bläser, Holger Dell
- ICALP
- 2007
The cover polynomial introduced by Chung and Graham is a two-variate graph polynomial for directed graphs. It counts the (weighted) number of ways to cover a graph with disjoint directed cycles and… (More)
In this article, the steering committee of the Parameterized Algorithms and Computational Experiments challenge (PACE) reports on the first iteration of the challenge. Where did PACE come from, how… (More)
- Radu Curticapean, Holger Dell, Dániel Marx
- STOC
- 2017
We introduce <em>graph motif parameters</em>, a class of graph parameters that depend only on the frequencies of constant-size induced subgraphs. Classical works by Lovász show that many interesting… (More)