Nederlof, Jesper
209  Ergebnisse:
Personensuche X
?
1

Correction to: Parameterized Algorithms for Covering by Ari..:

, In: Lecture Notes in Computer Science; SOFSEM 2024: Theory and Practice of Computer Science,
 
?
2

Parameterized Algorithms for Covering by Arithmetic Progres..:

, In: Lecture Notes in Computer Science; SOFSEM 2024: Theory and Practice of Computer Science,
 
?
3

Exact and Parameterized Algorithms for Choosability:

, In: Lecture Notes in Computer Science; SOFSEM 2024: Theory and Practice of Computer Science,
Bliznets, Ivan ; Nederlof, Jesper - p. 111-124 , 2024
 
?
4

Algorithms and Turing Kernels for Detecting and Counting Sm..:

, In: Lecture Notes in Computer Science; SOFSEM 2024: Theory and Practice of Computer Science,
Nederlof, Jesper ; Szilágyi, Krisztina - p. 413-426 , 2024
 
?
10

Solving Connectivity Problems Parameterized by Treewidth in..:

Cygan, Marek ; Nederlof, Jesper ; Pilipczuk, Marcin...
ACM Transactions on Algorithms (TALG).  18 (2022)  2 - p. 1-31 , 2022
 
?
11

Parameterized Problems Complete for Nondeterministic FPT ti..:

, In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS),
 
?
12

A Gap-ETH-Tight Approximation Scheme for Euclidean TSP:

, In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS),
 
?
14

Detecting Feedback Vertex Sets of SizekinO⋆(2.7k) Time:

Li, Jason ; Nederlof, Jesper
ACM Transactions on Algorithms.  18 (2022)  4 - p. 1-26 , 2022
 
?
15

A faster exponential time algorithm for bin packing with a ..:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,
 
1-15