| 2007 |
|---|
| 56 | EE | Wenceslas Fernandez de la Vega,
Claire Kenyon-Mathieu:
Linear programming relaxations of maxcut.
SODA 2007: 53-61 |
| 2006 |
|---|
| 55 | EE | Wenceslas Fernandez de la Vega,
Marek Karpinski:
Approximation Complexity of Nondense Instances of MAX-CUT.
Electronic Colloquium on Computational Complexity (ECCC) 13(101): (2006) |
| 54 | EE | Wenceslas Fernandez de la Vega,
Marek Karpinski:
On the Sample Complexity of MAX-CUT.
Electronic Colloquium on Computational Complexity (ECCC) 13(104): (2006) |
| 53 | EE | Wenceslas Fernandez de la Vega,
Ravi Kannan,
Marek Karpinski:
Approximation of Global MAX-CSP Problems.
Electronic Colloquium on Computational Complexity (ECCC) 13(124): (2006) |
| 52 | EE | Wenceslas Fernandez de la Vega,
Marek Karpinski:
Trading Tensors for Cloning: Constant Time Approximation Schemes for Metric MAX-CSP.
Electronic Colloquium on Computational Complexity (ECCC) 13(155): (2006) |
| 2005 |
|---|
| 51 | EE | Wenceslas Fernandez de la Vega,
Marek Karpinski,
Ravi Kannan,
Santosh Vempala:
Tensor decomposition and approximation schemes for constraint satisfaction problems.
STOC 2005: 747-754 |
| 2004 |
|---|
| 50 | EE | Wenceslas Fernandez de la Vega,
Marek Karpinski,
Claire Kenyon:
Approximation schemes for Metric Bisection and partitioning.
SODA 2004: 506-515 |
| 2003 |
|---|
| 49 | EE | Wenceslas Fernandez de la Vega,
Marek Karpinski,
Claire Kenyon,
Yuval Rabani:
Approximation schemes for clustering problems.
STOC 2003: 50-58 |
| 48 | EE | Wenceslas Fernandez de la Vega,
M. Lamari:
The task allocation problem with constant communication.
Discrete Applied Mathematics 131(1): 169-177 (2003) |
| 47 | EE | Noga Alon,
Wenceslas Fernandez de la Vega,
Ravi Kannan,
Marek Karpinski:
Random sampling and approximation of MAX-CSPs.
J. Comput. Syst. Sci. 67(2): 212-243 (2003) |
| 46 | EE | Cristina Bazgan,
Wenceslas Fernandez de la Vega,
Marek Karpinski:
Polynomial time approximation schemes for dense instances of minimum constraint satisfaction.
Random Struct. Algorithms 23(1): 73-91 (2003) |
| 2002 |
|---|
| 45 | EE | Noga Alon,
Wenceslas Fernandez de la Vega,
Ravi Kannan,
Marek Karpinski:
Random sampling and approximation of MAX-CSP problems.
STOC 2002: 232-239 |
| 44 | EE | Cristina Bazgan,
Wenceslas Fernandez de la Vega,
Marek Karpinski:
Approximability of Dense Instances of NEAREST CODEWORD Problem.
SWAT 2002: 298-307 |
| 43 | | Stéphane Boucheron,
Wenceslas Fernandez de la Vega:
On A Square Packing Problem.
Combinatorics, Probability & Computing 11(2): (2002) |
| 42 | EE | Wenceslas Fernandez de la Vega,
Marek Karpinski,
Claire Kenyon,
Yuval Rabani:
Polynomial Time Approximation Schemes for Metric Min-Sum Clustering
Electronic Colloquium on Computational Complexity (ECCC)(025): (2002) |
| 41 | EE | Wenceslas Fernandez de la Vega,
Marek Karpinski,
Claire Kenyon:
A Polynomial Time Approximation Scheme for Metric MIN-BISECTION
Electronic Colloquium on Computational Complexity (ECCC)(041): (2002) |
| 40 | EE | Wenceslas Fernandez de la Vega,
Marek Karpinski:
A Polynomial Time Approximation Scheme for Subdense MAX-CUT
Electronic Colloquium on Computational Complexity (ECCC)(044): (2002) |
| 39 | EE | Wenceslas Fernandez de la Vega,
Marek Karpinski:
9/8-Approximation Algorithm for Random MAX-3SAT
Electronic Colloquium on Computational Complexity (ECCC)(070): (2002) |
| 2001 |
|---|
| 38 | | Stéphane Boucheron,
Wenceslas Fernandez de la Vega:
On The Independence Number Of Random Interval Graphs.
Combinatorics, Probability & Computing 10(5): (2001) |
| 37 | EE | Noga Alon,
Wenceslas Fernandez de la Vega,
Ravi Kannan,
Marek Karpinski:
Random Sampling and Approximation of MAX-CSP Problems
Electronic Colloquium on Computational Complexity (ECCC)(100): (2001) |
| 36 | EE | Cristina Bazgan,
Wenceslas Fernandez de la Vega,
Marek Karpinski:
Polynomial Time Approximation Schemes for Dense Instances of Minimum Constraint Satisfaction
Electronic Colloquium on Computational Complexity (ECCC) 8(34): (2001) |
| 35 | EE | Wenceslas Fernandez de la Vega,
Claire Kenyon:
A Randomized Approximation Scheme for Metric MAX-CUT.
J. Comput. Syst. Sci. 63(4): 531-541 (2001) |
| 34 | EE | Wenceslas Fernandez de la Vega:
Random 2-SAT: results and problems.
Theor. Comput. Sci. 265(1-2): 131-146 (2001) |
| 2000 |
|---|
| 33 | EE | Wenceslas Fernandez de la Vega:
The Independence Number of Random Interval Graphs.
CIAC 2000: 59-62 |
| 32 | | Daniel Barraez,
Stéphane Boucheron,
Wenceslas Fernandez de la Vega:
On The Fluctuations Of The Giant Component.
Combinatorics, Probability & Computing 9(4): (2000) |
| 31 | EE | Cristina Bazgan,
Wenceslas Fernandez de la Vega,
Marek Karpinski:
Approximability of Dense Instances of NEAREST CODEWORD Problem
Electronic Colloquium on Computational Complexity (ECCC) 7(91): (2000) |
| 30 | | Wenceslas Fernandez de la Vega,
Marek Karpinski:
Polynomial time approximation of dense weighted instances of MAX-CUT.
Random Struct. Algorithms 16(4): 314-332 (2000) |
| 1999 |
|---|
| 29 | EE | Cristina Bazgan,
Wenceslas Fernandez de la Vega:
A Polynomial Time Approximation Scheme for Dense MIN 2SAT.
FCT 1999: 91-99 |
| 28 | EE | Wenceslas Fernandez de la Vega,
Marek Karpinski:
On the Approximation Hardness of Dense TSP and Other Path Problems.
Inf. Process. Lett. 70(2): 53-55 (1999) |
| 1998 |
|---|
| 27 | EE | Wenceslas Fernandez de la Vega,
Claire Kenyon:
A Randomized Approximation Scheme for Metric MAX-CUT.
FOCS 1998: 468-471 |
| 26 | EE | Wenceslas Fernandez de la Vega,
Vangelis Th. Paschos,
Andreas Stafylopatis:
Average-Case Complexity for the Execution of Recursive Definitions on Relational Databases.
Acta Inf. 35(3): 211-243 (1998) |
| 25 | EE | Wenceslas Fernandez de la Vega,
Alan M. Frieze,
Miklos Santha:
Average-Case Analysis of the Merging Algorithm of Hwang and Lin.
Algorithmica 22(4): 483-489 (1998) |
| 24 | EE | Wenceslas Fernandez de la Vega,
Vassilis Zissimopoulos:
An Approximation Scheme for Strip Packing of Rectangles with Bounded Dimensions.
Discrete Applied Mathematics 82(1-3): 93-101 (1998) |
| 23 | EE | Wenceslas Fernandez de la Vega,
Mohamed El Haddad,
Daniel Barraez,
Oscar Ordaz:
The Forwarding Diameter of Graphs.
Discrete Applied Mathematics 86(2-3): 201-211 (1998) |
| 22 | EE | Wenceslas Fernandez de la Vega,
Marek Karpinski:
On Approximation Hardness of Dense TSP and other Path Problems
Electronic Colloquium on Computational Complexity (ECCC) 5(24): (1998) |
| 21 | EE | Wenceslas Fernandez de la Vega,
Marek Karpinski:
Polynomial Time Approximation of Dense Weighted Instances of MAX-CUT
Electronic Colloquium on Computational Complexity (ECCC) 5(64): (1998) |
| 1996 |
|---|
| 20 | | M. Lamari,
Wenceslas Fernandez de la Vega:
The Module Allocation Problem: An Average Case Analysis.
IRREGULAR 1996: 307-312 |
| 19 | | Wenceslas Fernandez de la Vega:
MAX-CUT has a randomized approximation scheme in dense graphs.
Random Struct. Algorithms 8(3): 187-198 (1996) |
| 18 | | Wenceslas Fernandez de la Vega:
The largest induced tree in a sparse random graph.
Random Struct. Algorithms 9(1-2): 93-97 (1996) |
| 1995 |
|---|
| 17 | | A. El Maftouhi,
Wenceslas Fernandez de la Vega:
On Random 3-sat.
Combinatorics, Probability & Computing 4: 189-195 (1995) |
| 16 | EE | Joë Blot,
Wenceslas Fernandez de la Vega,
Vangelis Th. Paschos,
Rachid Saad:
Average Case Analysis of Greedy Algorithms for Optimisation Problems on Set Systems.
Theor. Comput. Sci. 147(1&2): 267-298 (1995) |
| 1994 |
|---|
| 15 | | Wenceslas Fernandez de la Vega,
Yannis Manoussakis:
Grids in Random Graphs.
Random Struct. Algorithms 5(2): 329-336 (1994) |
| 1993 |
|---|
| 14 | | Wenceslas Fernandez de la Vega,
Sampath Kannan,
Miklos Santha:
Two Probabilistic Results on Merging.
SIAM J. Comput. 22(2): 261-271 (1993) |
| 1992 |
|---|
| 13 | | Wenceslas Fernandez de la Vega,
Vangelis Th. Paschos,
Rachid Saad:
Average Case Analysis of a Greedy Algorithm for the Minimum Hitting Set Problem.
LATIN 1992: 130-138 |
| 12 | EE | Wenceslas Fernandez de la Vega,
Yannis Manoussakis:
The Forwarding Index of Communication Networks with Given Connectivity.
Discrete Applied Mathematics 37/38: 147-155 (1992) |
| 11 | | Wenceslas Fernandez de la Vega,
L. Marquez Gordones:
The Forwarding Indeces of Random Graphs.
Random Struct. Algorithms 3(1): 107-116 (1992) |
| 1991 |
|---|
| 10 | EE | Wenceslas Fernandez de la Vega,
Vangelis Th. Paschos,
A. N. Staylopatis:
On the Mean Execution Time of Recursive Definitions on Relational Databases.
MFDBS 1991: 119-133 |
| 1990 |
|---|
| 9 | | Wenceslas Fernandez de la Vega,
Sampath Kannan,
Miklos Santha:
Two Probabilistic Results on Merging.
SIGAL International Symposium on Algorithms 1990: 118-127 |
| 8 | EE | Wenceslas Fernandez de la Vega:
Kernels in random graphs.
Discrete Mathematics 82(2): 213-217 (1990) |
| 1988 |
|---|
| 7 | EE | Wenceslas Fernandez de la Vega:
Trees in sparse random graphs.
J. Comb. Theory, Ser. B 45(1): 77-85 (1988) |
| 1983 |
|---|
| 6 | EE | Wenceslas Fernandez de la Vega:
On the maximum density of graphs which have no subcontraction to K3.
Discrete Mathematics 46(1): 109-110 (1983) |
| 5 | EE | Wenceslas Fernandez de la Vega:
On the maximum cardinality of a consistent set of arcs in a random tournament.
J. Comb. Theory, Ser. B 35(3): 328-332 (1983) |
| 1982 |
|---|
| 4 | | Béla Bollobás,
Wenceslas Fernandez de la Vega:
The diameter of random regular graphs.
Combinatorica 2(2): 125-134 (1982) |
| 3 | EE | Wenceslas Fernandez de la Vega:
Sur la cardinalite maximum des couplages d'hypergraphes aleatoires uniformes.
Discrete Mathematics 40(2-3): 315-318 (1982) |
| 1981 |
|---|
| 2 | | Wenceslas Fernandez de la Vega,
George S. Lueker:
Bin packing can be solved within 1+epsilon in linear time.
Combinatorica 1(4): 349-355 (1981) |
| 1973 |
|---|
| 1 | EE | Andree Borillo,
Mario Borillo,
L. Bourrelly,
Eugène Chouraqui,
Wenceslas Fernandez de la Vega,
A. Guénoche,
A. Hesnard,
J. Tognotti,
Jacques Virbel:
Description des outils (mathematiques, linguistiques et informatiques) impliques par la construction d'une chaine automatique integree de traitement de l'information textuelle et graphique.
Information Storage and Retrieval 9(10): 527-560 (1973) |
