F. Pausinger, “Van der Corput sequences and linear permutations,” Electronic Notes in Discrete Mathematics, vol. 43. Elsevier, pp. 43–50, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2304
DOI: 10.1016/j.endm.2013.07.008

M. cadek, M. Krcál, J. Matousek, L. Vokínek, and U. Wagner, “Extending continuous maps: Polynomiality and undecidability,” in 45th Annual ACM Symposium on theory of computing, Palo Alto, CA, United States, 2013, pp. 595–604.
LibreCat: https://research-explorer.ista.ac.at/record/2807
DOI: 10.1145/2488608.2488683

D. Attali, U. Bauer, O. Devillers, M. Glisse, and A. Lieutier, “Homological reconstruction and simplification in ,” in Proceedings of the 29th annual symposium on Computational Geometry, Rio de Janeiro, Brazil, 2013, pp. 117–125.
LibreCat: https://research-explorer.ista.ac.at/record/2812
DOI: 10.1145/2462356.2462373

C. Topp et al., “D phenotyping and quantitative trait locus mapping identify core regions of the rice genome controlling root architecture,” PNAS, vol. 110, no. 18. National Academy of Sciences, pp. 95–04, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2822
DOI: 10.1073/pnas.1304354110
PMID: 25673779

H. Edelsbrunner and F. Pausinger, “Stable length estimates of tube-like shapes,” in 17th IAPR International Conference on Discrete Geometry for Computer Imagery, Seville, Spain, 2013, vol. 7749, pp. XV–XIX.
LibreCat: https://research-explorer.ista.ac.at/record/2843
DOI: 10.1007/978-3-642-37067-0

P. Bendich, H. Edelsbrunner, D. Morozov, and A. Patel, “Homology and robustness of level and interlevel sets,” Homology, Homotopy and Applications, vol. 15, no. 1. International Press, pp. 51–72, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2859
DOI: 10.4310/HHA.2013.v15.n1.a3
arXiv: 1102.3389

S. Fang et al., “Genotypic recognition and spatial responses by rice roots,” PNAS, vol. 110, no. 7. National Academy of Sciences, pp. 2670–2675, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2887
DOI: 10.1073/pnas.1222821110
PMID: 23362379

C. Chen, V. Kolmogorov, Z. Yan, D. Metaxas, and C. Lampert, “Computing the M most probable modes of a graphical model,” presented at the  AISTATS: Conference on Uncertainty in Artificial Intelligence, Scottsdale, AZ, United States, 2013, vol. 31, pp. 161–169.
LibreCat: https://research-explorer.ista.ac.at/record/2901

M. Kerber and H. Edelsbrunner, “D kinetic alpha complexes and their implementation,” in 2013 Proceedings of the 15th Workshop on Algorithm Engineering and Experiments, New Orleans, LA, United States, 2013, pp. 70–77.
LibreCat: https://research-explorer.ista.ac.at/record/2906
DOI: 10.1137/1.9781611972931.6

H. Edelsbrunner, B. T. Fasy, and G. Rote, “Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions,” Discrete &; Computational Geometry, vol. 49, no. 4. Springer, pp. 797–822, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2815
DOI: 10.1007/s00454-013-9517-x

C. Chen and M. Kerber, “An output sensitive algorithm for persistent homology,” Computational Geometry: Theory and Applications, vol. 46, no. 4. Elsevier, pp. 435–447, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2939
DOI: 10.1016/j.comgeo.2012.02.010

H. Edelsbrunner, “Persistent homology in image processing,” in Graph-Based Representations in Pattern Recognition, Vienna, Austria, 2013, vol. 7877, pp. 182–183.
LibreCat: https://research-explorer.ista.ac.at/record/10897
DOI: 10.1007/978-3-642-38221-5_19

H. Edelsbrunner and N. Strelkova, “On the configuration space of Steiner minimal trees,” Russian Mathematical Surveys, vol. 67, no. 6. IOP Publishing Ltd., pp. 1167–1168, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/2849
DOI: 10.1070/RM2012v067n06ABEH004820

