Counting, Selecting, adn Sorting by Query-Bounded Machines. - Albrecht Hoene; Arfst Nickelsen (STACS, 1993)

Deciding Verbose Languages with Linear Advice. - Arfst Nickelsen (MFCS, 1997)

On Polynomially D-Verbose Sets. - Arfst Nickelsen (STACS, 1997)

Algebraic Properties for P-Selectivity. - Lane A. Hemaspaandra; Harald Hempel; Arfst Nickelsen (COCOON, 2001)

Closure of Polynomial Time Partial Information Classes under Polynomial Time Reductions. - Arfst Nickelsen; Till Tantau (FCT, 2001)

Partial Information and Special Case Algorithms. - Arfst Nickelsen (MFCS, 2001)

Polynomial time partial information classes. - Arfst Nickelsen (Wiss.-und-Technik-Verlag, 2001)

On Reachability in Graphs with Bounded Independence Number. - Arfst Nickelsen; Till Tantau (COCOON, 2002)

Partial information classes. - Arfst Nickelsen; Till Tantau (SIGACT News, 2003)

Aggregates with Component Size One Characterize Polynomial Space - Arfst Nickelsen; Till Tantau; Lorenz Weizsäcker (Electron. Colloquium Comput. Complex., 2004)

Algebraic Properties for Selector Functions. - Lane A. Hemaspaandra; Harald Hempel; Arfst Nickelsen (SIAM J. Comput., 2004)

Average-Case Computations - Comparing AvgP, HP, and Nearly-P. - Arfst Nickelsen; Birgit Schelm (CCC, 2005)

Combining Self-reducibility and Partial Information Algorithms. - André Hernich; Arfst Nickelsen (MFCS, 2005)

The Complexity of Finding Paths in Graphs with Bounded Independence Number. - Arfst Nickelsen; Till Tantau (SIAM J. Comput., 2005)

One query reducibilities between partial information classes. - Sebastian Bab; Arfst Nickelsen (Theor. Comput. Sci., 2005)

Fixed-Parameter Algorithms in Phylogenetics. - Jens Gramm; Arfst Nickelsen; Till Tantau (Comput. J., 2008)