- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j2 |      | Jesper Nederlof: Fast Polynomial-Space Algorithms Using Inclusion-Exclusion. Algorithmica 65(4): 868-884 (2013) |
| 2012 | ||
| j1 | | Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Jesper Nederlof: Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time. SIAM J. Discrete Math. 26(3): 1008-1021 (2012) |
| c13 | | Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström: On Problems as Hard as CNF-SAT. IEEE Conference on Computational Complexity 2012: 74-84 |
| c12 | | Fedor V. Fomin, Petr A. Golovach, Jesper Nederlof, Michal Pilipczuk: Minimizing Rosenthal Potential in Multicast Games. ICALP (2) 2012: 525-536 |
| c11 | | Petteri Kaski, Mikko Koivisto, Jesper Nederlof: Homomorphic Hashing for Sparse Coefficient Extraction. IPEC 2012: 147-158 |
| c10 | | Jesper Nederlof, Erik Jan van Leeuwen, Ruben van der Zwaan: Reducing a Target Interval to a Few Exact Queries. MFCS 2012: 718-727 |
| c9 | | Andreas Björklund, Mikko Koivisto, Thore Husfeldt, Jesper Nederlof, Petteri Kaski, Pekka Parviainen: Fast zeta transforms for lattices with few irreducibles. SODA 2012: 1436-1444 |
| i6 | | Petteri Kaski, Mikko Koivisto, Jesper Nederlof: Homomorphic Hashing for Sparse Coefficient Extraction. CoRR abs/1203.4063 (2012) |
| i5 | | Jesper Nederlof, Erik Jan van Leeuwen, Ruben van der Zwaan: Reducing a Target Interval to a Few Exact Queries. CoRR abs/1208.4225 (2012) |
| i4 | | Hans L. Bodlaender, Marek Cygan, Stefan Kratsch, Jesper Nederlof: Solving weighted and counting variants of connectivity problems parameterized by treewidth deterministically in single exponential time. CoRR abs/1211.1505 (2012) |
| i3 | | Marek Cygan, Stefan Kratsch, Jesper Nederlof: Fast Hamiltonicity checking via bases of perfect matchings. CoRR abs/1211.1506 (2012) |
| 2011 | ||
| c8 | | Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michal Pilipczuk, Johan M. M. van Rooij, Jakub Onufry Wojtaszczyk: Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time. FOCS 2011: 150-159 |
| i2 | | Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michal Pilipczuk, Johan M. M. van Rooij, Jakub Onufry Wojtaszczyk: Solving connectivity problems parameterized by treewidth in single exponential time. CoRR abs/1103.0534 (2011) |
| i1 | | Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström: On Problems as Hard as CNFSAT. CoRR abs/1112.2275 (2011) |
| 2010 | ||
| c7 | | Pinar Heggernes, Federico Mancini, Jesper Nederlof, Yngve Villanger: A Parameterized Algorithm for Chordal Sandwich. CIAC 2010: 120-130 |
| c6 | | Jesper Nederlof, Johan M. M. van Rooij: Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting. IPEC 2010: 204-215 |
| c5 | | |
| c4 | | Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Jesper Nederlof: Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time. WG 2010: 75-87 |
| c3 | | Pinar Heggernes, Daniel Lokshtanov, Jesper Nederlof, Christophe Paul, Jan Arne Telle: Generalized Graph Clustering: Recognizing (p, q)-Cluster Graphs. WG 2010: 171-183 |
| 2009 | ||
| c2 | | Johan M. M. van Rooij, Jesper Nederlof, Thomas C. van Dijk: Inclusion/Exclusion Meets Measure and Conquer. ESA 2009: 554-565 |
| c1 | | Jesper Nederlof: Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems. ICALP (1) 2009: 713-725 |
Data released under the ODC-BY 1.0 license — See also our legal information page