Arfst Nickelsen
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
9
Venues
4
Active years
1993–2005
Best venue rank
B
Where they publish
Papers
9 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2005 | MFCS | Combining Self-reducibility and Partial Information Algorithms. | Andr Hernich, Arfst Nickelsen |
| 2004 | MFCS | One Query Reducibilities Between Partial Information Classes. | Sebastian Bab, Arfst Nickelsen |
| 2002 | COCOON | On Reachability in Graphs with Bounded Independence Number. | Arfst Nickelsen, Till Tantau |
| 2001 | COCOON | Algebraic Properties for P-Selectivity. | Lane A. Hemaspaandra, Harald Hempel, Arfst Nickelsen |
| 2001 | FCT | Closure of Polynomial Time Partial Information Classes under Polynomial Time Reductions. | Arfst Nickelsen, Till Tantau |
| 2001 | MFCS | Partial Information and Special Case Algorithms. | Arfst Nickelsen |
| 1997 | MFCS | Deciding Verbose Languages with Linear Advice. | Arfst Nickelsen |
| 1997 | STACS | On Polynomially D-Verbose Sets. | Arfst Nickelsen |
| 1993 | STACS | Counting, Selecting, adn Sorting by Query-Bounded Machines. | Albrecht Hoene, Arfst Nickelsen |