Lukas Retschmeier

According to our database, Lukas Retschmeier authored at least 5 papers between 2024 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2025

On the Parameterized Complexity of Semitotal Domination on Graph Classes.

Lukas Retschmeier

CoRR, June, 2025

Optimal Bounds for Private Minimum Spanning Trees via Input Perturbation.

Rasmus Pagh, Lukas Retschmeier, Hao Wu, Hanwen Zhang

Proc. ACM Manag. Data, May, 2025

Private Lossless Multiple Release.

Joel Daniel Andersson, Lukas Retschmeier, Boel Nelson, Rasmus Pagh

CoRR, May, 2025

The Correlated Gaussian Sparse Histogram Mechanism.

Christian Janos Lebeda, Lukas Retschmeier

Proceedings of the 6th Symposium on Foundations of Responsible Computing, 2025

2024

Faster Private Minimum Spanning Trees.

Rasmus Pagh, Lukas Retschmeier

CoRR, 2024