Going (back) to the home page

B. Escoffier, L.G., J. Monnot, Fair solutions for some multiagent optimization problems, to appear in Journal of Autonomous Agents and Multi-Agent Systems, Springer.

C. Bazgan, L.G., J. Monnot, Approximation with a fixed number of solutions of some biobjective maximization problems, WAOA 2011, Springer LNCS, 2011.

C. Bazgan, L.G., J. Monnot, F. Pascual, Single approximation for Multiobjective Max TSP, WAOA 2011, Springer LNCS, 2011.

C. Bazgan, L.G., J. Monnot, F. Pascual, On the approximation of multiple criteria Max-TSP, MCDM 2011, extended abstract of the WAOA2011's paper.

B. Escoffier, L. G., Nguyen Kim Thang, Fanny Pascual, Olivier Spanjaard, Strategy-proof Mechanisms for Facility Location Games with Many Facilities, ADT , Springer LNCS, 2011.

B. Escoffier, L. G., J. Monnot, The price of optimum in a matching game, SAGT , Springer LNCS, 2011.

B. Escoffier, L. G., J. Monnot, On the impact of local taxes in a set cover game, SIROCCO , Springer LNCS 6058, 2-13, 2010.

B. Escoffier, L. G., J. Monnot, Strategic coloring of a graph, CIAC , Springer LNCS 6078, 155-166, 2010.

L. G., J. Monnot, The Max k-Cut Game and its Strong Equilibria, TAMC, Springer LNCS 6108, 234-246, 2010.

L. G., A. Lyra, C. Martinhon, J. Monnot, Complexity of paths, trails and circuits in arc-colored digraphs, TAMC, Springer LNCS 6108, 222-233, 2010.

B. Escoffier, L. G., J. Monnot, O. Spanjaard, Two-stage stochastic matching and spanning tree problems: polynomial instances and approximation, EJOR, Volume 205, Issue 1, Pages 19-30.

H. Chatti, L. G., J. Monnot, The labeled vehicule routing problem, SOFSEM, Springer LNCS 5901, 271-282, 2010.

L. G., J. Monnot, On Strong Equilibria in the Max Cut Game , WINE, Springer LNCS 5929, 608-615, 2009.

L. G., J. Monnot, O. Telelis, Selfish Scheduling with Setup Times , WINE, Springer LNCS 5929, 292-303, 2009.

L. G., A. Lyra, C. Martinhon, J. Monnot, F. Protti, On s-t paths and trails in edge-colored graphs , LAGOS, 2009.

L. G., A. Lyra, C. Martinhon, J. Monnot, The minimum reload s-t path/trail/walk problems, SOFSEM, Springer LNCS 5404, 621-632, 2009. Extended version accepted for publication in Discrete Applied Mathematics

L. G., J. Monnot, Three selfish spanning tree games, WINE, Springer LNCS 5385, 465-476, 2008.

B. Couetoux, L. G., J. Monnot, O. Telelis, On Labeled Traveling Salesman Problems, ISAAC, Springer LNCS 5369, 776-787, 2008. Extended version accepted for publication in Discrete Optimization

L. G., J. Monnot, F. Pascual, Cooperation in multiorganization matching, WAOA, Springer LNCS 5426, 78-91, 2008.

E. Angel, E. Bampis, L. G., On the Minimum Hitting Set of Bundles Problem, AAIM, Springer LNCS 5034, 3-14, 2008. Also available in TCS.

A. Giannakos, L. G., J. Monnot, V. Th. Paschos, On the Performance of Congestion Games for Optimum Satisfiability Problems, WINE, Springer LNCS 4858, 220-231, 2007.

G. Christodoulou, L. G., F. Pascual, Scheduling Selfish Tasks: About the Performance of Truthful Algorithms, COCOON , Springer LNCS 4598, 187-197, 2007.

B. Escoffier, L. G., J. Monnot, Complexity and approximation results for the connected vertex cover problem, WG, Springer LNCS 4769, 202-213, 2007. Also available in JDA.

E. Angel, E. Bampis, L. G., J. Monnot, Approximation of Multicriteria Min and Max TSP(1,2), in Combinatorial Optimization and Computer Science: Interfaces and Perspectives, V. Th. Paschos Ed., Wiley, 2008.

E. Angel, E. Bampis, L. G., Approximation in Multiobjective Problems, in Handbook of Approximation Algorithms and Metaheuristics, T. Gonzalez Ed., Chapman & Hall, 2007.

E. Angel, E. Bampis, L. G., Approximation polynomiale avec garantie de performance pour l'optimisation multicritere (in french), in Optimisation Combinatoire : Problemes paradigmatiques et nouvelles problematiques, V. Paschos Ed., Hermes, 2007.

E. Angel, E. Bampis, L. G., L. Blin, Fair cost sharing methods for the minimum spanning tree game, Information Processing Letters, vol 100(1), pp 29-35, 2006.

E. Angel, E. Bampis, L. G., Approximation Algorithms for the bicriteria MAX-CUT problem, WG, Springer LNCS 3787, 331-340, 2005. Also available in Discrete Applied Mathematics, vol 154(12), pp. 1685-1692.

E. Angel, E. Bampis, L. G., J. Monnot, (Non)-Approximability for the multicriteria TSP(1,2), FCT, Springer LNCS 3623, 329-340, 2005.

E. Angel, E. Bampis, L. G., Approximation results for a bicriterion scheduling problem on a single machine without preemption, Information Processing Letters, 94(1), 19-27, 2005.

E. Angel, E. Bampis, L. G., Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem, FCT, Springer LNCS 2751, 39-48, 2003. Also available in Theoretical Computer Science, vol 310, pp. 135-146.

E. Angel, E. Bampis, L. G., A dynasearch neighborhood for the traveling salesman problem, MOMH, November 4-5, Carré des Sciences, Paris, 2002. Available in Metaheuristics for Multiobjective Optimisation, X. Gandibleux, M. Sevaux, K. Sorensen and V. T'kindt Eds., Springer LNEMS 535.