| Publication | Date of Publication | Type |
|---|
| Parallel construction of quadtrees and quality triangulations | 2023-01-18 | Paper |
| Improved parallel depth-first search in undirected planar graphs | 2023-01-18 | Paper |
| Transverse Wave: an impartial color-propagation game inspired by social influence and Quantum Nim | 2022-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090990 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090397 | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3390714 | 2022-03-25 | Paper |
| Multiscale Matrix Sampling and Sublinear-Time PageRank Computation | 2021-04-23 | Paper |
| Optimal Space-Depth Trade-Off of CNOT Circuits in Quantum Logic Synthesis | 2021-02-02 | Paper |
| A graph-theoretical basis of stochastic-cascading network influence: characterizations of influence-based centrality | 2020-05-23 | Paper |
| Finding Endogenously Formed Communities | 2019-05-15 | Paper |
| Fault tolerance properties of pyramid networks | 2018-07-09 | Paper |
| Network Essence: PageRank Completion and Centrality-Conforming Markov Chains | 2018-02-26 | Paper |
| Scalable Algorithms for Data and Network Analysis | 2016-07-18 | Paper |
| An Axiomatic Approach to Community Detection | 2016-04-15 | Paper |
| Maximum bipartite matchings with low rank data: locality and perturbation analysis | 2016-02-26 | Paper |
| Settling the complexity of computing two-player Nash equilibria | 2015-11-11 | Paper |
| Sliver exudation | 2015-09-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501832 | 2015-08-14 | Paper |
| Optimal online scheduling of parallel jobs with dependencies | 2015-05-07 | Paper |
| Smoothed analysis of algorithms | 2015-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934593 | 2014-12-18 | Paper |
| Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems | 2014-12-17 | Paper |
| Bounded budget connection (BBC) games or how to make friends and influence people, on a budget | 2014-12-12 | Paper |
| A compact routing scheme and approximate distance oracle for power-law graphs | 2014-12-05 | Paper |
| Smoothing and cleaning up slivers | 2014-09-26 | Paper |
| Subgraph sparsification and nearly optimal ultrasparsifiers | 2014-08-13 | Paper |
| Multi-stage design for quasipolynomial-time isomorphism testing of steiner 2-systems | 2014-08-07 | Paper |
| Reducibility among Fractional Stability Problems | 2014-07-25 | Paper |
| Learning and Smoothed Analysis | 2014-07-25 | Paper |
| Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Separable Utilities | 2014-07-25 | Paper |
| Smoothed Analysis of Multiobjective Optimization | 2014-07-25 | Paper |
| Higher Eigenvalues of Graphs | 2014-07-25 | Paper |
| Bounded budget connection (BBC) games or how to make friends and influence people, on a budget | 2014-06-10 | Paper |
| Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs | 2014-06-05 | Paper |
| Reducibility among Fractional Stability Problems | 2014-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5405114 | 2014-04-01 | Paper |
| Numerical Thinking in Algorithm Design and Analysis | 2014-02-21 | Paper |
| A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning | 2013-07-04 | Paper |
| Perturbation Analysis of Maximum-Weighted Bipartite Matchings with Low Rank Data | 2013-06-11 | Paper |
| A Sublinear Time Algorithm for PageRank Computations | 2012-07-23 | Paper |
| Metric uniformization and spectral bounds for graphs | 2012-01-24 | Paper |
| Bounded budget betweenness centrality game for strategic network formations | 2012-01-04 | Paper |
| Spectral Sparsification of Graphs | 2011-11-07 | Paper |
| Competitive routing over time | 2011-10-10 | Paper |
| Optimal cache-oblivious mesh layouts | 2011-03-30 | Paper |
| Local Computation of PageRank Contributions | 2011-02-28 | Paper |
| Smoothed analysis of condition numbers and complexity implications for linear programming | 2011-02-14 | Paper |
| Smoothed analysis of algorithms | 2010-08-17 | Paper |
| Lower-stretch spanning trees | 2010-08-16 | Paper |
| Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems | 2010-08-15 | Paper |
| Atropos: A PSPACE-Complete Sperner Triangle Game | 2010-07-09 | Paper |
| The Laplacian Paradigm: Emerging Algorithms for Massive Graphs | 2010-06-17 | Paper |
| Algorithms and Data Structures | 2010-04-20 | Paper |
| Quantum separation of local search and fixed point computation | 2010-02-23 | Paper |
| Spending Is Not Easier Than Trading: On the Computational Equivalence of Fisher and Arrow-Debreu Equilibria | 2009-12-17 | Paper |
| Agnostic Clustering | 2009-12-01 | Paper |
| Compact Routing in Power-Law Graphs | 2009-11-19 | Paper |
| The isolation game: a game of distances | 2009-11-06 | Paper |
| Bounded Budget Betweenness Centrality Game for Strategic Network Formations | 2009-10-29 | Paper |
| On the α-Sensitivity of Nash Equilibria in PageRank-Based Network Reputation Games | 2009-07-14 | Paper |
| Lower-Stretch Spanning Trees | 2009-04-30 | Paper |
| Market equilibria with hybrid linear-Leontief utilities | 2009-04-29 | Paper |
| Combinatorial and spectral aspects of nearest neighbor graphs in doubling dimensional and nearly-Euclidean spaces | 2009-03-20 | Paper |
| On the Approximation and Smoothed Complexity of Leontief Market Equilibria | 2009-03-10 | Paper |
| The Isolation Game: A Game of Distances | 2009-01-29 | Paper |
| On the Stability of Web Crawling and Web Search | 2009-01-29 | Paper |
| Quantum Separation of Local Search and Fixed Point Computation | 2008-07-10 | Paper |
| Local Computation of PageRank Contributions | 2008-04-11 | Paper |
| \(k\)-nearest-neighbor clustering and percolation theory | 2007-11-28 | Paper |
| Combinatorial and Spectral Aspects of Nearest Neighbor Graphs in Doubling Dimensional and Nearly-Euclidean Spaces | 2007-11-13 | Paper |
| Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices | 2007-05-03 | Paper |
| PARALLEL DELAUNAY REFINEMENT: ALGORITHMS AND ANALYSES | 2007-03-21 | Paper |
| Spectral partitioning works: planar graphs and finite element meshes | 2007-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3421283 | 2007-02-12 | Paper |
| Euro-Par 2004 Parallel Processing | 2005-08-23 | Paper |
| UNSTRUCTURED MESH GENERATION: THEORY, PRACTICE, AND PERSPECTIVES | 2005-06-10 | Paper |
| PARALLEL CONSTRUCTION OF QUADTREES AND QUALITY TRIANGULATIONS | 2005-06-10 | Paper |
| DATA GENERATION FOR GEOMETRIC ALGORITHMS ON NON-UNIFORM DISTRIBUTIONS | 2005-06-10 | Paper |
| Smoothed analysis of termination of linear programming algorithms | 2003-09-01 | Paper |
| Layer based solutions for constrained space-time meshing. | 2003-08-25 | Paper |
| Recovering mesh geometry from a stiffness matrix | 2002-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768269 | 2002-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234119 | 2002-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418806 | 2002-01-01 | Paper |
| Practical human-machine identification over insecure channels | 2001-11-25 | Paper |
| Min-max-boundary domain decomposition | 2001-08-20 | Paper |
| Simultaneous refinement and coarsening for adaptive meshing | 2001-04-16 | Paper |
| Simple efficient graph compression schemes for dense and complement graphs | 2001-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525735 | 2001-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4508066 | 2000-10-10 | Paper |
| Optimal Coarsening of Unstructured Meshes | 2000-01-27 | Paper |
| Regression depth and center points. | 2000-01-01 | 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 |
| Low Energy and Mutually Distant Sampling | 1999-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250995 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218415 | 1998-11-11 | Paper |
| Geometric Mesh Partitioning: Implementation and Experiments | 1998-09-21 | Paper |
| Combinatorial aspects of geometric graphs | 1998-08-30 | Paper |
| Tree-based parallel algorithm design | 1998-05-26 | Paper |
| Geometric Separators for Finite-Element Meshes | 1998-05-12 | Paper |
| Provably Good Partitioning and Load Balancing Algorithms for Parallel Adaptive N-Body Simulation | 1998-05-12 | Paper |
| Optimal on-line scheduling of parallel jobs with dependencies | 1998-04-13 | Paper |
| Moments of inertia and graph separators | 1998-04-13 | Paper |
| How Good is Recursive Bisection? | 1998-02-10 | Paper |
| Separators for sphere-packings and nearest neighbor graphs | 1998-01-22 | Paper |
| Fast Nested Dissection for Finite Element Meshes | 1997-06-05 | Paper |
| Approximating Shortest Superstrings | 1997-05-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128906 | 1997-04-23 | Paper |
| Independent sets versus perfect matchings | 1997-02-28 | Paper |
| APPROXIMATING CENTER POINTS WITH ITERATIVE RADON POINTS | 1996-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4883374 | 1996-07-01 | Paper |
| An optimal parallel algorithm for planar cycle separators | 1995-10-25 | Paper |
| Generating local addresses and communication sets for data-parallel programs | 1995-07-06 | Paper |
| Dynamic scheduling on parallel machines | 1995-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4327450 | 1995-04-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4327371 | 1995-04-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4288580 | 1995-01-02 | Paper |
| On the complexity of computing the diameter of a polytope | 1994-10-30 | Paper |
| Functional inversion and communication complexity | 1994-09-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035722 | 1993-05-18 | Paper |
| Space efficient processor identity protocol | 1990-01-01 | Paper |
| Security, veriflability, and universality in distributed computing | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3786400 | 1987-01-01 | Paper |
