EDBT 2026 Demo / reviewers in the wild / expert
Mads Vestergaard Jensen
dblp:405/6877
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2026
0009-0007-0929-5924ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Algorithms and data structures · 33% Computational complexity · 33% Graph algorithms and graph theory · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational complexity › parameterized complexity
kernelization |
1.0 | 1 | 2026 | Dynamic Meta-Kernelization · STOC 2026 |
Algorithms and data structures
parameterized algorithms |
1.0 | 1 | 2026 | Dynamic Meta-Kernelization · STOC 2026 |
Graph algorithms and graph theory › graph classes
sparse graph classes |
1.0 | 1 | 2026 | Dynamic Meta-Kernelization · STOC 2026 |
Methods — techniques the papers use, named apart from their topics
meta-kernelization · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Dynamic Meta-KernelizationabstractKernelization studies polynomial-time preprocessing algorithms. Over the last 20 years, the most celebrated positive results of the field have been linear kernels for classical NP-hard graph problems on sparse graph classes. In this paper, we lift these results to the dynamic setting. Christian Bertram 0001, Deborah Haun, Mads Vestergaard Jensen, Tuukka Korhonen |
STOC | 3 |