I am a software architect at the Physikalisch-Technische Bundesanstalt (PTB) in Berlin. My work spans algorithm optimization, standards enforcement and the mathematical modelling of risk. In earlier times, I was a postdoc at TU Berlin, at TU Ilmenau, and a doctoral student at IMSc.
Research Interests
- Combinatorial Optimization
- Statistical Learning
- Sublinear-Space Computation
- Heuristic Methods
Papers
- Kernelizing problems on planar graphs in sublinear space and polynomial time
with Johannes Meintrup. - Maximal independent sets in sublinear space and polynomial time (preprint, available on request)
- Parametrized Algorithms for Min-Sum Set Cover (preprint, available on request)
- Sublinear-Space Approximation Algorithms for Max r-SAT.
with Venkatesh Raman. - Approximation in (Poly-) Logarithmic Space.
with Venkatesh Raman and Saket Saurabh. - Solving Group Interval Scheduling Efficiently.
with Venkatesh Raman and Saket Saurabh. - The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments.
with Varunkumar Jayapaul, Venkatesh Raman and Srinivasa Rao Satti. - Improved Bounds for Poset Sorting in the Forbidden-Comparison Regime.
with Varunkumar Jayapaul and Venkatesh Raman. - A Simple Condition for the Existence of Transversals.