Lukas Retschmeier
PhD Student in Computer Science
@DIKU Københavns Universitet
Hej! Welcome to my little private corner of the internet!
I am a PhD candidate at Providentia at BARC at the University of Copenhagen under the supervision of Rasmus Pagh and Martin Aumüller. I am broadly interested in Differential Privacy with a focus on private graph algorithms.
Previously, I worked as a PLM consultant at Atos, where I gained strong expertise in software development and advising clients in complex technical environments. For a detailed overview of these projects, take a look at my CV.
Outside work, I enjoy playing classical music, winter bathing, and playing volleyball.
News
- [02 April 2026] Some work was accepted to TPDP 26!
- [12 Nov 2025] I gave a talk at Boston University during my stay abroad about our MST result from PODS.
- [22 Sep 2025] Our joint work with Lukas, Alexander, Johannes, Ulrich, and Manuel got accepted to ALENEX 2026! In the paper we consider the very practical problem of reducing instances of dominating set efficiently.
- [15 Mai 2025] I will be giving a talk at ARCO. Find the slides here (privateTrees).
Show older news.
- [30 April 2025] Our joint work with Rasmus, Boel and Joel about Private Lossless Multiple Releases was accepted to ICML 2025!
- [30 April 2025] Three of our recent results got accepted to TPDP 2025 and one of them was selected for an oral presentation! See you in California!
- [02 April 2025] The joined work with Christian on the Correlated Gaussian Sparse Histogram Mechanism was accepted to FORC 2025 and our PODS results selected as a highlight for oral presentation!
- [14 Jan 2025] Our work that strengthens our own previous results on private Minimum Spanning Trees in a joint work with Rasmus, Hao and Hanwen got accepted to PODS 2025!
- [16 Dec 2024] New preprint on improving the Gaussian Sparse Histogram Mechanism together with Christian!
Research
Differential Privacy
[7] Lower Bounds for Private Graph Optimization using Reconstruction-Attacks
under submission, partial content appeared in TPDP 25 + 26, preprint coming soon!
[6] The Correlated Gaussian Sparse Histogram Mechanism
Foundations of Responsible Computing (FORC), 2025
(publication)
[5] Optimal Bounds for Private Minimum Spanning Trees via Input Perturbation
The Principles of Database System (PODS), 2025
(publication)
[4] Private Lossless Multiple Release
International Conference in Machine Learning (ICML), 2025
(publication)
[3] Faster Private Minimium Spanning Trees
Presented at TPDP 2024, strictly stronger results in [5], 2024
(arXiv)
Parameterized Complexity
[2] Revisiting a Successful Reduction Rule for Dominating Set
SIAM Symposium on Algorithm Engineering and Experiments (ALENEX), 2026