| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q5875571 | 2023-02-03 | Paper |
| Faster enumeration of all spanning trees of a directed graph | 2022-12-16 | Paper |
| Price of Anarchy in Networks with Heterogeneous Latency Functions | 2020-09-01 | Paper |
| Equilibrium and inefficiency in multi-product Cournot games | 2020-06-18 | Paper |
| On minimum 3-cuts and approximating k-cuts using Cut Trees | 2019-01-11 | Paper |
| A Simple and Efficient Algorithm for Computing Market Equilibria | 2018-11-05 | Paper |
| Nash Equilibrium and Stability in Network Selection Games | 2017-11-01 | Paper |
| Efficient computation of geodesic shortest paths | 2016-09-29 | Paper |
| PROXIMITY STRUCTURES FOR GEOMETRIC GRAPHS | 2010-09-30 | Paper |
| Auction algorithms for market equilibrium | 2010-08-15 | Paper |
| Algorithms and Data Structures | 2010-04-20 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| Geodesic Spanners on Polyhedral Surfaces | 2009-12-17 | Paper |
| Visibility queries in a polygonal region | 2009-08-14 | Paper |
| Planar rectilinear shortest path computation using corridors | 2009-08-14 | Paper |
| Auction Algorithms for Market Equilibrium | 2008-05-27 | Paper |
| Finding a Rectilinear Shortest Path in R 2 Using Corridor Based Staircase Structures | 2008-04-24 | Paper |
| Bounded-diameter minimum-cost graph problems | 2007-12-19 | Paper |
| An auction-based market equilibrium algorithm for a production model | 2007-06-13 | Paper |
| Bounded-hops power assignment in ad hoc wireless networks | 2006-06-09 | Paper |
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2005-08-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473930 | 2004-08-04 | Paper |
| An algorithm for enumerating all spanning trees of a directed graph | 2000-12-18 | Paper |
| Dynamic Maintenance of Maxima of 2-d Point Sets | 2000-10-18 | Paper |
| Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles | 2000-10-18 | Paper |
| On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees | 1998-11-10 | Paper |
| An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane | 1998-03-11 | Paper |
| New Techniques for Exact and Approximate Dynamic Closest-Point Problems | 1997-03-03 | Paper |
| Speeding up Karmarkar's algorithm for multicommodity flows | 1996-10-13 | Paper |
| Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs | 1995-05-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037441 | 1993-05-18 | Paper |
| Optimum lopsided binary trees | 1992-06-25 | Paper |
| Stochastic rearrangement rules for self-organizing data structures | 1991-01-01 | Paper |
| Lower bounds for maximal and convex layers problems | 1989-01-01 | Paper |
| Recurrence relations based on minimization and maximization | 1985-01-01 | Paper |
