default search action
Michael Kerber
Person information
- affiliation: TU Graz, Institute of Geometry, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j27]Xavier Goaoc, Michael Kerber:
Guest Editors' Foreword. Discret. Comput. Geom. 71(1): 1-3 (2024) - [j26]Mickaël Buchet
, Bianca B. Dornelas
Sparse Higher Order Čech Filtrations. J. ACM 71(4): 28:1-28:23 (2024) - [c45]Ángel Javier Alonso, Michael Kerber, Primoz Skraba:
Probabilistic Analysis of Multiparameter Persistence Decompositions into Intervals. SoCG 2024: 6:1-6:19 - [c44]Ángel Javier Alonso, Michael Kerber, Tung Lam, Michael Lesnick:
Delaunay Bifiltrations of Functions on Point Clouds. SODA 2024: 4872-4891 - [i42]Ángel Javier Alonso, Michael Kerber, Primoz Skraba:
Probabilistic Analysis of Multiparameter Persistence Decompositions. CoRR abs/2403.11939 (2024) - [i41]Michael Kerber, Florian Russold:
Graphcode: Learning from multiparameter persistent homology using graph neural networks. CoRR abs/2405.14302 (2024) - 2023
- [j25]Ulderico Fugacci
Compression for 2-parameter persistent homology. Comput. Geom. 109: 101940 (2023) - [j24]René Corbet
Computing the Multicover Bifiltration. Discret. Comput. Geom. 70(2): 376-405 (2023) - [j23]Håvard Bakke Bjerkevik, Michael Kerber:
Asymptotic improvements on the exact matching distance for 2-parameter persistence. J. Comput. Geom. 14(1): 309-342 (2023) - [c43]Ángel Javier Alonso, Michael Kerber, Siddharth Pritam:
Filtration-Domination in Bifiltered Graphs. ALENEX 2023: 27-38 - [c42]Ángel Javier Alonso, Michael Kerber:
Decomposition of Zero-Dimensional Persistence Modules via Rooted Subsets. SoCG 2023: 7:1-7:16 - [c41]Mickaël Buchet, Bianca B. Dornelas, Michael Kerber:
Sparse Higher Order Čech Filtrations. SoCG 2023: 20:1-20:17 - [c40]Michael Kerber, Matthias Söls:
The Localized Union-Of-Balls Bifiltration. SoCG 2023: 45:1-45:19 - [i40]Ángel Javier Alonso, Michael Kerber:
Decomposition of zero-dimensional persistence modules via rooted subsets. CoRR abs/2303.06118 (2023) - [i39]Mickaël Buchet, Bianca B. Dornelas, Michael Kerber:
Sparse Higher Order Čech Filtrations. CoRR abs/2303.06666 (2023) - [i38]Michael Kerber, Matthias Söls:
The Localized Union-of-Balls Bifiltration. CoRR abs/2303.07002 (2023) - [i37]Martin Uray, Barbara Giunti, Michael Kerber, Stefan Huber
Topological Data Analysis in smart manufacturing processes - A survey on the state of the art. CoRR abs/2310.09319 (2023) - [i36]Ángel Javier Alonso, Michael Kerber, Tung Lam, Michael Lesnick:
Delaunay Bifiltrations of Functions on Point Clouds. CoRR abs/2310.15902 (2023) - 2022
- [c39]Barbara Giunti
Average Complexity of Matrix Reduction for Clique Filtrations. ISSAC 2022: 187-196 - [e1]Xavier Goaoc, Michael Kerber
38th International Symposium on Computational Geometry, SoCG 2022, June 7-10, 2022, Berlin, Germany. LIPIcs 224, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-227-3 [contents] - [i35]Ángel Javier Alonso, Michael Kerber, Siddharth Pritam:
Filtration-Domination in Bifiltered Graphs. CoRR abs/2211.05574 (2022) - [i34]Ulrich Bauer
Keeping it sparse: Computing Persistent Homology revised. CoRR abs/2211.09075 (2022) - 2021
- [j22]Aruni Choudhary
Improved approximate rips filtrations with shifted integer lattices and cubical complexes. J. Appl. Comput. Topol. 5(3): 425-458 (2021) - [c38]Michael Kerber, Alexander Rolle:
Fast Minimal Presentations of Bi-graded Persistence Modules. ALENEX 2021: 207-220 - [c37]René Corbet, Michael Kerber, Michael Lesnick, Georg Osang:
Computing the Multicover Bifiltration. SoCG 2021: 27:1-27:17 - [i33]René Corbet, Michael Kerber, Michael Lesnick, Georg Osang:
Computing the Multicover Bifiltration. CoRR abs/2103.07823 (2021) - [i32]Aruni Choudhary, Michael Kerber, Sharath Raghvendra:
Improved Approximate Rips Filtrations with Shifted Integer Lattices and Cubical Complexes. CoRR abs/2105.05151 (2021) - [i31]Ulderico Fugacci, Michael Kerber, Alexander Rolle:
Compression for 2-Parameter Persistent Homology. CoRR abs/2107.10924 (2021) - [i30]Barbara Giunti
Average complexity of matrix reduction for clique filtrations. CoRR abs/2111.02125 (2021) - [i29]Håvard Bakke Bjerkevik
Asymptotic Improvements on the Exact Matching Distance for 2-parameter Persistence. CoRR abs/2111.10303 (2021) - 2020
- [j21]Håvard Bakke Bjerkevik
Computing the Interleaving Distance is NP-Hard. Found. Comput. Math. 20(5): 1237-1271 (2020) - [j20]Michael Kerber
Metric Spaces with Expensive Distances. Int. J. Comput. Geom. Appl. 30(2): 141-165 (2020) - [j19]Michael Kerber, Michael Lesnick, Steve Oudot:
Exact computation of the matching distance on 2-parameter persistence modules. J. Comput. Geom. 11(2): 4-25 (2020) - [c36]Michael Kerber
Efficient Approximation of the Matching Distance for 2-Parameter Persistence. SoCG 2020: 53:1-53:16 - [c35]Ulderico Fugacci
Topology-Preserving Terrain Simplification. SIGSPATIAL/GIS 2020: 36-47 - [i28]Michael Kerber, Alexander Rolle:
Fast Minimal Presentations of Bi-graded Persistence Modules. CoRR abs/2010.15623 (2020)
2010 – 2019
- 2019
- [j18]René Corbet, Ulderico Fugacci
A kernel for multi-parameter persistent homology. Comput. Graph. X 2 (2019) - [j17]Aruni Choudhary
Polynomial-Sized Topological Approximations Using the Permutahedron. Discret. Comput. Geom. 61(1): 42-80 (2019) - [j16]Michael Kerber, Hannah Schreiber
Barcodes of Towers and a Streaming Algorithm for Persistent Homology. Discret. Comput. Geom. 61(4): 852-879 (2019) - [c34]Ulderico Fugacci
Chunk Reduction for Multi-Parameter Persistent Homology. SoCG 2019: 37:1-37:14 - [c33]Michael Kerber
Exact Computation of the Matching Distance on 2-Parameter Persistence Modules. SoCG 2019: 46:1-46:15 - [c32]Aruni Choudhary, Michael Kerber, Sharath Raghvendra:
Improved Topological Approximations by Digitization. SODA 2019: 2675-2688 - [i27]Michael Kerber, Arnur Nigmetov:
Metric Spaces with Expensive Distances. CoRR abs/1901.08805 (2019) - [i26]Ulderico Fugacci, Michael Kerber, Hugo Manet:
Topology-Preserving Terrain Simplification. CoRR abs/1912.03032 (2019) - [i25]Michael Kerber, Arnur Nigmetov:
Efficient Approximation of the Matching Distance for 2-parameter persistence. CoRR abs/1912.05826 (2019) - [i24]Michael Kerber, Vijay Natarajan, Bei Wang:
Topology, Computation and Data Analysis (Dagstuhl Seminar 19212). Dagstuhl Reports 9(5): 110-131 (2019) - 2018
- [j15]René Corbet
The representation theorem of persistence revisited and generalized. J. Appl. Comput. Topol. 2(1-2): 1-31 (2018) - [i23]René Corbet, Ulderico Fugacci, Michael Kerber, Claudia Landi, Bei Wang:
A Kernel for Multi-Parameter Persistent Homology. CoRR abs/1809.10231 (2018) - [i22]Håvard Bakke Bjerkevik, Magnus Bakke Botnan, Michael Kerber:
Computing the interleaving distance is NP-hard. CoRR abs/1811.09165 (2018) - [i21]Aruni Choudhary, Michael Kerber, Sharath Raghvendra:
Improved Topological Approximations by Digitization. CoRR abs/1812.04966 (2018) - [i20]Michael Kerber, Michael Lesnick, Steve Oudot:
Exact computation of the matching distance on 2-parameter persistence modules. CoRR abs/1812.09085 (2018) - 2017
- [j14]Michael Kerber, Dmitriy Morozov, Arnur Nigmetov
Geometry Helps to Compare Persistence Diagrams. ACM J. Exp. Algorithmics 22 (2017) - [j13]Michael Kerber:
Special issue on algorithms and software for computational topology. J. Symb. Comput. 78: 1-2 (2017) - [j12]Ulrich Bauer
Phat - Persistent Homology Algorithms Toolbox. J. Symb. Comput. 78: 76-90 (2017) - [c31]Michael Kerber, Robert Tichy, Mario Weitzer:
Constrained Triangulations, Volumes of Polytopes, and Unit Equations. SoCG 2017: 46:1-46:15 - [c30]Michael Kerber, Hannah Schreiber:
Barcodes of Towers and a Streaming Algorithm for Persistent Homology. SoCG 2017: 57:1-57:16 - [c29]Aruni Choudhary, Michael Kerber, Sharath Raghvendra:
Improved Approximate Rips Filtrations with Shifted Integer Lattices. ESA 2017: 28:1-28:13 - [i19]Michael Kerber, Hannah Schreiber:
Barcodes of Towers and a Streaming Algorithm for Persistent Homology. CoRR abs/1701.02208 (2017) - [i18]Aruni Choudhary, Michael Kerber, Sharath Raghvendra:
Improved Approximate Rips Filtrations with Shifted Integer Lattices. CoRR abs/1706.07399 (2017) - [i17]Hamish A. Carr, Michael Kerber, Bei Wang:
Topology, Computation and Data Analysis (Dagstuhl Seminar 17292). Dagstuhl Reports 7(7): 88-109 (2017) - 2016
- [c28]Michael Kerber, Dmitriy Morozov, Arnur Nigmetov
Geometry Helps to Compare Persistence Diagrams. ALENEX 2016: 103-112 - [c27]Aruni Choudhary, Michael Kerber, Sharath Raghvendra:
Polynomial-Sized Topological Approximations Using the Permutahedron. SoCG 2016: 31:1-31:16 - [c26]Michael Kerber, Donald R. Sheehy
Persistent Homology and Nested Dissection. SODA 2016: 1234-1245 - [i16]Aruni Choudhary, Michael Kerber, Sharath Raghvendra:
Polynomial-Sized Topological Approximations Using The Permutahedron. CoRR abs/1601.02732 (2016) - [i15]Michael Kerber, Dmitriy Morozov, Arnur Nigmetov:
Geometry Helps to Compare Persistence Diagrams. CoRR abs/1606.03357 (2016) - 2015
- [j11]Michael Kerber, Michael Sagraloff:
Root refinement for real polynomials using quadratic interval refinement. J. Comput. Appl. Math. 280: 377-395 (2015) - [c25]Aruni Choudhary, Michael Kerber:
Local Doubling Dimension of Point Sets. CCCG 2015 - [c24]Michael Kerber, Sharath Raghvendra:
Approximation and Streaming Algorithms for Projective Clustering via Random Projections. CCCG 2015 - [c23]Dan Halperin, Michael Kerber, Doron Shaharabani:
The Offset Filtration of Convex Objects. ESA 2015: 705-716 - [c22]Sergio Cabello
Semi-dynamic Connectivity in the Plane. WADS 2015: 115-126 - [i14]Sergio Cabello, Michael Kerber:
Semi-dynamic connectivity in the plane. CoRR abs/1502.03690 (2015) - 2014
- [c21]Ulrich Bauer
Distributed Computation of Persistent Homology. ALENEX 2014: 31-38 - [c20]Mabel Iglesias Ham, Michael Kerber, Caroline Uhler:
Sphere Packing with Limited Overlap. CCCG 2014 - [c19]Ulrich Bauer
PHAT - Persistent Homology Algorithms Toolbox. ICMS 2014: 137-143 - [c18]Chen Gu, Leonidas J. Guibas, Michael Kerber:
Topology-Driven Trajectory Synthesis with an Example on Retinal Cell Motions. WABI 2014: 326-339 - [p1]Ulrich Bauer
Clear and Compress: Computing Persistent Homology in Chunks. Topological Methods in Data Analysis and Visualization 2014: 103-117 - [i13]Mabel Iglesias Ham, Michael Kerber, Caroline Uhler:
Sphere Packing with Limited Overlap. CoRR abs/1401.0468 (2014) - [i12]Aruni Choudhary, Michael Kerber:
Local Doubling Dimension of Point Sets. CoRR abs/1406.4822 (2014) - [i11]Michael Kerber, Sharath Raghvendra:
Approximation and Streaming Algorithms for Projective Clustering via Random Projections. CoRR abs/1407.2063 (2014) - [i10]Dan Halperin, Michael Kerber, Doron Shaharabani:
The Offset Filtration of Convex Objects. CoRR abs/1407.6132 (2014) - 2013
- [j10]Chao Chen, Michael Kerber:
An output-sensitive algorithm for persistent homology. Comput. Geom. 46(4): 435-447 (2013) - [j9]Michael Kerber:
Embedding the dual complex of hyper-rectangular partitions. J. Comput. Geom. 4(1): 13-37 (2013) - [c17]Michael Kerber, Herbert Edelsbrunner:
3D kinetic alpha complexes and their implementation. ALENEX 2013: 70-77 - [c16]Yang Li
Large-scale joint map matching of GPS traces. SIGSPATIAL/GIS 2013: 214-223 - [c15]Haochen Tang, Michael Kerber, Qixing Huang, Leonidas J. Guibas:
Locating lucrative passengers for taxicab drivers. SIGSPATIAL/GIS 2013: 494-497 - [c14]Michael Kerber, R. Sharathkumar:
Approximate Čech Complex in Low and High Dimensions. ISAAC 2013: 666-676 - [i9]Michael Kerber, R. Sharathkumar:
Approximate Cech Complexes in Low and High Dimensions. CoRR abs/1307.3272 (2013) - [i8]Ulrich Bauer, Michael Kerber, Jan Reininghaus:
Distributed computation of persistent homology. CoRR abs/1310.0710 (2013) - 2012
- [j8]Herbert Edelsbrunner, Michael Kerber:
Dual Complexes of Cubical Subdivisions of ℝ n. Discret. Comput. Geom. 47(2): 393-414 (2012) - [j7]Eric Berberich, Dan Halperin, Michael Kerber, Roza Pogalnikova:
Deconstructing Approximate Offsets. Discret. Comput. Geom. 48(4): 964-989 (2012) - [j6]Michael Kerber, Michael Sagraloff:
A worst-case bound for topology computation of algebraic curves. J. Symb. Comput. 47(3): 239-258 (2012) - [c13]Herbert Edelsbrunner, Michael Kerber:
Alexander duality for functions: the persistent behavior of land and water and shore. SCG 2012: 249-258 - [i7]Michael Kerber:
Embedding the dual complex of hyper-rectangular partitions. CoRR abs/1207.3202 (2012) - [i6]Herbert Edelsbrunner, Carl-Philipp Heisenberg, Michael Kerber, Gabriel Krens:
The Medusa of Spatial Sorting: Topological Construction. CoRR abs/1207.6474 (2012) - [i5]Michael Kerber, Herbert Edelsbrunner:
The Medusa of Spatial Sorting: 3D Kinetic Alpha Complexes and Implementation. CoRR abs/1209.5434 (2012) - 2011
- [j5]Michael Kerber, Michael Sagraloff:
A Note on the Complexity of Real Algebraic Hypersurfaces. Graphs Comb. 27(3): 419-430 (2011) - [c12]Herbert Edelsbrunner, Michael Kerber:
Covering and Packing with Spheres by Diagonal Distortion in ℝn. Rainbow of Computer Science 2011: 20-35 - [c11]Eric Berberich, Michael Hemmer, Michael Kerber:
A generic algebraic kernel for non-linear geometric applications. SCG 2011: 179-186 - [c10]Eric Berberich, Dan Halperin, Michael Kerber, Roza Pogalnikova:
Deconstructing approximate offsets. SCG 2011: 187-196 - [c9]Chao Chen, Michael Kerber:
An output-sensitive algorithm for persistent homology. SCG 2011: 207-216 - [c8]Michael Kerber, Michael Sagraloff:
Efficient real root approximation. ISSAC 2011: 209-216 - [i4]Michael Kerber, Michael Sagraloff:
Root Refinement for Real Polynomials. CoRR abs/1104.1362 (2011) - [i3]Michael Kerber, Michael Sagraloff:
A Worst-case Bound for Topology Computation of Algebraic Curves. CoRR abs/1104.1510 (2011) - [i2]Eric Berberich, Dan Halperin, Michael Kerber, Roza Pogalnikova:
Deconstructing Approximate Offsets. CoRR abs/1109.2158 (2011) - [i1]Herbert Edelsbrunner, Michael Kerber:
Alexander Duality for Functions: the Persistent Behavior of Land and Water and Shore. CoRR abs/1109.5052 (2011) - 2010
- [j4]Eric Berberich, Michael Kerber, Michael Sagraloff:
An efficient algorithm for the stratification and triangulation of an algebraic surface. Comput. Geom. 43(3): 257-278 (2010) - [j3]Eric Berberich, Efi Fogel
Arrangements on Parametric Surfaces II: Concretizations and Applications. Math. Comput. Sci. 4(1): 67-91 (2010) - [j2]Paul Bendich, Herbert Edelsbrunner, Michael Kerber:
Computing Robustness and Persistence for Images. IEEE Trans. Vis. Comput. Graph. 16(6): 1251-1260 (2010) - [c7]Paul Bendich, Herbert Edelsbrunner, Michael Kerber, Amit K. Patel:
Persistent Homology under Non-uniform Error. MFCS 2010: 12-23
2000 – 2009
- 2009
- [b1]Michael Kerber:
Geometric algorithms for algebraic curves and surfaces. Saarland University, 2009 - [j1]Michael Kerber:
Division-free computation of subresultants using Bezout matrices. Int. J. Comput. Math. 86(12): 2186-2200 (2009) - [c6]Michael Kerber:
On the Complexity of Reliable Root Approximation. CASC 2009: 155-167 - 2008
- [c5]Eric Berberich, Michael Kerber, Michael Sagraloff:
Exact geometric-topological analysis of algebraic surfaces. SCG 2008: 164-173 - [c4]Pavel Emeliyanenko, Michael Kerber:
Visualizing and exploring planar algebraic arrangements: a web application. SCG 2008: 224-225 - [c3]Eric Berberich, Michael Kerber:
Exact arrangements on tori and Dupin cyclides. Symposium on Solid and Physical Modeling 2008: 59-66 - [c2]Arno Eigenwillig, Michael Kerber:
Exact and efficient 2D-arrangements of arbitrary algebraic curves. SODA 2008: 122-131 - 2007
- [c1]Arno Eigenwillig, Michael Kerber, Nicola Wolpert:
Fast and exact geometric analysis of real algebraic plane curves. ISSAC 2007: 151-158
Coauthor Index
Sharath Raghvendra
aka: R. Sharathkumar
aka: R. Sharathkumar
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-15 20:40 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: