research and mathematics. My work concerns the design and analysis of algorithms, and is largely motivated by the wish to nd a way to deal with NP-complete problems. After a PhD on the average-case analysis of dynamic data structures, and some work on computational geometry, I got interested in tiling problems. Then my interest shifted to approximation algorithms, on which I have been working for about ve years, and which provide a way to circumvent the NP-hardness of optimization problems by resigning oneself to nding an approximate solution. I am also interested in the probabilistic analysis of algorithms, particularly using Markov chains: resigning oneself to nding an algorithm which is ecient on average, instead of in the worst case, is another way to circumvent NP-hardness.
|
839
|
Reducibilities among combinatorial problems
– Karp
- 1972
|
|
578
|
Improved approximation algorithms for Maximum Cut and Satisfiability problems using semidefinite programming
– Goemans, Williamson
- 1995
|
|
293
|
The small-world phenomenon: An algorithmic perspective
– Kleinberg
- 2000
|
|
289
|
Probabilistic checking of proofs: A new characterization of NP
– Arora, Safra
- 1992
|
|
273
|
Property testing and its connection to learning and approximation
– Goldreich, Goldwasser, et al.
- 1998
|
|
217
|
Approximating the permanent
– Jerrum, Sinclair
- 1989
|
|
202
|
Approximating clique is almost NP–complete
– Feige, Goldwasser, et al.
- 1991
|
|
186
|
On the ratio of optimal integral and fractional covers
– Lovász
- 1975
|
|
116
|
Approximation schemes for covering and packing problems in image processing and VLSI
– Hochbaum, Maass
- 1985
|
|
93
|
An efficient approximation scheme for the onedimensional bin-packing problem
– Karp, Karmarkar
- 1982
|
|
84
|
Conway’s tiling groups
– Thurston
- 1990
|
|
68
|
Clique is Hard to Approximate Within n 1
– Hastad
- 1996
|
|
58
|
Tilings with polyominoes and combinatorial group theory
– Conway, Lagarias
- 1990
|
|
53
|
A polylogarithmic approximation of the minimum bisection
– Feige, Krauthgamer
- 2002
|
|
35
|
Polynomial-time approximation scheme for data broadcast, in
– Kenyon, Schabanel, et al.
|
|
34
|
de la Vega, MAX-CUT has a randomized approximation scheme
– Fernandez
- 1996
|
|
31
|
Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing
– Kenyon, Rabani, et al.
- 1998
|
|
26
|
Proof Veri and Intractability of Approximation Problems
– Arora, Lund, et al.
- 1992
|
|
26
|
The data broadcast problem with non-uniform transmission times
– Kenyon, Schabanel
- 1999
|
|
25
|
A randomized approximation scheme for metric max-cut
– Vega, Kenyon
- 1998
|
|
17
|
Eric Vigoda: A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries, ACM Sympos. Theory of Computing 33
– Jerrum, Sinclair
- 2001
|
|
15
|
Dynamic TCP acknowledgment and other stories about e/(e-1
– Karlin, Kenyon, et al.
|
|
15
|
The average case analysis of some on-line algorithms for bin packing
– Shor
- 1986
|
|
12
|
Bin packing can be solved within 1
– Vega, Lueker
- 1981
|
|
11
|
A self organizing bin packing heuristic
– Csirik, Johnson, et al.
- 1999
|
|
10
|
Better approximation algorithms for bin covering
– Csirik, Johnson, et al.
- 2001
|
|
10
|
Approximating the Number of Monomer-Dimer Coverings of a Lattice
– Kenyon, Randall, et al.
- 1996
|
|
9
|
Huffman coding with unequal letter costs
– Golin, Kenyon, et al.
- 2002
|
|
7
|
OPT versus LOAD in dynamic storage allocation
– Buchsbaum, Karloff, et al.
- 2003
|
|
6
|
Inside-outside algorithm
– Johnson
- 2006
|
|
6
|
A critical phenomenon in a broadcast process. Unpublished manuscript, circulated
– Evans, Kenyon, et al.
- 1995
|
|
5
|
Eric Remila, A near-optimal solution to a two-dimensional cutting stock problem
– Kenyon
- 2000
|
|
4
|
Approximation Schemes for Scheduling to Minimize Average Completion Time with Release Dates
– Afrati, Bampis, et al.
- 1999
|
|
4
|
Probabilistic Analysis of Packing and Partitioning Algorithms
– Coman, Lueker
- 1991
|
|
2
|
Approximation schemes for metric bisection and partitioning
– Vega, Karpinski, et al.
- 2004
|
|
2
|
Elchanan Mossel and Yuval Peres, Glauber Dynamics on Trees
– Kenyon
- 2001
|
|
1
|
Scheduling Multiprocessor Tasks on
– Amoura, Bampis, et al.
- 1997
|
|
1
|
Average-Case Performance of One-Dimensional Bin Packing Algorithms under Discrete Uniform Distributions, Proc
– Coman, Courcoubetis, et al.
- 1991
|
|
1
|
Asymptotic Approximation Schemes for Two-Dimensional Packing
– Correa, Kenyon
- 2004
|
|
1
|
Approximation Schemes for Clustering Problems, W. Fernandez de la
– Vega, Kenyon
|
|
1
|
Tiling a polygon with rectangles, 33 rd Annual
– Kenyon, Kenyon
- 1992
|
|
1
|
Linear Waste of Best-Fit Bin Packing on Skewed
– Kenyon, Mitzenmacher
|
|
1
|
Habilitation a dirriger des recherches
– Remila
- 1997
|
|
1
|
le pavage de Figures du Plan par des dominos, Rapport 91-18 du Laboratoire de l'Informatique du Paralllisme, Ecole Normale Suprieure de Lyon, aussi comptes rendus des `Journes Polyominos et Pavages' Universit Paris XII-Val de Marne
– Robson, Sur
- 1991
|
|
