Corbet, René, et al. “Computing the Multicover Bifiltration.”10.1007/s00454-022-00476-8__Discrete and Computational Geometry, vol. 70, Springer Nature, 2023, pp. 376–405, doi:10.1007/s00454-022-00476-8.

Kerber, Michael, and Herbert Edelsbrunner. “D Kinetic Alpha Complexes and Their Implementation.”10.1137/1.9781611972931.6__2013 Proceedings of the 15th Workshop on Algorithm Engineering and Experiments, Society of Industrial and Applied Mathematics, 2013, pp. 70–77, doi:10.1137/1.9781611972931.6.

Chen, Chao, and Michael Kerber. “An Output Sensitive Algorithm for Persistent Homology.”10.1016/j.comgeo.2012.02.010__Computational Geometry: Theory and Applications, vol. 46, no. 4, Elsevier, 2013, pp. 435–47, doi:10.1016/j.comgeo.2012.02.010.

Brown, Gavin, et al. “Fano 3 Folds in Codimension 4 Tom and Jerry Part I.”10.1112/S0010437X11007226__Compositio Mathematica, vol. 148, no. 4, Cambridge University Press, 2012, pp. 1171–94, doi:10.1112/S0010437X11007226.

Edelsbrunner, Herbert, and Michael Kerber. “Alexander Duality for Functions: The Persistent Behavior of Land and Water and Shore.”10.1145/2261250.2261287__Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry , ACM, 2012, pp. 249–58, doi:10.1145/2261250.2261287.

Edelsbrunner, Herbert, and Michael Kerber. “Dual Complexes of Cubical Subdivisions of dn.”10.1007/s00454-011-9382-4__Discrete &; Computational Geometry, vol. 47, no. 2, Springer, 2012, pp. 393–414, doi:10.1007/s00454-011-9382-4.

Berberich, Eric, et al. “Deconstructing Approximate Offsets.”10.1007/s00454-012-9441-5__Discrete &; Computational Geometry, vol. 48, no. 4, Springer, 2012, pp. 964–89, doi:10.1007/s00454-012-9441-5.

Kerber, Michael, and Michael Sagraloff. “A Worst Case Bound for Topology Computation of Algebraic Curves.”10.1016/j.jsc.2011.11.001__10.1016/j.jsc.2011.11.001__Journal of Symbolic Computation, vol. 47, no. 3, Elsevier, 2012, pp. 239–58, doi:10.1016/j.jsc.2011.11.001.

Berberich, Eric, et al. “Deconstructing Approximate Offsets.”10.1145/1998196.1998225__Proceedings of the Twenty-Seventh Annual Symposium on Computational Geometry, ACM, 2011, pp. 187–96, doi:10.1145/1998196.1998225.

Kerber, Michael, and Michael Sagraloff. “A Note on the Complexity of Real Algebraic Hypersurfaces.”10.1007/s00373-011-1020-7__Graphs and Combinatorics, vol. 27, no. 3, Springer, 2011, pp. 419–30, doi:10.1007/s00373-011-1020-7.

Kerber, Michael, and Michael Sagraloff. Root Refinement for Real Polynomials. Springer, 2011, pp. 209–16, doi:10.1145/1993886.1993920.

Berberich, Eric, et al. A Generic Algebraic Kernel for Non Linear Geometric Applications. ACM, 2011, pp. 179–86, doi:10.1145/1998196.1998224.

Chen, Chao, and Michael Kerber. An Output Sensitive Algorithm for Persistent Homology. ACM, 2011, pp. 207–16, doi:10.1145/1998196.1998228.

Edelsbrunner, Herbert, and Michael Kerber. “Covering and Packing with Spheres by Diagonal Distortion in R^n.”10.1007/978-3-642-19391-0_2__Rainbow of Computer Science, edited by Cristian Calude et al., vol. 6570, Springer, 2011, pp. 20–35, doi:10.1007/978-3-642-19391-0_2.

Chen, Chao, and Michael Kerber. Persistent Homology Computation with a Twist. TU Dortmund, 2011, pp. 197–200.

Bendich, Paul, et al. Persistent Homology under Non-Uniform Error. Vol. 6281, Springer, 2010, pp. 12–23, doi:10.1007/978-3-642-15155-2_2.

Berberich, Eric, et al. Polygonal Reconstruction from Approximate Offsets. TU Dortmund, 2010, pp. 12–23.

Bendich, Paul, et al. “Computing Robustness and Persistence for Images.”10.1109/TVCG.2010.139__IEEE Transactions of Visualization and Computer Graphics, vol. 16, no. 6, IEEE, 2010, pp. 1251–60, doi:10.1109/TVCG.2010.139.