Michael Kerber

Research output

Research output per year 2016 2016 2017 2018 2019 2021 2023 2024

• 21 Conference paper
• 14 Article
• 3 Poster
• 2 Abstract
• 6 More
  • 2 Preprint
  • 1 Anthology
  • 1 Paper
  • 1 Editorial
  • 1 Special issue

Research output per year

Research output per year

Search results

• 2024

  Delaunay Bifiltrations of Functions on Point Clouds

  Alonso, Á. J., Kerber, M., Lam, T. & Lesnick, M., 2024, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Association of Computing Machinery, p. 4872-4891 20 p.

  Research output: Chapter in Book/Report/Conference proceeding › Conference paper › peer-review

  • Points 100%
  • Computational Topology 33%
  • Worst Case 33%
  • Sublevels 33%
  • Computational Geometry Algorithm Library 33%
• 2023

  Decomposition of Zero-Dimensional Persistence Modules via Rooted Subsets

  Alonso, Á. J. & Kerber, M., 1 Jun 2023, 39th International Symposium on Computational Geometry, SoCG 2023. Chambers, E. W. & Gudmundsson, J. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 7. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 258).

  Research output: Chapter in Book/Report/Conference proceeding › Conference paper › peer-review

  Open Access

  • Interval 100%
  • Vector Space 66%
  • Points 33%
  • Bounds 33%
  • Constant 33%

• Filtration-Domination in Bifiltered Graphs

  Alonso, A. J., Kerber, M. & Pritam, S., 2023, 2023 Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2023. Society for Industrial and Applied Mathematics Publications, p. 27-38 12 p.

  Research output: Chapter in Book/Report/Conference proceeding › Conference paper › peer-review

  • Algorithms 100%
  • Clique Complex 100%
  • Evaluation 50%
  • Induced Clique 33%

• Sparse Higher Order Čech Filtrations

  Buchet, M., Dornelas, B. B. & Kerber, M., 1 Jun 2023, 39th International Symposium on Computational Geometry, SoCG 2023. Chambers, E. W. & Gudmundsson, J. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 20. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 258).

  Research output: Chapter in Book/Report/Conference proceeding › Conference paper › peer-review

  Open Access

  • Order 100%
  • Nested Sequence 100%
  • Points 50%
  • Linear Time 50%
  • Number 50%

• The Localized Union-Of-Balls Bifiltration

  Kerber, M. & Söls, M., 1 Jun 2023, 39th International Symposium on Computational Geometry, SoCG 2023. Chambers, E. W. & Gudmundsson, J. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 45. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 258).

  Research output: Chapter in Book/Report/Conference proceeding › Conference paper › peer-review

  Open Access

  • Computational Geometry Algorithm Library 100%
• 2022

  Average Complexity of Matrix Reduction for Clique Filtrations

  Giunti, B., Houry, G. & Kerber, M., 4 Jul 2022, ISSAC 2022 - Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation47th International Symposium on Symbolic and Algebraic Computation, ISSAC 2022. Hashemi, A. (ed.). Association of Computing Machinery, p. 187-196 10 p. (Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC).

  Research output: Chapter in Book/Report/Conference proceeding › Conference paper › peer-review

  Open Access

  • Algorithmic Complexity 100%
  • Average Complexity 100%
• 2021

  Collapses of Higher-Order Delaunay complexes

  Buchet, M., Dornelas, B. B. & Kerber, M., 2021, Book of Abstracts: 37th European Workshop on Computational Geometry. p. 39:1-39:7

  Research output: Chapter in Book/Report/Conference proceeding › Conference paper

• Computing the multicover bifiltration

  Corbet, R., Kerber, M., Lesnick, M. & Osang, G., 1 Jun 2021, 37th International Symposium on Computational Geometry, SoCG 2021. Buchin, K. & de Verdiere, E. C. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 27. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 189).

  Research output: Chapter in Book/Report/Conference proceeding › Conference paper › peer-review

  • Points 100%
  • Finite Set 50%
  • Parameter Family 50%
  • Homology 50%

• Fast Minimal Presentations of Bi-Graded Persistence Modules

  Kerber, M. & Rolle, A., 2021, SIAM 2021: Symposium on Algorithm Engineering and Experiments. Algorithm Engineering and Experimentation (ALENEX)

  Research output: Chapter in Book/Report/Conference proceeding › Conference paper › peer-review

  Open Access
