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)

Bin packing can be solved within 1+epsilon in linear time. - Wenceslas Fernandez de la Vega; George S. Lueker (Comb., 1981)

The diameter of random regular graphs. - Béla Bollobás; Wenceslas Fernandez de la Vega (Comb., 1982)

Sur la cardinalite maximum des couplages d'hypergraphes aleatoires uniformes. - Wenceslas Fernandez de la Vega (Discret. Math., 1982)

On the maximum density of graphs which have no subcontraction to K3. - Wenceslas Fernandez de la Vega (Discret. Math., 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)

Induced trees in sparse random graphs. - Wenceslas Fernandez de la Vega (Graphs Comb., 1986)

Trees in sparse random graphs. - Wenceslas Fernandez de la Vega (J. Comb. Theory B, 1988)

Kernels in random graphs. - Wenceslas Fernandez de la Vega (Discret. Math., 1990)

On the Mean Execution Time of Recursive Definitions on Relational Databases. - Wenceslas Fernandez de la Vega; Vangelis Th. Paschos; A. N. Staylopatis (MFDBS, 1991)

Average Case Analysis of a Greedy Algorithm for the Minimum Hitting Set Problem. - Wenceslas Fernandez de la Vega; Vangelis Th. Paschos; Rachid Saad (LATIN, 1992)

The Forwarding Index of Communication Networks with Given Connectivity. - Wenceslas Fernandez de la Vega; Yannis Manoussakis (Discret. Appl. Math., 1992)

The Forwarding Indeces of Random Graphs. - Wenceslas Fernandez de la Vega; L. Marquez Gordones (Random Struct. Algorithms, 1992)

Two Probabilistic Results on Merging. - Wenceslas Fernandez de la Vega; Sampath Kannan; Miklos Santha (SIAM J. Comput., 1993)

Computation of the forwarding index via flows: A note. - Wenceslas Fernandez de la Vega; Yannis Manoussakis (Networks, 1994)

Grids in Random Graphs. - Wenceslas Fernandez de la Vega; Yannis Manoussakis (Random Struct. Algorithms, 1994)

On Random 3-sat. - A. El Maftouhi; Wenceslas Fernandez de la Vega (Comb. Probab. Comput., 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)

The Module Allocation Problem: An Average Case Analysis. - M. Lamari; Wenceslas Fernandez de la Vega (IRREGULAR, 1996)

MAX-CUT has a randomized approximation scheme in dense graphs. - Wenceslas Fernandez de la Vega (Random Struct. Algorithms, 1996)

The largest induced tree in a sparse random graph. - Wenceslas Fernandez de la Vega (Random Struct. Algorithms, 1996)

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)

Average-Case Analysis of the Merging Algorithm of Hwang and Lin. - Wenceslas Fernandez de la Vega; Alan M. Frieze; Miklos Santha (Algorithmica, 1998)

The Forwarding Diameter of Graphs. - Wenceslas Fernandez de la Vega; Mohamed El Haddad; Daniel Barraez; Oscar Ordaz (Discret. Appl. Math., 1998)

An Approximation Scheme for Strip Packing of Rectangles with Bounded Dimensions. - Wenceslas Fernandez de la Vega; Vassilis Zissimopoulos (Discret. Appl. Math., 1998)

Polynomial Time Approximation of Dense Weighted Instances of MAX-CUT - Wenceslas Fernandez de la Vega; Marek Karpinski (Electron. Colloquium Comput. Complex., 1998)

A Polynomial Time Approximation Scheme for Dense MIN 2SAT. - Cristina Bazgan; Wenceslas Fernandez de la Vega (FCT, 1999)

On the Approximation Hardness of Dense TSP and Other Path Problems. - Wenceslas Fernandez de la Vega; Marek Karpinski (Inf. Process. Lett., 1999)

The Independence Number of Random Interval Graphs. - Wenceslas Fernandez de la Vega (CIAC, 2000)

On The Fluctuations Of The Giant Component. - Daniel Barraez; Stéphane Boucheron; Wenceslas Fernandez de la Vega (Comb. Probab. Comput., 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 Independence Number Of Random Interval Graphs. - Stéphane Boucheron; Wenceslas Fernandez de la Vega (Comb. Probab. Comput., 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)

Random Sampling and Approximation of MAX-CSP Problems - Noga Alon; Wenceslas Fernandez de la Vega; Ravi Kannan; Marek Karpinski (Electron. Colloquium Comput. Complex., 2001)

A Randomized Approximation Scheme for Metric MAX-CUT. - Wenceslas Fernandez de la Vega; Claire Kenyon (J. Comput. Syst. Sci., 2001)

Random 2-SAT: results and problems. - Wenceslas Fernandez de la Vega (Theor. Comput. Sci., 2001)

On A Square Packing Problem. - Stéphane Boucheron; Wenceslas Fernandez de la Vega (Comb. Probab. Comput., 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)

A Polynomial Time Approximation Scheme for Metric MIN-BISECTION - Wenceslas Fernandez de la Vega; Marek Karpinski; Claire Kenyon (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)

9/8-Approximation Algorithm for Random MAX-3SAT - Wenceslas Fernandez de la Vega; Marek Karpinski (Electron. Colloquium Comput. Complex., 2002)

Approximation schemes for clustering problems. - Wenceslas Fernandez de la Vega; Marek Karpinski; Claire Kenyon; Yuval Rabani (STOC, 2003)

The task allocation problem with constant communication. - Wenceslas Fernandez de la Vega; M. Lamari (Discret. Appl. Math., 2003)

Random sampling and approximation of MAX-CSPs. - Noga Alon; Wenceslas Fernandez de la Vega; Ravi Kannan; Marek Karpinski (J. Comput. Syst. Sci., 2003)

Approximation schemes for Metric Bisection and partitioning. - Wenceslas Fernandez de la Vega; Marek Karpinski; Claire Kenyon (SODA, 2004)

Tensor decomposition and approximation schemes for constraint satisfaction problems. - Wenceslas Fernandez de la Vega; Marek Karpinski; Ravi Kannan; Santosh S. Vempala (STOC, 2005)

Approximation Complexity of Nondense Instances of MAX-CUT. - 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)

Trading Tensors for Cloning: Constant Time Approximation Schemes for Metric MAX-CSP. - Wenceslas Fernandez de la Vega; Marek Karpinski (Electron. Colloquium Comput. Complex., 2006)

Approximation of Global MAX-CSP Problems. - Wenceslas Fernandez de la Vega; Ravi Kannan; Marek Karpinski (Electron. Colloquium Comput. Complex., 2006)

Linear programming relaxations of maxcut. - Wenceslas Fernandez de la Vega; Claire Kenyon-Mathieu (SODA, 2007)

1.0957-Approximation Algorithm for Random MAX-3SAT. - Wenceslas Fernandez de la Vega; Marek Karpinski (RAIRO Oper. Res., 2007)

Groupies in random graphs. - Wenceslas Fernandez de la Vega; Zsolt Tuza (Inf. Process. Lett., 2009)

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)

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)