International Conferences

• M. Demange, J. Monnot P. Pop and B. Ries, Selective Graph Coloring in Some Special Classes of Graphs, ISCO 12, LNCS, 2012. (to appear). (preliminary version).
• N. Boria, J. Monnot and V. Paschos, Reoptimization of maximum induced hereditary subgraph problem, LATIN 12, LNCS, 2012. (to appear). (preliminary version).
• N. Boria, J. Monnot and V. Paschos, Reopitimization of the maximum weight Pk-free subgraph under vertex insertion, Proc. WALCOM 12, LNCS, 2012. (to appear). (preliminary version).
• C. Bazgan, L. Gourvès, J. Monnot and F. Pascual, Single approximation for Biobjective Max TSP , Proc. WACOA 11, LNCS , 2012. (to appear). (preliminary version).
• C. Bazgan,L. Gourvès, and J. Monnot, Approximation with a fixed number of solutions of some biojective maximization problems, Proc. WAOA 11, LNCS, 2011. (to appear). (preliminary version).
• B. Escoffier, L.Gourvès, and J. Monnot, The Price of Optimum in a Matching Game, Proc. SAGT 11, LNCS 6982, p: 81-92 , 2011. (preliminary version).
• Y. Chevaleyre, J. Lang, N. Maudet, and J. Monnot, Compilation and communication protocols for voting rules with a dynamic set of candidates, Proc. TARK, p: 153-160 , 2011. (preliminary version).
• L. Xia, J. Lang, and J. Monnot, Possible Winners When New Alternatives Join : New Results Coming Up!, In Proceedings of the 10th international Conference on Autonomous Agents and Multiagent Systems, IFAAMAS, p:829-836 , 2011. (preliminary version).
• L. Alfandari, and J. Monnot,Approximation of the Clustered Set Covering Problem, Proc. ISCO 10, Electronic Notes in Discrete Mathematics, 36(1), p: 479-485, 2010. (preliminary version).
• Y. Chevaleyre, J. Lang, N. Maudet, and J. Monnot, Possible winners when news candidates are added: the case of scoring rules, Proc. of the 24th AAAI Conference on Artificial Intelligence (AAAI-2010), 2010. (preliminary version).
• L. Gourvès, A. Lyra, C. Martinhon, and J. Monnot, Complexity of paths, trails and circuits in arc-colored digraphs, Proc. TAMC 10, LNCS 6108, p: 222-233, 2010. (preliminary version).
• L. Gourvès, and J. Monnot, The Max k-Cut Game and its Strong Equilibria, Proc. TAMC 10, LNCS 6108, P: 234-246, 2010. (preliminary version).
• B. Escoffier, L. Gourvès, and J. Monnot, On the impact of local taxes in a set cover game, Proc. SIROCCO 10, LNCS 6058, p: 2-13, 2010. (preliminary version).
• B. Escoffier, L. Gourvès, and J. Monnot, Strategic Coloring of a Graph, Proc. CIAC 10, LNCS 6078, p: 155-166, 2010. (preliminary version).
• H. Chatti, L. Gourvès, and J. Monnot, On a Labeled Vehicle Routing Problem, Proc. SOFSEM 10, LNCS 5901, p: 271-282, 2010. (preliminary version).
• M. Milanic, and J. Monnot, The Exact Weighted Independent Set Problem in Perfect Graphs, Proc. LAGOS 09, Electronic Notes in discrete Mathematics, 35, p: 271-282, 2009. (preliminary version).
• L. Gourvès, A. Lyra, C. Martinhon, and J. Monnot, On s-t paths and trails in edge-colored graphs, Proc. LAGOS 09, Electronic Notes in Discrete Mathematics, 35, p: 221-226, 2009. (preliminary version).
• L. Gourvès, and J. Monnot, On strong equilibria in the Max Cut Games, Proc. WINE 09, LNCS 5929, p: 608-615, 2009. (preliminary version).
• L. Gourvès, J. Monnot and O. Telelis, Selfish Scheduling with Setup times, Proc. WINE 09, LNCS 5929, p: 292-303, 2009. (preliminary version).
• L. Gourvès, A. Lyra, C. Martinhon, et J. Monnot, The minimum reload s - t path/trail/walk problems, Proc. SOFSEM. 09, LNCS 5404, p: 621-632, 2009. (preliminary version).
• L. Gourvès, and J. Monnot, Three selfish spanning tree games, Proc. WINE 08, LNCS 5385, p: 465-476, 2008. (preliminary version).
• B. Couetoux, L. Gourvès, J. Monnot, and O. Telelis, On Labeled Traveling Salesman Problems, Proc. ISAAC 08, LNCS 5369, p: 776-787, 2008. (preliminary version).
• L. Gourvès, J. Monnot, and F. Pascual, Cooperation in multiorganization matching, Proc. WAOA 08, LNCS 5426, p: 78-91, 2008. (preliminary version).
• B. Escoffier, J. Monnot, and O. Spanjaard, Some tractable instances of interval data minmax regret problems: bounded distance from triviality, Proc. SOFSEM 08, LNCS 4910, p: 280-291, 2008. (preliminary version).
• A. Giannakos, L. Gourvès, J. Monnot, and V. Th. Paschos, On the performance of congestion games for optimum satisfiability problems, Proc. WINE 07, LNCS 4858, p: 220-231, 2007. (preliminary version).
• B. Escoffier, L. Gourvès, and J. Monnot, Complexity and approximation results for the connected vertex cover problem,Proc. WG 07, LNCS 4769, p: 202-213, 2007. (preliminary version).
• R. Hassin, J. Monnot, and D. Segev, The Complexity of Bottleneck Labeled Graph Problems, Proc. WG 07, LNCS 4769, p: 328-340, 2007. (preliminary version).
• J. Monnot, and S. Toulouse, The Pk partition problem and related problems in bipartite graphs, Proc. SOFSEM 07, LNCS 4362: 422-433, 2007. (preliminary version).
• R. Hassin, J. Monnot, and D. Segev, Approximation Algorithms and Hardness Results for Labeled Connectivity Problems, Proc. MFCS 06, LNCS 4162, p: 480-491, 2006.(preliminary version).
• G. Ausiello, B. Escoffier, J. Monnot, and V. Th. Paschos, Reoptimization of minimum and maximum traveling salesman's tours, Proc. SWAT 06, LNCS 4059, p:196-207, 2006. (preliminary version).
• J. Monnot, and S. Toulouse, The complexity of the Pk partition problem and related problems in bipartite graphs, AACC 05 (Asian Applied Computing Conference), Imperial college Press, 2005. (preliminary version).
• J. Monnot, and S. Toulouse, Complexity of Pk packing problems in bipartite graphs, Proc. ALIO/EURO 05, 2005. Applied Computing Con (preliminary version).
• J. Monnot, On complexity and approximability of the Labeled maximum/perfect matching problems, Proc. ISAAC 05, LNCS 3827, p: 934-943, 2005. (preliminary version).
• B. Escoffier, J. Monnot, and V. Th. Paschos, Weighted coloring: further complexity and approximability results, Proc. ICTCS 05, LNCS 3701, p: 205-214, 2005. (preliminary version).
• E. Angel, E. Bampis, L. Gourvès, and J. Monnot,(Non)-Approximability for the multi-criteria TSP(1,2 ), Proc. FCT 05, LNCS 3623, p:318-329, 2005. (preliminary version).
• J. Monnot, and S. Toulouse, Approximation results for the weighted P4 partition problems, Proc. FCT 05, LNCS 3623, p: 377-385, 2005. (preliminary version).
• C. Bazgan, J. Monnot, V. Th. Paschos, and F. Serrière,Greedy differential approximations for min set cover, Proc. SOFSEM 05, LNCS 3381, p: 62-71, 2005. (preliminary version).
• L. Alfandari, M. Demange, and J. Monnot, Integral inverse Optimization Problems , EURO XX (Conference on Operational Research), 2004. (preliminary version).
• D. de Werra, M. Demange, B. Escoffier, J. Monnot, and V. Th. Paschos, Weighted coloring on planar, bipartite and split graphs: complexity and improved approximation, Proc. ISAAC 04, LNCS 3341, p: 896-907, 2004. (preliminary version).
• D. De Werra, M. Demange, J.Monnot, and V. Th. Paschos, The Hypocoloring problem: complexity and approximability when the chromatic number is small, Proc. WG 04, LNCS 3353, p:377-388, 2004. (preliminary version).
• C. Bazgan, R. Hassin, and J. Monnot, Differential approximation for some routing problems, Proc. CIAC 03, LNCS 2653, p: 277-288, 2003. (preliminary version).
• D. de Werra, M. Demange, J. Monnot, and V. Th. Paschos, Weighted node coloring: when stable sets are expensive, Proc. WG 02, LNCS 2573, p: 114-125, 2002. (preliminary version).
• J. Monnot, V. Th. Paschos, and S. Toulouse, Differential approximation results for traveling salesman problem with distance 1 and 2, Proc. FCT 01, LNCS 2138, p: 275-286, 2001.(preliminary version).

