| 2008 |
|---|
| 16 | EE | Jens Gramm,
Arfst Nickelsen,
Till Tantau:
Fixed-Parameter Algorithms in Phylogenetics.
Comput. J. 51(1): 79-101 (2008) |
| 2005 |
|---|
| 15 | EE | Arfst Nickelsen,
Birgit Schelm:
Average-Case Computations - Comparing AvgP, HP, and Nearly-P.
IEEE Conference on Computational Complexity 2005: 235-242 |
| 14 | EE | André Hernich,
Arfst Nickelsen:
Combining Self-reducibility and Partial Information Algorithms.
MFCS 2005: 483-494 |
| 13 | EE | Lane A. Hemaspaandra,
Harald Hempel,
Arfst Nickelsen:
Algebraic Properties for Selector Functions
CoRR abs/cs/0501022: (2005) |
| 12 | EE | Arfst Nickelsen,
Till Tantau:
The Complexity of Finding Paths in Graphs with Bounded Independence Number.
SIAM J. Comput. 34(5): 1176-1195 (2005) |
| 11 | EE | Sebastian Bab,
Arfst Nickelsen:
One query reducibilities between partial information classes.
Theor. Comput. Sci. 345(2-3): 173-189 (2005) |
| 2004 |
|---|
| 10 | EE | Sebastian Bab,
Arfst Nickelsen:
One Query Reducibilities Between Partial Information Classes.
MFCS 2004: 404-415 |
| 9 | EE | Arfst Nickelsen,
Till Tantau,
Lorenz Weizsäcker:
Aggregates with Component Size One Characterize Polynomial Space
Electronic Colloquium on Computational Complexity (ECCC)(028): (2004) |
| 8 | EE | Lane A. Hemaspaandra,
Harald Hempel,
Arfst Nickelsen:
Algebraic Properties for Selector Functions.
SIAM J. Comput. 33(6): 1309-1337 (2004) |
| 2002 |
|---|
| 7 | EE | Arfst Nickelsen,
Till Tantau:
On Reachability in Graphs with Bounded Independence Number.
COCOON 2002: 554-563 |
| 2001 |
|---|
| 6 | EE | Lane A. Hemaspaandra,
Harald Hempel,
Arfst Nickelsen:
Algebraic Properties for P-Selectivity.
COCOON 2001: 49-58 |
| 5 | EE | Arfst Nickelsen,
Till Tantau:
Closure of Polynomial Time Partial Information Classes under Polynomial Time Reductions.
FCT 2001: 299-310 |
| 4 | EE | Arfst Nickelsen:
Partial Information and Special Case Algorithms.
MFCS 2001: 573-584 |
| 1997 |
|---|
| 3 | | Arfst Nickelsen:
Deciding Verbose Languages with Linear Advice.
MFCS 1997: 438-447 |
| 2 | | Arfst Nickelsen:
On Polynomially D-Verbose Sets.
STACS 1997: 307-318 |
| 1993 |
|---|
| 1 | | Albrecht Hoene,
Arfst Nickelsen:
Counting, Selecting, adn Sorting by Query-Bounded Machines.
STACS 1993: 196-205 |
