| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6062162 | 2023-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6084404 | 2023-10-31 | Paper |
| Maximizing coverage while ensuring fairness: a tale of conflicting objectives | 2023-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875466 | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5088977 | 2022-07-18 | Paper |
| Fractal dimension and lower bounds for geometric problems | 2021-07-02 | Paper |
| Approximate greedy clustering and distance selection for graph metrics | 2021-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136247 | 2020-11-25 | Paper |
| Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces | 2020-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5116530 | 2020-08-18 | Paper |
| On theoretical and empirical algorithmic analysis of the efficiency gap measure in partisan gerrymandering | 2020-07-29 | Paper |
| Temporal clustering | 2020-05-27 | Paper |
| Polylogarithmic approximation for Euler genus on bounded degree graphs | 2020-01-30 | Paper |
| On constant multi-commodity flow-cut gaps for families of directed minor-free graphs | 2019-10-15 | Paper |
| Minimum \(d\)-dimensional arrangement with fixed points | 2019-06-20 | Paper |
| Euclidean spanners in high dimensions | 2019-05-15 | Paper |
| Approximation algorithms for low-distortion embeddings into low-dimensional spaces | 2019-03-12 | Paper |
| Spectral concentration and greedy \(k\)-clustering | 2018-11-16 | Paper |
| Computing the Gromov-Hausdorff Distance for Metric Trees | 2018-11-13 | Paper |
| Ordinal embeddings of minimum relaxation: general properties, trees, and ultrametrics | 2018-11-05 | Paper |
| Quasimetric embeddings and their applications | 2018-10-18 | Paper |
| Approximation algorithms for Euler genus and related problems | 2018-08-21 | Paper |
| Algorithmic interpretations of fractal dimension | 2018-08-13 | Paper |
| Metric embeddings with outliers | 2018-07-16 | Paper |
| Alleviating partisan gerrymandering: can math and computers help to eliminate wasted votes? | 2018-04-27 | Paper |
| A near-optimal approximation algorithm for asymmetric TSP on embedded graphs | 2018-04-23 | Paper |
| The limited blessing of low dimensionality: when \(1-1/d\) is the best possible exponent for \(d\)-dimensional geometric problems (extended abstract) | 2018-04-23 | Paper |
| Constant-factor approximations for asymmetric TSP on nearly-embeddable graphs | 2018-04-19 | Paper |
| Constant-distortion embeddings of Hausdorff metrics into constant-dimensional \(\ell_p\) spaces | 2018-04-19 | Paper |
| Quasimetric Embeddings and Their Applications | 2017-12-19 | Paper |
| Randomly removing \(g\) handles at once | 2017-10-20 | Paper |
| A pseudo-approximation for the genus of Hamiltonian graphs | 2017-10-11 | Paper |
| On graph crossing number and edge planarization | 2017-09-29 | Paper |
| Fat polygonal partitions with applications to visualization and embeddings | 2017-03-09 | Paper |
| How to walk your dog in the mountains with no magic leash | 2016-02-29 | Paper |
| Layouts of Expander Graphs | 2016-02-01 | Paper |
| Computing the Gromov-Hausdorff Distance for Metric Trees | 2016-01-11 | Paper |
| Computing the Fréchet distance between polygons with holes | 2015-10-27 | Paper |
| Undecidability and intractability results concerning Datalog programs and their persistency numbers | 2015-09-17 | Paper |
| Beyond the Euler characteristic: approximating the genus of general graphs (extended abstract) | 2015-08-21 | Paper |
| On the geometry of graphs with a forbidden minor | 2015-02-04 | Paper |
| Approximation algorithms for embedding general metrics into trees | 2014-12-18 | Paper |
| On distributing symmetric streaming computations | 2014-11-18 | Paper |
| Approximation algorithms for low-distortion embeddings into low-dimensional spaces | 2014-10-13 | Paper |
| Ordinal embeddings of minimum relaxation, general properties, trees, and ultrametrics | 2014-10-13 | Paper |
| How to walk your dog in the mountains with no magic leash | 2014-08-07 | Paper |
| Near-optimal distortion bounds for embedding doubling spaces into L 1 | 2014-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417618 | 2014-05-22 | Paper |
| Inapproximability for planar embedding problems | 2014-05-22 | Paper |
| Pathwidth, trees, and random embeddings | 2014-03-17 | Paper |
| A pseudo-approximation for the genus of Hamiltonian graphs | 2013-10-04 | Paper |
| Non-positive curvature, and the planar embedding conjecture | 2013-04-28 | Paper |
| How strong is Nisan's pseudo-random generator? | 2013-04-04 | Paper |
| Planarizing an unknown surface | 2012-11-02 | Paper |
| Convergence and approximation in potential games | 2012-08-08 | Paper |
| Inapproximability for metric embeddings into $\mathbb{R}^{d}$ | 2011-01-06 | Paper |
| Online embeddings | 2010-09-10 | Paper |
| Randomly removing \(g\) handles at once | 2010-09-02 | Paper |
| Low-distortion embeddings of general metrics into the line | 2010-08-16 | Paper |
| Streaming Embeddings with Slack | 2009-10-20 | Paper |
| Approximation and Online Algorithms | 2009-08-11 | Paper |
| Probabilistic embeddings of bounded genus graphs into planar graphs | 2009-02-12 | Paper |
| Circular partitions with applications to visualization and embeddings | 2009-02-12 | Paper |
| Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction | 2008-11-27 | Paper |
| Convergence and Approximation in Potential Games | 2008-03-19 | Paper |