H. Edelsbrunner and O. Symonova, “The adaptive topology of a digital image,” presented at the ISVD: International Symposium on Voronoi Diagrams in Science and Engineering, New Brunswick, NJ, USA , 2012, pp. 41–48.
LibreCat: https://research-explorer.ista.ac.at/record/2903
DOI: 10.1109/ISVD.2012.11

N. Dolbilin, H. Edelsbrunner, and O. Musin, “On the optimality of functionals over triangulations of Delaunay sets,” Russian Mathematical Surveys, vol. 67, no. 4. IOP Publishing, pp. 781–783, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/2941
DOI: 10.1070/RM2012v067n04ABEH004807

G. Zankl, Y. Haxhimusa, and A. Ion, “Interactive labeling of image segmentation hierarchies,” presented at the Pattern Recognition, Graz, Austria, 2012, vol. 7476, pp. 11–20.
LibreCat: https://research-explorer.ista.ac.at/record/2971
DOI: 10.1007/978-3-642-32717-9_2

G. Brown, M. Kerber, and M. Reid, “Fano 3 folds in codimension 4 Tom and Jerry Part I,” Compositio Mathematica, vol. 148, no. 4. Cambridge University Press, pp. 1171–1194, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/3120
DOI: 10.1112/S0010437X11007226

H. Edelsbrunner and M. Kerber, “Alexander duality for functions: The persistent behavior of land and water and shore,” in Proceedings of the twenty-eighth annual symposium on Computational geometry , Chapel Hill, NC, USA, 2012, pp. 249–258.
LibreCat: https://research-explorer.ista.ac.at/record/3133
DOI: 10.1145/2261250.2261287

H. Edelsbrunner, B. Fasy, and G. Rote, “Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions,” in Proceedings of the twenty-eighth annual symposium on Computational geometry , Chapel Hill, NC, USA, 2012, pp. 91–100.
LibreCat: https://research-explorer.ista.ac.at/record/3134
DOI: 10.1145/2261250.2261265

H. Edelsbrunner and M. Kerber, “Dual complexes of cubical subdivisions of dn,” Discrete &; Computational Geometry, vol. 47, no. 2. Springer, pp. 393–414, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/3256
DOI: 10.1007/s00454-011-9382-4

A. Ion, J. Carreira, and C. Sminchisescu, “Image segmentation by figure-ground composition into maximal cliques,” presented at the ICCV: International Conference on Computer Vision, Barcelona, Spain, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/3265
DOI: 10.1109/ICCV.2011.6126486

E. Berberich, D. Halperin, M. Kerber, and R. Pogalnikova, “Deconstructing approximate offsets,” Discrete &; Computational Geometry, vol. 48, no. 4. Springer, pp. 964–989, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/3115
DOI: 10.1007/s00454-012-9441-5
arXiv: 1109.2158

M. Kerber and M. Sagraloff, “A worst case bound for topology computation of algebraic curves,”  Journal of Symbolic Computation, vol. 47, no. 3. Elsevier, pp. 239–258, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/3331
DOI: 10.1016/j.jsc.2011.11.001

O. Busaryev, S. Cabello, C. Chen, T. Dey, and Y. Wang, “Annotating simplices with a homology basis and its applications,” presented at the SWAT: Symposium and Workshops on Algorithm Theory, Helsinki, Finland, 2012, vol. 7357, pp. 189–200.
LibreCat: https://research-explorer.ista.ac.at/record/3129
DOI: 10.1007/978-3-642-31155-0_17
arXiv: 1107.3793

Y. Mileyko, H. Edelsbrunner, C. Price, and J. Weitz, “Hierarchical ordering of reticular networks,” PLoS One, vol. 7, no. 6. Public Library of Science, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/3159
DOI: 10.1371/journal.pone.0036715

P. Bendich, S. Cabello, and H. Edelsbrunner, “A point calculus for interlevel set homology,” Pattern Recognition Letters, vol. 33, no. 11. Elsevier, pp. 1436–1444, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/3310
DOI: 10.1016/j.patrec.2011.10.007

