The following pages link to Nicolas Bourgeois (Q396667):
Displayed 25 items.
- Exponential approximation schemata for some network design problems (Q396669) (← links)
- Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms (Q411835) (← links)
- The \textsc{max quasi-independent set} problem (Q434194) (← links)
- (Q732317) (redirect page) (← links)
- Probabilistic graph-coloring in bipartite and split graphs (Q732320) (← links)
- Approximating the max-edge-coloring problem (Q986540) (← links)
- Approximation of min coloring by moderately exponential algorithms (Q989534) (← links)
- Efficient approximation of Min Set Cover by moderately exponential algorithms (Q1019736) (← links)
- Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem (Q1683124) (← links)
- Algorithms for dominating clique problems (Q1758169) (← links)
- Fast algorithms for min independent dominating set (Q1941381) (← links)
- Fast algorithms for max independent set (Q2428670) (← links)
- Experimental and theoretical analysis of the limits to ductility of type 304 stainless steel sheet (Q2481024) (← links)
- (Q2867360) (← links)
- (Q3109949) (← links)
- (Q3109950) (← links)
- Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms (Q3183480) (← links)
- An O *(1.0977 n ) Exact Algorithm for max independent set in Sparse Graphs (Q3503578) (← links)
- Maximum Independent Set in Graphs of Average Degree at Most Three in ${\mathcal O}(1.08537^n)$ (Q3569091) (← links)
- Fast Algorithms for min independent dominating set (Q3569130) (← links)
- The max quasi-independent set Problem (Q3569731) (← links)
- A Bottom-Up Method and Fast Algorithms for max independent set (Q3569879) (← links)
- Approximating the Max Edge-Coloring Problem (Q3651536) (← links)
- Exact Algorithms for Dominating Clique Problems (Q3652186) (← links)
- Exact and Approximation Algorithms for Densest k-Subgraph (Q4914440) (← links)