| Publication | Date of Publication | Type |
|---|
| 1.0957-Approximation Algorithm for Random MAX-3SAT | 2018-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501299 | 2015-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934582 | 2014-12-18 | Paper |
| Approximation schemes for clustering problems | 2010-08-16 | Paper |
| Tensor decomposition and approximation schemes for constraint satisfaction problems | 2010-08-16 | Paper |
| Random sampling and approximation of MAX-CSP problems | 2010-08-05 | Paper |
| Groupies in random graphs | 2010-06-16 | Paper |
| Random sampling and approximation of MAX-CSPs | 2004-11-18 | Paper |
| Approximability of Dense Instances of Nearest Codeword Problem | 2004-08-12 | Paper |
| The task allocation problem with constant communication. | 2003-09-25 | Paper |
| Polynomial time approximation schemes for dense instances of minimum constraint satisfaction | 2003-08-06 | Paper |
| On a Square Packing Problem | 2002-10-21 | Paper |
| On the independence number of random interval graphs | 2002-09-17 | Paper |
| On the approximation hardness of dense TSP and other path problems | 2002-07-25 | Paper |
| A randomized approximation scheme for metric MAX-CUT | 2002-07-04 | Paper |
| Random 2-SAT: Results and problems | 2002-03-03 | Paper |
| On the fluctuations of the giant component | 2001-05-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4503937 | 2001-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4500688 | 2000-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4934320 | 2000-01-17 | Paper |
| Average-case analysis of the merging algorithm of Hwang and Lin | 1999-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4866843 | 1998-12-10 | Paper |
| An approximation scheme for strip packing of rectangles with bounded dimensions | 1998-08-12 | Paper |
| Average-case complexity for the execution of recursive definitions on relational databases (paper no 50-95 accepted for publication in ACTA INFORMATICA) | 1998-08-10 | Paper |
| Average case analysis of greedy algorithms for optimisation problems on set systems | 1997-02-28 | Paper |
| MAX-CUT has a randomized approximation scheme in dense graphs | 1996-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4894603 | 1996-10-07 | Paper |
| On Random 3-sat | 1996-07-01 | Paper |
| Computation of the forwarding index via flows: A note | 1994-09-05 | Paper |
| Grids in random graphs | 1994-07-20 | Paper |
| Two Probabilistic Results on Merging | 1993-05-17 | Paper |
| The forwarding index of communication networks with given connectivity | 1993-01-16 | Paper |
| The Forwarding Indices of Random Graphs | 1992-06-28 | Paper |
| Kernels in random graphs | 1990-01-01 | Paper |
| Trees in sparse random graphs | 1988-01-01 | Paper |
| Induced trees in sparse random graphs | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3749092 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5187324 | 1984-01-01 | Paper |
| On the maximum density of graphs which have no subcontraction to \(K^ r\). | 1983-01-01 | Paper |
| On the maximum cardinality of a consistent set of arcs in a random tournament | 1983-01-01 | Paper |
| On the Bandwidth of Random Graphs | 1983-01-01 | Paper |
| The diameter of random regular graphs | 1982-01-01 | Paper |
| Sur la cardinalite maximum des couplages d'hypergraphes aléatoires uniformes | 1982-01-01 | Paper |
| Bin packing can be solved within 1+epsilon in linear time | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3887496 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3889104 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3943736 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4141122 | 1977-01-01 | Paper |
| On almost sure convergence of quadratic Brownian variation | 1974-01-01 | Paper |
