Publications

	Books/Book chapters
	An Introduction to Exponential Time Exact Algorithms for Solving NP-hard Problems. N. Bourgeois, B. Escoffier and V. Th. Paschos, Chapter 15 of the book Combinatorial Optimization: Recent Progress, A.R. Mahjoub Editor, Iste - Wiley and Sons, 2011
	Moderately Exponential Approximation. N. Bourgeois, B. Escoffier, V. Th. Paschos and E. Tourniaire, Chapter 16 of the book Combinatorial Optimization: Recent Progress, A.R. Mahjoub Editor, Iste - Wiley and Sons, 2011
	Complexity and Approximation in Reoptimization. G. Ausiello, V. Bonifaci and B. Escoffier, Chapter 4 of the book Computability in Context: Computation and Logic in the Real World, S.B. Cooper and A. Sorbi Editors, Imperial College Press, pages 101-130, 2011
	Worst-case Complexity. F. Della Croce, B. Escoffier, M. Kaminski and V. Th. Paschos, Chapter 8 of the book Combinatorial optimization - Theoretical Computer Science: Interfaces and Perspectives, Iste - Wiley and Sons, pages 203-240, 2008
	Min Weighted Node Coloring Problem. M. Demange, B. Escoffier, J. Monnot, V. Th. Paschos and D. de Werra, Chapter 10 of the book Combinatorial optimization - Theoretical Computer Science: Interfaces and Perspectives, Iste - Wiley and Sons, pages 259-290, 2008
	Weighted Edge Coloring. M. Demange, B. Escoffier, G. Lucarelli, J. Monnot, V. Th. Paschos and D. de Werra, Chapter 11 of the book Combinatorial optimization - Theoretical Computer Science: Interfaces and Perspectives, Iste - Wiley and Sons, pages 291-318, John Wiley Publisher, 2008
	Programmation dynamique, B. Escoffier and O. Spanjaard, chapter 4 of Optimisation Combinatoire: concepts fondamentaux (vol 1), pages 95-124, Editions Hermes science, 2005 (in French)
	Objectif prépa, cours et exercices corrigés de mathématiques, Editions Ellipses, 2001 (in French). 2nd edition, 2009.
	International journals
	Fast algorithms for min independent dominating set, N. Bourgeois, F. Della Croce, B. Escoffier and V. Th. Paschos, Discrete Applied Mathematics (accepted, to appear).
	Fair solutions for some multiagent optimization problems, B. Escoffier, L. Gourvès and J. Monnot, Journal of Autonomous Agents and Multi-Agent Systems (accepted, to appear).
	Fast Algorithms for max independent set, N. Bourgeois, B. Escoffier, V. Th. Paschos and J.M.M Van Rooij, Algorithmica 62 (1-2): 382-415, 2012.
	Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms, N. Bourgeois, B. Escoffier and V. Th. Paschos, Discrete Applied Mathematics 159 (17): 1954-1970, 2011.
	Adapting parallel algorithms to the W-Stream model, with applications to graph problems, C. Demetrescu, B. Escoffier, G. Moruz and A. Ribichini, Theoretical Computer Science 411 (44-46): 3994-4004, 2010.
	Two-stage stochastic matching and spanning tree problems: polynomial instances and approximation, B. Escoffier, L. Gourvès, J. Monnot and O. Spanjaard, European Journal of Operations Research 205:19-30, 2010.
	A survey on the structure of approximation classes, B. Escoffier and V. Th. Paschos, Computer Science Review 4(1):19-40, 2010.
	Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs, B. Escoffier, L. Gourvès and J. Monnot, Journal of Discrete Algorithms 8(1):36-49, 2010.
	Reoptimization of minimum and maximum traveling salesman’s tours, G. Ausiello, B. Escoffier, J. Monnot and V. Th. Paschos, Journal of Discrete Algorithms 7(4):453-463, 2009 (preliminary version in Cahier du Lamsade n°233).
	Simple and Fast Reoptimizations for the Steiner Tree Problem, B. Escoffier, M. Milanic and V. Th. Paschos, Algorithmic Operations Research 4(2): 86-94, 2009 (preliminary version in Cahier du Lamsade n°245).
	Approximation of Min Coloring by moderately exponential algorithms, N. Bourgeois, B. Escoffier and V. Th. Paschos, Information Processing Letters 109(16): 950-954, 2009 (preliminary version in Cahier du Lamsade n°280)..
	Efficient approximation of Min Set Cover by moderately exponential algorithms, N. Bourgeois, B. Escoffier and V. Th. Paschos, Theoretical Computer Science 410(21-23): 2184-2195, 2009 (preliminary version in Cahier du Lamsade n°278)..
	Weighted coloring on planar, bipartite and split graphs: complexity and approximation, D. de Werra, M. Demange, B. Escoffier J. Monnot and V. Th. Paschos, Discrete Applied Mathematics 157(4): 819-832, 2009 (preliminary version in Annales du Lamsade n°4-5).
	Probabilistic graph-coloring in bipartite and split graphs, N. Bourgeois, F. Della Croce, B. Escoffier, C. Murat et V. Th. Paschos. Journal of Combinatorial Optimization 17: 274-311, 2009 (preliminary version in Cahier du Lamsade n°268).
	A better differential approximation ratio for symmetric TSP, B. Escoffier and J. Monnot. Theoretical Computer Science 396(1-3): 63-70, 2008 (preliminary version in Cahier du Lamsade n°261)
	Some tractable instances of interval data minmax regret problems: bounded distance from triviality, B. Escoffier, J. Monnot et O. Spanjaard. Operations Research Letters 36: 424–429, 2008 (preliminary version in Cahier du Lamsade n°265).
	Approximation of the Quadratic Set Covering Problem, B. Escoffier et P. Hammer. Discrete Optimization 4(3-4), pages 378-386, 2007 (preliminary version in Annales du Lamsade n°4-5).
	Improved worst-case complexity for the MIN 3-SET COVERING problem, B. Escoffier, F. Della Croce and V. Th. Paschos. Operations Research Letters 35(2), pages 205-210, 2007 (preliminary version in Cahier du Lamsade n°232)
	Differential approximation of Max SAT, Min SAT and related problems, B. Escoffier and V. Th. Paschos, European Journal of Operations Research 181(2), pages 620-633, 2007 (preliminary version in Cahier de Recherche n°220)
	Completeness in approximation classes beyond APX, B. Escoffier and V. Paschos. Theoretical Computer Science 359 (1-3): 369-377 (2006) (preliminary version in Cahier de Recherche n°225)
	Weighted Coloring: further complexity and approximations results, B. Escoffier, J. Monnot and V. Th. Paschos. Information Processing Letters 97(3): 98-103 (2006) (preliminary version in Annales du Lamsade n°4)
	Poly-APX- and PTAS-completeness in standard and differential approximation, C. Bazgan, B. Escoffier and V. Th. Paschos, Theoretical Computer Science 339 (2-3): 272-292, 2005 (preliminary version in Cahier de Recherche n°217)
	Proving completeness by logic, B. Escoffier and V. Th. Paschos, International Journal of Computer Mathematics, 82 (2):151-161, 2005 (preliminary version in Annales du Lamsade n°2)
	French journals
	On-line models and algorithms for max independent set, B. Escoffier and V. Th. Paschos, RAIRO Operations Research 40 (2): 129-142 (2006) (preliminary version in Annales du Lamsade n°2)
	International conferences
	The price of optimum in a matching game, B. Escoffier, L. Gourvès and J. Monnot, SAGT'11 (to appear in LNCS), 2011
	Strategy-proof Mechanisms for Facility Location Games with Many Facilities, B. Escoffier, L. Gourvès, T. NGuyen Kim, F. Pascual and O. Spanjaard, ADT'11 (to appear in LNAI), 2011
	A Bottom-Up Method and Fast Algorithms for max independent set, N. Bourgeois, B. Escoffier, V. Th. Paschos and J.M.M Van Rooij, SWAT'10, LNCS 6139: 62-73, 2010
	Fast algorithms for min independent dominating set, N. Bourgeois, B. Escoffier and V. Th. Paschos, SIROCCO'10, LNCS 6058: 2-13, 2010
	On the impact of local taxes in a set cover game, B. Escoffier, L. Gourvès and J. Monnot, SIROCCO'10, LNCS 6058: 247-261, 2010
	Maximum Independent Set in Graphs of Average Degree at Most Three in O(1.08537^n), N. Bourgeois, B. Escoffier, V. Th. Paschos and J.M.M Van Rooij, TAMC'10, LNCS 6108: 373-384, 2010
	Strategic Coloring of a Graph, B. Escoffier, L. Gourvès and J. Monnot, CIAC'10, LNCS 6078: 155-166, 2010
	Exact algorithms for dominating clique problems, N. Bourgeois, F. Della Croce, B. Escoffier and V. Th. Paschos, ISAAC'09, LNCS 5878: 4-13, 2009
	Efficient approximation of combinatorial problems by moderately exponential algorithms, N. Bourgeois, B. Escoffier and V. Th. Paschos, WADS'09, LNCS 5664: 507-518, 2009
	Single-Peaked consistency and its complexity, B. Escoffier, J. Lang and M. Öztürk, ECAI'08
	An O*(1.0977^n) exact algorithm for max independent set in sparse graphs, N. Bourgeois, B. Escoffier and V. Th. Paschos, IWPEC'08, LNCS 5018:55-65, 2008
	Some tractable instances of interval data minmax regret problems: bounded distance from triviality, B. Escoffier, J. Monnot and O. Spanjaard, SOFSEM'08, LNCS 4910: 280-291, 2008
	Adapting parallel algorithms to the W-Stream model, with applications to graph problems, C. Demetrescu, B. Escoffier, G. Moruz and A. Ribichini, MFCS'07, LNCS 4708: 194-205, 2007
	Complexity and approximation results for the connected vertex cover problem, B. Escoffier, L. Gourvès and J. Monnot, WG'07, LNCS: 4769: 202-213, 2007
	Reoptimization of minimum and maximum traveling salesman's tour, G. Ausiello, B. Escoffier, J. Monnot and V. Th. Paschos, SWAT'06, LNCS 4059, 196-207, 2006
	Weighted Coloring: further complexity and approximations results, B. Escoffier, J. Monnot and V. Th. Paschos, ICTCS'05, LNCS 3701 : 205-214 (2005)
	Probabilistic Coloring of Bipartite and Split Graphs, F. Della Croce, B. Escoffier, C. Murat and V. Th. Paschos, ICCSA'05, LNCS 3483 : 202-211, 2005
	Differential Approximation of min sat, max sat and Related Problems, B. Escoffier and V. Th. Paschos, ICCSA'05, LNCS 3483 : 192-201, 2005
	Weighted coloring on planar, bipartite and split graphs: complexity and improved approximation, D. de Werra, M. Demange, B. Escoffier J. Monnot and V. Th. Paschos, ISAAC'04, LNCS 3341, 896-907, 2004
	Poly-APX- and PTAS-completeness in standard and differential approximation, C. Bazgan, B. Escoffier and V. Th. Paschos, ISAAC'04, LNCS 3341, 124-136, 2004
	French conferences
	Algorithmes exponentiels pour des problèmes de clique dominante, N. Bourgeois, F. Della Croce, B. Escoffier and V. Th. Paschos. ROADEF 2010, Toulouse
	Approximation et algorithmes exponentiels : le cas de la couverture minimum, N. Bourgeois, B. Escoffier and V. Th. Paschos. ROADEF 2009, Nancy
	Approximation efficiente de problèmes d'optimisation, N. Bourgeois, B. Escoffier and V. Th. Paschos. ROADEF 2008, Clermont-Ferrand
	Quelques aspects algorithmiques du raisonnement sur les préférences unimodales, B. Escoffier, J. Lang and M. Öztürk. RFIA 2008, Amiens
	Réoptimisation: le cas de l'arbre de Steiner, B. Escoffier, M. Milanic and V. Th. Paschos. ROADEF 2007, Grenoble
	Complexité au pire des cas pour 3-Dominating Set, F. Della Croce, B. Escoffier and V. Th. Paschos. ROADEF 2006, Lille
	Complétude dans les classes d’approximation, B. Escoffier and V. Th. Paschos. ROADEF 2006, Lille
	Complexité du problème de coloration pondérée dans des classes de graphes triangulés, B. Escoffier, J. Monnot and V. Th. Paschos, ROADEF 2005, Tours
	Versions on-line du problème du stable max, B. Escoffier and V. Th. Paschos, Majecstic 2003, Marseille
	Etude de versions on-line du problème du stable max dans un graphe, B. Escoffier and V. Th. Paschos, ROADEF 2003, Avignon
	On-line journals
	Versions on-line du problème du stable max, B. Escoffier V. Th. Paschos, special issue of conference Majecstic 2003, available at http://isdm.univ-tln.fr/articles/num_archives.htm#isdm13
	PhD. Thesis
	Approximation polynomiale : aspects structurels et opérationnels, PhD. thesis, defended on Novembre 4th, 2005. A summary of this thesis has been published in 4OR 5(2): 161-164 (2007).