Wenceslas Fernandez de la Vega

According to our database, Wenceslas Fernandez de la Vega authored at least 55 papers between 1973 and 2019.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2019

Maximum colored trees in edge-colored graphs.

Valentin Borozan, Wenceslas Fernandez de la Vega, Yannis Manoussakis, Carlos A. J. Martinhon, Rahul Muthu, Hong Phong Pham, Rachid Saad

Eur. J. Comb., 2019

2010

Cycles and paths in edge-colored graphs with given degrees.

Abdelfattah Abouelaoualim, Kinkar Chandra Das, Wenceslas Fernandez de la Vega, Marek Karpinski, Yannis Manoussakis, Carlos A. J. Martinhon, Rachid Saad

J. Graph Theory, 2010

2009

Groupies in random graphs.

Wenceslas Fernandez de la Vega, Zsolt Tuza

Inf. Process. Lett., 2009

2007

1.0957-Approximation Algorithm for Random MAX-3SAT.

Wenceslas Fernandez de la Vega, Marek Karpinski

RAIRO Oper. Res., 2007

Linear programming relaxations of maxcut.

Wenceslas Fernandez de la Vega, Claire Kenyon-Mathieu

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2006

Approximation of Global MAX-CSP Problems.

Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski

Electron. Colloquium Comput. Complex., 2006

Trading Tensors for Cloning: Constant Time Approximation Schemes for Metric MAX-CSP.

Wenceslas Fernandez de la Vega, Marek Karpinski

Electron. Colloquium Comput. Complex., 2006

On the Sample Complexity of MAX-CUT.

Wenceslas Fernandez de la Vega, Marek Karpinski

Electron. Colloquium Comput. Complex., 2006

Approximation Complexity of Nondense Instances of MAX-CUT.

Wenceslas Fernandez de la Vega, Marek Karpinski

Electron. Colloquium Comput. Complex., 2006

2005

Tensor decomposition and approximation schemes for constraint satisfaction problems.

Wenceslas Fernandez de la Vega, Marek Karpinski, Ravi Kannan, Santosh S. Vempala

Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

2004

Approximation schemes for Metric Bisection and partitioning.

Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2003

Random sampling and approximation of MAX-CSPs.

Noga Alon, Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski

J. Comput. Syst. Sci., 2003

The task allocation problem with constant communication.

Wenceslas Fernandez de la Vega, M. Lamari

Discret. Appl. Math., 2003

Approximation schemes for clustering problems.

Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon, Yuval Rabani

Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

2002

9/8-Approximation Algorithm for Random MAX-3SAT

Wenceslas Fernandez de la Vega, Marek Karpinski

Electron. Colloquium Comput. Complex., 2002

A Polynomial Time Approximation Scheme for Subdense MAX-CUT

Wenceslas Fernandez de la Vega, Marek Karpinski

Electron. Colloquium Comput. Complex., 2002

A Polynomial Time Approximation Scheme for Metric MIN-BISECTION

Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon

Electron. Colloquium Comput. Complex., 2002

Polynomial Time Approximation Schemes for Metric Min-Sum Clustering

Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon, Yuval Rabani

Electron. Colloquium Comput. Complex., 2002

On A Square Packing Problem.

Stéphane Boucheron, Wenceslas Fernandez de la Vega

Comb. Probab. Comput., 2002

2001

Random 2-SAT: results and problems.

Wenceslas Fernandez de la Vega

Theor. Comput. Sci., 2001

A Randomized Approximation Scheme for Metric MAX-CUT.

Wenceslas Fernandez de la Vega, Claire Kenyon

J. Comput. Syst. Sci., 2001

Random Sampling and Approximation of MAX-CSP Problems

Noga Alon, Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski

Electron. Colloquium Comput. Complex., 2001

Polynomial Time Approximation Schemes for Dense Instances of Minimum Constraint Satisfaction

Cristina Bazgan, Wenceslas Fernandez de la Vega, Marek Karpinski

Electron. Colloquium Comput. Complex., 2001

On The Independence Number Of Random Interval Graphs.

Stéphane Boucheron, Wenceslas Fernandez de la Vega

Comb. Probab. Comput., 2001

2000

Approximability of Dense Instances of NEAREST CODEWORD Problem

Cristina Bazgan, Wenceslas Fernandez de la Vega, Marek Karpinski

Electron. Colloquium Comput. Complex., 2000

On The Fluctuations Of The Giant Component.

Daniel Barraez, Stéphane Boucheron, Wenceslas Fernandez de la Vega

Comb. Probab. Comput., 2000

The Independence Number of Random Interval Graphs.

Wenceslas Fernandez de la Vega

Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000

1999

