| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos |
Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems.  |
LATIN  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos |
Reoptimization of the Maximum Weighted P k -Free Subgraph Problem under Vertex Insertion. |
WALCOM |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Yann Chevaleyre, Jérôme Lang, Nicolas Maudet, Jérôme Monnot, Lirong Xia |
New Candidates Welcome! Possible Winners with respect to the Addition of New Candidates |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Bruno Escoffier, Laurent Gourvès, Jérôme Monnot |
The Price of Optimum in a Matching Game. |
SAGT |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Laurent Gourvès, Jérôme Monnot |
Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems. |
WAOA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Laurent Gourvès, Jérôme Monnot, Fanny Pascual |
Single Approximation for Biobjective Max TSP. |
WAOA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Lirong Xia, Jérôme Lang, Jérôme Monnot |
Possible winners when new alternatives join: new results coming up! |
AAMAS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Yann Chevaleyre, Jérôme Lang, Nicolas Maudet, Jérôme Monnot |
Compilation and communication protocols for voting rules with a dynamic set of candidates. |
TARK |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurent Alfandari, Jérôme Monnot |
Approximation of the Clustered Set Covering Problem. |
Electronic Notes in Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Basile Couëtoux, Laurent Gourvès, Jérôme Monnot, Orestis Telelis |
Labeled Traveling Salesman Problems: Complexity and approximation. |
Discrete Optimization |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Jérôme Monnot, Danny Segev |
The Complexity of Bottleneck Labeled Graph Problems. |
Algorithmica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Escoffier, Laurent Gourvès, Jérôme Monnot, Olivier Spanjaard |
Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation. |
European Journal of Operational Research |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Escoffier, Laurent Gourvès, Jérôme Monnot |
Minimum regulation of uncoordinated matchings |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot |
The minimum reload s-t path, trail and walk problems. |
Discrete Applied Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Escoffier, Laurent Gourvès, Jérôme Monnot |
Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs. |
J. Discrete Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurent Gourvès, Jérôme Monnot |
The Max k-Cut Game and Its Strong Equilibria. |
TAMC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot |
Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs. |
TAMC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Escoffier, Laurent Gourvès, Jérôme Monnot |
On the Impact of Local Taxes in a Set Cover Game. |
SIROCCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hatem Chatti, Laurent Gourvès, Jérôme Monnot |
On a Labeled Vehicle Routing Problem. |
SOFSEM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Yann Chevaleyre, Jérôme Lang, Nicolas Maudet, Jérôme Monnot |
Possible Winners when New Candidates Are Added: The Case of Scoring Rules. |
AAAI |
2010 |
DBLP BibTeX RDF |
|
| 1 | Bruno Escoffier, Laurent Gourvès, Jérôme Monnot |
Strategic Coloring of a Graph. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Milanic, Jérôme Monnot |
The Exact Weighted Independent Set Problem in Perfect Graphs and Related Classes. |
Electronic Notes in Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot, Fábio Protti |
On s-t paths and trails in edge-colored graphs. |
Electronic Notes in Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Dominique de Werra, Marc Demange, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos |
Weighted coloring on planar, bipartite and split graphs: Complexity and approximation. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Giorgio Ausiello, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos |
Reoptimization of minimum and maximum traveling salesman's tours. |
J. Discrete Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurent Gourvès, Jérôme Monnot |
On Strong Equilibria in the Max Cut Game. |
WINE |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurent Gourvès, Jérôme Monnot, Orestis Telelis |
Selfish Scheduling with Setup Times. |
WINE |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot |
The Minimum Reload s-tPath/Trail/Walk Problems. |
SOFSEM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Escoffier, Jérôme Monnot, Olivier Spanjaard |
Some tractable instances of interval data minmax regret problems. |
Oper. Res. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Escoffier, Jérôme Monnot |
A better differential approximation ratio for symmetric TSP. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérôme Monnot |
A note on the hardness results for the labeled perfect matching problems in bipartite graphs. |
RAIRO - Operations Research |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérôme Monnot, Sophie Toulouse |
Approximation results for the weighted P4 partition problem. |
J. Discrete Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurent Gourvès, Jérôme Monnot |
Three Selfish Spanning Tree Games. |
WINE |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurent Gourvès, Jérôme Monnot, Fanny Pascual |
Cooperation in Multiorganization Matching. |
WAOA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Escoffier, Jérôme Monnot, Olivier Spanjaard |
Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality. |
SOFSEM |
2008 |
DBLP DOI BibTeX RDF |
Bipartite perfect matching, Shortest path, Spanning tree, Robust optimization, Interval data |
| 1 | Basile Couëtoux, Laurent Gourvès, Jérôme Monnot, Orestis Telelis |
On Labeled Traveling Salesman Problems. |
ISAAC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérôme Monnot, Sophie Toulouse |
The path partition problem and related problems in bipartite graphs. |
Oper. Res. Lett. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Jérôme Monnot, Danny Segev |
Approximation algorithms and hardness results for labeled connectivity problems. |
J. Comb. Optim. |
2007 |
DBLP DOI BibTeX RDF |
Labeled connectivity, Approximation algorithms, Hardness of approximation |
| 1 | Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos |
Time slot scheduling of compatible jobs. |
J. Scheduling |
2007 |
DBLP DOI BibTeX RDF |
Weighted coloring, Chromatic scheduling, Approximations, Edge coloring, Batch scheduling |
| 1 | Refael Hassin, Jérôme Monnot, Danny Segev |
The Complexity of Bottleneck Labeled Graph Problems. |
WG |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Escoffier, Laurent Gourvès, Jérôme Monnot |
Complexity and Approximation Results for the Connected Vertex Cover Problem. |
WG |
2007 |
DBLP DOI BibTeX RDF |
Connected vertex cover, APX-complete, approximation algorithm, planar graphs, bipartite graphs, chordal graphs |
| 1 | Aristotelis Giannakos, Laurent Gourvès, Jérôme Monnot, Vangelis Th. Paschos |
On the Performance of Congestion Games for Optimum Satisfiability Problems. |
WINE |
2007 |
DBLP DOI BibTeX RDF |
non oblivious local search, max sat, approximation algorithm, price of anarchy |
| 1 | Jérôme Monnot, Sophie Toulouse |
The Pk Partition Problem and Related Problems in Bipartite Graphs. |
SOFSEM |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos |
Weighted Coloring: further complexity and approximability results. |
Inf. Process. Lett. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérôme Monnot |
A simple approximation algorithm for WIS based on the approximability in k. |
European Journal of Operational Research |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Jérôme Monnot, Danny Segev |
Approximation Algorithms and Hardness Results for Labeled Connectivity Problems. |
MFCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Giorgio Ausiello, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos |
Reoptimization of Minimum and Maximum Traveling Salesman's Tours. |
SWAT |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Jérôme Monnot |
The maximum saving partition problem. |
Oper. Res. Lett. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérôme Monnot |
The labeled perfect matching in bipartite graphs. |
Inf. Process. Lett. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Jérôme Monnot, Vangelis Th. Paschos, Fabrice Serrière |
On the differential approximation of MIN SET COVER. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérôme Monnot |
Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s). |
European Journal of Operational Research |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Dominique de Werra, Marc Demange, Jérôme Monnot, Vangelis Th. Paschos |
A hypocoloring model for batch scheduling. |
Discrete Applied Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Refael Hassin, Jérôme Monnot |
Approximation algorithms for some vehicle routing problems. |
Discrete Applied Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos |
Weighted Coloring: Further Complexity and Approximability Results. |
ICTCS |
2005 |
DBLP DOI BibTeX RDF |
weighted coloring, line graph of bipartite graphs, Approximation algorithm, NP-complete problems, interval graphs, partial k-tree |
| 1 | Jérôme Monnot, Sophie Toulouse |
Approximation Results for the Weighted P4 Partition Problems. |
FCT |
2005 |
DBLP DOI BibTeX RDF |
3-length chain, standard approximation, differential approximation, approximation algorithms, Graph partition, performance ratio |
| 1 | Eric Angel, Evripidis Bampis, Laurent Gourvès, Jérôme Monnot |
(Non)-Approximability for the Multi-criteria TSP(1, 2). |
FCT |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina Bazgan, Jérôme Monnot, Vangelis Th. Paschos, Fabrice Serrière |
Greedy Differential Approximations for Min Set Cover. |
SOFSEM |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérôme Monnot |
On Complexity and Approximability of the Labeled Maximum/Perfect Matching Problems. |
ISAAC |
2005 |
DBLP DOI BibTeX RDF |
labeled matching, approximate algorithms, NP-complete, bipartite graphs, colored matching |
| 1 | Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse |
Local approximations for maximum partial subgraph problem. |
Oper. Res. Lett. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Dominique de Werra, Marc Demange, Jérôme Monnot, Vangelis Th. Paschos |
The Hypocoloring Problem: Complexity and Approximability Results when the Chromatic Number Is Small. |
WG |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérôme Monnot, Vangelis Th. Paschos, Dominique de Werra, Marc Demange, Bruno Escoffier |
Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation. |
ISAAC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Tobias Brüggemann, Jérôme Monnot, Gerhard J. Woeginger |
Local search for the minimum label spanning tree problem with bounded color classes. |
Oper. Res. Lett. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse |
Differential approximation results for the traveling salesman problem with distances 1 and 2. |
European Journal of Operational Research |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Demange, Jérôme Monnot, Vangelis Th. Paschos |
Differential approximation results for the Steiner tree problem. |
Appl. Math. Lett. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérôme Monnot, Olivier Spanjaard |
Bottleneck shortest paths on a partially ordered scale. |
4OR |
2003 |
DBLP DOI BibTeX RDF |
bottleneck problems, Shortest path, partial order, algebraic methods |
| 1 | Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse |
Optima locaux garantis pour l'approximation différentielle. |
Technique et Science Informatiques |
2003 |
DBLP BibTeX RDF |
|
| 1 | Cristina Bazgan, Refael Hassin, Jérôme Monnot |
Differential Approximation for Some Routing Problems. |
CIAC |
2003 |
DBLP DOI BibTeX RDF |
differential ratio, approximation algorithm, TSP, VRP |
| 1 | Jérôme Monnot |
Differential approximation results for the traveling salesman and related problems. |
Inf. Process. Lett. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérôme Monnot |
Differential approximation of NP-hard problems with equal size feasible solutions. |
RAIRO - Operations Research |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos |
Weighted Node Coloring: When Stable Sets Are Expensive. |
WG |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérôme Monnot |
The maximum f-depth spanning tree problem. |
Inf. Process. Lett. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse |
Differential Approximation Results for the Traveling Salesman Problem with Distances 1 and 2. |
FCT |
2001 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")