Leo Wennmann

Orcid: 0009-0001-3346-6494

According to our database¹, Leo Wennmann authored at least 6 papers between 2024 and 2026.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of four.

Timeline

Legend:

Book In proceedings Article PhD thesis Dataset Other

Links

On csauthors.net:

Bibliography

2026

Distributed Santa Claus via Global Rounding.

[BibT_eX]

[DOI]

CoRR, April, 2026

Non-Additive Discrepancy: Coverage Functions in a Beck-Fiala Setting.

[BibT_eX]

[DOI]

T. R. Avila

Lars Rohwedder

Leo Wennmann

CoRR, February, 2026

2025

Solving Polynomial Equations Over Finite Fields.

[BibT_eX]

[DOI]

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

Cost Preserving Dependent Rounding for Allocation Problems.

[BibT_eX]

[DOI]

Lars Rohwedder

Arman Rouhani

Leo Wennmann

Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

A Simple Algorithm for Trimmed Multipoint Evaluation.

[BibT_eX]

[DOI]

Nick Fischer

Melvin Kallmayer

Leo Wennmann

Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

2024

Minimizing Tardy Processing Time on a Single Machine in Near-Linear Time.

[BibT_eX]

[DOI]

Nick Fischer

Leo Wennmann

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Leo Wennmann

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...