LIP6 » Actualité

ESCOFFIER Bruno

Professeur
Équipe : RO
Localisation : Campus Pierre et Marie Curie

Sorbonne Université - LIP6

Tel: 01 44 27 72 09, Bruno.Escoffier (at) nulllip6.fr
http://www-desir.lip6.fr/~escoffier

1 Doctorant (Direction de recherche / Co-encadrement)

TEILLER Alexandre : optimisation temporelle.

Publications 2005-2017

2017
- B. Escoffier, L. Gourvès, J. Monnot : “The Price of Optimum: Complexity and Approximation for a Matching Game”, Algorithmica, vol. 77 (3), pp. 836-866, (Springer Verlag) (2017)
2016
- B. Escoffier, Vangelis Th. Paschos, É. Tourniaire : “Super-polynomial approximation branching algorithms”, RAIRO - Operations Research, vol. 50 (4-5), pp. 979-994, (EDP Sciences) (2016)
- É. Bonnet, B. Escoffier, V. Paschos, G. Stamoulis : “A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs”, LATIN 2016: Theoretical Informatics - 12^th Latin American Symposium, vol. 9644, Lecture Notes in Computer Science, Ensenada, Mexico, pp. 235-248, (Springer) (2016)
- E. Angel, E. Bampis, B. Escoffier, M. Lampis : “Parameterized Power Vertex Cover”, Proceedings of WG 2016, 42^nd International Workshop on Graph-Theoretic Concepts in Computer Science, vol. 9941, Lecture Notes in Computer Science, Istanbul, Turkey, pp. 97-108, (Springer-Verlag) (2016)
- B. Escoffier : “Saving colors and Max Coloring: some fixed-parameter tractability results”, Proceedings of WG 2016, 42^nd International Workshop on Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, Istanbul, Turkey (2016)
2015
- É. Bonnet, B. Escoffier, Vangelis Th. Paschos, É. Tourniaire : “Multi-parameter Analysis for Local Graph Partitioning Problems: Using Greediness for Parameterization”, Algorithmica, vol. 71 (3), pp. 566-580, (ISBN: 0178-4617) (2015)
- B. Escoffier, J. Monnot, Vangelis Th. Paschos, M. Xiao : “New Results on Polynomial Inapproximabilityand Fixed Parameter Approximability of Edge Dominating Set”, Theory of Computing Systems, vol. 56 (2), pp. 330-346, (ISBN: 1432-4350) (2015)
- É. Bonnet, B. Escoffier, E. Kim, Vangelis Th. Paschos : “On Subexponential and FPT-Time Inapproximability”, Algorithmica, vol. 71 (3), pp. 541-565, (ISBN: 0178-4617) (2015)
2014
- B. Escoffier, Vangelis Th. Paschos, É. Tourniaire : “Approximating MAX SAT by moderately exponential and parameterized algorithms”, Theoretical Computer Science, vol. 560 (2), pp. 147-157, (Elsevier), (ISBN: 0304-3975) (2014)
2013
- B. Escoffier, J. Monnot, F. Pascual, O. Spanjaard : “Algorithmes à véracité garantie pour des problèmes de b-couplage dans un graphe biparti”, 14ème Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, ROADEF 2013, Troyes, France (2013)
- B. Escoffier, J. Monnot, F. Pascual, O. Spanjaard : “Truthful many-to-many assignment with private weights”, 8^th International Conference on Algorithms and Complexity (CIAC 2013), vol. 7878, Lecture Notes in Computer Science, Barcelona, Spain, pp. 209-220, (Springer) (2013)
2011
- B. Escoffier, L. Gourvès, K. Nguyen, F. Pascual, O. Spanjaard : “Algorithmes à véracité garantie pour le placement d’installations sur une ligne”, 12ème Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 2011), Saint-Etienne, France (2011)
- B. Escoffier, L. Gourvès, K. Nguyen, F. Pascual, O. Spanjaard : “Strategy-proof Mechanisms for Facility Location Games with Many Facilities”, 2^nd International Conference on Algorithmic Decision Theory (ADT'11), vol. 6992, Lecture Notes in Artificial Intelligence, Piscataway, NJ, USA, pp. 67-81, (Springer) (2011)
2010
- B. Escoffier, L. Gourvès, J. Monnot, O. Spanjaard : “Two-stage stochastic matching and spanning tree problems: polynomial instances and approximation”, European Journal of Operational Research, vol. 205 (1), pp. 19-30, (ISBN: 0377-2217) (2010)
- B. Escoffier, O. Spanjaard : “Dynamic Programming”, chapter in Concepts of Combinatorial Optimization, Vangelis Th. Paschos (Ed.), pp. 71-98, (ISTE -- Wiley), (ISBN: 9781848211476) (2010)
2008
- B. Escoffier, J. Monnot, O. Spanjaard : “Some tractable instances of interval data minmax regret problems”, Operations Research Letters, vol. 36 (4), pp. 424-429, (ISBN: 0167-6377) (2008)
- B. Escoffier, J. Monnot, O. Spanjaard : “Some tractable instances of interval data minmax regret problems: bounded distance from triviality (short version)”, 34^th International Conference on Current Trends in Theory and Practice of Computer Science, vol. 4910, Lecture Notes in Computer Science, Nový Smokovec, Slovakia, pp. 280-291, (Springer-Verlag) (2008)
2007
- B. Escoffier, J. Monnot, O. Spanjaard : “Some tractable instances of interval data minmax regret problems: bounded distance from triviality”, (2007)
2005
- B. Escoffier, O. Spanjaard : “Programmation dynamique”, chapitre de Optimisation combinatoire (Volume 1: concepts fondamentaux), Vangelis Th. Paschos (Ed.), pp. 95-124, (Hermès), (ISBN: 2-7462-1038-X) (2005)