International Journal

• Y. Chevaleyre, J. Lang, N. Maudet, J. Monnot, and L. Xia, New candidates welcome! Possible winners with respect to the addiction of new candidates, Mathematical Social Sciences (accepted), 2011. (preliminary version).
• B. Escoffier, L. Gourvès, and J. Monnot, Fair solutions for some multiagent optimization problems, JAAMAS, (accepted) 2001. (preliminary version).
• L. Alfandari, and J. Monnot, A note on the Clustered Set Covering Problem, DAM, (accepted) 2011. (preliminary version).
• E. Fritzilas, M. Milanic, J. Monnot, and A. Rios-Solis, Resilience and optimization of identifiable bipartite graphs, DAM, (accepted) 2011. (preliminary version).
• R. Hassin, J. Monnot, and D. Segev, The Complexity of bottleneck Labeled graph problems, Algorithmica, 58(2), 245-262, 2010. (preliminary version).
• B. Escoffier, L. Gourvès, J. Monnot, and O. Spanjaard, The two-stage stochastic matching and spanning tree problems: polynomial instances and approximation algorithms, European Journal of Operational Research, 205(1), 19-30, 2010. (preliminary version).
• B. Couëtoux, L. Gourvès, J. Monnot, and O. Telelis, On labeled Traveling Salesman Problems, Discrete Optimization, 7(2), 74-85, 2010. (preliminary version).
• L. Gourvès, A. Lyra, C. Martinhon, and J. Monnot, The minimum reload s-t path/trail/walk problems, Discrete Applied Mathematics, 158(13), 1404-1417, 2010. (preliminary version).
• B. Escoffier, L. Gourvès, and J. Monnot, Complexity and approximation for the connected vertex cover problem in graphs and hypergraphs, Journal of Discrete Algorithms, 8(1), 36-49, 2010. (preliminary version).
• G. Ausiello, B. Escoffier, J. Monnot, and V. Th. Paschos, Reoptimization of minimum and maximum traveling salesman's tours, Journal of Discrete Algorithms, 7(4), 453-463, 2009. (preliminary version).
• D. De Werra, M. Demange, B. Escoffier, J. Monnot, and V. Th. Paschos, Weighted coloring on planar, bipartite and split graphs: complexity and improved approximation, Discrete Applied Mathematics, 157(4), 819-832, 2009. (preliminary version).
• B. Escoffier, J. Monnot, and O. Spanjaard, Some tractable instances of interval data minmax regret problems, Operations Research Letters, 36, 424-429, 2008. (preliminary version).
• J. Monnot, and S. Toulouse, Approximation results for the weighted P4 partition problems, Journal od Discrete Algorithms, 6(2), 299-312, 2008. (preliminary version).
• B. Escoffier, and J. Monnot, Better differential approximation for symmetric TSP, Theoretical Computer Science, 396, p: 63-70, 2008. (preliminary version).
• R. Hassin, J. Monnot, and D. Segev, Approximation Algorithms and Hardness Results for Labeled Connectivity Problems, Journal of Combinatorial Optimization, 14(4), p: 437-453, 2007. (preliminary version).
• J. Monnot and S. Toulouse, The path partition problem and related problems in bipartite graphs, Operations Research Letters, 35, p : 677-684, 2007. (preliminary version).
• D. de Werra, M. Demange, J. Monnot, and V. Th. Paschos, Time slot scheduling of compatible jobs, Journal of Scheduling, 10(2), p: 111-127, 2007. (preliminary version).
• J. Monnot, A note on the NP-completeness of the precoloring extension coloring problem in triangle free planar graphs, Foundations of Computing and Decision Sciences, 31, p : 169-173, 2006. (preliminary version).
• B. Escoffier, J. Monnot, and V. Th. Paschos, Weighted coloring: further: complexity and approximability results, Information Processing Letters, 97, 98-103, 2006. (preliminary version).
• J. Monnot, A simple approximation algorithm for WIS based on the approximability in k-partite graphs, European Journal of Operational Research, 171, 346-348, 2006. (preliminary version).
• J. Monnot, The Labeled perfect matching in bipartite graphs, Information Processing Letters, 96, 81-88, 2005. (preliminary version).
• C. Bazgan, J. Monnot, V. Th. Paschos, and F. Serrière, Differential approximations for min set cover Theoretical Computer Science, 332, 497-513, 2005. (preliminary version).
• R. Hassin and J. Monnot, The maximum saving partition problem, Operations Research Letters, 33, 242-248, 2005. (preliminary version).
• C. Bazgan, R. Hassin, and J. Monnot, Appoximation algorithms for some routing problems, Discrete Applied Mathematics, 146, 3-26, 2005. (preliminary version).
• D. De Werra, M. Demange, J. Monnot, and V. Th. Paschos, A hypocoloring model for batch scheduling, Discrete Applied Mathematics, 146, 27-42, 2005. (preliminary version).
• J. Monnot, Approximation algorithms for the the maximum Hamiltonian path problem with specified endpoint(s), European Journal of Operational Research, 161, 721-735, 2005. (preliminary version).
• J. Monnot, V. Th. Paschos, and S. Toulouse, Local approximation for maximum H₀-partial subgraph problems, Operations Research Letters, 32(3), 217-224, 2004. (preliminary version).
• T. Bruggemann, J. Monnot, and G. J. Woeginger, Local search for the minimum label spanning tree problem with bounded color classes, Operations Research Letter, 31(3), 195-201, 2003. (preliminary version).
• J. Monnot and O. Spanjaard, Bottleneck shortest path on a partially ordered scale, 4OR, 1(3), 225-241, 2003. (preliminary version).
• M. Demange, J. Monnot, and V. Th. Paschos, Differential approximation results for Steiner tree problem, Applied Mathematics Letters, 16, 733-739, 2003. (preliminary version).
• J. Monnot, V. Th. Paschos, and S. Toulouse, Differential approximation results for traveling salesman problem with distance 1 and 2, European Journal of Operational Research, 145(3), 537-548, 2003. (preliminary version).
• J. Monnot, Differential approximation results for the Traveling Salesman and related problems, Information Processing Letters, 82(5), 229-235, 2002. (preliminary version).
• J. Monnot, Approximation results toward Nearest Neighbor heuristic, Yugoslav Journal of Operations Research, 12(1), 11-16, 2002. (paper).
• J. Monnot, V. Th. Paschos, and S. Toulouse, Approximation algorithms for the traveling salesman problem, Mathematical Models of Operations Research, 56, 387-405, 2002. (preliminary version).
• J. Monnot, The maximum f-depth Spanning tree problem, Information Processing Letters, 80(4), 179-187, 2001. (preliminary version).
• M. Demange, J. Monnot, and V. Th. Paschos, Maximizing the number of unused bins, Foundations of Computing and Decision Sciences, 26(2), 169-186, 2001. (preliminary version).
• M. Demange, J. Monnot, and V. Th. Paschos, Bridging gap between standard and differential polynomial approximation : the case of bin-packing, Applied Mathematics Letters 12, 127-133, 1999. (preliminary version).

