The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Wenceslas Fernandez de la Vega: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Wenceslas Fernandez de la Vega
    The Independence Number of Random Interval Graphs. [Citation Graph (0, 0)][DBLP]
    CIAC, 2000, pp:59-62 [Conf]
  2. Cristina Bazgan, Wenceslas Fernandez de la Vega
    A Polynomial Time Approximation Scheme for Dense MIN 2SAT. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:91-99 [Conf]
  3. Wenceslas Fernandez de la Vega, Claire Kenyon
    A Randomized Approximation Scheme for Metric MAX-CUT. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:468-471 [Conf]
  4. M. Lamari, Wenceslas Fernandez de la Vega
    The Module Allocation Problem: An Average Case Analysis. [Citation Graph (0, 0)][DBLP]
    IRREGULAR, 1996, pp:307-312 [Conf]
  5. Wenceslas Fernandez de la Vega, Vangelis Th. Paschos, Rachid Saad
    Average Case Analysis of a Greedy Algorithm for the Minimum Hitting Set Problem. [Citation Graph (0, 0)][DBLP]
    LATIN, 1992, pp:130-138 [Conf]
  6. Wenceslas Fernandez de la Vega, Vangelis Th. Paschos, A. N. Staylopatis
    On the Mean Execution Time of Recursive Definitions on Relational Databases. [Citation Graph (0, 3)][DBLP]
    MFDBS, 1991, pp:119-133 [Conf]
  7. Wenceslas Fernandez de la Vega, Sampath Kannan, Miklos Santha
    Two Probabilistic Results on Merging. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:118-127 [Conf]
  8. Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon
    Approximation schemes for Metric Bisection and partitioning. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:506-515 [Conf]
  9. Noga Alon, Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski
    Random sampling and approximation of MAX-CSP problems. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:232-239 [Conf]
  10. Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon, Yuval Rabani
    Approximation schemes for clustering problems. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:50-58 [Conf]
  11. Wenceslas Fernandez de la Vega, Marek Karpinski, Ravi Kannan, Santosh Vempala
    Tensor decomposition and approximation schemes for constraint satisfaction problems. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:747-754 [Conf]
  12. Cristina Bazgan, Wenceslas Fernandez de la Vega, Marek Karpinski
    Approximability of Dense Instances of NEAREST CODEWORD Problem. [Citation Graph (0, 0)][DBLP]
    SWAT, 2002, pp:298-307 [Conf]
  13. Wenceslas Fernandez de la Vega, Vangelis Th. Paschos, Andreas Stafylopatis
    Average-Case Complexity for the Execution of Recursive Definitions on Relational Databases. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1998, v:35, n:3, pp:211-243 [Journal]
  14. Wenceslas Fernandez de la Vega, Alan M. Frieze, Miklos Santha
    Average-Case Analysis of the Merging Algorithm of Hwang and Lin. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:22, n:4, pp:483-489 [Journal]
  15. Béla Bollobás, Wenceslas Fernandez de la Vega
    The diameter of random regular graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1982, v:2, n:2, pp:125-134 [Journal]
  16. Wenceslas Fernandez de la Vega, George S. Lueker
    Bin packing can be solved within 1+epsilon in linear time. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1981, v:1, n:4, pp:349-355 [Journal]
  17. Stéphane Boucheron, Wenceslas Fernandez de la Vega
    On A Square Packing Problem. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2002, v:11, n:2, pp:- [Journal]
  18. Stéphane Boucheron, Wenceslas Fernandez de la Vega
    On The Independence Number Of Random Interval Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2001, v:10, n:5, pp:- [Journal]
  19. Daniel Barraez, Stéphane Boucheron, Wenceslas Fernandez de la Vega
    On The Fluctuations Of The Giant Component. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2000, v:9, n:4, pp:- [Journal]
  20. A. El Maftouhi, Wenceslas Fernandez de la Vega
    On Random 3-sat. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1995, v:4, n:, pp:189-195 [Journal]
  21. Wenceslas Fernandez de la Vega, Mohamed El Haddad, Daniel Barraez, Oscar Ordaz
    The Forwarding Diameter of Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:86, n:2-3, pp:201-211 [Journal]
  22. Wenceslas Fernandez de la Vega, M. Lamari
    The task allocation problem with constant communication. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:1, pp:169-177 [Journal]
  23. Wenceslas Fernandez de la Vega, Yannis Manoussakis
    The Forwarding Index of Communication Networks with Given Connectivity. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1992, v:37, n:, pp:147-155 [Journal]
  24. Wenceslas Fernandez de la Vega, Vassilis Zissimopoulos
    An Approximation Scheme for Strip Packing of Rectangles with Bounded Dimensions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:82, n:1-3, pp:93-101 [Journal]
  25. Cristina Bazgan, Wenceslas Fernandez de la Vega, Marek Karpinski
    Approximability of Dense Instances of NEAREST CODEWORD Problem [Citation Graph (0, 0)][DBLP]
    , 2000, v:7, n:91, pp:- [Journal]
  26. Cristina Bazgan, Wenceslas Fernandez de la Vega, Marek Karpinski
    Polynomial Time Approximation Schemes for Dense Instances of Minimum Constraint Satisfaction [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:34, pp:- [Journal]
  27. Noga Alon, Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski
    Random Sampling and Approximation of MAX-CSP Problems [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:, n:100, pp:- [Journal]
  28. Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon, Yuval Rabani
    Polynomial Time Approximation Schemes for Metric Min-Sum Clustering [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:025, pp:- [Journal]
  29. Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon
    A Polynomial Time Approximation Scheme for Metric MIN-BISECTION [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:041, pp:- [Journal]
  30. Wenceslas Fernandez de la Vega, Marek Karpinski
    A Polynomial Time Approximation Scheme for Subdense MAX-CUT [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:044, pp:- [Journal]
  31. Wenceslas Fernandez de la Vega, Marek Karpinski
    9/8-Approximation Algorithm for Random MAX-3SAT [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:070, pp:- [Journal]
  32. Wenceslas Fernandez de la Vega, Marek Karpinski
    On Approximation Hardness of Dense TSP and other Path Problems [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:24, pp:- [Journal]
  33. Wenceslas Fernandez de la Vega, Marek Karpinski
    Polynomial Time Approximation of Dense Weighted Instances of MAX-CUT [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:64, pp:- [Journal]
  34. Wenceslas Fernandez de la Vega, Marek Karpinski
    On the Approximation Hardness of Dense TSP and Other Path Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:70, n:2, pp:53-55 [Journal]
  35. Andree 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. [Citation Graph (0, 0)][DBLP]
    Information Storage and Retrieval, 1973, v:9, n:10, pp:527-560 [Journal]
  36. Noga Alon, Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski
    Random sampling and approximation of MAX-CSPs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:67, n:2, pp:212-243 [Journal]
  37. Wenceslas Fernandez de la Vega, Claire Kenyon
    A Randomized Approximation Scheme for Metric MAX-CUT. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:63, n:4, pp:531-541 [Journal]
  38. Wenceslas Fernandez de la Vega
    On the maximum cardinality of a consistent set of arcs in a random tournament. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1983, v:35, n:3, pp:328-332 [Journal]
  39. Wenceslas Fernandez de la Vega
    Trees in sparse random graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1988, v:45, n:1, pp:77-85 [Journal]
  40. Cristina Bazgan, Wenceslas Fernandez de la Vega, Marek Karpinski
    Polynomial time approximation schemes for dense instances of minimum constraint satisfaction. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2003, v:23, n:1, pp:73-91 [Journal]
  41. Wenceslas Fernandez de la Vega
    MAX-CUT has a randomized approximation scheme in dense graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1996, v:8, n:3, pp:187-198 [Journal]
  42. Wenceslas Fernandez de la Vega
    The largest induced tree in a sparse random graph. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1996, v:9, n:1-2, pp:93-97 [Journal]
  43. Wenceslas Fernandez de la Vega, L. Marquez Gordones
    The Forwarding Indeces of Random Graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1992, v:3, n:1, pp:107-116 [Journal]
  44. Wenceslas Fernandez de la Vega, Marek Karpinski
    Polynomial time approximation of dense weighted instances of MAX-CUT. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2000, v:16, n:4, pp:314-332 [Journal]
  45. Wenceslas Fernandez de la Vega, Yannis Manoussakis
    Grids in Random Graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1994, v:5, n:2, pp:329-336 [Journal]
  46. Wenceslas Fernandez de la Vega, Sampath Kannan, Miklos Santha
    Two Probabilistic Results on Merging. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:2, pp:261-271 [Journal]
  47. Joë Blot, Wenceslas Fernandez de la Vega, Vangelis Th. Paschos, Rachid Saad
    Average Case Analysis of Greedy Algorithms for Optimisation Problems on Set Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:147, n:1&2, pp:267-298 [Journal]
  48. Wenceslas Fernandez de la Vega
    Random 2-SAT: results and problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:265, n:1-2, pp:131-146 [Journal]
  49. Wenceslas Fernandez de la Vega, Claire Kenyon-Mathieu
    Linear programming relaxations of maxcut. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:53-61 [Conf]
  50. Wenceslas Fernandez de la Vega
    Sur la cardinalite maximum des couplages d'hypergraphes aleatoires uniformes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:40, n:2-3, pp:315-318 [Journal]
  51. Wenceslas Fernandez de la Vega
    On the maximum density of graphs which have no subcontraction to K3. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:46, n:1, pp:109-110 [Journal]
  52. Wenceslas Fernandez de la Vega
    Kernels in random graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:82, n:2, pp:213-217 [Journal]

  53. Trading Tensors for Cloning: Constant Time Approximation Schemes for Metric MAX-CSP. [Citation Graph (, )][DBLP]


  54. Approximation Complexity of Nondense Instances of MAX-CUT. [Citation Graph (, )][DBLP]


  55. On the Sample Complexity of MAX-CUT. [Citation Graph (, )][DBLP]


  56. Approximation of Global MAX-CSP Problems. [Citation Graph (, )][DBLP]


Search in 0.099secs, Finished in 0.101secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002