The following pages link to Bruno Escoffier (Q396668):
Displaying 50 items.
- Exponential approximation schemata for some network design problems (Q396669) (← links)
- (Q410726) (redirect page) (← links)
- Adapting parallel algorithms to the W-stream model, with applications to graph problems (Q410728) (← links)
- Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms (Q411835) (← links)
- A survey on the structure of approximation classes (Q458503) (← links)
- Approximating MAX SAT by moderately exponential and parameterized algorithms (Q477187) (← links)
- (Q521812) (redirect page) (← links)
- The price of optimum: complexity and approximation for a matching game (Q521813) (← links)
- (Q557902) (redirect page) (← links)
- Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness (Q557903) (← links)
- (Q732318) (redirect page) (← links)
- Probabilistic graph-coloring in bipartite and split graphs (Q732320) (← links)
- Differential approximation of MIN SAT, MAX SAT and related problems (Q877035) (← links)
- A better differential approximation ratio for symmetric TSP (Q924134) (← links)
- Approximation of min coloring by moderately exponential algorithms (Q989534) (← links)
- Some tractable instances of interval data minmax regret problems (Q1003488) (← links)
- Efficient approximation of Min Set Cover by moderately exponential algorithms (Q1019736) (← links)
- Weighted coloring on planar, bipartite and split graphs: Complexity and approximation (Q1028481) (← links)
- Reoptimization of minimum and maximum traveling salesman's tours (Q1044031) (← links)
- Weighted coloring: further complexity and approximability results (Q1045908) (← links)
- Purely combinatorial approximation algorithms for maximum \(k\)-vertex cover in bipartite graphs (Q1662108) (← links)
- Saving colors and max coloring: some fixed-parameter tractability results (Q1755584) (← links)
- Algorithms for dominating clique problems (Q1758169) (← links)
- Fast algorithms for min independent dominating set (Q1941381) (← links)
- Online multistage subset maximization problems (Q2041973) (← links)
- A simple rounding scheme for multistage optimization (Q2077374) (← links)
- Target-based computer-assisted orchestration: complexity and approximation algorithms (Q2079398) (← links)
- Recognizing single-peaked preferences on an arbitrary graph: complexity and algorithms (Q2109969) (← links)
- LP-based algorithms for multistage minimization problems (Q2117680) (← links)
- Multistage knapsack (Q2119404) (← links)
- In memory of Jérôme Monnot (Q2140557) (← links)
- Weighted majority tournaments and Kemeny ranking with 2-dimensional Euclidean preferences (Q2146734) (← links)
- Online learning for min-max discrete problems (Q2166779) (← links)
- Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs (Q2266936) (← links)
- Two-stage stochastic matching and spanning tree problems: polynomial instances and approximation (Q2270290) (← links)
- The convergence of iterative delegations in liquid democracy in a social network (Q2292630) (← links)
- On subexponential and FPT-time inapproximability (Q2343081) (← links)
- Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization (Q2343085) (← links)
- New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set (Q2345984) (← links)
- Approximation of the quadratic set covering problem (Q2427697) (← links)
- Fast algorithms for max independent set (Q2428670) (← links)
- Completeness in approximation classes beyond APX (Q2503307) (← links)
- Improved worst-case complexity for the MIN 3-SET COVERING problem (Q2643796) (← links)
- Polynomial approximation: a structural and operational study. (Abstract of thesis) (Q2644383) (← links)
- Measuring nearly single-peakedness of an electorate: some new insights (Q2695423) (← links)
- A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs (Q2802943) (← links)
- Designing Budget-Balanced Best-Response Mechanisms for Network Coordination Games (Q2856145) (← links)
- Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization (Q2867073) (← links)
- (Q2867366) (← links)
- Moderately exponential time and fixed parameter approximation algorithms (Q2868915) (← links)