National Journal

• J. Monnot, A note on the hardness results for the labeled perfect matching problems in bibartite graphs, RAIRO–Operations Research 42(3), 315-324, 2008. (preliminary version).
• J. Monnot, V. Th. Paschos, and S. Toulouse, Optima locaux garantis pour l'approximation différentielle, Technique et Science Informatiques, 22(3), 257-288, 2003. (preliminary version).
• J. Monnot, Differential approximation of NP–hard problems with constant size feasible, Technique et Science Informatiques, 22(3), 257-288, 2003. (preliminary version).

Book Chapter

• L. Gourvès, J. Monnot, and O.Telelis, strategic Scheduling Games : Equilibria and Efficiency, Chapter 10 of Just-in-Time Systems, p: 209-244, R. Z. Ryos-Mercado and Y. A. Ryos-Solys (eds.), Springer Optimization and Its Applications, 60, 2011. (preliminary version).
• M. Milanic, and J. Monnot, The complexity of the exact weighted independent set, Chapter 16 of Combinatorial Optimization – Theoretical Computer Science : Interfaces and Perspectives, Wiley-ISTE, p: 393-432, 2008. (preliminary version).
• M. Milanic, and J. Monnot, The complexity of the exact weighted independent set, Chapter 16 of Combinatorial Optimization – Theoretical Computer Science : Interfaces and Perspectives, Wiley-ISTE, p: 393-432, 2008. (preliminary version).
• J. Monnot, and S. Toulouse, Bounded-size path packing problems, Chapter 18 of Combinatorial Optimization – Theoretical Computer Science : Interfaces and Perspectives, Wiley-ISTE, p: 455-498, 2008. (preliminary version).
• J. Monnot, The Labeled perfect matching in bipartite graphs: complexity and (in)approximability, Chapter 17 of Combinatorial Optimization – Theoretical Computer Science : Interfaces and Perspectives, Wiley-ISTE, p: 433-454, 2008. (preliminary version).
• M. Demange, B. Escoffier, G. Lucarelli, I. Milis, J. Monnot, V. Th. Paschos, and D. de Werra, Weighted Edge Coloring, Chapter 11 of Combinatorial Optimization – Theoretical Computer Science : Interfaces and Perspectives, Wiley-ISTE, p: 291-318, 2008. (preliminary version).
• M. Demange, B. Escoffier, J. Monnot, V. Th. Paschos, and D. de Werra, Complexity and approximation results for the Min Weighted Node Coloring problem, Chapter 10 of Combinatorial Optimization – Theoretical Computer Science : Interfaces and Perspectives, Wiley-ISTE, p: 259-290, 2008. (preliminary version).
• E. Angel, E. Bampis, L. Gourvès, and J. Monnot, Approximation of Multi-criteria Min and Max TSP(1,2 ), Chapter 2 of Combinatorial Optimization – Theoretical Computer Science : Interfaces and Perspectives, Wiley-ISTE, p: 37-70, 2008.(preliminary version).
• J. Monnot, and S. Toulouse, Le voyageur de commerce et ses variations : un tour d'horizon de ses résolutions, Chapitre 2 du Livre Optimization Combinatoire, Volume V, Hermès, p:51-94, 2007. (preliminary version).
• M. Demange, and J. Monnot, Une introduction aux problèmes combinatoires inverses, Chapitre 5 du Livre Optimisation Combinatoire volume II concepts avancés, Hermès, p:181-220, 2005. (preliminary version).

Book

• J. Monnot, V. Th. Paschos, and S. Toulouse, Approximation polynomiale des problèmes NP-difficiles : optima locaux et rapport différentiel , Informatique et Systèmes d'Information, Hermès, Paris, 2003 (in French). (link).

Thesis

• J. Monnot. Approximation polynomiale : du rapport standard au rapport différentiel, PhD thesis, Habilitation à diriger les recherches, Université Paris-Dauphine, 2003 (in French). (habilitationPhd).
• J. Monnot. Familles d’instances critiques et approximation polynomiale, PhD thesis, Université Paris-Dauphine, 1998 (in French). (Phd).