Arfst Nickelsen

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