Skip to content

Jrme Monnot

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

58

Venues

20

Active years

2001–2021

Best venue rank

A*

Where they publish

Papers

58 indexed papers, newest first.

YearVenueTitleAuthors
2021CIACAbundant Extensions.Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jrme Monnot, Florian Sikora
2021WABIThe Maximum Duo-Preservation String Mapping Problem with Bounded Alphabet.Nicolas Boria, Laurent Gourvs, Vangelis Th. Paschos, Jrme Monnot
2020WGStrong Cliques in Diamond-Free Graphs.Nina Chiarelli, Berenice Martnez-Barona, Martin Milanic, Jrme Monnot, Peter Mursic
2019CIACProject Games.Vittorio Bil, Laurent Gourvs, Jrme Monnot
2019CIACExtension of Vertex Cover and Independent Set in Some Classes of Graphs.Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jrme Monnot, Florian Sikora
2019FCTExtension of Some Edge Graph Problems: Standard and Parameterized Complexity.Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jrme Monnot, Florian Sikora
2019IWOCAExtension and Its Price for the Connected Vertex Cover Problem.Mehdi Khosravian Ghadikolaei, Nikolaos Melissinos, Jrme Monnot, Aris Pagourtzis
2019SAGTOn a Simple Hedonic Game with Graph-Restricted Communication.Vittorio Bil, Laurent Gourvs, Jrme Monnot
2019WALCOMWeighted Upper Edge Cover: Complexity and Approximability.Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jrme Monnot, Florian Sikora
2019WALCOMCorrection to: Weighted Upper Edge Cover: Complexity and Approximability.Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jrme Monnot, Florian Sikora
2019WGMaximum Independent Sets in Subcubic Graphs: New Results.Ararat Harutyunyan, Michael Lampis, Vadim V. Lozin, Jrme Monnot
2017CIACApproximate Maximin Share Allocations in Matroids.Laurent Gourvs, Jrme Monnot
2017COCOAExtended Spanning Star Forest Problems.Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jrme Monnot, Dirk Oliver Theis
2017SOFSEMSelfish Transportation Games.Dimitris Fotakis, Laurent Gourvs, Jrme Monnot
2016AAIMAlgorithmic Aspects of Upper Domination: A Parameterised Perspective.Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jrme Monnot, Vangelis Th. Paschos
2016IJCAIComputing Pareto Optimal Committees.Haris Aziz, Jrme Lang, Jrme Monnot
2016IJCAIAchieving Proportional Representation in Conference Programs.Ioannis Caragiannis, Laurent Gourvs, Jrme Monnot
2016IJCAIHow Hard Is It for a Party to Nominate an Election Winner?.Piotr Faliszewski, Laurent Gourvs, Jrme Lang, Julien Lesca, Jrme Monnot
2016IWOCAA Boundary Property for Upper Domination.Hassan AbouEisha, Shahid Hussain, Vadim V. Lozin, Jrme Monnot, Bernard Ries, Victor Zamaraev
2016IWOCAUpper Domination: Complexity and Approximation.Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jrme Monnot, Vangelis Th. Paschos
2014COCOAA Dichotomy for Upper Domination in Monogenic Classes.Hassan AbouEisha, Shahid Hussain, Vadim V. Lozin, Jrme Monnot, Bernard Ries
2014ECAINear Fairness in Matroids.Laurent Gourvs, Jrme Monnot, Lydia Tlilane
2013CIACTruthful Many-to-Many Assignment with Private Weights.Bruno Escoffier, Jrme Monnot, Fanny Pascual, Olivier Spanjaard
2013FCTThe Lazy Bureaucrat Problem with Common Arrivals and Deadlines: Approximation and Mechanism Design.Laurent Gourvs, Jrme Monnot, Aris Pagourtzis
2013IJCAIA Matroid Approach to the Worst Case Allocation of Indivisible Goods.Laurent Gourvs, Jrme Monnot, Lydia Tlilane
2013IWOCAOn the Maximum Independent Set Problem in Subclasses of Subcubic Graphs.Vadim V. Lozin, Jrme Monnot, Bernard Ries
2012COCOAComplexity Results for the Empire Problem in Collection of Stars.Basile Coutoux, Jrme Monnot, Sonia Toubaline
2012ECAIApproximate Tradeoffs on Matroids.Laurent Gourvs, Jrme Monnot, Lydia Tlilane
2012LATINReoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems.Nicolas Boria, Jrme Monnot, Vangelis Th. Paschos
2012SAGTCongestion Games with Capacitated Resources.Laurent Gourvs, Jrme Monnot, Stefano Moretti, Kim Thang Nguyen
2012WALCOMReoptimization of the Maximum Weighted P k -Free Subgraph Problem under Vertex Insertion.Nicolas Boria, Jrme Monnot, Vangelis Th. Paschos
2011SAGTThe Price of Optimum in a Matching Game.Bruno Escoffier, Laurent Gourvs, Jrme Monnot
2011TARKCompilation and communication protocols for voting rules with a dynamic set of candidates.Yann Chevaleyre, Jrme Lang, Nicolas Maudet, Jrme Monnot
2011WAOAApproximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems.Cristina Bazgan, Laurent Gourvs, Jrme Monnot
2011WAOASingle Approximation for Biobjective Max TSP.Cristina Bazgan, Laurent Gourvs, Jrme Monnot, Fanny Pascual
2010AAAIPossible Winners when New Candidates Are Added: The Case of Scoring Rules.Yann Chevaleyre, Jrme Lang, Nicolas Maudet, Jrme Monnot
2010CIACStrategic Coloring of a Graph.Bruno Escoffier, Laurent Gourvs, Jrme Monnot
2010SIROCCOOn the Impact of Local Taxes in a Set Cover Game.Bruno Escoffier, Laurent Gourvs, Jrme Monnot
2010SOFSEMOn a Labeled Vehicle Routing Problem.Hatem Chatti, Laurent Gourvs, Jrme Monnot
2010TAMCComplexity of Paths, Trails and Circuits in Arc-Colored Digraphs.Laurent Gourvs, Adria Lyra, Carlos A. J. Martinhon, Jrme Monnot
2010TAMCThe MaxLaurent Gourvs, Jrme Monnot
2009SOFSEMThe Minimum Reload s-tPath/Trail/Walk Problems.Laurent Gourvs, Adria Lyra, Carlos A. J. Martinhon, Jrme Monnot
2008ISAACOn Labeled Traveling Salesman Problems.Basile Coutoux, Laurent Gourvs, Jrme Monnot, Orestis Telelis
2008SOFSEMSome Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality.Bruno Escoffier, Jrme Monnot, Olivier Spanjaard
2008WAOACooperation in Multiorganization Matching.Laurent Gourvs, Jrme Monnot, Fanny Pascual
2007SOFSEMThe PJrme Monnot, Sophie Toulouse
2007WGComplexity and Approximation Results for the Connected Vertex Cover Problem.Bruno Escoffier, Laurent Gourvs, Jrme Monnot
2007WGThe Complexity of Bottleneck Labeled Graph Problems.Refael Hassin, Jrme Monnot, Danny Segev
2006MFCSApproximation Algorithms and Hardness Results for Labeled Connectivity Problems.Refael Hassin, Jrme Monnot, Danny Segev
2005FCT(Non)-Approximability for the Multi-criteriaEric Angel, Evripidis Bampis, Laurent Gourvs, Jrme Monnot
2005FCTApproximation Results for the Weighted PJrme Monnot, Sophie Toulouse
2005ISAACOn Complexity and Approximability of the Labeled Maximum/Perfect Matching Problems.Jrme Monnot
2005SOFSEMGreedy Differential Approximations for Min Set Cover.Cristina Bazgan, Jrme Monnot, Vangelis Th. Paschos, Fabrice Serrire
2004ISAACWeighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation.Jrme Monnot, Vangelis Th. Paschos, Dominique de Werra, Marc Demange, Bruno Escoffier
2004WGThe Hypocoloring Problem: Complexity and Approximability Results when the Chromatic Number Is Small.Dominique de Werra, Marc Demange, Jrme Monnot, Vangelis Th. Paschos
2003CIACDifferential Approximation for Some Routing Problems.Cristina Bazgan, Refael Hassin, Jrme Monnot
2002WGWeighted Node Coloring: When Stable Sets Are Expensive.Marc Demange, Dominique de Werra, Jrme Monnot, Vangelis Th. Paschos
2001FCTDifferential Approximation Results for the Traveling Salesman Problem with Distances 1 and 2.Jrme Monnot, Vangelis Th. Paschos, Sophie Toulouse