23 novembre 2012 à 10h00
Université Paris-Dauphine, Amphi 2-3 (2ème étage)
View online : Soutenance d’HDR de Bruno ESCOFFIER
Partenaires
Menu
-
News
- Annulation de la réunion TODO du 13 novembre
- APEX 2013: program
- Forthcoming event: APEX 2013
- Les rencontres du numérique de l’ANR
- Réunion à Clermont-Ferrand (novembre 2012)
- Réunion à Dauphine (22 février 2013)
- Réunion de démarrage
- Réunion des tâches 1, 2 et 3
- Soutenance d’HDR de Bruno ESCOFFIER
- 1ère Réunion
- 2ème Réunion
- 3ème Réunion - Réunion à Clermont-Ferrand
- 4ème Réunion
- Presentation
-
Workshop APEX
-
Publications
- A Bottom-Up Method and Fast Algorithms for MAX INDEPENDENT SET
- A New Lower Bound on the Independence Number of Graphs
- A Note on the Clustered Set Covering Problem
- A Peep Through the Looking Glass: Articulation Points in Lattices
- A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph
- A Survey on Combinatorial Optimization in Dynamic Environments
- Algorithme approché probabiliste pour le problème Q||Σwici en tenant compte de l’énergie consommée
- Algorithme exact pour le problème de l’indépendant faiblement connexe de cardinalité minimum
- Algorithmes d’approximation à mémoire limitée pour le traitement de grands graphes : le problème du Vertex Cover
- Algorithmes d’ordonnancement de faible complexité pour minimiser l’énergie consommée des instances agréables
- Algorithms for the Vertex Cover Problem on Large Graphs
- An Introduction to Exponential Time Exact Algorithms for Solving NP-hard Problems
- Analysis and Comparison of Three Algorithms for the Vertex Cover Problem on Large Graphs with Low Memory Capacities
- Analytical and experimental comparison of six algorithms for the vertex cover problem
- Approximating MAX SAT by Moderately Exponential and Parameterized Algorithms
- Approximating the max edge-coloring problem
- Approximation of the Clustered Set Covering Problem
- Comparaison d’Algorithmes pour le Problème du Vertex Cover sur de Grands Graphes
- Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms
- Exact algorithms for dominating clique problems
- Exponential approximation schemata for some network design problems
- Fast Algorithms for Max Independent Set
- Fast Algorithms for MIN INDEPENDENT DOMINATING SET
- Implementation and Comparison of Heuristics for the Vertex Cover Problem on Huge Graphs
- Low Complexity Scheduling Algorithms Minimizing the Energy for Tasks with Agreeable Deadlines
- Maximum Independent Set in Graphs of Average Degree at Most Three in 0(1.08537^n)
- Mise en œuvre d’heuristiques capables de traiter de très grands graphes pour le problème du Vertex Cover
- Moderately Exponential Approximation
- New approximability and FPT results on Edge Dominating Set
- New Results on Maximum Induced Matchings in Bipartite Graphs and Beyond
- On Inverse Traveling Salesman Problems
- On Multiprocessor Temperature-Aware Scheduling Problems
- On Some Coloring Problems in Grids
- On the MAX <i>k</i>-VERTEX COVER problem
- On the Online Track Assignment Problem
- On the PROBABILISTIC MIN SPANNING TREE problem
- Online Maximum k-Coverage
- Ordonnancement des tâches avec migration et minimisation de l’énergie consommée
- Reoptimization of maximum weight induced hereditary subgraph problems
- Reoptimization of the Maximum Weight Pk-Free Subgraph Under Vertex Insertion
- Reoptimization of the Minimum Spanning Tree
- The MAX QUASI-INDEPENDENT SET problem
- Triangulation and Clique Separator Decomposition of Claw-Free Graphs
- Une nouvelle borne inférieure sur la taille maximum d’un ensemble indépendant dans un graphe
- Vertical Decomposition of a Lattice Using Clique Separators
- Weighted completion time minimization on a single-machine with a fixed non-availability interval: differential approximability
-
Software
- Members