On the Approximation Hardness of Dense TSP and Other Path Problems.

Wenceslas Fernandez de la Vega, Marek Karpinski

Inf. Process. Lett., 1999

A Polynomial Time Approximation Scheme for Dense MIN 2SAT.

Cristina Bazgan, Wenceslas Fernandez de la Vega

Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

1998

Polynomial Time Approximation of Dense Weighted Instances of MAX-CUT

Wenceslas Fernandez de la Vega, Marek Karpinski

Electron. Colloquium Comput. Complex., 1998

An Approximation Scheme for Strip Packing of Rectangles with Bounded Dimensions.

Wenceslas Fernandez de la Vega, Vassilis Zissimopoulos

Discret. Appl. Math., 1998

The Forwarding Diameter of Graphs.

Wenceslas Fernandez de la Vega, Mohamed El Haddad, Daniel Barraez, Oscar Ordaz

Discret. Appl. Math., 1998

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

Wenceslas Fernandez de la Vega, Alan M. Frieze, Miklos Santha

Algorithmica, 1998

Average-Case Complexity for the Execution of Recursive Definitions on Relational Databases.

Wenceslas Fernandez de la Vega, Vangelis Th. Paschos, Andreas Stafylopatis

Acta Informatica, 1998

1996

The largest induced tree in a sparse random graph.

Wenceslas Fernandez de la Vega

Random Struct. Algorithms, 1996

MAX-CUT has a randomized approximation scheme in dense graphs.

Wenceslas Fernandez de la Vega

Random Struct. Algorithms, 1996

The Module Allocation Problem: An Average Case Analysis.

M. Lamari, Wenceslas Fernandez de la Vega

Proceedings of the Parallel Algorithms for Irregularly Structured Problems, 1996

1995

Average Case Analysis of Greedy Algorithms for Optimisation Problems on Set Systems.

Joël Blot, Wenceslas Fernandez de la Vega, Vangelis Th. Paschos, Rachid Saad

Theor. Comput. Sci., 1995

On Random 3-sat.

A. El Maftouhi, Wenceslas Fernandez de la Vega

Comb. Probab. Comput., 1995

1994

Grids in Random Graphs.

Wenceslas Fernandez de la Vega, Yannis Manoussakis

Random Struct. Algorithms, 1994

Computation of the forwarding index via flows: A note.

Wenceslas Fernandez de la Vega, Yannis Manoussakis

Networks, 1994

1993

Two Probabilistic Results on Merging.

Wenceslas Fernandez de la Vega, Sampath Kannan, Miklos Santha

SIAM J. Comput., 1993

1992

The Forwarding Indeces of Random Graphs.

Wenceslas Fernandez de la Vega, L. Marquez Gordones

Random Struct. Algorithms, 1992

The Forwarding Index of Communication Networks with Given Connectivity.

Wenceslas Fernandez de la Vega, Yannis Manoussakis

Discret. Appl. Math., 1992

Average Case Analysis of a Greedy Algorithm for the Minimum Hitting Set Problem.

Wenceslas Fernandez de la Vega, Vangelis Th. Paschos, Rachid Saad

Proceedings of the LATIN '92, 1992

1991

On the Mean Execution Time of Recursive Definitions on Relational Databases.

Wenceslas Fernandez de la Vega, Vangelis Th. Paschos, A. N. Staylopatis

Proceedings of the MFDBS 91, 1991

1990

Kernels in random graphs.

Wenceslas Fernandez de la Vega

Discret. Math., 1990

1988

Trees in sparse random graphs.

Wenceslas Fernandez de la Vega

J. Comb. Theory B, 1988

1986

Induced trees in sparse random graphs.

Wenceslas Fernandez de la Vega

Graphs Comb., 1986

1983

On the maximum cardinality of a consistent set of arcs in a random tournament.

Wenceslas Fernandez de la Vega

J. Comb. Theory B, 1983

On the maximum density of graphs which have no subcontraction to K³.

Wenceslas Fernandez de la Vega

Discret. Math., 1983

1982

Sur la cardinalite maximum des couplages d'hypergraphes aleatoires uniformes.

Wenceslas Fernandez de la Vega

Discret. Math., 1982

The diameter of random regular graphs.

Béla Bollobás, Wenceslas Fernandez de la Vega

Comb., 1982

1981

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

Wenceslas Fernandez de la Vega, George S. Lueker

Comb., 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.

Andrée Borillo, Mario Borillo, L. Bourrelly, Eugène Chouraqui, Wenceslas Fernandez de la Vega, A. Guénoche, A. Hesnard, J. Tognotti, Jacques Virbel

Inf. Storage Retr., 1973