VLDB 2026 Research / reviewers in the wild / expert
Maximilian Witek
dblp:38/8235
· DBLP profile ↗
6ranked-venue papers
0as first author
0since 2021 · last 2017
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 6
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
2 papers |
Computational complexity · 100% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational complexity › reduction
autoreducibility |
0.5 | 2 | 2017 | Autoreducibility and mitoticity of logspace-complete sets for NP and other classes · Inf. Comput. 2017 Autoreducibility of Complete Sets for Log-Space and Polynomial-Time Reductions · ICALP (1) 2013 |
Computational complexity › reduction
logspace reductions |
0.2 | 1 | 2013 | Autoreducibility of Complete Sets for Log-Space and Polynomial-Time Reductions · ICALP (1) 2013 |
Computational complexity › reduction
polynomial-time reduction |
0.2 | 1 | 2013 | Autoreducibility of Complete Sets for Log-Space and Polynomial-Time Reductions · ICALP (1) 2013 |
Computational complexity › space complexity
logspace completeness |
0.1 | 1 | 2017 | Autoreducibility and mitoticity of logspace-complete sets for NP and other classes · Inf. Comput. 2017 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2017 | Autoreducibility and mitoticity of logspace-complete sets for NP and other classes
Christian Glaßer, Maximilian Witek |
Inf. Comput. | 2 |
| 2014 | Autoreducibility and Mitoticity of Logspace-Complete Sets for NP and Other Classes
Christian Glaßer, Maximilian Witek |
MFCS (2) | 2 |
| 2013 | Autoreducibility of Complete Sets for Log-Space and Polynomial-Time Reductions
Christian Glaßer, Christian Reitwießner, Alan L. Selman, Maximilian Witek |
ICALP (1) | 5 |
| 2012 | Structural Complexity of Multiobjective NP Search Problems
Krzysztof Fleszar 0001, Christian Glaßer, Fabian Lipp, Christian Reitwießner, Maximilian Witek |
LATIN | 5 |
| 2011 | Applications of Discrepancy Theory in Multiobjective ApproximationabstractWe apply a multi-color extension of the Beck-Fiala theorem to show that the multiobjective maximum traveling salesman problem is randomized 1/2-approximable on directed graphs and randomized 2/3-approximable on undirected graphs. Using the same technique we show that the multiobjective maximum satisfiablilty problem is 1/2-approximable. Christian Glaßer, Christian Reitwießner, Maximilian Witek |
FSTTCS | 3 |
| 2010 | Approximability and Hardness in Multi-objective Optimization
Christian Glaßer, Christian Reitwießner, Heinz Schmitz, Maximilian Witek |
CiE | 4 |