Wenceslas Fernandez de la Vega

According to our database1, Wenceslas Fernandez de la Vega
  • authored at least 61 papers between 1973 and 2010.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2010
Cycles and paths in edge-colored graphs with given degrees.
Journal of Graph Theory, 2010

2009
Groupies in random graphs.
Inf. Process. Lett., 2009

2007
1.0957-Approximation Algorithm for Random MAX-3SAT.
RAIRO - Operations Research, 2007

Linear programming relaxations of maxcut.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2006
Approximation of Global MAX-CSP Problems.
Electronic Colloquium on Computational Complexity (ECCC), 2006

Trading Tensors for Cloning: Constant Time Approximation Schemes for Metric MAX-CSP.
Electronic Colloquium on Computational Complexity (ECCC), 2006

On the Sample Complexity of MAX-CUT.
Electronic Colloquium on Computational Complexity (ECCC), 2006

Approximation Complexity of Nondense Instances of MAX-CUT.
Electronic Colloquium on Computational Complexity (ECCC), 2006

2005
Tensor decomposition and approximation schemes for constraint satisfaction problems.
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

2004
Approximation schemes for Metric Bisection and partitioning.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2003
Polynomial time approximation schemes for dense instances of minimum constraint satisfaction.
Random Struct. Algorithms, 2003

Random sampling and approximation of MAX-CSPs.
J. Comput. Syst. Sci., 2003

The task allocation problem with constant communication.
Discrete Applied Mathematics, 2003

Approximation schemes for clustering problems.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

2002
9/8-Approximation Algorithm for Random MAX-3SAT
Electronic Colloquium on Computational Complexity (ECCC), 2002

A Polynomial Time Approximation Scheme for Subdense MAX-CUT
Electronic Colloquium on Computational Complexity (ECCC), 2002

A Polynomial Time Approximation Scheme for Metric MIN-BISECTION
Electronic Colloquium on Computational Complexity (ECCC), 2002

Polynomial Time Approximation Schemes for Metric Min-Sum Clustering
Electronic Colloquium on Computational Complexity (ECCC), 2002

On A Square Packing Problem.
Combinatorics, Probability & Computing, 2002

Approximability of Dense Instances of NEAREST CODEWORD Problem.
Proceedings of the Algorithm Theory, 2002

Random sampling and approximation of MAX-CSP problems.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

2001
Random 2-SAT: results and problems.
Theor. Comput. Sci., 2001

A Randomized Approximation Scheme for Metric MAX-CUT.
J. Comput. Syst. Sci., 2001

Random Sampling and Approximation of MAX-CSP Problems
Electronic Colloquium on Computational Complexity (ECCC), 2001

Polynomial Time Approximation Schemes for Dense Instances of Minimum Constraint Satisfaction
Electronic Colloquium on Computational Complexity (ECCC), 2001

On The Independence Number Of Random Interval Graphs.
Combinatorics, Probability & Computing, 2001

2000
Polynomial time approximation of dense weighted instances of MAX-CUT.
Random Struct. Algorithms, 2000

Approximability of Dense Instances of NEAREST CODEWORD Problem
Electronic Colloquium on Computational Complexity (ECCC), 2000

On The Fluctuations Of The Giant Component.
Combinatorics, Probability & Computing, 2000

The Independence Number of Random Interval Graphs.
Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000

1999
On the Approximation Hardness of Dense TSP and Other Path Problems.
Inf. Process. Lett., 1999

A Polynomial Time Approximation Scheme for Dense MIN 2SAT.
Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

1998
Polynomial Time Approximation of Dense Weighted Instances of MAX-CUT
Electronic Colloquium on Computational Complexity (ECCC), 1998

On Approximation Hardness of Dense TSP and other Path Problems
Electronic Colloquium on Computational Complexity (ECCC), 1998

An Approximation Scheme for Strip Packing of Rectangles with Bounded Dimensions.
Discrete Applied Mathematics, 1998

The Forwarding Diameter of Graphs.
Discrete Applied Mathematics, 1998

Average-Case Analysis of the Merging Algorithm of Hwang and Lin.
Algorithmica, 1998

Average-Case Complexity for the Execution of Recursive Definitions on Relational Databases.
Acta Inf., 1998

A Randomized Approximation Scheme for Metric MAX-CUT.
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1996
The largest induced tree in a sparse random graph.
Random Struct. Algorithms, 1996

MAX-CUT has a randomized approximation scheme in dense graphs.
Random Struct. Algorithms, 1996

The Module Allocation Problem: An Average Case Analysis.
Proceedings of the Parallel Algorithms for Irregularly Structured Problems, 1996

1995
Average Case Analysis of Greedy Algorithms for Optimisation Problems on Set Systems.
Theor. Comput. Sci., 1995

On Random 3-sat.
Combinatorics, Probability & Computing, 1995

1994
Grids in Random Graphs.
Random Struct. Algorithms, 1994

Computation of the forwarding index via flows: A note.
Networks, 1994

1993
Two Probabilistic Results on Merging.
SIAM J. Comput., 1993

1992
The Forwarding Indeces of Random Graphs.
Random Struct. Algorithms, 1992

The Forwarding Index of Communication Networks with Given Connectivity.
Discrete Applied Mathematics, 1992

Average Case Analysis of a Greedy Algorithm for the Minimum Hitting Set Problem.
Proceedings of the LATIN '92, 1992

1991
On the Mean Execution Time of Recursive Definitions on Relational Databases.
Proceedings of the MFDBS 91, 1991

1990
Kernels in random graphs.
Discrete Mathematics, 1990

Two Probabilistic Results on Merging.
Proceedings of the Algorithms, 1990

1988
Trees in sparse random graphs.
J. Comb. Theory, Ser. B, 1988

1986
Induced trees in sparse random graphs.
Graphs and Combinatorics, 1986

1983
On the maximum cardinality of a consistent set of arcs in a random tournament.
J. Comb. Theory, Ser. B, 1983

On the maximum density of graphs which have no subcontraction to K3.
Discrete Mathematics, 1983

1982
Sur la cardinalite maximum des couplages d'hypergraphes aleatoires uniformes.
Discrete Mathematics, 1982

The diameter of random regular graphs.
Combinatorica, 1982

1981
Bin packing can be solved within 1+epsilon in linear time.
Combinatorica, 1981

1973
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, 1973


  Loading...