Arfst Nickelsen

Publication Activity (10 Years)

Years Active: 1993-2008
Publications (10 Years): 0

Technical University of Berlin, Germany (PHD)

Education History

Technical University of Berlin, Germany

PHD

Publications

Jens Gramm, Arfst Nickelsen, Till Tantau
Fixed-Parameter Algorithms in Phylogenetics. Comput. J. 51 (1) (2008)
Arfst Nickelsen, Till Tantau
The Complexity of Finding Paths in Graphs with Bounded Independence Number. SIAM J. Comput. 34 (5) (2005)
André Hernich, Arfst Nickelsen
Combining Self-reducibility and Partial Information Algorithms. MFCS (2005)
Sebastian Bab, Arfst Nickelsen
One query reducibilities between partial information classes. Theor. Comput. Sci. 345 (2-3) (2005)
Lane A. Hemaspaandra, Harald Hempel, Arfst Nickelsen
Algebraic Properties for Selector Functions CoRR (2005)
Arfst Nickelsen, Birgit Schelm
Average-Case Computations - Comparing AvgP, HP, and Nearly-P. Computational Complexity Conference (2005)
Arfst Nickelsen, Till Tantau, Lorenz Weizsäcker
Aggregates with Component Size One Characterize Polynomial Space Electron. Colloquium Comput. Complex. (028) (2004)
Lane A. Hemaspaandra, Harald Hempel, Arfst Nickelsen
Algebraic Properties for Selector Functions. SIAM J. Comput. 33 (6) (2004)
Sebastian Bab, Arfst Nickelsen
One Query Reducibilities Between Partial Information Classes. MFCS (2004)
Arfst Nickelsen, Till Tantau
Partial information classes. SIGACT News 34 (1) (2003)
Arfst Nickelsen, Till Tantau
On Reachability in Graphs with Bounded Independence Number. COCOON (2002)
Arfst Nickelsen, Till Tantau
Closure of Polynomial Time Partial Information Classes under Polynomial Time Reductions. FCT (2001)
Arfst Nickelsen
Partial Information and Special Case Algorithms. MFCS (2001)
Lane A. Hemaspaandra, Harald Hempel, Arfst Nickelsen
Algebraic Properties for P-Selectivity. COCOON (2001)
Arfst Nickelsen
Deciding Verbose Languages with Linear Advice. MFCS (1997)
Arfst Nickelsen
On Polynomially D-Verbose Sets. STACS (1997)
Albrecht Hoene, Arfst Nickelsen
Counting, Selecting, adn Sorting by Query-Bounded Machines. STACS (1993)

Arfst Nickelsen.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Arfst Nickelsen