Wenceslas Fernandez de la Vega

62 papers A* 6B 2C 1Journal 49Unranked 4
YearRankTypeTitle / Venue / Authors
2019 J jnl
Maximum colored trees in edge-colored graphs.
Eur. J. Comb.
Valentin Borozan, Wenceslas Fernandez de la Vega, Yannis Manoussakis, Carlos A. J. Martinhon, Rahul Muthu, Hong Phong Pham, Rachid Saad
2010 J jnl
Cycles and paths in edge-colored graphs with given degrees.
J. Graph Theory
Abdelfattah Abouelaoualim, Kinkar Chandra Das, Wenceslas Fernandez de la Vega, Marek Karpinski, Yannis Manoussakis, Carlos A. J. Martinhon, Rachid Saad
2009 J jnl
Groupies in random graphs.
Inf. Process. Lett.
Wenceslas Fernandez de la Vega, Zsolt Tuza
2007 J jnl
1.0957-Approximation Algorithm for Random MAX-3SAT.
RAIRO Oper. Res.
Wenceslas Fernandez de la Vega, Marek Karpinski
2007 A* conf
Linear programming relaxations of maxcut.
SODA
Wenceslas Fernandez de la Vega, Claire Kenyon-Mathieu
2006 J jnl
Approximation Complexity of Nondense Instances of MAX-CUT.
Electron. Colloquium Comput. Complex.
Wenceslas Fernandez de la Vega, Marek Karpinski
2006 J jnl
Approximation of Global MAX-CSP Problems.
Electron. Colloquium Comput. Complex.
Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski
2006 J jnl
On the Sample Complexity of MAX-CUT.
Electron. Colloquium Comput. Complex.
Wenceslas Fernandez de la Vega, Marek Karpinski
2006 J jnl
Trading Tensors for Cloning: Constant Time Approximation Schemes for Metric MAX-CSP.
Electron. Colloquium Comput. Complex.
Wenceslas Fernandez de la Vega, Marek Karpinski
2005 A* conf
Tensor decomposition and approximation schemes for constraint satisfaction problems.
STOC
Wenceslas Fernandez de la Vega, Marek Karpinski, Ravi Kannan, Santosh S. Vempala
2004 A* conf
Approximation schemes for Metric Bisection and partitioning.
SODA
Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon
2003 A* conf
Approximation schemes for clustering problems.
STOC
Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon, Yuval Rabani
2003 J jnl
Polynomial time approximation schemes for dense instances of minimum constraint satisfaction.
Random Struct. Algorithms
Cristina Bazgan, Wenceslas Fernandez de la Vega, Marek Karpinski
2003 J jnl
Random sampling and approximation of MAX-CSPs.
J. Comput. Syst. Sci.
Noga Alon, Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski
2003 J jnl
The task allocation problem with constant communication.
Discret. Appl. Math.
Wenceslas Fernandez de la Vega, M. Lamari
2002 J jnl
9/8-Approximation Algorithm for Random MAX-3SAT
Electron. Colloquium Comput. Complex.
Wenceslas Fernandez de la Vega, Marek Karpinski
2002 J jnl
A Polynomial Time Approximation Scheme for Metric MIN-BISECTION
Electron. Colloquium Comput. Complex.
Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon
2002 J jnl
A Polynomial Time Approximation Scheme for Subdense MAX-CUT
Electron. Colloquium Comput. Complex.
Wenceslas Fernandez de la Vega, Marek Karpinski
2002 — conf
Approximability of Dense Instances of NEAREST CODEWORD Problem.
SWAT
Cristina Bazgan, Wenceslas Fernandez de la Vega, Marek Karpinski
2002 J jnl
On A Square Packing Problem.
Comb. Probab. Comput.
Stéphane Boucheron, Wenceslas Fernandez de la Vega
2002 J jnl
Polynomial Time Approximation Schemes for Metric Min-Sum Clustering
Electron. Colloquium Comput. Complex.
Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon, Yuval Rabani
2002 A* conf
Random sampling and approximation of MAX-CSP problems.
STOC
Noga Alon, Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski
2001 J jnl
A Randomized Approximation Scheme for Metric MAX-CUT.
J. Comput. Syst. Sci.
Wenceslas Fernandez de la Vega, Claire Kenyon
2001 J jnl
On The Independence Number Of Random Interval Graphs.
Comb. Probab. Comput.
Stéphane Boucheron, Wenceslas Fernandez de la Vega
2001 J jnl
Polynomial Time Approximation Schemes for Dense Instances of Minimum Constraint Satisfaction
Electron. Colloquium Comput. Complex.
Cristina Bazgan, Wenceslas Fernandez de la Vega, Marek Karpinski
2001 J jnl
Random 2-SAT: results and problems.
Theor. Comput. Sci.
Wenceslas Fernandez de la Vega
2001 J jnl
Random Sampling and Approximation of MAX-CSP Problems
Electron. Colloquium Comput. Complex.
Noga Alon, Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski
2000 J jnl
Approximability of Dense Instances of NEAREST CODEWORD Problem
Electron. Colloquium Comput. Complex.
Cristina Bazgan, Wenceslas Fernandez de la Vega, Marek Karpinski
2000 J jnl
On The Fluctuations Of The Giant Component.
Comb. Probab. Comput.
Daniel Barraez, Stéphane Boucheron, Wenceslas Fernandez de la Vega
2000 J jnl
Polynomial time approximation of dense weighted instances of MAX-CUT.
Random Struct. Algorithms
Wenceslas Fernandez de la Vega, Marek Karpinski
2000 C conf
The Independence Number of Random Interval Graphs.
CIAC
Wenceslas Fernandez de la Vega
1999 B conf
A Polynomial Time Approximation Scheme for Dense MIN 2SAT.
FCT
Cristina Bazgan, Wenceslas Fernandez de la Vega
1999 J jnl
On the Approximation Hardness of Dense TSP and Other Path Problems.
Inf. Process. Lett.
Wenceslas Fernandez de la Vega, Marek Karpinski
1998 A* conf
A Randomized Approximation Scheme for Metric MAX-CUT.
FOCS
Wenceslas Fernandez de la Vega, Claire Kenyon
1998 J jnl
An Approximation Scheme for Strip Packing of Rectangles with Bounded Dimensions.
Discret. Appl. Math.
Wenceslas Fernandez de la Vega, Vassilis Zissimopoulos
1998 J jnl
Average-Case Analysis of the Merging Algorithm of Hwang and Lin.
Algorithmica
Wenceslas Fernandez de la Vega, Alan M. Frieze, Miklos Santha
1998 J jnl
Average-Case Complexity for the Execution of Recursive Definitions on Relational Databases.
Acta Informatica
Wenceslas Fernandez de la Vega, Vangelis Th. Paschos, Andreas Stafylopatis
1998 J jnl
On Approximation Hardness of Dense TSP and other Path Problems
Electron. Colloquium Comput. Complex.
Wenceslas Fernandez de la Vega, Marek Karpinski
1998 J jnl
Polynomial Time Approximation of Dense Weighted Instances of MAX-CUT
Electron. Colloquium Comput. Complex.
Wenceslas Fernandez de la Vega, Marek Karpinski
1998 J jnl
The Forwarding Diameter of Graphs.
Discret. Appl. Math.
Wenceslas Fernandez de la Vega, Mohamed El Haddad, Daniel Barraez, Oscar Ordaz
1996 J jnl
MAX-CUT has a randomized approximation scheme in dense graphs.
Random Struct. Algorithms
Wenceslas Fernandez de la Vega
1996 — conf
The Module Allocation Problem: An Average Case Analysis.
IRREGULAR
M. Lamari, Wenceslas Fernandez de la Vega
1996 J jnl
The largest induced tree in a sparse random graph.
Random Struct. Algorithms
Wenceslas Fernandez de la Vega
1995 J jnl
Average Case Analysis of Greedy Algorithms for Optimisation Problems on Set Systems.
Theor. Comput. Sci.
Joël Blot, Wenceslas Fernandez de la Vega, Vangelis Th. Paschos, Rachid Saad
1995 J jnl
On Random 3-sat.
Comb. Probab. Comput.
A. El Maftouhi, Wenceslas Fernandez de la Vega
1994 J jnl
Computation of the forwarding index via flows: A note.
Networks
Wenceslas Fernandez de la Vega, Yannis Manoussakis
1994 J jnl
Grids in Random Graphs.
Random Struct. Algorithms
Wenceslas Fernandez de la Vega, Yannis Manoussakis
1993 J jnl
Two Probabilistic Results on Merging.
SIAM J. Comput.
Wenceslas Fernandez de la Vega, Sampath Kannan, Miklos Santha
1992 B conf
Average Case Analysis of a Greedy Algorithm for the Minimum Hitting Set Problem.
LATIN
Wenceslas Fernandez de la Vega, Vangelis Th. Paschos, Rachid Saad
1992 J jnl
The Forwarding Indeces of Random Graphs.
Random Struct. Algorithms
Wenceslas Fernandez de la Vega, L. Marquez Gordones
1992 J jnl
The Forwarding Index of Communication Networks with Given Connectivity.
Discret. Appl. Math.
Wenceslas Fernandez de la Vega, Yannis Manoussakis
1991 — conf
On the Mean Execution Time of Recursive Definitions on Relational Databases.
MFDBS
Wenceslas Fernandez de la Vega, Vangelis Th. Paschos, A. N. Staylopatis
1990 J jnl
Kernels in random graphs.
Discret. Math.
Wenceslas Fernandez de la Vega
1990 — conf
Two Probabilistic Results on Merging.
SIGAL International Symposium on Algorithms
Wenceslas Fernandez de la Vega, Sampath Kannan, Miklos Santha
1988 J jnl
Trees in sparse random graphs.
J. Comb. Theory B
Wenceslas Fernandez de la Vega
1986 J jnl
Induced trees in sparse random graphs.
Graphs Comb.
Wenceslas Fernandez de la Vega
1983 J jnl
On the maximum cardinality of a consistent set of arcs in a random tournament.
J. Comb. Theory B
Wenceslas Fernandez de la Vega
1983 J jnl
On the maximum density of graphs which have no subcontraction to K
Discret. Math.
Wenceslas Fernandez de la Vega
1982 J jnl
Sur la cardinalite maximum des couplages d'hypergraphes aleatoires uniformes.
Discret. Math.
Wenceslas Fernandez de la Vega
1982 J jnl
The diameter of random regular graphs.
Comb.
Béla Bollobás, Wenceslas Fernandez de la Vega
1981 J jnl
Bin packing can be solved within 1+epsilon in linear time.
Comb.
Wenceslas Fernandez de la Vega, George S. Lueker
1973 J jnl
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.
Andrée Borillo, Mario Borillo, L. Bourrelly, Eugène Chouraqui, Wenceslas Fernandez de la Vega, A. Guénoche, A. Hesnard, J. Tognotti, Jacques Virbel