• 2020

  Efficient Approximation of the Matching Distance for 2-Parameter Persistence

  Kerber, M. & Nigmetov, A., 2020, 36th International Symposium on Computational Geometry, SoCG 2020. Cabello, S. & Chen, D. Z. (eds.). Wadern: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 16 p. LIPIcs-SoCG-2020-53. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 164).

  Research output: Chapter in Book/Report/Conference proceeding › Conference paper › peer-review

  Open Access

  • Parameter 100%
  • Approximation 100%
  • Matching 100%
  • Public Repository 100%
  • Term 25%

• Topology-Preserving Terrain Simplification

  Fugacci, U., Kerber, M. & Manet, H., 2020, SIGSPATIAL '20: Proceedings of the 28th International Conference on Advances in Geographic Information Systems. p. 36-47

  Research output: Chapter in Book/Report/Conference proceeding › Conference paper › peer-review

  Open Access
• 2019

  Chunk Reduction for Multi-Parameter Persistent Homology

  Fugacci, U. & Kerber, M., 2019, 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA. p. 37:1-37:14 14 p.

  Research output: Chapter in Book/Report/Conference proceeding › Conference paper › peer-review

  • Sequential Version 100%
  • Chain Complex 100%

• Exact Computation of the Matching Distance on 2-Parameter Persistence Modules

  Kerber, M., Lesnick, M. & Oudot, S., 2019, 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA. p. 46:1-46:15 15 p.

  Research output: Chapter in Book/Report/Conference proceeding › Conference paper › peer-review

  Open Access

• Improved Topological Approximations by Digitization

  Choudhary, A., Kerber, M. & Raghvendra, S., 2019, Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019. Philadelphia: SIAM - Society of Industrial and Applied Mathematics, p. 2675-2688

  Research output: Chapter in Book/Report/Conference proceeding › Conference paper › peer-review

  • Sample Point 100%
• 2018

  A Note on Planar Monohedral Tilings

  Aichholzer, O., Kerber, M., Talata, I. & Vogtenhuber, B., 2018, Proc. 34th European Workshop on Computational Geometry EuroCG '18. Berlin, Germany, p. 31:1-31:6

  Research output: Chapter in Book/Report/Conference proceeding › Conference paper
• 2017

  Barcodes of Towers and a Streaming Algorithm for Persistent Homology

  Kerber, M. & Schreiber, H., 2017, 33rd International Symposium on Computational Geometry (SoCG 2017). LIPICS ed. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Vol. 77. p. 57:1-57:16 16 p.

  Research output: Chapter in Book/Report/Conference proceeding › Conference paper › peer-review

  Open Access

  • Persistent Homology 100%
  • Homology 100%
  • Filtration 100%
  • Simplicial Complex 50%
  • simplicial complex σ 50%

• Constrained Triangulations, Volumes of Polytopes, and Unit Equations

  Kerber, M., Tichy, R. & Weitzer, M. F., 2017, 33rd International Symposium on Computational Geometry (SoCG 2017). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 46:1--46:15 15 p.

  Research output: Chapter in Book/Report/Conference proceeding › Conference paper › peer-review

• Improved Approximate Rips Filtrations with Shifted Integer Lattices

  Choudhary, A., Kerber, M. & Raghvendra, S., 2017, 25th Annual European Symposium on Algorithms (ESA 2017). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 28:1--28:13 13 p.

  Research output: Chapter in Book/Report/Conference proceeding › Conference paper › peer-review
• 2016

  Geometry Helps to Compare Persistence Diagrams

  Kerber, M., Morozov, D. & Nigmetov, A., 2016, 2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX). ., p. 103-112

  Research output: Chapter in Book/Report/Conference proceeding › Conference paper › peer-review

  Open Access

  File

• Persistent Homology and Nested Dissection

  Kerber, M., Sheehy, D. & Skraba, P., 2016, Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms. ., p. 1234-1245

  Research output: Chapter in Book/Report/Conference proceeding › Conference paper › peer-review

• Polynomial-Sized Topological Approximations Using The Permutahedron

  Choudhary, A., Kerber, M. & Raghvendra, S., 2016, 32nd International Symposium on Computational Geometry (SoCG 2016). Fekete, S. & Lubiw, A. (eds.). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 31:1--31:16 16 p. (Leiniz International Proceedings in Informatics; vol. 51).

  Research output: Chapter in Book/Report/Conference proceeding › Conference paper › peer-review

  Open Access