Jérôme Monnot

162 papers A* 5A 6B 33C 18Journal 86Unranked 14

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	On a Simple Hedonic Game with Graph-Restricted Communication. J. Artif. Intell. Res. Vittorio Bilò, Laurent Gourvès, Jérôme Monnot
2023	J	`jnl`	Extension of some edge graph problems: Standard, parameterized and approximation complexity. Discret. Appl. Math. Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
2023	J	`jnl`	Project games. Theor. Comput. Sci. Vittorio Bilò, Laurent Gourvès, Jérôme Monnot
2022	J	`jnl`	Complexity and algorithms for constant diameter augmentation problems. Theor. Comput. Sci. Eun Jung Kim, Martin Milanic, Jérôme Monnot, Christophe Picouleau
2022	J	`jnl`	Extension and its price for the connected vertex cover problem. Theor. Comput. Sci. Mehdi Khosravian Ghadikolaei, Nikolaos Melissinos, Jérôme Monnot, Aris Pagourtzis
2022	J	`jnl`	On the complexity of solution extension of optimization problems. Theor. Comput. Sci. Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
2021	C	`conf`	Abundant Extensions. CIAC Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
2021	J	`jnl`	Algorithmic aspects of upper edge domination. Theor. Comput. Sci. Jérôme Monnot, Henning Fernau, David F. Manlove
2021	J	`jnl`	Strong cliques in diamond-free graphs. Theor. Comput. Sci. Nina Chiarelli, Berenice Martínez-Barona, Martin Milanic, Jérôme Monnot, Peter Mursic
2021	C	`conf`	The Maximum Duo-Preservation String Mapping Problem with Bounded Alphabet. WABI Nicolas Boria, Laurent Gourvès, Vangelis Th. Paschos, Jérôme Monnot
2020	J	`jnl`	Computing and testing Pareto optimal committees. Auton. Agents Multi Agent Syst. Haris Aziz, Jérôme Monnot
2020	J	`jnl`	Maximum independent sets in subcubic graphs: New results. Theor. Comput. Sci. Ararat Harutyunyan, Michael Lampis, Vadim V. Lozin, Jérôme Monnot
2020	—	`conf`	On the Complexity of the Upper r-Tolerant Edge Cover Problem. TTCS Ararat Harutyunyan, Mehdi Khosravian Ghadikolaei, Nikolaos Melissinos, Jérôme Monnot, Aris Pagourtzis
2020	B	`conf`	Strong Cliques in Diamond-Free Graphs. WG Nina Chiarelli, Berenice Martínez-Barona, Martin Milanic, Jérôme Monnot, Peter Mursic
2020	J	`jnl`	Weighted Upper Edge Cover: Complexity and Approximability. J. Graph Algorithms Appl. Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
2019	J	`jnl`	Complexity and approximability of extended Spanning Star Forest problems in general and complete graphs. Theor. Comput. Sci. Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Dirk Oliver Theis
2019	B	`conf`	Correction to: Weighted Upper Edge Cover: Complexity and Approximability. WALCOM Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
2019	J	`jnl`	Efficient reallocation under additive and responsive preferences. Theor. Comput. Sci. Haris Aziz, Péter Biró, Jérôme Lang, Julien Lesca, Jérôme Monnot
2019	C	`conf`	Extension and Its Price for the Connected Vertex Cover Problem. IWOCA Mehdi Khosravian Ghadikolaei, Nikolaos Melissinos, Jérôme Monnot, Aris Pagourtzis
2019	B	`conf`	Extension of Some Edge Graph Problems: Standard and Parameterized Complexity. FCT Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
2019	C	`conf`	Extension of Vertex Cover and Independent Set in Some Classes of Graphs. CIAC Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
2019	B	`conf`	Maximum Independent Sets in Subcubic Graphs: New Results. WG Ararat Harutyunyan, Michael Lampis, Vadim V. Lozin, Jérôme Monnot
2019	B	`conf`	On a Simple Hedonic Game with Graph-Restricted Communication. SAGT Vittorio Bilò, Laurent Gourvès, Jérôme Monnot
2019	J	`jnl`	On maximin share allocations in matroids. Theor. Comput. Sci. Laurent Gourvès, Jérôme Monnot
2019	C	`conf`	Project Games. CIAC Vittorio Bilò, Laurent Gourvès, Jérôme Monnot
2019	B	`conf`	Weighted Upper Edge Cover: Complexity and Approximability. WALCOM Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
2018	J	`jnl`	Computing and Testing Pareto Optimal Committees. CoRR Haris Aziz, Jérôme Lang, Jérôme Monnot
2018	J	`jnl`	Extension of vertex cover and independent set in some classes of graphs and generalizations. CoRR Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
2018	J	`jnl`	Maximum Independent Sets in Subcubic Graphs: New Results. CoRR Ararat Harutyunyan, Michael Lampis, Vadim V. Lozin, Jérôme Monnot
2018	J	`jnl`	On the Complexity of Solution Extension of Optimization Problems. CoRR Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
2018	J	`jnl`	Subset sum problems with digraph constraints. J. Comb. Optim. Laurent Gourvès, Jérôme Monnot, Lydia Tlilane
2018	J	`jnl`	The many facets of upper domination. Theor. Comput. Sci. Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos
2018	J	`jnl`	Upper Domination: Towards a Dichotomy Through Boundary Properties. Algorithmica Hassan AbouEisha, Shahid Hussain, Vadim V. Lozin, Jérôme Monnot, Bernard Ries, Viktor Zamaraev
2018	J	`jnl`	Weighted Upper Edge Cover: Complexity and Approximability. CoRR Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
2017	C	`conf`	Approximate Maximin Share Allocations in Matroids. CIAC Laurent Gourvès, Jérôme Monnot
2017	A	`conf`	Beyond Electing and Ranking: Collective Dominating Chains, Dominating Subsets and Dichotomies. AAMAS Jérôme Lang, Jérôme Monnot, Arkadii Slinko, William S. Zwicker
2017	J	`jnl`	Bi-objective matchings with the triangle inequality. Theor. Comput. Sci. Laurent Gourvès, Jérôme Monnot, Fanny Pascual, Daniel Vanderpooten
2017	—	`conf`	Extended Spanning Star Forest Problems. COCOA (1) Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Dirk Oliver Theis
2017	B	`conf`	Selfish Transportation Games. SOFSEM Dimitris Fotakis, Laurent Gourvès, Jérôme Monnot
2017	J	`jnl`	The Price of Optimum: Complexity and Approximation for a Matching Game. Algorithmica Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
2017	J	`jnl`	Weighted upper domination number. Electron. Notes Discret. Math. Arman Boyaci, Jérôme Monnot
2016	C	`conf`	A Boundary Property for Upper Domination. IWOCA Hassan AbouEisha, Shahid Hussain, Vadim V. Lozin, Jérôme Monnot, Bernard Ries, Victor Zamaraev
2016	A*	`conf`	Achieving Proportional Representation in Conference Programs. IJCAI Ioannis Caragiannis, Laurent Gourvès, Jérôme Monnot
2016	C	`conf`	Algorithmic Aspects of Upper Domination: A Parameterised Perspective. AAIM Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos
2016	A*	`conf`	Computing Pareto Optimal Committees. IJCAI Haris Aziz, Jérôme Lang, Jérôme Monnot
2016	—	`conf`	Conference Program Design with Single-Peaked and Single-Crossing Preferences. WINE Dimitris Fotakis, Laurent Gourvès, Jérôme Monnot
2016	A*	`conf`	How Hard Is It for a Party to Nominate an Election Winner?. IJCAI Piotr Faliszewski, Laurent Gourvès, Jérôme Lang, Julien Lesca, Jérôme Monnot
2016	A	`conf`	Optimal Reallocation under Additive and Ordinal Preferences. AAMAS Haris Aziz, Péter Biró, Jérôme Lang, Julien Lesca, Jérôme Monnot
2016	J	`jnl`	Optimal Reallocation under Additive and Ordinal Preferences. CoRR Haris Aziz, Péter Biró, Jérôme Lang, Julien Lesca, Jérôme Monnot
2016	J	`jnl`	Subset Sum Problems With Digraph Constraints. CoRR Laurent Gourvès, Jérôme Monnot, Lydia Tlilane
2016	C	`conf`	Upper Domination: Complexity and Approximation. IWOCA Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos
2016	J	`jnl`	Upper Domination: towards a dichotomy through boundary properties. CoRR Hassan AbouEisha, Shahid Hussain, Vadim V. Lozin, Jérôme Monnot, Bernard Ries, Victor Zamaraev
2015	J	`jnl`	A note on the traveling salesman reoptimization problem under vertex insertion. Inf. Process. Lett. Jérôme Monnot
2015	J	`jnl`	Algorithmic Aspects of Upper Domination. CoRR Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos
2015	J	`jnl`	Approximate tradeoffs on weighted labeled matroids. Discret. Appl. Math. Laurent Gourvès, Jérôme Monnot, Lydia Tlilane
2015	J	`jnl`	Congestion Games with Capacitated Resources. Theory Comput. Syst. Laurent Gourvès, Jérôme Monnot, Stefano Moretti, Kim Thang Nguyen
2015	J	`jnl`	New Results on Polynomial Inapproximabilityand Fixed Parameter Approximability of Edge Dominating Set. Theory Comput. Syst. Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos, Mingyu Xiao
2015	J	`jnl`	On the maximum independent set problem in subclasses of subcubic graphs. J. Discrete Algorithms Vadim V. Lozin, Jérôme Monnot, Bernard Ries
2015	J	`jnl`	The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles. Theor. Comput. Sci. Luérbio Faria, Laurent Gourvès, Carlos A. J. Martinhon, Jérôme Monnot
2015	J	`jnl`	Worst case compromises in matroids with applications to the allocation of indivisible goods. Theor. Comput. Sci. Laurent Gourvès, Jérôme Monnot, Lydia Tlilane
2014	C	`conf`	A Dichotomy for Upper Domination in Monogenic Classes. COCOA Hassan AbouEisha, Shahid Hussain, Vadim V. Lozin, Jérôme Monnot, Bernard Ries
2014	J	`jnl`	A note on the Clustered Set Covering Problem. Discret. Appl. Math. Laurent Alfandari, Jérôme Monnot
2014	A	`conf`	Near Fairness in Matroids. ECAI Laurent Gourvès, Jérôme Monnot, Lydia Tlilane
2014	A	`conf`	On regular and approximately fair allocations of indivisible goods. AAMAS Diodato Ferraioli, Laurent Gourvès, Jérôme Monnot
2014	J	`jnl`	On the complexity of the selective graph coloring problem in some special classes of graphs. Theor. Comput. Sci. Marc Demange, Jérôme Monnot, Petrica C. Pop, Bernard Ries
2014	—	`conf`	The Lazy Matroid Problem. IFIP TCS Laurent Gourvès, Jérôme Monnot, Aris Pagourtzis
2013	A*	`conf`	A Matroid Approach to the Worst Case Allocation of Indivisible Goods. IJCAI Laurent Gourvès, Jérôme Monnot, Lydia Tlilane
2013	—	`conf`	A Protocol for Cutting Matroids Like Cakes. WINE Laurent Gourvès, Jérôme Monnot, Lydia Tlilane
2013	J	`jnl`	Approximation with a fixed number of solutions of some multiobjective maximization problems. J. Discrete Algorithms Cristina Bazgan, Laurent Gourvès, Jérôme Monnot
2013	J	`jnl`	Complexity of trails, paths and circuits in arc-colored digraphs. Discret. Appl. Math. Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot
2013	J	`jnl`	Fair solutions for some multiagent optimization problems. Auton. Agents Multi Agent Syst. Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
2013	C	`conf`	On the Maximum Independent Set Problem in Subclasses of Subcubic Graphs. IWOCA Vadim V. Lozin, Jérôme Monnot, Bernard Ries
2013	—	`conf`	Possible Winners in Approval Voting. ADT Nathanaël Barrot, Laurent Gourvès, Jérôme Lang, Jérôme Monnot, Bernard Ries
2013	J	`jnl`	Reoptimization of maximum weight induced hereditary subgraph problems. Theor. Comput. Sci. Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos
2013	J	`jnl`	Reoptimization under Vertex Insertion: Max P Discret. Math. Algorithms Appl. Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos
2013	J	`jnl`	Resilience and optimization of identifiable bipartite graphs. Discret. Appl. Math. Epameinondas Fritzilas, Martin Milanic, Jérôme Monnot, Yasmín Á. Ríos-Solís
2013	J	`jnl`	Single approximation for the biobjective Max TSP. Theor. Comput. Sci. Cristina Bazgan, Laurent Gourvès, Jérôme Monnot, Fanny Pascual
2013	B	`conf`	The Lazy Bureaucrat Problem with Common Arrivals and Deadlines: Approximation and Mechanism Design. FCT Laurent Gourvès, Jérôme Monnot, Aris Pagourtzis
2013	C	`conf`	Truthful Many-to-Many Assignment with Private Weights. CIAC Bruno Escoffier, Jérôme Monnot, Fanny Pascual, Olivier Spanjaard
2012	A	`conf`	Approximate Tradeoffs on Matroids. ECAI Laurent Gourvès, Jérôme Monnot, Lydia Tlilane
2012	C	`conf`	Complexity Results for the Empire Problem in Collection of Stars. COCOA Basile Couëtoux, Jérôme Monnot, Sonia Toubaline
2012	B	`conf`	Congestion Games with Capacitated Resources. SAGT Laurent Gourvès, Jérôme Monnot, Stefano Moretti, Kim Thang Nguyen
2012	J	`jnl`	Cooperation in multiorganization matching. Algorithmic Oper. Res. Laurent Gourvès, Jérôme Monnot, Fanny Pascual
2012	—	`conf`	Cost allocation protocols for network formation on connection situations. VALUETOOLS Bruno Escoffier, Laurent Gourvès, Jérôme Monnot, Stefano Moretti
2012	B	`conf`	New Results on Polynomial Inapproximability and Fixed Parameter Approximability of edge dominating set. IPEC Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos, Mingyu Xiao
2012	J	`jnl`	New candidates welcome! Possible winners with respect to the addition of new candidates. Math. Soc. Sci. Yann Chevaleyre, Jérôme Lang, Nicolas Maudet, Jérôme Monnot, Lirong Xia
2012	J	`jnl`	On paths, trails and closed trails in edge-colored graphs. Discret. Math. Theor. Comput. Sci. Laurent Gourvès, Adria Ramos de Lyra, Carlos A. J. Martinhon, Jérôme Monnot
2012	B	`conf`	Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems. LATIN Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos
2012	B	`conf`	Reoptimization of the Maximum Weighted P k -Free Subgraph Problem under Vertex Insertion. WALCOM Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos
2012	C	`conf`	Selective Graph Coloring in Some Special Classes of Graphs. ISCO Marc Demange, Jérôme Monnot, Petrica C. Pop, Bernard Ries
2012	J	`jnl`	Strategic Coloring of a Graph. Internet Math. Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
2011	B	`conf`	Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems. WAOA Cristina Bazgan, Laurent Gourvès, Jérôme Monnot
2011	B	`conf`	Compilation and communication protocols for voting rules with a dynamic set of candidates. TARK Yann Chevaleyre, Jérôme Lang, Nicolas Maudet, Jérôme Monnot
2011	J	`jnl`	New Candidates Welcome! Possible Winners with respect to the Addition of New Candidates CoRR Yann Chevaleyre, Jérôme Lang, Nicolas Maudet, Jérôme Monnot, Lirong Xia
2011	A	`conf`	Possible winners when new alternatives join: new results coming up! AAMAS Lirong Xia, Jérôme Lang, Jérôme Monnot
2011	B	`conf`	Single Approximation for Biobjective Max TSP. WAOA Cristina Bazgan, Laurent Gourvès, Jérôme Monnot, Fanny Pascual
2011	B	`conf`	The Price of Optimum in a Matching Game. SAGT Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
2010	J	`jnl`	Approximation of the Clustered Set Covering Problem. Electron. Notes Discret. Math. Laurent Alfandari, Jérôme Monnot
2010	J	`jnl`	Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs. J. Discrete Algorithms Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
2010	C	`conf`	Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs. TAMC Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot
2010	J	`jnl`	Labeled Traveling Salesman Problems: Complexity and approximation. Discret. Optim. Basile Couëtoux, Laurent Gourvès, Jérôme Monnot, Orestis Telelis
2010	J	`jnl`	Minimum regulation of uncoordinated matchings CoRR Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
2010	B	`conf`	On a Labeled Vehicle Routing Problem. SOFSEM Hatem Chatti, Laurent Gourvès, Jérôme Monnot
2010	B	`conf`	On the Impact of Local Taxes in a Set Cover Game. SIROCCO Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
2010	A*	`conf`	Possible Winners when New Candidates Are Added: The Case of Scoring Rules. AAAI Yann Chevaleyre, Jérôme Lang, Nicolas Maudet, Jérôme Monnot
2010	C	`conf`	Strategic Coloring of a Graph. CIAC Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
2010	J	`jnl`	The Complexity of Bottleneck Labeled Graph Problems. Algorithmica Refael Hassin, Jérôme Monnot, Danny Segev
2010	C	`conf`	The Max TAMC Laurent Gourvès, Jérôme Monnot
2010	J	`jnl`	The minimum reload s-t path, trail and walk problems. Discret. Appl. Math. Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot
2010	J	`jnl`	Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation. Eur. J. Oper. Res. Bruno Escoffier, Laurent Gourvès, Jérôme Monnot, Olivier Spanjaard
2009	—	`conf`	On Strong Equilibria in the Max Cut Game. WINE Laurent Gourvès, Jérôme Monnot
2009	J	`jnl`	On s-t paths and trails in edge-colored graphs. Electron. Notes Discret. Math. Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot, Fábio Protti
2009	J	`jnl`	Reoptimization of minimum and maximum traveling salesman's tours. J. Discrete Algorithms Giorgio Ausiello, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos
2009	—	`conf`	Selfish Scheduling with Setup Times. WINE Laurent Gourvès, Jérôme Monnot, Orestis Telelis
2009	J	`jnl`	The Exact Weighted Independent Set Problem in Perfect Graphs and Related Classes. Electron. Notes Discret. Math. Martin Milanic, Jérôme Monnot
2009	B	`conf`	The Minimum Reload s-tPath/Trail/Walk Problems. SOFSEM Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot
2009	J	`jnl`	Weighted coloring on planar, bipartite and split graphs: Complexity and approximation. Discret. Appl. Math. Dominique de Werra, Marc Demange, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos
2008	J	`jnl`	A better differential approximation ratio for symmetric TSP. Theor. Comput. Sci. Bruno Escoffier, Jérôme Monnot
2008	J	`jnl`	A note on the hardness results for the labeled perfect matching problems in bipartite graphs. RAIRO Oper. Res. Jérôme Monnot
2008	J	`jnl`	Approximation results for the weighted P J. Discrete Algorithms Jérôme Monnot, Sophie Toulouse
2008	B	`conf`	Cooperation in Multiorganization Matching. WAOA Laurent Gourvès, Jérôme Monnot, Fanny Pascual
2008	B	`conf`	On Labeled Traveling Salesman Problems. ISAAC Basile Couëtoux, Laurent Gourvès, Jérôme Monnot, Orestis Telelis
2008	B	`conf`	Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality. SOFSEM Bruno Escoffier, Jérôme Monnot, Olivier Spanjaard
2008	J	`jnl`	Some tractable instances of interval data minmax regret problems. Oper. Res. Lett. Bruno Escoffier, Jérôme Monnot, Olivier Spanjaard
2008	—	`conf`	Three Selfish Spanning Tree Games. WINE Laurent Gourvès, Jérôme Monnot
2007	J	`jnl`	Approximation algorithms and hardness results for labeled connectivity problems. J. Comb. Optim. Refael Hassin, Jérôme Monnot, Danny Segev
2007	B	`conf`	Complexity and Approximation Results for the Connected Vertex Cover Problem. WG Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
2007	—	`conf`	On the Performance of Congestion Games for Optimum Satisfiability Problems. WINE Aristotelis Giannakos, Laurent Gourvès, Jérôme Monnot, Vangelis Th. Paschos
2007	B	`conf`	The Complexity of Bottleneck Labeled Graph Problems. WG Refael Hassin, Jérôme Monnot, Danny Segev
2007	—	`conf`	The P SOFSEM (1) Jérôme Monnot, Sophie Toulouse
2007	J	`jnl`	The path partition problem and related problems in bipartite graphs. Oper. Res. Lett. Jérôme Monnot, Sophie Toulouse
2007	J	`jnl`	Time slot scheduling of compatible jobs. J. Sched. Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos
2006	J	`jnl`	A simple approximation algorithm for WIS based on the approximability in k. Eur. J. Oper. Res. Jérôme Monnot
2006	B	`conf`	Approximation Algorithms and Hardness Results for Labeled Connectivity Problems. MFCS Refael Hassin, Jérôme Monnot, Danny Segev
2006	—	`conf`	Reoptimization of Minimum and Maximum Traveling Salesman's Tours. SWAT Giorgio Ausiello, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos
2006	J	`jnl`	Weighted Coloring: further complexity and approximability results. Inf. Process. Lett. Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos
2005	B	`conf`	(Non)-Approximability for the Multi-criteria FCT Eric Angel, Evripidis Bampis, Laurent Gourvès, Jérôme Monnot
2005	J	`jnl`	A hypocoloring model for batch scheduling. Discret. Appl. Math. Dominique de Werra, Marc Demange, Jérôme Monnot, Vangelis Th. Paschos
2005	B	`conf`	Approximation Results for the Weighted P FCT Jérôme Monnot, Sophie Toulouse
2005	J	`jnl`	Approximation algorithms for some vehicle routing problems. Discret. Appl. Math. Cristina Bazgan, Refael Hassin, Jérôme Monnot
2005	J	`jnl`	Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s). Eur. J. Oper. Res. Jérôme Monnot
2005	B	`conf`	Greedy Differential Approximations for Min Set Cover. SOFSEM Cristina Bazgan, Jérôme Monnot, Vangelis Th. Paschos, Fabrice Serrière
2005	B	`conf`	On Complexity and Approximability of the Labeled Maximum/Perfect Matching Problems. ISAAC Jérôme Monnot
2005	J	`jnl`	On the differential approximation of MIN SET COVER. Theor. Comput. Sci. Cristina Bazgan, Jérôme Monnot, Vangelis Th. Paschos, Fabrice Serrière
2005	J	`jnl`	The labeled perfect matching in bipartite graphs. Inf. Process. Lett. Jérôme Monnot
2005	J	`jnl`	The maximum saving partition problem. Oper. Res. Lett. Refael Hassin, Jérôme Monnot
2005	—	`conf`	Weighted Coloring: Further Complexity and Approximability Results. ICTCS Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos
2004	J	`jnl`	Local approximations for maximum partial subgraph problem. Oper. Res. Lett. Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse
2004	B	`conf`	The Hypocoloring Problem: Complexity and Approximability Results when the Chromatic Number Is Small. WG Dominique de Werra, Marc Demange, Jérôme Monnot, Vangelis Th. Paschos
2004	B	`conf`	Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation. ISAAC Jérôme Monnot, Vangelis Th. Paschos, Dominique de Werra, Marc Demange, Bruno Escoffier
2003	J	`jnl`	Approximation algorithms for the traveling salesman problem. Math. Methods Oper. Res. Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse
2003	J	`jnl`	Bottleneck shortest paths on a partially ordered scale. 4OR Jérôme Monnot, Olivier Spanjaard
2003	C	`conf`	Differential Approximation for Some Routing Problems. CIAC Cristina Bazgan, Refael Hassin, Jérôme Monnot
2003	J	`jnl`	Differential approximation results for the Steiner tree problem. Appl. Math. Lett. Marc Demange, Jérôme Monnot, Vangelis Th. Paschos
2003	J	`jnl`	Differential approximation results for the traveling salesman problem with distances 1 and 2. Eur. J. Oper. Res. Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse
2003	J	`jnl`	Local search for the minimum label spanning tree problem with bounded color classes. Oper. Res. Lett. Tobias Brüggemann, Jérôme Monnot, Gerhard J. Woeginger
2003	J	`jnl`	Optima locaux garantis pour l'approximation différentielle. Tech. Sci. Informatiques Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse
2002	J	`jnl`	Differential approximation of NP-hard problems with equal size feasible solutions. RAIRO Oper. Res. Jérôme Monnot
2002	J	`jnl`	Differential approximation results for the traveling salesman and related problems. Inf. Process. Lett. Jérôme Monnot
2002	B	`conf`	Weighted Node Coloring: When Stable Sets Are Expensive. WG Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos
2001	B	`conf`	Differential Approximation Results for the Traveling Salesman Problem with Distances 1 and 2. FCT Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse
2001	J	`jnl`	The maximum f-depth spanning tree problem. Inf. Process. Lett. Jérôme Monnot