Arfst Nickelsen

According to our database, Arfst Nickelsen authored at least 16 papers between 1993 and 2008.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2008

Fixed-Parameter Algorithms in Phylogenetics.

Jens Gramm, Arfst Nickelsen, Till Tantau

Comput. J., 2008

2005

One query reducibilities between partial information classes.

Sebastian Bab, Arfst Nickelsen

Theor. Comput. Sci., 2005

The Complexity of Finding Paths in Graphs with Bounded Independence Number.

Arfst Nickelsen, Till Tantau

SIAM J. Comput., 2005

Combining Self-reducibility and Partial Information Algorithms.

André Hernich, Arfst Nickelsen

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

Average-Case Computations - Comparing AvgP, HP, and Nearly-P.

Arfst Nickelsen, Birgit Schelm

Proceedings of the 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 2005

2004

Algebraic Properties for Selector Functions.

Lane A. Hemaspaandra, Harald Hempel, Arfst Nickelsen

SIAM J. Comput., 2004

Aggregates with Component Size One Characterize Polynomial Space

Arfst Nickelsen, Till Tantau, Lorenz Weizsäcker

Electron. Colloquium Comput. Complex., 2004

2003

Partial information classes.

Arfst Nickelsen, Till Tantau

SIGACT News, 2003

2002

On Reachability in Graphs with Bounded Independence Number.

Arfst Nickelsen, Till Tantau

Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

2001

Polynomial time partial information classes.

Arfst Nickelsen

PhD thesis, 2001

Partial Information and Special Case Algorithms.

Arfst Nickelsen

Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

Closure of Polynomial Time Partial Information Classes under Polynomial Time Reductions.

Arfst Nickelsen, Till Tantau

Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

Algebraic Properties for P-Selectivity.

Lane A. Hemaspaandra, Harald Hempel, Arfst Nickelsen

Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

1997

On Polynomially D-Verbose Sets.

Arfst Nickelsen

Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

Deciding Verbose Languages with Linear Advice.

Arfst Nickelsen

Proceedings of the Mathematical Foundations of Computer Science 1997, 1997

1993

Counting, Selecting, adn Sorting by Query-Bounded Machines.

Albrecht Hoene, Arfst Nickelsen

Proceedings of the STACS 93, 1993