Travelled to:1 × Greece
1 × Latvia
1 × United Kingdom
2 × USA
Collaborated with:M.Cygan S.Kratsch D.Lokshtanov ∅ H.L.Bodlaender F.V.Fomin P.A.Golovach M.Pilipczuk
Talks about:algorithm (2) problem (2) space (2) fast (2) determinist (1) treewidth (1) parameter (1) multicast (1) exponenti (1) polynomi (1)
Person: Jesper Nederlof
DBLP: Nederlof:Jesper
Contributed to:
2013
2013201220102009Wrote 5 papers:
- ICALP-v1-2013-BodlaenderCKN #algorithm #exponential #problem
- Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth (HLB, MC, SK, JN), pp. 196–207.
- STOC-2013-CyganKN #performance
- Fast hamiltonicity checking via bases of perfect matchings (MC, SK, JN), pp. 301–310.
- ICALP-v2-2012-FominGNP #game studies #multi
- Minimizing Rosenthal Potential in Multicast Games (FVF, PAG, JN, MP), pp. 525–536.
- STOC-2010-LokshtanovN #algebra
- Saving space by algebraization (DL, JN), pp. 321–330.
- ICALP-v1-2009-Nederlof #algorithm #performance #problem #using
- Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems (JN), pp. 713–725.