F. Pausinger, “Elementary solutions of the Bernstein problem on two intervals,” Journal of Mathematical Physics, Analysis, Geometry, vol. 8, no. 1. B. Verkin Institute for Low Temperature Physics and Engineering, pp. 63–78, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/6588
WoS: 000301173600004

H. Edelsbrunner and N. Strelkova, “On the configuration space for the shortest networks,” Russian Mathematical Surveys, vol. 67, no. 6. Russian Academy of Sciences, pp. 1167–1168, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/2912
DOI: 10.4213/rm9503

N. Quadrianto, C. Lampert, and C. Chen, “The most persistent soft-clique in a set of sampled graphs,” in Proceedings of the 29th International Conference on Machine Learning, Edinburgh, United Kingdom, 2012, pp. 211–218.
LibreCat: https://research-explorer.ista.ac.at/record/3127

F. Pausinger, “Weak multipliers for generalized van der Corput sequences,” Journal de Theorie des Nombres des Bordeaux, vol. 24, no. 3. Université de Bordeaux, pp. 729–749, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/2904
DOI: 10.5802/jtnb.819

H. Edelsbrunner et al., “Fractal and computational geometry for generalizing cartographic objects,” Modeling and Analysis of Information Systems, vol. 19, no. 6. Russian Academy of Sciences, pp. 152–160, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/2902

A. Ion, J. Carreira, and C. Sminchisescu, “Probabilistic joint image segmentation and labeling,” in NIPS Proceedings, Granada, Spain, 2011, vol. 24, pp. 1827–1835.
LibreCat: https://research-explorer.ista.ac.at/record/3266

Y. Sheng, B. Cutler, C. Chen, and J. Nasman, “Perceptual global illumination cancellation in complex projection environments,” Computer Graphics Forum, vol. 30, no. 4. Wiley-Blackwell, pp. 1261–1268, 2011.
LibreCat: https://research-explorer.ista.ac.at/record/3269
DOI: 10.1111/j.1467-8659.2011.01985.x

C. Chen and D. Freedman, “Hardness results for homology localization,” Discrete &; Computational Geometry, vol. 45, no. 3. Springer, pp. 425–448, 2011.
LibreCat: https://research-explorer.ista.ac.at/record/3267
DOI: 10.1007/s00454-010-9322-8

R. Van De Weygaert et al., “Alpha, Betti and the Megaparsec Universe: On the topology of the Cosmic Web,” in Transactions on Computational Science XIV, vol. 6970, M. Gavrilova, K. Tan, and M. Mostafavi, Eds. Springer, 2011, pp. 60–101.
LibreCat: https://research-explorer.ista.ac.at/record/3335
DOI: 10.1007/978-3-642-25249-5_3
arXiv: 1306.3640

E. Berberich, D. Halperin, M. Kerber, and R. Pogalnikova, “Deconstructing approximate offsets,” in Proceedings of the twenty-seventh annual symposium on Computational geometry, Paris, France, 2011, pp. 187–196.
LibreCat: https://research-explorer.ista.ac.at/record/3329
DOI: 10.1145/1998196.1998225

M. Kerber and M. Sagraloff, “A note on the complexity of real algebraic hypersurfaces,” Graphs and Combinatorics, vol. 27, no. 3. Springer, pp. 419–430, 2011.
LibreCat: https://research-explorer.ista.ac.at/record/3332
DOI: 10.1007/s00373-011-1020-7

M. Kerber and M. Sagraloff, “Root refinement for real polynomials,” presented at the ISSAC: International Symposium on Symbolic and Algebraic Computation, California, USA, 2011, pp. 209–216.
LibreCat: https://research-explorer.ista.ac.at/record/3330
DOI: 10.1145/1993886.1993920
arXiv: 1104.1362

E. Berberich, M. Hemmer, and M. Kerber, “A generic algebraic kernel for non linear geometric applications,” presented at the SCG: Symposium on Computational Geometry, Paris, France, 2011, pp. 179–186.
LibreCat: https://research-explorer.ista.ac.at/record/3328
DOI: 10.1145/1998196.1998224

