default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWenceslas Fernandez de la Vega
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j36]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: 296-310 (2019)- 2010
- [j35]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): 63-86 (2010)
2000 – 2009
- 2009
- [j34]Wenceslas Fernandez de la Vega, Zsolt Tuza:
Groupies in random graphs. Inf. Process. Lett. 109(7): 339-340 (2009) - 2007
- [j33]Wenceslas Fernandez de la Vega, Marek Karpinski:
1.0957-Approximation Algorithm for Random MAX-3SAT. RAIRO Oper. Res. 41(1): 95-103 (2007) - [c13]Wenceslas Fernandez de la Vega, Claire Kenyon-Mathieu:
Linear programming relaxations of maxcut. SODA 2007: 53-61 - 2006
- [i13]Wenceslas Fernandez de la Vega, Marek Karpinski:
Approximation Complexity of Nondense Instances of MAX-CUT. Electron. Colloquium Comput. Complex. TR06 (2006) - [i12]Wenceslas Fernandez de la Vega, Marek Karpinski:
On the Sample Complexity of MAX-CUT. Electron. Colloquium Comput. Complex. TR06 (2006) - [i11]Wenceslas Fernandez de la Vega, Marek Karpinski:
Trading Tensors for Cloning: Constant Time Approximation Schemes for Metric MAX-CSP. Electron. Colloquium Comput. Complex. TR06 (2006) - [i10]Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski:
Approximation of Global MAX-CSP Problems. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [c12]Wenceslas Fernandez de la Vega, Marek Karpinski, Ravi Kannan, Santosh S. Vempala:
Tensor decomposition and approximation schemes for constraint satisfaction problems. STOC 2005: 747-754 - 2004
- [c11]Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon:
Approximation schemes for Metric Bisection and partitioning. SODA 2004: 506-515 - 2003
- [j32]Wenceslas Fernandez de la Vega, M. Lamari:
The task allocation problem with constant communication. Discret. Appl. Math. 131(1): 169-177 (2003) - [j31]Noga Alon, Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski:
Random sampling and approximation of MAX-CSPs. J. Comput. Syst. Sci. 67(2): 212-243 (2003) - [j30]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): 73-91 (2003) - [c10]Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon, Yuval Rabani
:
Approximation schemes for clustering problems. STOC 2003: 50-58 - 2002
- [j29]Stéphane Boucheron, Wenceslas Fernandez de la Vega:
On A Square Packing Problem. Comb. Probab. Comput. 11(2): 113-127 (2002) - [c9]Noga Alon, Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski:
Random sampling and approximation of MAX-CSP problems. STOC 2002: 232-239 - [c8]Cristina Bazgan, Wenceslas Fernandez de la Vega, Marek Karpinski:
Approximability of Dense Instances of NEAREST CODEWORD Problem. SWAT 2002: 298-307 - [i9]Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon, Yuval Rabani:
Polynomial Time Approximation Schemes for Metric Min-Sum Clustering. Electron. Colloquium Comput. Complex. TR02 (2002) - [i8]Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon:
A Polynomial Time Approximation Scheme for Metric MIN-BISECTION. Electron. Colloquium Comput. Complex. TR02 (2002) - [i7]Wenceslas Fernandez de la Vega, Marek Karpinski:
A Polynomial Time Approximation Scheme for Subdense MAX-CUT. Electron. Colloquium Comput. Complex. TR02 (2002) - [i6]Wenceslas Fernandez de la Vega, Marek Karpinski:
9/8-Approximation Algorithm for Random MAX-3SAT. Electron. Colloquium Comput. Complex. TR02 (2002) - 2001
- [j28]Stéphane Boucheron, Wenceslas Fernandez de la Vega:
On The Independence Number Of Random Interval Graphs. Comb. Probab. Comput. 10(5): 385-396 (2001) - [j27]Wenceslas Fernandez de la Vega, Claire Kenyon:
A Randomized Approximation Scheme for Metric MAX-CUT. J. Comput. Syst. Sci. 63(4): 531-541 (2001) - [j26]Wenceslas Fernandez de la Vega:
Random 2-SAT: results and problems. Theor. Comput. Sci. 265(1-2): 131-146 (2001) - [i5]Cristina Bazgan, Wenceslas Fernandez de la Vega, Marek Karpinski:
Polynomial Time Approximation Schemes for Dense Instances of Minimum Constraint Satisfaction. Electron. Colloquium Comput. Complex. TR01 (2001) - [i4]Noga Alon, Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski:
Random Sampling and Approximation of MAX-CSP Problems. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [j25]Daniel Barraez, Stéphane Boucheron, Wenceslas Fernandez de la Vega:
On The Fluctuations Of The Giant Component. Comb. Probab. Comput. 9(4): 287-304 (2000) - [j24]Wenceslas Fernandez de la Vega, Marek Karpinski:
Polynomial time approximation of dense weighted instances of MAX-CUT. Random Struct. Algorithms 16(4): 314-332 (2000) - [c7]Wenceslas Fernandez de la Vega:
The Independence Number of Random Interval Graphs. CIAC 2000: 59-62 - [i3]Cristina Bazgan, Wenceslas Fernandez de la Vega, Marek Karpinski:
Approximability of Dense Instances of NEAREST CODEWORD Problem. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1999
- [j23]Wenceslas Fernandez de la Vega, Marek Karpinski:
On the Approximation Hardness of Dense TSP and Other Path Problems. Inf. Process. Lett. 70(2): 53-55 (1999) - [c6]Cristina Bazgan, Wenceslas Fernandez de la Vega:
A Polynomial Time Approximation Scheme for Dense MIN 2SAT. FCT 1999: 91-99 - 1998
- [j22]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): 211-243 (1998) - [j21]Wenceslas Fernandez de la Vega, Alan M. Frieze, Miklos Santha:
Average-Case Analysis of the Merging Algorithm of Hwang and Lin. Algorithmica 22(4): 483-489 (1998) - [j20]Wenceslas Fernandez de la Vega, Vassilis Zissimopoulos:
An Approximation Scheme for Strip Packing of Rectangles with Bounded Dimensions. Discret. Appl. Math. 82(1-3): 93-101 (1998) - [j19]Wenceslas Fernandez de la Vega, Mohamed El Haddad, Daniel Barraez, Oscar Ordaz:
The Forwarding Diameter of Graphs. Discret. Appl. Math. 86(2-3): 201-211 (1998) - [c5]Wenceslas Fernandez de la Vega, Claire Kenyon:
A Randomized Approximation Scheme for Metric MAX-CUT. FOCS 1998: 468-471 - [i2]Wenceslas Fernandez de la Vega, Marek Karpinski:
On Approximation Hardness of Dense TSP and other Path Problems. Electron. Colloquium Comput. Complex. TR98 (1998) - [i1]Wenceslas Fernandez de la Vega, Marek Karpinski:
Polynomial Time Approximation of Dense Weighted Instances of MAX-CUT. Electron. Colloquium Comput. Complex. TR98 (1998) - 1996
- [j18]Wenceslas Fernandez de la Vega:
MAX-CUT has a randomized approximation scheme in dense graphs. Random Struct. Algorithms 8(3): 187-198 (1996) - [j17]Wenceslas Fernandez de la Vega:
The largest induced tree in a sparse random graph. Random Struct. Algorithms 9(1-2): 93-97 (1996) - [c4]M. Lamari, Wenceslas Fernandez de la Vega:
The Module Allocation Problem: An Average Case Analysis. IRREGULAR 1996: 307-312 - 1995
- [j16]A. El Maftouhi, Wenceslas Fernandez de la Vega:
On Random 3-sat. Comb. Probab. Comput. 4: 189-195 (1995) - [j15]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): 267-298 (1995) - 1994
- [j14]Wenceslas Fernandez de la Vega, Yannis Manoussakis:
Computation of the forwarding index via flows: A note. Networks 24(5): 273-276 (1994) - [j13]Wenceslas Fernandez de la Vega, Yannis Manoussakis:
Grids in Random Graphs. Random Struct. Algorithms 5(2): 329-336 (1994) - 1993
- [j12]Wenceslas Fernandez de la Vega, Sampath Kannan, Miklos Santha:
Two Probabilistic Results on Merging. SIAM J. Comput. 22(2): 261-271 (1993) - 1992
- [j11]Wenceslas Fernandez de la Vega, Yannis Manoussakis:
The Forwarding Index of Communication Networks with Given Connectivity. Discret. Appl. Math. 37/38: 147-155 (1992) - [j10]Wenceslas Fernandez de la Vega, L. Marquez Gordones:
The Forwarding Indeces of Random Graphs. Random Struct. Algorithms 3(1): 107-116 (1992) - [c3]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: 130-138 - 1991
- [c2]Wenceslas Fernandez de la Vega, Vangelis Th. Paschos, A. N. Staylopatis:
On the Mean Execution Time of Recursive Definitions on Relational Databases. MFDBS 1991: 119-133 - 1990
- [j9]Wenceslas Fernandez de la Vega:
Kernels in random graphs. Discret. Math. 82(2): 213-217 (1990) - [c1]Wenceslas Fernandez de la Vega, Sampath Kannan, Miklos Santha:
Two Probabilistic Results on Merging. SIGAL International Symposium on Algorithms 1990: 118-127
1980 – 1989
- 1988
- [j8]Wenceslas Fernandez de la Vega:
Trees in sparse random graphs. J. Comb. Theory B 45(1): 77-85 (1988) - 1986
- [j7]Wenceslas Fernandez de la Vega:
Induced trees in sparse random graphs. Graphs Comb. 2(1): 227-231 (1986) - 1983
- [j6]Wenceslas Fernandez de la Vega:
On the maximum density of graphs which have no subcontraction to K3. Discret. Math. 46(1): 109-110 (1983) - [j5]Wenceslas Fernandez de la Vega:
On the maximum cardinality of a consistent set of arcs in a random tournament. J. Comb. Theory B 35(3): 328-332 (1983) - 1982
- [j4]Béla Bollobás, Wenceslas Fernandez de la Vega:
The diameter of random regular graphs. Comb. 2(2): 125-134 (1982) - [j3]Wenceslas Fernandez de la Vega:
Sur la cardinalite maximum des couplages d'hypergraphes aleatoires uniformes. Discret. Math. 40(2-3): 315-318 (1982) - 1981
- [j2]Wenceslas Fernandez de la Vega, George S. Lueker:
Bin packing can be solved within 1+epsilon in linear time. Comb. 1(4): 349-355 (1981)
1970 – 1979
- 1973
- [j1]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): 527-560 (1973)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
