| Publication | Date of Publication | Type |
|---|
1.0957-Approximation Algorithm for Random MAX-3SAT
RAIRO - Operations Research | 2018-01-12 | Paper |
| Approximation schemes for metric bisection and partitioning | 2015-08-03 | Paper |
| Linear programming relaxations of \textsc{maxcut} | 2014-12-18 | Paper |
Approximation schemes for clustering problems
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Tensor decomposition and approximation schemes for constraint satisfaction problems
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Random sampling and approximation of MAX-CSP problems
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
Groupies in random graphs
Information Processing Letters | 2010-06-16 | Paper |
Random sampling and approximation of MAX-CSPs
Journal of Computer and System Sciences | 2004-11-18 | Paper |
Approximability of Dense Instances of Nearest Codeword Problem
Algorithm Theory — SWAT 2002 | 2004-08-12 | Paper |
The task allocation problem with constant communication.
Discrete Applied Mathematics | 2003-09-25 | Paper |
Polynomial time approximation schemes for dense instances of minimum constraint satisfaction
Random Structures & Algorithms | 2003-08-06 | Paper |
On a Square Packing Problem
Combinatorics, Probability and Computing | 2002-10-21 | Paper |
On the independence number of random interval graphs
Combinatorics, Probability and Computing | 2002-09-17 | Paper |
On the approximation hardness of dense TSP and other path problems
Information Processing Letters | 2002-07-25 | Paper |
A randomized approximation scheme for metric MAX-CUT
Journal of Computer and System Sciences | 2002-07-04 | Paper |
Random 2-SAT: Results and problems
Theoretical Computer Science | 2002-03-03 | Paper |
On the fluctuations of the giant component
Combinatorics, Probability and Computing | 2001-05-03 | Paper |
| scientific article; zbMATH DE number 1507217 (Why is no real title available?) | 2001-01-23 | Paper |
| scientific article; zbMATH DE number 1496577 (Why is no real title available?) | 2000-08-27 | Paper |
| scientific article; zbMATH DE number 1390055 (Why is no real title available?) | 2000-01-17 | Paper |
Average-case analysis of the merging algorithm of Hwang and Lin
Algorithmica | 1999-06-21 | Paper |
| scientific article; zbMATH DE number 847791 (Why is no real title available?) | 1998-12-10 | Paper |
An approximation scheme for strip packing of rectangles with bounded dimensions
Discrete Applied Mathematics | 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)
Acta Informatica | 1998-08-10 | Paper |
Average case analysis of greedy algorithms for optimisation problems on set systems
Theoretical Computer Science | 1997-02-28 | Paper |
| MAX-CUT has a randomized approximation scheme in dense graphs | 1996-10-24 | Paper |
| scientific article; zbMATH DE number 932179 (Why is no real title available?) | 1996-10-07 | Paper |
On Random 3-sat
Combinatorics, Probability and Computing | 1996-07-01 | Paper |
Computation of the forwarding index via flows: A note
Networks | 1994-09-05 | Paper |
Grids in random graphs
Random Structures & Algorithms | 1994-07-20 | Paper |
Two Probabilistic Results on Merging
SIAM Journal on Computing | 1993-05-17 | Paper |
The forwarding index of communication networks with given connectivity
Discrete Applied Mathematics | 1993-01-16 | Paper |
The Forwarding Indices of Random Graphs
Random Structures & Algorithms | 1992-06-28 | Paper |
Kernels in random graphs
Discrete Mathematics | 1990-01-01 | Paper |
Trees in sparse random graphs
Journal of Combinatorial Theory. Series B | 1988-01-01 | Paper |
Induced trees in sparse random graphs
Graphs and Combinatorics | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3985277 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3895112 (Why is no real title available?) | 1984-01-01 | Paper |
On the maximum density of graphs which have no subcontraction to \(K^ r\).
Discrete Mathematics | 1983-01-01 | Paper |
On the maximum cardinality of a consistent set of arcs in a random tournament
Journal of Combinatorial Theory. Series B | 1983-01-01 | Paper |
On the Bandwidth of Random Graphs
Combinatorial Mathematics, Proceedings of the International Colloquium on Graph Theory and Combinatorics | 1983-01-01 | Paper |
The diameter of random regular graphs
Combinatorica | 1982-01-01 | Paper |
Sur la cardinalite maximum des couplages d'hypergraphes aléatoires uniformes
Discrete Mathematics | 1982-01-01 | Paper |
Bin packing can be solved within 1+epsilon in linear time
Combinatorica | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3693325 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3695261 (Why is no real title available?) | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3761094 (Why is no real title available?) | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3568560 (Why is no real title available?) | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3568560 (Why is no real title available?) | 1977-01-01 | Paper |
On almost sure convergence of quadratic Brownian variation
The Annals of Probability | 1974-01-01 | Paper |