H. Edelsbrunner, J. Pach, and G. Ziegler, “Letter from the new editors-in-chief,” Discrete &; Computational Geometry, vol. 45, no. 1. Springer, pp. 1–2, 2011.
LibreCat: https://research-explorer.ista.ac.at/record/3334
DOI: 10.1007/s00454-010-9313-9

C. Chen and M. Kerber, “An output sensitive algorithm for persistent homology,” presented at the SoCG: Symposium on Computational Geometry, Paris, France, 2011, pp. 207–216.
LibreCat: https://research-explorer.ista.ac.at/record/3367
DOI: 10.1145/1998196.1998228

B. T. Fasy, “The difference in length of curves in R^n,” Acta Sci. Math. (Szeged), vol. 77, no. 1–2. Szegedi Tudományegyetem, pp. 359–367, 2011.
LibreCat: https://research-explorer.ista.ac.at/record/3781

H. Edelsbrunner and M. Kerber, “Covering and packing with spheres by diagonal distortion in R^n,” in Rainbow of Computer Science, vol. 6570, C. Calude, G. Rozenberg, and A. Salomaa, Eds. Springer, 2011, pp. 20–35.
LibreCat: https://research-explorer.ista.ac.at/record/3796
DOI: 10.1007/978-3-642-19391-0_2

B. Wang, H. Edelsbrunner, and D. Morozov, “Computing elevation maxima by searching the Gauss sphere,” Journal of Experimental Algorithmics, vol. 16, no. 2.2. ACM, pp. 1–13, 2011.
LibreCat: https://research-explorer.ista.ac.at/record/3965
DOI: 10.1145/1963190.1970375

H. Wagner, C. Chen, and E. Vuçini, “Efficient computation of persistent homology for cubical data,” in Topological Methods in Data Analysis and Visualization II, R. Peikert, H. Hauser, H. Carr, and R. Fuchs, Eds. Springer, 2011, pp. 91–106.
LibreCat: https://research-explorer.ista.ac.at/record/3271
DOI: 10.1007/978-3-642-23175-9_7

C. Chen and M. Kerber, “Persistent homology computation with a twist,” presented at the EuroCG: European Workshop on Computational Geometry, Morschach, Switzerland, 2011, pp. 197–200.
LibreCat: https://research-explorer.ista.ac.at/record/3270

Y. Zheng, S. Gu, H. Edelsbrunner, C. Tomasi, and P. Benfey, Detailed reconstruction of 3D plant root shape. IEEE, 2011.
LibreCat: https://research-explorer.ista.ac.at/record/3312
DOI: 10.1109/ICCV.2011.6126475

C. Chen and H. Edelsbrunner, “Diffusion runs low on persistence fast,” in Proceedings of the IEEE International Conference on Computer Vision, Barcelona, Spain, 2011.
LibreCat: https://research-explorer.ista.ac.at/record/3313
DOI: 10.1109/ICCV.2011.6126271

H. Edelsbrunner, “Alpha shapes - a survey,” in Tessellations in the Sciences: Virtues, Techniques and Applications of Geometric Tilings, R. van de Weygaert, G. Vegter, J. Ritzerveld, and V. Icke, Eds. Springer.
LibreCat: https://research-explorer.ista.ac.at/record/3311

H. Edelsbrunner, D. Morozov, and A. Patel, “Quantifying transversality by measuring the robustness of intersections,” Foundations of Computational Mathematics, vol. 11, no. 3. Springer, pp. 345–361, 2011.
LibreCat: https://research-explorer.ista.ac.at/record/3377
DOI: 10.1007/s10208-011-9090-8

P. Bendich and J. Harer, “Persistent intersection homology,” Foundations of Computational Mathematics, vol. 11, no. 3. Springer, pp. 305–336, 2011.
LibreCat: https://research-explorer.ista.ac.at/record/3378
DOI: 10.1007/s10208-010-9081-1

C. Chen, D. Freedman, and C. Lampert, “Enforcing topological constraints in random field image segmentation,” in CVPR: Computer Vision and Pattern Recognition, Colorado Springs, CO, United States, 2011, pp. 2089–2096.
LibreCat: https://research-explorer.ista.ac.at/record/3336
DOI: 10.1109/CVPR.2011.5995503

