Wenceslas Fernandez de la Vega

Publication Activity (10 Years)

Years Active: 1973-2019
Publications (10 Years): 1

Top Topics

Hough Transform

Adjacency Graph

Top Venues

Publications

Valentin Borozan, Wenceslas Fernandez de la Vega, Yannis Manoussakis, Carlos A. J. Martinhon, Rahul Muthu, Hong Phong Pham, Rachid Saad
Maximum colored trees in edge-colored graphs. Eur. J. Comb. 80 (2019)
Abdelfattah Abouelaoualim, Kinkar Chandra Das, Wenceslas Fernandez de la Vega, Marek Karpinski, Yannis Manoussakis, Carlos A. J. Martinhon, Rachid Saad
Cycles and paths in edge-colored graphs with given degrees. J. Graph Theory 64 (1) (2010)
Wenceslas Fernandez de la Vega, Zsolt Tuza
Groupies in random graphs. Inf. Process. Lett. 109 (7) (2009)
Wenceslas Fernandez de la Vega, Claire Kenyon-Mathieu
Linear programming relaxations of maxcut. SODA (2007)
Wenceslas Fernandez de la Vega, Marek Karpinski
1.0957-Approximation Algorithm for Random MAX-3SAT. RAIRO Oper. Res. 41 (1) (2007)
Wenceslas Fernandez de la Vega, Marek Karpinski
Approximation Complexity of Nondense Instances of MAX-CUT. Electron. Colloquium Comput. Complex. 13 (101) (2006)
Wenceslas Fernandez de la Vega, Marek Karpinski
On the Sample Complexity of MAX-CUT. Electron. Colloquium Comput. Complex. 13 (104) (2006)
Wenceslas Fernandez de la Vega, Marek Karpinski
Trading Tensors for Cloning: Constant Time Approximation Schemes for Metric MAX-CSP. Electron. Colloquium Comput. Complex. 13 (155) (2006)
Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski
Approximation of Global MAX-CSP Problems. Electron. Colloquium Comput. Complex. 13 (124) (2006)
Wenceslas Fernandez de la Vega, Marek Karpinski, Ravi Kannan, Santosh S. Vempala
Tensor decomposition and approximation schemes for constraint satisfaction problems. STOC (2005)
Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon
Approximation schemes for Metric Bisection and partitioning. SODA (2004)
Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon, Yuval Rabani
Approximation schemes for clustering problems. STOC (2003)
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) (2003)
Wenceslas Fernandez de la Vega, M. Lamari
The task allocation problem with constant communication. Discret. Appl. Math. 131 (1) (2003)
Noga Alon, Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski
Random sampling and approximation of MAX-CSPs. J. Comput. Syst. Sci. 67 (2) (2003)
Stéphane Boucheron, Wenceslas Fernandez de la Vega
On A Square Packing Problem. Comb. Probab. Comput. 11 (2) (2002)
Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon
A Polynomial Time Approximation Scheme for Metric MIN-BISECTION Electron. Colloquium Comput. Complex. (041) (2002)
Wenceslas Fernandez de la Vega, Marek Karpinski
9/8-Approximation Algorithm for Random MAX-3SAT Electron. Colloquium Comput. Complex. (070) (2002)
Noga Alon, Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski
Random sampling and approximation of MAX-CSP problems. STOC (2002)
Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon, Yuval Rabani
Polynomial Time Approximation Schemes for Metric Min-Sum Clustering Electron. Colloquium Comput. Complex. (025) (2002)
Wenceslas Fernandez de la Vega, Marek Karpinski
A Polynomial Time Approximation Scheme for Subdense MAX-CUT Electron. Colloquium Comput. Complex. (044) (2002)
Cristina Bazgan, Wenceslas Fernandez de la Vega, Marek Karpinski
Approximability of Dense Instances of NEAREST CODEWORD Problem. SWAT (2002)
Cristina Bazgan, Wenceslas Fernandez de la Vega, Marek Karpinski
Polynomial Time Approximation Schemes for Dense Instances of Minimum Constraint Satisfaction Electron. Colloquium Comput. Complex. 8 (34) (2001)
Noga Alon, Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski
Random Sampling and Approximation of MAX-CSP Problems Electron. Colloquium Comput. Complex. (100) (2001)
Wenceslas Fernandez de la Vega, Claire Kenyon
A Randomized Approximation Scheme for Metric MAX-CUT. J. Comput. Syst. Sci. 63 (4) (2001)
Wenceslas Fernandez de la Vega
Random 2-SAT: results and problems. Theor. Comput. Sci. 265 (1-2) (2001)
Stéphane Boucheron, Wenceslas Fernandez de la Vega
On The Independence Number Of Random Interval Graphs. Comb. Probab. Comput. 10 (5) (2001)
Cristina Bazgan, Wenceslas Fernandez de la Vega, Marek Karpinski
Approximability of Dense Instances of NEAREST CODEWORD Problem Electron. Colloquium Comput. Complex. 7 (91) (2000)
Daniel Barraez, Stéphane Boucheron, Wenceslas Fernandez de la Vega
On The Fluctuations Of The Giant Component. Comb. Probab. Comput. 9 (4) (2000)
Wenceslas Fernandez de la Vega, Marek Karpinski
Polynomial time approximation of dense weighted instances of MAX-CUT. Random Struct. Algorithms 16 (4) (2000)
Wenceslas Fernandez de la Vega
The Independence Number of Random Interval Graphs. CIAC (2000)
Wenceslas Fernandez de la Vega, Marek Karpinski
On the Approximation Hardness of Dense TSP and Other Path Problems. Inf. Process. Lett. 70 (2) (1999)
Cristina Bazgan, Wenceslas Fernandez de la Vega
A Polynomial Time Approximation Scheme for Dense MIN 2SAT. FCT (1999)
Wenceslas Fernandez de la Vega, Marek Karpinski
Polynomial Time Approximation of Dense Weighted Instances of MAX-CUT Electron. Colloquium Comput. Complex. 5 (64) (1998)
Wenceslas Fernandez de la Vega, Vassilis Zissimopoulos
An Approximation Scheme for Strip Packing of Rectangles with Bounded Dimensions. Discret. Appl. Math. 82 (1-3) (1998)
Wenceslas Fernandez de la Vega, Vangelis Th. Paschos, Andreas Stafylopatis
Average-Case Complexity for the Execution of Recursive Definitions on Relational Databases. Acta Informatica 35 (3) (1998)
Wenceslas Fernandez de la Vega, Alan M. Frieze, Miklos Santha
Average-Case Analysis of the Merging Algorithm of Hwang and Lin. Algorithmica 22 (4) (1998)
Wenceslas Fernandez de la Vega, Claire Kenyon
A Randomized Approximation Scheme for Metric MAX-CUT. FOCS (1998)
Wenceslas Fernandez de la Vega, Marek Karpinski
On Approximation Hardness of Dense TSP and other Path Problems Electron. Colloquium Comput. Complex. 5 (24) (1998)
Wenceslas Fernandez de la Vega, Mohamed El Haddad, Daniel Barraez, Oscar Ordaz
The Forwarding Diameter of Graphs. Discret. Appl. Math. 86 (2-3) (1998)
M. Lamari, Wenceslas Fernandez de la Vega
The Module Allocation Problem: An Average Case Analysis. IRREGULAR (1996)
Wenceslas Fernandez de la Vega
The largest induced tree in a sparse random graph. Random Struct. Algorithms 9 (1-2) (1996)
Wenceslas Fernandez de la Vega
MAX-CUT has a randomized approximation scheme in dense graphs. Random Struct. Algorithms 8 (3) (1996)
A. El Maftouhi, Wenceslas Fernandez de la Vega
On Random 3-sat. Comb. Probab. Comput. 4 (1995)
Joël 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) (1995)
Wenceslas Fernandez de la Vega, Yannis Manoussakis
Grids in Random Graphs. Random Struct. Algorithms 5 (2) (1994)
Wenceslas Fernandez de la Vega, Yannis Manoussakis
Computation of the forwarding index via flows: A note. Networks 24 (5) (1994)
Wenceslas Fernandez de la Vega, Sampath Kannan, Miklos Santha
Two Probabilistic Results on Merging. SIAM J. Comput. 22 (2) (1993)
Wenceslas Fernandez de la Vega, Yannis Manoussakis
The Forwarding Index of Communication Networks with Given Connectivity. Discret. Appl. Math. (1992)
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)
Wenceslas Fernandez de la Vega, L. Marquez Gordones
The Forwarding Indeces of Random Graphs. Random Struct. Algorithms 3 (1) (1992)
Wenceslas Fernandez de la Vega, Vangelis Th. Paschos, A. N. Staylopatis
On the Mean Execution Time of Recursive Definitions on Relational Databases. MFDBS (1991)
Wenceslas Fernandez de la Vega, Sampath Kannan, Miklos Santha
Two Probabilistic Results on Merging. SIGAL International Symposium on Algorithms (1990)
Wenceslas Fernandez de la Vega
Kernels in random graphs. Discret. Math. 82 (2) (1990)
Wenceslas Fernandez de la Vega
Trees in sparse random graphs. J. Comb. Theory, Ser. B 45 (1) (1988)
Wenceslas Fernandez de la Vega
Induced trees in sparse random graphs. Graphs Comb. 2 (1) (1986)
Wenceslas Fernandez de la Vega
. Discret. Math. 46 (1) (1983)
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) (1983)
Béla Bollobás, Wenceslas Fernandez de la Vega
The diameter of random regular graphs. Comb. 2 (2) (1982)
Wenceslas Fernandez de la Vega
Sur la cardinalite maximum des couplages d'hypergraphes aleatoires uniformes. Discret. Math. 40 (2-3) (1982)
Wenceslas Fernandez de la Vega, George S. Lueker
Bin packing can be solved within 1+epsilon in linear time. Comb. 1 (4) (1981)
Andrée 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. Inf. Storage Retr. 9 (10) (1973)