Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Nederlof, Jesper"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Subset sum in the absence of concentration
Per Austrin
,
Petteri Kaski
,
Mikko Koivisto
,
Jesper Nederlof
Leibniz International Proceedings in Informatics (LIPIcs)
30
, 2015, pp. 48-61
Inclusion/exclusion meets measure and conquer
Jesper Nederlof
,
Johan M.M. van Rooij
,
Thomas C. van Dijk
Algorithmica
69
(3), 2014, pp. 685-740
Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
Hans L. Bodlaender
,
Marek Cygan
,
Stefan Kratsch
,
Jesper Nederlof
Lecture Notes in Computer Science
7965
, 2013, pp. 196-207
Fast Hamiltonicity checking via bases of perfect matchings
Marek Cygan
,
Stefan Kratsch
,
Jesper Nederlof
Proceedings of the 45th ACM Symposium on Theory of Computing, STOC'2013 (Palo Alto, California, USA, June 1-4, 2013)
, 2013, pp. 301-310
Fast polynomial-space algorithms using inclusion-exclusion
Jesper Nederlof
Algorithmica
65
(4), 2013, pp. 868-884
Minimizing rosenthal potential in multicast games
Fedor V. Fomin
,
Petr Golovach
,
Jesper Nederlof
,
Michaƚ Pilipczuk
Lecture Notes in Computer Science
7392
, 2012, pp. 525-536
Computing the cutwidth of bipartite permutation graphs in linear time
Pinar Heggernes
,
Pim van 't Hof
,
Daniel Lokshtanov
,
Jesper Nederlof
SIAM Journal on Discrete Mathematics
26
(3), 2012, pp. 1008-1021
Reducing a target interval to a few exact queries
Jesper Nederlof
,
Erik Jan van Leeuwen
,
Ruben van der Zwaan
Lecture Notes in Computer Science
7464
, 2012, pp. 718-727
Computing the cutwidth of bipartite permutation graphs in linear time
Pinar Heggernes
,
Pim van át Hof
,
Daniel Lokshtanov
,
Jesper Nederlof
Lecture Notes in Computer Science
6410
, 2010, pp. 75-87
Generalized graph clustering: Recognizing (
p
,
q
)-cluster graphs
Pinar Heggernes
,
Daniel Lokshtanov
,
Jesper Nederlof
,
Christophe Paul
,
Jan Arne Telle
Lecture Notes in Computer Science
6410
, 2010, pp. 171-183
A parameterized algorithm for
Chordal Sandwich
Pinar Heggernes
,
Federico Mancini
,
Jesper Nederlof
,
Yngve Villanger
Lecture Notes in Computer Science
6078
, 2010, pp. 120-130
Saving space by algebraization
Daniel Lokshtanov
,
Jesper Nederlof
Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC'2010 (Cambridge, Massachusetts, June 5-8, 2010)
, 2010, pp. 321-330
Fast polynomial-space algorithms using Möbius inversion: Improving on Steiner tree and related problems
Jesper Nederlof
Lecture Notes in Computer Science
5555
, 2009, pp. 713-725
Inclusion/exclusion meets measure and conquer - Exact algorithms for counting dominating sets
Johan M.M. van Rooij
,
Jesper Nederlof
,
Thomas C. van Dijk
Lecture Notes in Computer Science
5757
, 2009, pp. 554-565