The following pages link to Wenceslas Fernandez de la Vega (Q672469):
Displaying 50 items.
- (Q236856) (redirect page) (← links)
- Average case analysis of greedy algorithms for optimisation problems on set systems (Q672472) (← links)
- On the maximum cardinality of a consistent set of arcs in a random tournament (Q788001) (← links)
- Groupies in random graphs (Q976110) (← links)
- On the maximum density of graphs which have no subcontraction to \(K^ r\). (Q1053033) (← links)
- Induced trees in sparse random graphs (Q1086255) (← links)
- Trees in sparse random graphs (Q1113925) (← links)
- Bin packing can be solved within 1+epsilon in linear time (Q1164429) (← links)
- Sur la cardinalite maximum des couplages d'hypergraphes aléatoires uniformes (Q1165870) (← links)
- The forwarding index of communication networks with given connectivity (Q1199420) (← links)
- Average-case analysis of the merging algorithm of Hwang and Lin (Q1277377) (← links)
- An approximation scheme for strip packing of rectangles with bounded dimensions (Q1383370) (← links)
- Average-case complexity for the execution of recursive definitions on relational databases (paper no 50-95 accepted for publication in ACTA INFORMATICA) (Q1386412) (← links)
- The task allocation problem with constant communication. (Q1408823) (← links)
- A randomized approximation scheme for metric MAX-CUT (Q1604207) (← links)
- On the approximation hardness of dense TSP and other path problems (Q1606928) (← links)
- The diameter of random regular graphs (Q1835933) (← links)
- On almost sure convergence of quadratic Brownian variation (Q1845442) (← links)
- Random sampling and approximation of MAX-CSPs (Q1886453) (← links)
- Kernels in random graphs (Q2277494) (← links)
- On the Fluctuations of the Giant Component (Q2703028) (← links)
- On the Independence Number of Random Interval Graphs (Q2777890) (← links)
- (Q2934582) (← links)
- Approximability of Dense Instances of Nearest Codeword Problem (Q3046504) (← links)
- On a Square Packing Problem (Q3147273) (← links)
- Random sampling and approximation of MAX-CSP problems (Q3579226) (← links)
- Approximation schemes for clustering problems (Q3581243) (← links)
- Tensor decomposition and approximation schemes for constraint satisfaction problems (Q3581412) (← links)
- On the Bandwidth of Random Graphs (Q3672034) (← links)
- (Q3749092) (← links)
- (Q3887496) (← links)
- (Q3889104) (← links)
- (Q3943736) (← links)
- The Forwarding Indices of Random Graphs (Q3989744) (← links)
- Two Probabilistic Results on Merging (Q4032936) (← links)
- (Q4141122) (← links)
- Grids in random graphs (Q4286298) (← links)
- Computation of the forwarding index via flows: A note (Q4305121) (← links)
- Polynomial time approximation schemes for dense instances of minimum constraint satisfaction (Q4417004) (← links)
- (Q4500688) (← links)
- (Q4503937) (← links)
- 1.0957-Approximation Algorithm for Random MAX-3SAT (Q4600615) (← links)
- On Random 3-sat (Q4862742) (← links)
- (Q4866843) (← links)
- MAX-CUT has a randomized approximation scheme in dense graphs (Q4885224) (← links)
- (Q4894603) (← links)
- (Q4934320) (← links)
- (Q5187324) (← links)
- (Q5501299) (← links)
- Random 2-SAT: Results and problems (Q5958804) (← links)
