| Publication | Date of Publication | Type |
|---|
| Density-based clustering in MapReduce with guarantees on parallel time, space, and solution quality | 2025-01-24 | Paper |
| Explainable graph clustering via expanders in the massively parallel computation model | 2024-07-01 | Paper |
| Reflective guarding a gallery | 2023-11-24 | Paper |
| Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce | 2022-12-08 | Paper |
| Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model | 2022-03-09 | Paper |
| Fair allocation of indivisible goods: beyond additive valuations | 2022-03-02 | Paper |
| Maximin share guarantee for goods with positive externalities | 2021-11-12 | Paper |
| Fair Allocation of Indivisible Goods: Improvement | 2021-09-14 | Paper |
| On the Distortion Value of Elections with Abstention | 2021-03-26 | Paper |
| Clearing an orthogonal polygon to find the evaders | 2020-11-06 | Paper |
| Covering orthogonal polygons with sliding \(k\)-transmitters | 2020-04-06 | Paper |
| 1+ ε approximation of tree edit distance in quadratic time | 2020-01-30 | Paper |
| Rent division among groups | 2019-10-11 | Paper |
| Visibility extension via mirror-edges to cover invisible segments | 2019-09-10 | Paper |
| Visibility testing and counting for uncertain segments | 2019-06-06 | Paper |
| Expand the shares together: envy-free mechanisms with a small number of cuts | 2019-04-25 | Paper |
| Fair Allocation of Indivisible Goods to Asymmetric Agents | 2019-01-18 | Paper |
| Geometric spanners in the MapReduce model | 2018-10-04 | Paper |
| Weak visibility queries of line segments in simple polygons and polygonal domains | 2018-05-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607964 | 2018-03-15 | Paper |
| Randomized approximation algorithms for planar visibility counting problem | 2017-12-20 | Paper |
| Weighted two-valued digit-set encodings: unifying efficient hardware representation schemes for redundant number systems | 2017-11-20 | Paper |
| Approximate minimum diameter | 2017-10-23 | Paper |
| Efficient computation of query point visibility in polygons with holes | 2017-10-20 | Paper |
| How to Extend Visibility Polygons by Mirrors to Cover Invisible Segments | 2017-05-05 | Paper |
| An Improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem | 2016-09-02 | Paper |
| Optimal space coverage with white convex polygons | 2016-08-31 | Paper |
| Euclidean movement minimization | 2016-08-31 | Paper |
| Robots’ Cooperation for Finding a Target in Streets | 2016-04-01 | Paper |
| Near optimal line segment queries in simple polygons | 2015-11-17 | Paper |
| Optimal Strategy for Walking in Streets with Minimum Number of Turns for a Simple Robot | 2015-09-11 | Paper |
| Walking in streets with minimal sensing | 2015-07-28 | Paper |
| Weak visibility counting in simple polygons | 2015-06-22 | Paper |
| Visibility testing and counting | 2015-06-02 | Paper |
| Unit Covering in Color-Spanning Set Model | 2015-02-27 | Paper |
| On non-progressive spread of influence through social networks | 2014-08-26 | Paper |
| Pricing in population games with semi-rational agents | 2014-05-14 | Paper |
| Scheduling to minimize gaps and power consumption | 2014-02-05 | Paper |
| \(\alpha\)-visibility | 2014-01-22 | Paper |
| Walking in Streets with Minimal Sensing | 2013-12-10 | Paper |
| Equilibrium pricing with positive externalities | 2013-04-17 | Paper |
| Space/query-time tradeoff for computing the visibility polygon | 2013-01-25 | Paper |
| Scheduling tasks with exponential duration on unrelated parallel machines | 2012-10-19 | Paper |
| α-Visibility | 2012-08-14 | Paper |
| On the Non-progressive Spread of Influence through Social Networks | 2012-06-29 | Paper |
| Optimal online pricing with network externalities | 2012-05-04 | Paper |
| Efficient observer-dependent simplification in polygonal domains | 2012-04-26 | Paper |
| Permutation betting markets: singleton betting with extra information | 2011-07-01 | Paper |
| White Space Regions | 2011-02-15 | Paper |
| Incremental labeling in closed-2PM model | 2010-11-25 | Paper |
| Algorithms and Data Structures | 2010-04-20 | Paper |
| Spanning trees with minimum weighted degrees | 2010-03-24 | Paper |
| Optimal point removal in closed-2PM labeling | 2010-03-24 | Paper |
| A practical approach for planar visibility maintenance | 2010-01-29 | Paper |
| Shortest paths in simple polygons with polygon-meet constraints | 2009-07-21 | Paper |
| Space–Query-Time Tradeoff for Computing the Visibility Polygon | 2009-07-14 | Paper |
| An Approximation Algorithm for the k-Level Uncapacitated Facility Location Problem with Penalties | 2009-05-20 | Paper |
| Sorting on OTIS-Networks | 2009-05-20 | Paper |
| Kinetic Polar Diagram | 2009-05-20 | Paper |
| SimDiv: A New Solution for Protein Comparison | 2009-01-07 | Paper |
| Shortest paths with single point visibility constraint | 2008-11-17 | Paper |
| Visiting a Polygon on the Optimal Way to a Query Point | 2008-06-19 | Paper |
| Query-point visibility constrained shortest paths in simple polygons | 2008-01-07 | Paper |
| Query point visibility computation in polygons with holes | 2007-12-03 | Paper |
| An approximation algorithm ford1-optimal motion of a rod robot with fixed rotations | 2007-02-15 | Paper |
| Label updating to avoid point-shaped obstacles in fixed model | 2007-01-09 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| An efficient universal addition scheme for all hybrid-redundant representations with weighted bit-set encoding | 2006-10-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5719029 | 2006-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5719012 | 2006-01-16 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| SOFSEM 2005: Theory and Practice of Computer Science | 2005-12-07 | Paper |
| Pipelined operator tree scheduling in heterogeneous environments. | 2003-08-07 | Paper |
| Length-constrained path-matchings in graphs | 2002-09-29 | Paper |
