| Publication | Date of Publication | Type |
|---|
| Spectral Clustering on Large Datasets: When Does it Work? Theory from Continuous Clustering and Density Cheeger-Buser | 2023-05-10 | Paper |
| A generalized Cheeger inequality | 2023-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875459 | 2023-02-03 | Paper |
| Exact computation of a manifold metric, via Lipschitz Embeddings and Shortest Paths on a Graph | 2021-02-02 | Paper |
| Metric Transforms and Low Rank Matrices via Representation Theory of the Real Hyperrectangle | 2020-11-23 | Paper |
| Solving 1-Laplacians in Nearly Linear Time: Collapsing and Expanding a Topological Ball | 2019-06-20 | Paper |
| Approximate Maximum Flow on Separable Undirected Graphs | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633918 | 2019-05-06 | Paper |
| Approximate center points with proofs | 2017-10-20 | Paper |
| A bézier-based approach to unstructured moving meshes | 2017-09-29 | Paper |
| Geometric median in nearly linear time | 2017-09-29 | Paper |
| Routing under balance | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365147 | 2017-09-29 | Paper |
| Exact Computation of a Manifold Metric, via Lipschitz Embeddings and Shortest Paths on a Graph | 2017-09-22 | Paper |
| Runtime guarantees for regression problems | 2017-05-16 | Paper |
| Approximating Nearest Neighbor Distances | 2015-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501797 | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501832 | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501286 | 2015-08-03 | Paper |
| Solving SDD linear systems in nearly m log 1/2 n time | 2015-06-26 | Paper |
| A new approach to output-sensitive construction of Voronoi diagrams and Delaunay triangulations | 2015-02-17 | Paper |
| A fast algorithm for well-spaced points and approximate delaunay graphs | 2015-02-17 | Paper |
| Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs | 2015-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934693 | 2014-12-18 | Paper |
| A new approach to output-sensitive construction of Voronoi diagrams and Delaunay triangulations | 2014-11-14 | Paper |
| Smoothing and cleaning up slivers | 2014-09-26 | Paper |
| A Nearly-m log n Time Solver for SDD Linear Systems | 2014-07-30 | Paper |
| Approaching Optimality for Solving SDD Linear Systems | 2014-06-04 | Paper |
| Faster approximate multicommodity flow using quadratically coupled flows | 2014-05-13 | Paper |
| Topological inference via meshing | 2014-04-03 | Paper |
| Approximation algorithms for speeding up dynamic programming and denoising aCGH data | 2014-04-01 | Paper |
| Beating the spread | 2014-03-24 | Paper |
| On the nlog n isomorphism technique (A Preliminary Report) | 2014-03-14 | Paper |
| Triangle Sparsifiers | 2013-11-28 | Paper |
| Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning | 2012-08-29 | Paper |
| Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning | 2011-01-21 | Paper |
| Approximate centerpoints with proofs | 2010-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5442552 | 2008-02-22 | Paper |
| Size Competitive Meshing Without Large Angles | 2007-11-28 | Paper |
| Representing Topological Structures Using Cell-Chains | 2007-09-06 | Paper |
| DATA GENERATION FOR GEOMETRIC ALGORITHMS ON NON-UNIFORM DISTRIBUTIONS | 2005-06-10 | Paper |
| WHEN AND WHY DELAUNAY REFINEMENT ALGORITHMS WORK | 2005-05-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234119 | 2002-01-30 | Paper |
| Persistent triangulations | 2001-11-21 | Paper |
| Design and implementation of a practical parallel Delaunay algorithm | 2000-07-17 | Paper |
| The Path Resistance Method for Bounding the Smallest Nontrivial Eigenvalue of a Laplacian | 2000-06-04 | Paper |
| Graph Embeddings and Laplacian Eigenvalues | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252314 | 2000-02-09 | Paper |
| Optimal Coarsening of Unstructured Meshes | 2000-01-27 | Paper |
| On the Radius-Edge Condition in the Control Volume Method | 1999-11-22 | Paper |
| The Dynamic Parallel Complexity of Computational Circuits | 1999-10-28 | Paper |
| Geometric Mesh Partitioning: Implementation and Experiments | 1998-09-21 | Paper |
| Tree-based parallel algorithm design | 1998-05-26 | Paper |
| Geometric Separators for Finite-Element Meshes | 1998-05-12 | Paper |
| On the Quality of Spectral Separators | 1998-05-11 | Paper |
| Moments of inertia and graph separators | 1998-04-13 | Paper |
| Separators for sphere-packings and nearest neighbor graphs | 1998-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128906 | 1997-04-23 | Paper |
| APPROXIMATING CENTER POINTS WITH ITERATIVE RADON POINTS | 1996-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886053 | 1996-07-28 | Paper |
| Flow in Planar Graphs with Multiple Sources and Sinks | 1996-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4327371 | 1995-04-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4288580 | 1995-01-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138969 | 1993-10-20 | Paper |
| A new graph triconnectivity algorithm and its parallelization | 1992-09-27 | Paper |
| Parallel Tree Contraction Part 2: Further Applications | 1992-06-27 | Paper |
| Deterministic parallel list ranking | 1991-01-01 | Paper |
| A simple randomized parallel algorithm for list-ranking | 1990-01-01 | Paper |
| Subtree isomorphism is in random NC | 1990-01-01 | Paper |
| An improved parallel algorithm that computes the BFS numbering of a directed graph | 1988-01-01 | Paper |
| Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3798228 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3798258 | 1988-01-01 | Paper |
| An additivity theorem for the genus of a graph | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3801574 | 1987-01-01 | Paper |
| Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers | 1987-01-01 | Paper |
| Finding small simple cycle separators for 2-connected planar graphs | 1986-01-01 | Paper |
| Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number Fields | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3727384 | 1986-01-01 | Paper |
| Sums of Divisors, Perfect Numbers and Factoring | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3746881 | 1986-01-01 | Paper |
| Solvability by radicals is in polynomial time | 1985-01-01 | Paper |
| Layouts for the Shuffle-Exchange Graph Based on the Complex Plane Diagram | 1984-01-01 | Paper |
| An asymptotically optimal layout for the shuffle-exchange graph | 1983-01-01 | Paper |
| Isomorphism of k-contractible graphs. A generalization of bounded valence and bounded genus | 1983-01-01 | Paper |
| Isomorphism of graphs which are pairwise k-separable | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3670594 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3900916 | 1981-01-01 | Paper |
| Regular groups of automorphisms of cubic graphs | 1980-01-01 | Paper |
| The Complexity of Coloring Circular Arcs and Chords | 1980-01-01 | Paper |
| Graph isomorphism, general remarks | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3909080 | 1979-01-01 | Paper |
| Riemann's hypothesis and tests for primality | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4140386 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4149785 | 1975-01-01 | Paper |
