sign in · help · news · about ·

BibSonomy :: author :: Monnot ::

tag user group author concept BibTeX key search:all

The blue social bookmark and publication sharing system.

>
|
<

bookmarks

bookmarks per page: 5 10 20 50 100

RSS BibTeX RDF more

publications

(66)

<< < 1 | 2 | 3 > >>

A note on the hardness results for the labeled perfect matching problems in bipartite graphs.
Jérôme Monnot RAIRO - Operations Research 42(3):315-324 (2008)
to dblp by dblp on Dec 11, 2011, 12:00 AM
URL | BibTeX
Minimum regulation of uncoordinated matchings
Bruno Escoffier, Laurent Gourvès, and Jérôme Monnot CoRR (2010)
to dblp by dblp on Dec 5, 2011, 12:00 AM
URL | BibTeX
New Candidates Welcome! Possible Winners with respect to the Addition of New Candidates
Yann Chevaleyre, Jérôme Lang, Nicolas Maudet, Jérôme Monnot, and Lirong Xia CoRR (2011)
to dblp by dblp on Dec 5, 2011, 12:00 AM
URL | BibTeX
Possible winners when new alternatives join: new results coming up!
Lirong Xia, Jérôme Lang, and Jérôme Monnot AAMAS, page 829-836. IFAAMAS, (2011)
to dblp by dblp on Nov 18, 2011, 12:00 AM
URL | BibTeX
The Price of Optimum in a Matching Game.
Bruno Escoffier, Laurent Gourvès, and Jérôme Monnot SAGT, volume 6982 of Lecture Notes in Computer Science, page 81-92. Springer, (2011)
to dblp by dblp on Oct 14, 2011, 12:00 AM
URL | BibTeX
The Hypocoloring Problem: Complexity and Approximability Results when the Chromatic Number Is Small.
Dominique de Werra, Marc Demange, Jérôme Monnot, and Vangelis Th. Paschos WG, volume 3353 of Lecture Notes in Computer Science, page 377-388. Springer, (2004)
to dblp by dblp on Aug 8, 2011, 12:00 AM
URL | BibTeX
Compilation and communication protocols for voting rules with a dynamic set of candidates.
Yann Chevaleyre, Jérôme Lang, Nicolas Maudet, and Jérôme Monnot TARK, page 153-160. ACM, (2011)
to dblp by dblp on Jul 13, 2011, 12:00 AM
URL | BibTeX
Differential Approximation for Some Routing Problems.
Cristina Bazgan, Refael Hassin, and Jérôme Monnot CIAC, volume 2653 of Lecture Notes in Computer Science, page 277-288. Springer, (2003)
to dblp by dblp on Jul 5, 2011, 12:00 AM
URL | BibTeX
Weighted Node Coloring: When Stable Sets Are Expensive.
Marc Demange, Dominique de Werra, Jérôme Monnot, and Vangelis Th. Paschos WG, volume 2573 of Lecture Notes in Computer Science, page 114-125. Springer, (2002)
to dblp by dblp on Jul 4, 2011, 12:00 AM
URL | BibTeX
Differential Approximation Results for the Traveling Salesman Problem with Distances 1 and 2.
Jérôme Monnot, Vangelis Th. Paschos, and Sophie Toulouse FCT, volume 2138 of Lecture Notes in Computer Science, page 275-286. Springer, (2001)
to dblp by dblp on Jun 28, 2011, 12:00 AM
URL | BibTeX
Approximation of the Clustered Set Covering Problem.
Laurent Alfandari, and Jérôme Monnot Electronic Notes in Discrete Mathematics (2010)
to dblp by dblp on Nov 20, 2010, 12:00 AM
URL | BibTeX
The Complexity of Bottleneck Labeled Graph Problems.
Refael Hassin, Jérôme Monnot, and Danny Segev Algorithmica 58(2):245-262 (2010)
to dblp by dblp on Oct 26, 2010, 12:00 AM
URL | BibTeX
The minimum reload s-t path, trail and walk problems.
Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, and Jérôme Monnot Discrete Applied Mathematics 158(13):1404-1417 (2010)
to dblp by dblp on Sep 13, 2010, 12:00 AM
URL | BibTeX
Possible Winners when New Candidates Are Added: The Case of Scoring Rules.
Yann Chevaleyre, Jérôme Lang, Nicolas Maudet, and Jérôme Monnot AAAI, AAAI Press, (2010)
to dblp by dblp on Sep 1, 2010, 12:00 AM
URL | BibTeX
The Max k-Cut Game and Its Strong Equilibria.
Laurent Gourvès, and Jérôme Monnot TAMC, volume 6108 of Lecture Notes in Computer Science, page 234-246. Springer, (2010)
to dblp by dblp on Jul 21, 2010, 4:03 PM
URL | BibTeX
Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs.
Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, and Jérôme Monnot TAMC, volume 6108 of Lecture Notes in Computer Science, page 222-233. Springer, (2010)
to dblp by dblp on Jul 21, 2010, 4:03 PM
URL | BibTeX
On the Impact of Local Taxes in a Set Cover Game.
Bruno Escoffier, Laurent Gourvès, and Jérôme Monnot SIROCCO, volume 6058 of Lecture Notes in Computer Science, page 2-13. Springer, (2010)
to dblp by dblp on Jul 21, 2010, 4:02 PM
URL | BibTeX
Strategic Coloring of a Graph.
Bruno Escoffier, Laurent Gourvès, and Jérôme Monnot CIAC, volume 6078 of Lecture Notes in Computer Science, page 155-166. Springer, (2010)
to dblp by dblp on Jul 21, 2010, 3:57 PM
URL | BibTeX
The Exact Weighted Independent Set Problem in Perfect Graphs and Related Classes.
Martin Milanic, and Jérôme Monnot Electronic Notes in Discrete Mathematics (2009)
to dblp by dblp on Jul 21, 2010, 3:51 PM
URL | BibTeX
On s-t paths and trails in edge-colored graphs.
Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot, and Fábio Protti Electronic Notes in Discrete Mathematics (2009)
to dblp by dblp on Jul 21, 2010, 3:51 PM
URL | BibTeX

<< < 1 | 2 | 3 > >>publications per page: 5 10 20 50 100

a gripper