| Publication | Date of Publication | Type |
|---|
| On approximating the longest path in a graph | 2023-01-18 | Paper |
| Visibility-based pursuit-evasion in a polygonal environment | 2022-08-19 | Paper |
| Intractability of assembly sequencing: Unit disks in the plane | 2022-08-19 | Paper |
| Constrained TSP and low-power computing | 2022-08-19 | Paper |
| Distinct Values Estimators for Power Law Distributions | 2019-09-16 | Paper |
| Complexity of graph partition problems | 2016-09-29 | Paper |
| Derandomization through approximation, an NC algorithm for minimum cuts | 2016-09-01 | Paper |
| Querying priced information in databases | 2015-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501799 | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501305 | 2015-08-03 | Paper |
| Finding large cycles in Hamiltonian graphs | 2014-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3191564 | 2014-10-06 | Paper |
| Finding long paths and cycles in sparse Hamiltonian graphs | 2014-09-26 | Paper |
| Computing the median with uncertainty | 2014-09-26 | Paper |
| On the decidability of accessibility problems (extended abstract) | 2014-09-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417603 | 2014-05-22 | Paper |
| Approximate nearest neighbor: towards removing the curse of dimensionality | 2012-09-27 | Paper |
| On the graph turnpike problem | 2010-08-20 | Paper |
| Finding large cycles in Hamiltonian graphs | 2010-05-25 | Paper |
| A combinatorial algorithm for MAX CSP | 2009-03-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601534 | 2009-02-10 | Paper |
| Lower Bounds on Locality Sensitive Hashing | 2008-12-05 | Paper |
| Estimating Sum by Weighted Sampling | 2007-11-28 | Paper |
| Fractional Matching Via Balls-and-Bins | 2007-08-28 | Paper |
| Computing shortest paths with uncertainty | 2007-05-14 | Paper |
| The price of validity in dynamic networks | 2007-04-26 | Paper |
| A simple approach for pricing equity options with Markov switching state variables | 2006-08-21 | Paper |
| The load rebalancing problem | 2006-08-14 | Paper |
| Scale-free aggregation in sensor networks | 2005-12-05 | Paper |
| Database Theory - ICDT 2005 | 2005-09-13 | Paper |
| Database Theory - ICDT 2005 | 2005-09-13 | Paper |
| Database Theory - ICDT 2005 | 2005-09-13 | Paper |
| Algorithmic Aspects of Wireless Sensor Networks | 2005-08-25 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Incremental Clustering and Dynamic Information Retrieval | 2005-02-21 | Paper |
| Proof verification and the hardness of approximation problems | 2005-01-25 | Paper |
| Combinatorial and experimental methods for approximate point pattern matching | 2004-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828994 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828995 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828920 | 2004-11-29 | Paper |
| Combining request scheduling with web caching | 2004-11-23 | Paper |
| Modeling correlations in web traces and implications for designing replacement policies | 2004-11-18 | Paper |
| List Partitions | 2004-01-08 | Paper |
| Online Scheduling with Lookahead: Multipass Assembly Lines | 2003-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418665 | 2003-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418664 | 2003-08-11 | Paper |
| Computing the Median with Uncertainty | 2003-06-19 | Paper |
| Worst-case time bounds for coloring and satisfiability problems | 2003-05-14 | Paper |
| Maintaining Stream Statistics over Sliding Windows | 2003-01-05 | Paper |
| Approximating the Longest Cycle Problem in Sparse Graphs | 2002-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542583 | 2002-08-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4499940 | 2002-04-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230322 | 2002-01-17 | Paper |
| Approximation techniques for average completion time scheduling | 2001-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527030 | 2001-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527029 | 2001-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952715 | 2001-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4506483 | 2000-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250208 | 2000-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942235 | 2000-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252321 | 2000-04-25 | Paper |
| The Angular-Metric Traveling Salesman Problem | 2000-03-19 | Paper |
| Precedence constrained scheduling to minimize sum of weighted completion times on a single machine | 2000-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234082 | 1999-11-08 | Paper |
| Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication) | 1999-10-28 | Paper |
| Approximating Capacitated Routing and Delivery Problems | 1999-10-28 | Paper |
| Randomized query processing in robot path planning | 1999-09-13 | Paper |
| Realization of Matrices and Directed Graphs | 1999-08-23 | Paper |
| Approximating probability distributions using small sample spaces | 1999-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228486 | 1999-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228228 | 1999-02-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4226450 | 1999-01-27 | Paper |
| Approximate graph coloring by semidefinite programming | 1999-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252385 | 1999-01-01 | Paper |
| On Syntactic versus Computational Views of Approximability | 1998-09-21 | Paper |
| On certificates and lookahead in dynamic graph problems | 1998-08-02 | Paper |
| The Robot Localization Problem | 1998-02-10 | Paper |
| On approximating the longest path in a graph | 1997-11-12 | Paper |
| An $\NC$ Algorithm for Minimum Cuts | 1997-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875189 | 1996-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875229 | 1996-04-28 | Paper |
| Tail bounds for occupancy and the satisfiability threshold conjecture | 1996-03-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4848595 | 1996-03-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4856179 | 1995-11-23 | Paper |
| Clique partitions, graph compression and speeding-up algorithms | 1995-10-25 | Paper |
| The probabilistic method yields deterministic parallel algorithms | 1995-10-24 | Paper |
| Average-case analysis of algorithms for matchings and related problems | 1995-04-10 | Paper |
| Computing roots of graphs is hard | 1994-11-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138917 | 1994-09-19 | Paper |
| Nonclairvoyant scheduling | 1994-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140446 | 1993-12-15 | Paper |
| Probabilistic Analysis of Network Flow Algorithms | 1993-06-29 | Paper |
| The greedy algorithm is optimal for on-line edge coloring | 1993-05-16 | Paper |
| A Linear Time Approach to the Set Maxima Problem | 1992-06-28 | Paper |
| Covering orthogonal polygons with star polygons: The perfect graph approach | 1990-01-01 | Paper |
| Stable husbands | 1990-01-01 | Paper |
| Perfect Graphs and Orthogonally Convex Covers | 1989-01-01 | Paper |
| Deferred Data Structuring | 1988-01-01 | Paper |
