Martin Herold
- Address
- Max-Planck-Institut für Informatik
Saarland Informatics Campus
Campus E1 4
66123 Saarbrücken - Location
- E1 4 - 308
- Phone
- +49 681 9325 1131
- Fax
- +49 681 9325 1099
- Get email via email
Martin Herold
Research Interests
I am interested in the design and analysis of efficient algorithms, with a particular focus on approximation algorithms and clustering problems. My work also touches on isomorphic computational models, sublinear & randomized algorithms, and high-dimensional geometry.
Publications
2026
Herold, M. G., Kipouridis, E., & Spoerhase, J. (2026). A Broader View on Clustering under Cluster-Aware Norm Objectives. In Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2026). Vancouver, Canada: SIAM. doi:10.1137/1.9781611978971.30
Export
BibTeX
@inproceedings{Herold_SODA26,
TITLE = {A Broader View on Clustering under Cluster-Aware Norm Objectives},
AUTHOR = {Herold, Martin G. and Kipouridis, Evangelos and Spoerhase, Joachim},
LANGUAGE = {eng},
ISBN = {978-1-61197-897-1},
DOI = {10.1137/1.9781611978971.30},
PUBLISHER = {SIAM},
YEAR = {2026},
DATE = {2026},
BOOKTITLE = {Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2026)},
PAGES = {758--793},
ADDRESS = {Vancouver, Canada},
}
Endnote
%0 Conference Proceedings
%A Herold, Martin G.
%A Kipouridis, Evangelos
%A Spoerhase, Joachim
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
%T A Broader View on Clustering under Cluster-Aware Norm Objectives :
%G eng
%U http://hdl.handle.net/21.11116/0000-0013-21BE-0
%R 10.1137/1.9781611978971.30
%D 2026
%B Thirty-Seventh Annual ACM-SIAM Symposium on Disrete Algorithms
%Z date of event: 2026-01-11 - 2026-01-14
%C Vancouver, Canada
%B Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms
%P 758 - 793
%I SIAM
%@ 978-1-61197-897-1
2025
Herold, M. G., Nanongkai, D., Spoerhase, J., Varma, N., & Wu, Z. (2025). Sublinear Data Structures for Nearest Neighbor in Ultra High Dimensions. In 41st International Symposium on Computational Geometry (SoCG 2025). Kanazawa, Japan: Schloss Dagstuhl. doi:10.4230/LIPIcs.SoCG.2025.56
Export
BibTeX
@inproceedings{Herold_SoCG2025,
TITLE = {Sublinear Data Structures for Nearest Neighbor in Ultra High Dimensions},
AUTHOR = {Herold, Martin G. and Nanongkai, Danupon and Spoerhase, Joachim and Varma, Nithin and Wu, Zihang},
LANGUAGE = {eng},
ISSN = {1868-8969},
URL = {urn:nbn:de:0030-drops-232087},
DOI = {10.4230/LIPIcs.SoCG.2025.56},
PUBLISHER = {Schloss Dagstuhl},
YEAR = {2025},
MARGINALMARK = {$\bullet$},
DATE = {2025},
BOOKTITLE = {41st International Symposium on Computational Geometry (SoCG 2025)},
SERIES = {Leibniz International Proceedings in Informatics},
VOLUME = {332},
PAGES = {1--15},
EID = {56},
ADDRESS = {Kanazawa, Japan},
}
Endnote
%0 Conference Proceedings
%A Herold, Martin G.
%A Nanongkai, Danupon
%A Spoerhase, Joachim
%A Varma, Nithin
%A Wu, Zihang
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Sublinear Data Structures for Nearest Neighbor in Ultra High Dimensions :
%G eng
%U http://hdl.handle.net/21.11116/0000-0010-9A80-F
%R 10.4230/LIPIcs.SoCG.2025.56
%U urn:nbn:de:0030-drops-232087
%D 2025
%B 41st International Symposium on Computational Geometry
%Z date of event: 2025-06-23 - 2025-06-27
%C Kanazawa, Japan
%B 41st International Symposium on Computational Geometry
%I Schloss Dagstuhl
%B Leibniz International Proceedings in Informatics
%N 332
%P 1 - 15
%Z sequence number: 56
%@ false
%U https://arxiv.org/pdf/2503.03079
Herold, M. G., Kipouridis, E., & Spoerhase, J. (2025). Clustering to Minimize Cluster-Aware Norm Objectives. In Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2025). New Orleans, LA, USA: SIAM. doi:10.1137/1.9781611978322.8
Export
BibTeX
@inproceedings{Herold_SODA25,
TITLE = {Clustering to Minimize Cluster-Aware Norm Objectives},
AUTHOR = {Herold, Martin G. and Kipouridis, Evangelos and Spoerhase, Joachim},
LANGUAGE = {eng},
ISBN = {978-1-61197-832-2},
DOI = {10.1137/1.9781611978322.8},
PUBLISHER = {SIAM},
YEAR = {2025},
MARGINALMARK = {$\bullet$},
DATE = {2025},
BOOKTITLE = {Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2025)},
PAGES = {255--287},
ADDRESS = {New Orleans, LA, USA},
}
Endnote
%0 Conference Proceedings
%A Herold, Martin G.
%A Kipouridis, Evangelos
%A Spoerhase, Joachim
%+ Algorithms and Complexity, MPI for Informatics, Max Planck Society
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Clustering to Minimize Cluster-Aware Norm Objectives :
%G eng
%U http://hdl.handle.net/21.11116/0000-0010-36A7-5
%R 10.1137/1.9781611978322.8
%D 2025
%B Annual ACM-SIAM Symposium on Discrete Algorithms
%Z date of event: 2025-01-12 - 2025-01-15
%C New Orleans, LA, USA
%B Annual ACM-SIAM Symposium on Discrete Algorithms
%P 255 - 287
%I SIAM
%@ 978-1-61197-832-2
2023
Egidy, F., Glaßer, C., & Herold, M. G. (2023). Upward Translation of Optimal and P-Optimal Proof Systems in the Boolean Hierarchy over NP. In 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023). Bordeaux, France: Schloss Dagstuhl. doi:10.4230/LIPIcs.MFCS.2023.44
Export
BibTeX
@inproceedings{Egidy_MFCS23,
TITLE = {Upward Translation of Optimal and P-Optimal Proof Systems in the {B}oolean Hierarchy over {NP}},
AUTHOR = {Egidy, Fabian and Gla{\ss}er, Christian and Herold, Martin G.},
LANGUAGE = {eng},
ISBN = {978-3-95977-292-1},
URL = {urn:nbn:de:0030-drops-185784},
DOI = {10.4230/LIPIcs.MFCS.2023.44},
PUBLISHER = {Schloss Dagstuhl},
YEAR = {2023},
MARGINALMARK = {$\bullet$},
DATE = {2023},
BOOKTITLE = {48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)},
EDITOR = {Leroux, J{\'e}r{\^o}me and Lombardy, Sylvain and Peleg, David},
PAGES = {1--15},
EID = {44},
SERIES = {Leibniz International Proceedings in Informatics},
VOLUME = {272},
ADDRESS = {Bordeaux, France},
}
Endnote
%0 Conference Proceedings
%A Egidy, Fabian
%A Glaßer, Christian
%A Herold, Martin G.
%+ External Organizations
External Organizations
Algorithms and Complexity, MPI for Informatics, Max Planck Society
%T Upward Translation of Optimal and P-Optimal Proof Systems in the Boolean Hierarchy over NP :
%G eng
%U http://hdl.handle.net/21.11116/0000-0010-3509-9
%R 10.4230/LIPIcs.MFCS.2023.44
%U urn:nbn:de:0030-drops-185784
%D 2023
%B 48th International Symposium on Mathematical Foundations of Computer Science
%Z date of event: 2023-08-28 - 2023-09-01
%C Bordeaux, France
%B 48th International Symposium on Mathematical Foundations of Computer Science
%E Leroux, Jérôme; Lombardy, Sylvain; Peleg, David
%P 1 - 15
%Z sequence number: 44
%I Schloss Dagstuhl
%@ 978-3-95977-292-1
%B Leibniz International Proceedings in Informatics
%N 272
Education
2022 - present:
PhD in Computer Science at Max-Planck-Institut for Informatics
2021 - 2022:
Master in Computer Science at University of Würzburg
2018 - 2021:
Bachelor in Computer Science at University of Würzburg
Hobbies
- Basketball
- Dunking
- Football