R. Gonzalez-Diaz, A. Ion, M. J. Jimenez, and R. Poyatos, “Incremental-decremental algorithm for computing AT-models and persistent homology,” in Computer Analysis of Images and Patterns, Seville, Spain, 2011, vol. 6854, pp. 286–293.
LibreCat: https://research-explorer.ista.ac.at/record/9648
DOI: 10.1007/978-3-642-23672-3_35

N. M. Artner, A. Ion, and W. G. Kropatsch, “Spatio-temporal extraction of articulated models in a graph pyramid,” in Graph-Based Representations in Pattern Recognition, Münster, Germany, 2011, vol. 6658, pp. 215–224.
LibreCat: https://research-explorer.ista.ac.at/record/10907
DOI: 10.1007/978-3-642-20844-7_22

C. Chen and D. Freedman, “Hardness results for homology localization,” in Proceedings of the 2010 Annual ACM-SIAM Symposium on Discrete Algorithms, Austin, TX, United States, 2010, pp. 1594–1604.
LibreCat: https://research-explorer.ista.ac.at/record/10909
DOI: 10.1137/1.9781611973075.129

C. Chen and D. Freedman, “Topology noise removal for curve  and surface evolution,” in  Conference proceedings MCV 2010, Beijing, China, 2010, vol. 6533, pp. 31–42.
LibreCat: https://research-explorer.ista.ac.at/record/3782
DOI: 10.1007/978-3-642-18421-5_4

H. Edelsbrunner, D. Morozov, and A. Patel, “The stability of the apparent contour of an orientable 2-manifold,” in Topological Data Analysis and Visualization: Theory, Algorithms and Applications, Springer, 2010, pp. 27–42.
LibreCat: https://research-explorer.ista.ac.at/record/3795
DOI: 10.1007/978-3-642-15014-2_3

P. Bendich, H. Edelsbrunner, D. Morozov, and A. Patel, “The robustness of level sets,” presented at the ESA: European Symposium on Algorithms, Liverpool, UK, 2010, vol. 6346, pp. 1–10.
LibreCat: https://research-explorer.ista.ac.at/record/3848
DOI: 10.1007/978-3-642-15775-2_1

K. Chatterjee, L. Doyen, H. Edelsbrunner, T. A. Henzinger, and P. Rannou, “Mean-payoff automaton expressions,” presented at the CONCUR: Concurrency Theory, Paris, France, 2010, vol. 6269, pp. 269–283.
LibreCat: https://research-explorer.ista.ac.at/record/3853
DOI: 10.1007/978-3-642-15375-4_19

P. Bendich, H. Edelsbrunner, M. Kerber, and A. Patel, “Persistent homology under non-uniform error,” presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic, 2010, vol. 6281, pp. 12–23.
LibreCat: https://research-explorer.ista.ac.at/record/3849
DOI: 10.1007/978-3-642-15155-2_2

E. Berberich, D. Halperin, M. Kerber, and R. Pogalnikova, “Polygonal reconstruction from approximate offsets,” presented at the EuroCG: European Workshop on Computational Geometry, Dortmund, Germany, 2010, pp. 12–23.
LibreCat: https://research-explorer.ista.ac.at/record/3850

P. Bendich, H. Edelsbrunner, and M. Kerber, “Computing robustness and persistence for images,” IEEE Transactions of Visualization and Computer Graphics, vol. 16, no. 6. IEEE, pp. 1251–1260, 2010.
LibreCat: https://research-explorer.ista.ac.at/record/3901
DOI: 10.1109/TVCG.2010.139

H. Edelsbrunner and J. Harer, “The persistent Morse complex segmentation of a 3-manifold,” presented at the 3DPH: Modelling the Physiological Human, Zermatt, Switzerland, 2009, vol. 5903, pp. 36–50.
LibreCat: https://research-explorer.ista.ac.at/record/3968
DOI: 10.1007/978-3-642-10470-1_4