Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Jérôme Monnot
@article{DBLP:journals/dam/CaselFGMS23,
author = {Katrin Casel and
Henning Fernau and
Mehdi Khosravian Ghadikolaei and
J{\'{e}}r{\^{o}}me Monnot and
Florian Sikora},
title = {Extension of some edge graph problems: Standard, parameterized and
approximation complexity},
journal = {Discret. Appl. Math.},
volume = {340},
pages = {183--201},
year = {2023},
url = {https://doi.org/10.1016/j.dam.2023.06.042},
doi = {10.1016/J.DAM.2023.06.042},
timestamp = {Sat, 14 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/CaselFGMS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BiloGM23,
author = {Vittorio Bil{\`{o}} and
Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot},
title = {Project games},
journal = {Theor. Comput. Sci.},
volume = {940},
number = {Part},
pages = {97--111},
year = {2023},
url = {https://doi.org/10.1016/j.tcs.2022.10.043},
doi = {10.1016/J.TCS.2022.10.043},
timestamp = {Mon, 05 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BiloGM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KimMMP22,
author = {Eun Jung Kim and
Martin Milanic and
J{\'{e}}r{\^{o}}me Monnot and
Christophe Picouleau},
title = {Complexity and algorithms for constant diameter augmentation problems},
journal = {Theor. Comput. Sci.},
volume = {904},
pages = {15--26},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2021.05.020},
doi = {10.1016/J.TCS.2021.05.020},
timestamp = {Wed, 23 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KimMMP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CaselFGMS22,
author = {Katrin Casel and
Henning Fernau and
Mehdi Khosravian Ghadikolaei and
J{\'{e}}r{\^{o}}me Monnot and
Florian Sikora},
title = {On the complexity of solution extension of optimization problems},
journal = {Theor. Comput. Sci.},
volume = {904},
pages = {48--65},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2021.10.017},
doi = {10.1016/J.TCS.2021.10.017},
timestamp = {Wed, 23 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CaselFGMS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GhadikolaeiMMP22,
author = {Mehdi Khosravian Ghadikolaei and
Nikolaos Melissinos and
J{\'{e}}r{\^{o}}me Monnot and
Aris Pagourtzis},
title = {Extension and its price for the connected vertex cover problem},
journal = {Theor. Comput. Sci.},
volume = {904},
pages = {66--80},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2021.11.028},
doi = {10.1016/J.TCS.2021.11.028},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/GhadikolaeiMMP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChiarelliMMMM21,
author = {Nina Chiarelli and
Berenice Mart{\'{\i}}nez{-}Barona and
Martin Milanic and
J{\'{e}}r{\^{o}}me Monnot and
Peter Mursic},
title = {Strong cliques in diamond-free graphs},
journal = {Theor. Comput. Sci.},
volume = {858},
pages = {49--63},
year = {2021},
url = {https://doi.org/10.1016/j.tcs.2020.12.001},
doi = {10.1016/J.TCS.2020.12.001},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/ChiarelliMMMM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MonnotFM21,
author = {J{\'{e}}r{\^{o}}me Monnot and
Henning Fernau and
David F. Manlove},
title = {Algorithmic aspects of upper edge domination},
journal = {Theor. Comput. Sci.},
volume = {877},
pages = {46--57},
year = {2021},
url = {https://doi.org/10.1016/j.tcs.2021.03.038},
doi = {10.1016/J.TCS.2021.03.038},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MonnotFM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/CaselFGMS21,
author = {Katrin Casel and
Henning Fernau and
Mehdi Khosravian Ghadikolaei and
J{\'{e}}r{\^{o}}me Monnot and
Florian Sikora},
editor = {Tiziana Calamoneri and
Federico Cor{\`{o}}},
title = {Abundant Extensions},
booktitle = {Algorithms and Complexity - 12th International Conference, {CIAC}
2021, Virtual Event, May 10-12, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12701},
pages = {3--17},
publisher = {Springer},
year = {2021},
timestamp = {Thu, 25 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/CaselFGMS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wabi/BoriaGPM21,
author = {Nicolas Boria and
Laurent Gourv{\`{e}}s and
Vangelis Th. Paschos and
J{\'{e}}r{\^{o}}me Monnot},
editor = {Alessandra Carbone and
Mohammed El{-}Kebir},
title = {The Maximum Duo-Preservation String Mapping Problem with Bounded Alphabet},
booktitle = {21st International Workshop on Algorithms in Bioinformatics, {WABI}
2021, August 2-4, 2021, Virtual Conference},
series = {LIPIcs},
volume = {201},
pages = {5:1--5:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.WABI.2021.5},
doi = {10.4230/LIPICS.WABI.2021.5},
timestamp = {Thu, 22 Jul 2021 15:39:38 +0200},
biburl = {https://dblp.org/rec/conf/wabi/BoriaGPM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aamas/AzizM20,
author = {Haris Aziz and
J{\'{e}}r{\^{o}}me Monnot},
title = {Computing and testing Pareto optimal committees},
journal = {Auton. Agents Multi Agent Syst.},
volume = {34},
number = {1},
pages = {24},
year = {2020},
url = {https://doi.org/10.1007/s10458-020-09445-y},
doi = {10.1007/S10458-020-09445-Y},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/aamas/AzizM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/KhoshkhahGMS20,
author = {Kaveh Khoshkhah and
Mehdi Khosravian Ghadikolaei and
J{\'{e}}r{\^{o}}me Monnot and
Florian Sikora},
title = {Weighted Upper Edge Cover: Complexity and Approximability},
journal = {J. Graph Algorithms Appl.},
volume = {24},
number = {2},
pages = {65--88},
year = {2020},
url = {https://doi.org/10.7155/jgaa.00519},
doi = {10.7155/JGAA.00519},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/KhoshkhahGMS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HarutyunyanLLM20,
author = {Ararat Harutyunyan and
Michael Lampis and
Vadim V. Lozin and
J{\'{e}}r{\^{o}}me Monnot},
title = {Maximum independent sets in subcubic graphs: New results},
journal = {Theor. Comput. Sci.},
volume = {846},
pages = {14--26},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2020.09.010},
doi = {10.1016/J.TCS.2020.09.010},
timestamp = {Wed, 04 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HarutyunyanLLM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ttcs/HarutyunyanGMMP20,
author = {Ararat Harutyunyan and
Mehdi Khosravian Ghadikolaei and
Nikolaos Melissinos and
J{\'{e}}r{\^{o}}me Monnot and
Aris Pagourtzis},
editor = {Lu{\'{\i}}s Soares Barbosa and
Mohammad Ali Abam},
title = {On the Complexity of the Upper r-Tolerant Edge Cover Problem},
booktitle = {Topics in Theoretical Computer Science - Third {IFIP} {WG} 1.8 International
Conference, {TTCS} 2020, Tehran, Iran, July 1-2, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12281},
pages = {32--47},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-57852-7\_3},
doi = {10.1007/978-3-030-57852-7\_3},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ttcs/HarutyunyanGMMP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/ChiarelliMMMM20,
author = {Nina Chiarelli and
Berenice Mart{\'{\i}}nez{-}Barona and
Martin Milanic and
J{\'{e}}r{\^{o}}me Monnot and
Peter Mursic},
editor = {Isolde Adler and
Haiko M{\"{u}}ller},
title = {Strong Cliques in Diamond-Free Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science - 46th International
Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12301},
pages = {261--273},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-60440-0\_21},
doi = {10.1007/978-3-030-60440-0\_21},
timestamp = {Thu, 22 Oct 2020 11:34:57 +0200},
biburl = {https://dblp.org/rec/conf/wg/ChiarelliMMMM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GourvesM19,
author = {Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot},
title = {On maximin share allocations in matroids},
journal = {Theor. Comput. Sci.},
volume = {754},
pages = {50--64},
year = {2019},
url = {https://doi.org/10.1016/j.tcs.2018.05.018},
doi = {10.1016/J.TCS.2018.05.018},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/GourvesM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KhoshkhahGMT19,
author = {Kaveh Khoshkhah and
Mehdi Khosravian Ghadikolaei and
J{\'{e}}r{\^{o}}me Monnot and
Dirk Oliver Theis},
title = {Complexity and approximability of extended Spanning Star Forest problems
in general and complete graphs},
journal = {Theor. Comput. Sci.},
volume = {775},
pages = {1--15},
year = {2019},
url = {https://doi.org/10.1016/j.tcs.2018.11.025},
doi = {10.1016/J.TCS.2018.11.025},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/KhoshkhahGMT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AzizBLLM19,
author = {Haris Aziz and
P{\'{e}}ter Bir{\'{o}} and
J{\'{e}}r{\^{o}}me Lang and
Julien Lesca and
J{\'{e}}r{\^{o}}me Monnot},
title = {Efficient reallocation under additive and responsive preferences},
journal = {Theor. Comput. Sci.},
volume = {790},
pages = {1--15},
year = {2019},
url = {https://doi.org/10.1016/j.tcs.2019.05.011},
doi = {10.1016/J.TCS.2019.05.011},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AzizBLLM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BiloGM19,
author = {Vittorio Bil{\`{o}} and
Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot},
editor = {Pinar Heggernes},
title = {Project Games},
booktitle = {Algorithms and Complexity - 11th International Conference, {CIAC}
2019, Rome, Italy, May 27-29, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11485},
pages = {75--86},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17402-6\_7},
doi = {10.1007/978-3-030-17402-6\_7},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BiloGM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/CaselFGMS19,
author = {Katrin Casel and
Henning Fernau and
Mehdi Khosravian Ghadikolaei and
J{\'{e}}r{\^{o}}me Monnot and
Florian Sikora},
editor = {Pinar Heggernes},
title = {Extension of Vertex Cover and Independent Set in Some Classes of Graphs},
booktitle = {Algorithms and Complexity - 11th International Conference, {CIAC}
2019, Rome, Italy, May 27-29, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11485},
pages = {124--136},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17402-6\_11},
doi = {10.1007/978-3-030-17402-6\_11},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/CaselFGMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/CaselFGMS19,
author = {Katrin Casel and
Henning Fernau and
Mehdi Khosravian Ghadikolaei and
J{\'{e}}r{\^{o}}me Monnot and
Florian Sikora},
editor = {Leszek Antoni Gasieniec and
Jesper Jansson and
Christos Levcopoulos},
title = {Extension of Some Edge Graph Problems: Standard and Parameterized
Complexity},
booktitle = {Fundamentals of Computation Theory - 22nd International Symposium,
{FCT} 2019, Copenhagen, Denmark, August 12-14, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11651},
pages = {185--200},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-25027-0\_13},
doi = {10.1007/978-3-030-25027-0\_13},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fct/CaselFGMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/GhadikolaeiMMP19,
author = {Mehdi Khosravian Ghadikolaei and
Nikolaos Melissinos and
J{\'{e}}r{\^{o}}me Monnot and
Aris Pagourtzis},
editor = {Charles J. Colbourn and
Roberto Grossi and
Nadia Pisanti},
title = {Extension and Its Price for the Connected Vertex Cover Problem},
booktitle = {Combinatorial Algorithms - 30th International Workshop, {IWOCA} 2019,
Pisa, Italy, July 23-25, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11638},
pages = {315--326},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-25005-8\_26},
doi = {10.1007/978-3-030-25005-8\_26},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/GhadikolaeiMMP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/BiloGM19,
author = {Vittorio Bil{\`{o}} and
Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot},
editor = {Dimitris Fotakis and
Evangelos Markakis},
title = {On a Simple Hedonic Game with Graph-Restricted Communication},
booktitle = {Algorithmic Game Theory - 12th International Symposium, {SAGT} 2019,
Athens, Greece, September 30 - October 3, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11801},
pages = {252--265},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-30473-7\_17},
doi = {10.1007/978-3-030-30473-7\_17},
timestamp = {Thu, 24 Mar 2022 11:08:57 +0100},
biburl = {https://dblp.org/rec/conf/sagt/BiloGM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/KhoshkhahGMS19,
author = {Kaveh Khoshkhah and
Mehdi Khosravian Ghadikolaei and
J{\'{e}}r{\^{o}}me Monnot and
Florian Sikora},
editor = {Gautam K. Das and
Partha Sarathi Mandal and
Krishnendu Mukhopadhyaya and
Shin{-}Ichi Nakano},
title = {Weighted Upper Edge Cover: Complexity and Approximability},
booktitle = {{WALCOM:} Algorithms and Computation - 13th International Conference,
{WALCOM} 2019, Guwahati, India, February 27 - March 2, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11355},
pages = {235--247},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-10564-8\_19},
doi = {10.1007/978-3-030-10564-8\_19},
timestamp = {Wed, 31 Mar 2021 12:03:13 +0200},
biburl = {https://dblp.org/rec/conf/walcom/KhoshkhahGMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/KhoshkhahGMS19a,
author = {Kaveh Khoshkhah and
Mehdi Khosravian Ghadikolaei and
J{\'{e}}r{\^{o}}me Monnot and
Florian Sikora},
editor = {Gautam K. Das and
Partha Sarathi Mandal and
Krishnendu Mukhopadhyaya and
Shin{-}Ichi Nakano},
title = {Correction to: Weighted Upper Edge Cover: Complexity and Approximability},
booktitle = {{WALCOM:} Algorithms and Computation - 13th International Conference,
{WALCOM} 2019, Guwahati, India, February 27 - March 2, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11355},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-10564-8\_33},
doi = {10.1007/978-3-030-10564-8\_33},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/walcom/KhoshkhahGMS19a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/HarutyunyanLLM19,
author = {Ararat Harutyunyan and
Michael Lampis and
Vadim V. Lozin and
J{\'{e}}r{\^{o}}me Monnot},
editor = {Ignasi Sau and
Dimitrios M. Thilikos},
title = {Maximum Independent Sets in Subcubic Graphs: New Results},
booktitle = {Graph-Theoretic Concepts in Computer Science - 45th International
Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21,
2019, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {11789},
pages = {40--52},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-30786-8\_4},
doi = {10.1007/978-3-030-30786-8\_4},
timestamp = {Tue, 29 Dec 2020 18:38:49 +0100},
biburl = {https://dblp.org/rec/conf/wg/HarutyunyanLLM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AbouEishaHLMRZ18,
author = {Hassan AbouEisha and
Shahid Hussain and
Vadim V. Lozin and
J{\'{e}}r{\^{o}}me Monnot and
Bernard Ries and
Viktor Zamaraev},
title = {Upper Domination: Towards a Dichotomy Through Boundary Properties},
journal = {Algorithmica},
volume = {80},
number = {10},
pages = {2799--2817},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0346-9},
doi = {10.1007/S00453-017-0346-9},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AbouEishaHLMRZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GourvesMT18,
author = {Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot and
Lydia Tlilane},
title = {Subset sum problems with digraph constraints},
journal = {J. Comb. Optim.},
volume = {36},
number = {3},
pages = {937--964},
year = {2018},
url = {https://doi.org/10.1007/s10878-018-0262-1},
doi = {10.1007/S10878-018-0262-1},
timestamp = {Tue, 04 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/GourvesMT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BazganBCFJKLLMP18,
author = {Cristina Bazgan and
Ljiljana Brankovic and
Katrin Casel and
Henning Fernau and
Klaus Jansen and
Kim{-}Manuel Klein and
Michael Lampis and
Mathieu Liedloff and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos},
title = {The many facets of upper domination},
journal = {Theor. Comput. Sci.},
volume = {717},
pages = {2--25},
year = {2018},
url = {https://doi.org/10.1016/j.tcs.2017.05.042},
doi = {10.1016/J.TCS.2017.05.042},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BazganBCFJKLLMP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1803-06644,
author = {Haris Aziz and
J{\'{e}}r{\^{o}}me Lang and
J{\'{e}}r{\^{o}}me Monnot},
title = {Computing and Testing Pareto Optimal Committees},
journal = {CoRR},
volume = {abs/1803.06644},
year = {2018},
url = {http://arxiv.org/abs/1803.06644},
eprinttype = {arXiv},
eprint = {1803.06644},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1803-06644.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-04553,
author = {Katrin Casel and
Henning Fernau and
Mehdi Khosravian Ghadikolaei and
J{\'{e}}r{\^{o}}me Monnot and
Florian Sikora},
title = {On the Complexity of Solution Extension of Optimization Problems},
journal = {CoRR},
volume = {abs/1810.04553},
year = {2018},
url = {http://arxiv.org/abs/1810.04553},
eprinttype = {arXiv},
eprint = {1810.04553},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-04553.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-04629,
author = {Katrin Casel and
Henning Fernau and
Mehdi Khosravian Ghadikolaei and
J{\'{e}}r{\^{o}}me Monnot and
Florian Sikora},
title = {Extension of vertex cover and independent set in some classes of graphs
and generalizations},
journal = {CoRR},
volume = {abs/1810.04629},
year = {2018},
url = {http://arxiv.org/abs/1810.04629},
eprinttype = {arXiv},
eprint = {1810.04629},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-04629.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-10940,
author = {Ararat Harutyunyan and
Michael Lampis and
Vadim V. Lozin and
J{\'{e}}r{\^{o}}me Monnot},
title = {Maximum Independent Sets in Subcubic Graphs: New Results},
journal = {CoRR},
volume = {abs/1810.10940},
year = {2018},
url = {http://arxiv.org/abs/1810.10940},
eprinttype = {arXiv},
eprint = {1810.10940},
timestamp = {Wed, 31 Oct 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-10940.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-02599,
author = {Kaveh Khoshkhah and
Mehdi Khosravian Ghadikolaei and
J{\'{e}}r{\^{o}}me Monnot and
Florian Sikora},
title = {Weighted Upper Edge Cover: Complexity and Approximability},
journal = {CoRR},
volume = {abs/1811.02599},
year = {2018},
url = {http://arxiv.org/abs/1811.02599},
eprinttype = {arXiv},
eprint = {1811.02599},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-02599.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EscoffierGM17,
author = {Bruno Escoffier and
Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot},
title = {The Price of Optimum: Complexity and Approximation for a Matching
Game},
journal = {Algorithmica},
volume = {77},
number = {3},
pages = {836--866},
year = {2017},
url = {https://doi.org/10.1007/s00453-015-0108-5},
doi = {10.1007/S00453-015-0108-5},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/EscoffierGM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BoyaciM17,
author = {Arman Boyaci and
J{\'{e}}r{\^{o}}me Monnot},
title = {Weighted upper domination number},
journal = {Electron. Notes Discret. Math.},
volume = {62},
pages = {171--176},
year = {2017},
url = {https://doi.org/10.1016/j.endm.2017.10.030},
doi = {10.1016/J.ENDM.2017.10.030},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/BoyaciM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GourvesMPV17,
author = {Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot and
Fanny Pascual and
Daniel Vanderpooten},
title = {Bi-objective matchings with the triangle inequality},
journal = {Theor. Comput. Sci.},
volume = {670},
pages = {1--10},
year = {2017},
url = {https://doi.org/10.1016/j.tcs.2017.01.012},
doi = {10.1016/J.TCS.2017.01.012},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/GourvesMPV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/LangMSZ17,
author = {J{\'{e}}r{\^{o}}me Lang and
J{\'{e}}r{\^{o}}me Monnot and
Arkadii Slinko and
William S. Zwicker},
editor = {Kate Larson and
Michael Winikoff and
Sanmay Das and
Edmund H. Durfee},
title = {Beyond Electing and Ranking: Collective Dominating Chains, Dominating
Subsets and Dichotomies},
booktitle = {Proceedings of the 16th Conference on Autonomous Agents and MultiAgent
Systems, {AAMAS} 2017, S{\~{a}}o Paulo, Brazil, May 8-12, 2017},
pages = {24--32},
publisher = {{ACM}},
year = {2017},
url = {http://dl.acm.org/citation.cfm?id=3091135},
timestamp = {Wed, 27 Sep 2017 07:24:00 +0200},
biburl = {https://dblp.org/rec/conf/atal/LangMSZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/GourvesM17,
author = {Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {Approximate Maximin Share Allocations in Matroids},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {310--321},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_26},
doi = {10.1007/978-3-319-57586-5\_26},
timestamp = {Thu, 24 Mar 2022 11:08:56 +0100},
biburl = {https://dblp.org/rec/conf/ciac/GourvesM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/KhoshkhahGMT17,
author = {Kaveh Khoshkhah and
Mehdi Khosravian Ghadikolaei and
J{\'{e}}r{\^{o}}me Monnot and
Dirk Oliver Theis},
editor = {Xiaofeng Gao and
Hongwei Du and
Meng Han},
title = {Extended Spanning Star Forest Problems},
booktitle = {Combinatorial Optimization and Applications - 11th International Conference,
{COCOA} 2017, Shanghai, China, December 16-18, 2017, Proceedings,
Part {I}},
series = {Lecture Notes in Computer Science},
volume = {10627},
pages = {195--209},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-71150-8\_18},
doi = {10.1007/978-3-319-71150-8\_18},
timestamp = {Tue, 14 Jun 2022 14:15:49 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/KhoshkhahGMT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/FotakisGM17,
author = {Dimitris Fotakis and
Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot},
editor = {Bernhard Steffen and
Christel Baier and
Mark van den Brand and
Johann Eder and
Mike Hinchey and
Tiziana Margaria},
title = {Selfish Transportation Games},
booktitle = {{SOFSEM} 2017: Theory and Practice of Computer Science - 43rd International
Conference on Current Trends in Theory and Practice of Computer Science,
Limerick, Ireland, January 16-20, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10139},
pages = {176--187},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-51963-0\_14},
doi = {10.1007/978-3-319-51963-0\_14},
timestamp = {Sun, 02 Oct 2022 16:15:51 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/FotakisGM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaim/BazganBCFJKLLMP16,
author = {Cristina Bazgan and
Ljiljana Brankovic and
Katrin Casel and
Henning Fernau and
Klaus Jansen and
Kim{-}Manuel Klein and
Michael Lampis and
Mathieu Liedloff and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos},
editor = {Riccardo Dondi and
Guillaume Fertin and
Giancarlo Mauri},
title = {Algorithmic Aspects of Upper Domination: {A} Parameterised Perspective},
booktitle = {Algorithmic Aspects in Information and Management - 11th International
Conference, {AAIM} 2016, Bergamo, Italy, July 18-20, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9778},
pages = {113--124},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-41168-2\_10},
doi = {10.1007/978-3-319-41168-2\_10},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/aaim/BazganBCFJKLLMP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/AzizBLLM16,
author = {Haris Aziz and
P{\'{e}}ter Bir{\'{o}} and
J{\'{e}}r{\^{o}}me Lang and
Julien Lesca and
J{\'{e}}r{\^{o}}me Monnot},
editor = {Catholijn M. Jonker and
Stacy Marsella and
John Thangarajah and
Karl Tuyls},
title = {Optimal Reallocation under Additive and Ordinal Preferences},
booktitle = {Proceedings of the 2016 International Conference on Autonomous Agents
{\&} Multiagent Systems, Singapore, May 9-13, 2016},
pages = {402--410},
publisher = {{ACM}},
year = {2016},
url = {http://dl.acm.org/citation.cfm?id=2936984},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/atal/AzizBLLM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/AzizLM16,
author = {Haris Aziz and
J{\'{e}}r{\^{o}}me Lang and
J{\'{e}}r{\^{o}}me Monnot},
editor = {Subbarao Kambhampati},
title = {Computing Pareto Optimal Committees},
booktitle = {Proceedings of the Twenty-Fifth International Joint Conference on
Artificial Intelligence, {IJCAI} 2016, New York, NY, USA, 9-15 July
2016},
pages = {60--66},
publisher = {{IJCAI/AAAI} Press},
year = {2016},
url = {http://www.ijcai.org/Abstract/16/016},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/AzizLM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/CaragiannisGM16,
author = {Ioannis Caragiannis and
Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot},
editor = {Subbarao Kambhampati},
title = {Achieving Proportional Representation in Conference Programs},
booktitle = {Proceedings of the Twenty-Fifth International Joint Conference on
Artificial Intelligence, {IJCAI} 2016, New York, NY, USA, 9-15 July
2016},
pages = {144--150},
publisher = {{IJCAI/AAAI} Press},
year = {2016},
url = {http://www.ijcai.org/Abstract/16/028},
timestamp = {Tue, 20 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/CaragiannisGM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/FaliszewskiGLLM16,
author = {Piotr Faliszewski and
Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Lang and
Julien Lesca and
J{\'{e}}r{\^{o}}me Monnot},
editor = {Subbarao Kambhampati},
title = {How Hard Is It for a Party to Nominate an Election Winner?},
booktitle = {Proceedings of the Twenty-Fifth International Joint Conference on
Artificial Intelligence, {IJCAI} 2016, New York, NY, USA, 9-15 July
2016},
pages = {257--263},
publisher = {{IJCAI/AAAI} Press},
year = {2016},
url = {http://www.ijcai.org/Abstract/16/044},
timestamp = {Tue, 20 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/FaliszewskiGLLM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/AbouEishaHLMRZ16,
author = {Hassan AbouEisha and
Shahid Hussain and
Vadim V. Lozin and
J{\'{e}}r{\^{o}}me Monnot and
Bernard Ries and
Victor Zamaraev},
editor = {Veli M{\"{a}}kinen and
Simon J. Puglisi and
Leena Salmela},
title = {A Boundary Property for Upper Domination},
booktitle = {Combinatorial Algorithms - 27th International Workshop, {IWOCA} 2016,
Helsinki, Finland, August 17-19, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9843},
pages = {229--240},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-44543-4\_18},
doi = {10.1007/978-3-319-44543-4\_18},
timestamp = {Wed, 11 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/AbouEishaHLMRZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/BazganBCFJKLLMP16,
author = {Cristina Bazgan and
Ljiljana Brankovic and
Katrin Casel and
Henning Fernau and
Klaus Jansen and
Kim{-}Manuel Klein and
Michael Lampis and
Mathieu Liedloff and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos},
editor = {Veli M{\"{a}}kinen and
Simon J. Puglisi and
Leena Salmela},
title = {Upper Domination: Complexity and Approximation},
booktitle = {Combinatorial Algorithms - 27th International Workshop, {IWOCA} 2016,
Helsinki, Finland, August 17-19, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9843},
pages = {241--252},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-44543-4\_19},
doi = {10.1007/978-3-319-44543-4\_19},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwoca/BazganBCFJKLLMP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/FotakisGM16,
author = {Dimitris Fotakis and
Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot},
editor = {Yang Cai and
Adrian Vetta},
title = {Conference Program Design with Single-Peaked and Single-Crossing Preferences},
booktitle = {Web and Internet Economics - 12th International Conference, {WINE}
2016, Montreal, Canada, December 11-14, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10123},
pages = {221--235},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-54110-4\_16},
doi = {10.1007/978-3-662-54110-4\_16},
timestamp = {Sat, 09 Apr 2022 12:47:11 +0200},
biburl = {https://dblp.org/rec/conf/wine/FotakisGM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AzizBLLM16,
author = {Haris Aziz and
P{\'{e}}ter Bir{\'{o}} and
J{\'{e}}r{\^{o}}me Lang and
Julien Lesca and
J{\'{e}}r{\^{o}}me Monnot},
title = {Optimal Reallocation under Additive and Ordinal Preferences},
journal = {CoRR},
volume = {abs/1604.01091},
year = {2016},
url = {http://arxiv.org/abs/1604.01091},
eprinttype = {arXiv},
eprint = {1604.01091},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/AzizBLLM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GourvesMT16,
author = {Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot and
Lydia Tlilane},
title = {Subset Sum Problems With Digraph Constraints},
journal = {CoRR},
volume = {abs/1609.01078},
year = {2016},
url = {http://arxiv.org/abs/1609.01078},
eprinttype = {arXiv},
eprint = {1609.01078},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GourvesMT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AbouEishaHLMRZ16,
author = {Hassan AbouEisha and
Shahid Hussain and
Vadim V. Lozin and
J{\'{e}}r{\^{o}}me Monnot and
Bernard Ries and
Victor Zamaraev},
title = {Upper Domination: towards a dichotomy through boundary properties},
journal = {CoRR},
volume = {abs/1609.01510},
year = {2016},
url = {http://arxiv.org/abs/1609.01510},
eprinttype = {arXiv},
eprint = {1609.01510},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/AbouEishaHLMRZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GourvesMT15,
author = {Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot and
Lydia Tlilane},
title = {Approximate tradeoffs on weighted labeled matroids},
journal = {Discret. Appl. Math.},
volume = {184},
pages = {154--166},
year = {2015},
url = {https://doi.org/10.1016/j.dam.2014.11.005},
doi = {10.1016/J.DAM.2014.11.005},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GourvesMT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Monnot15,
author = {J{\'{e}}r{\^{o}}me Monnot},
title = {A note on the traveling salesman reoptimization problem under vertex
insertion},
journal = {Inf. Process. Lett.},
volume = {115},
number = {3},
pages = {435--438},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2014.11.003},
doi = {10.1016/J.IPL.2014.11.003},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Monnot15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/LozinMR15,
author = {Vadim V. Lozin and
J{\'{e}}r{\^{o}}me Monnot and
Bernard Ries},
title = {On the maximum independent set problem in subclasses of subcubic graphs},
journal = {J. Discrete Algorithms},
volume = {31},
pages = {104--112},
year = {2015},
url = {https://doi.org/10.1016/j.jda.2014.08.005},
doi = {10.1016/J.JDA.2014.08.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/LozinMR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/EscoffierMPX15,
author = {Bruno Escoffier and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos and
Mingyu Xiao},
title = {New Results on Polynomial Inapproximabilityand Fixed Parameter Approximability
of Edge Dominating Set},
journal = {Theory Comput. Syst.},
volume = {56},
number = {2},
pages = {330--346},
year = {2015},
url = {https://doi.org/10.1007/s00224-014-9549-5},
doi = {10.1007/S00224-014-9549-5},
timestamp = {Mon, 08 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/EscoffierMPX15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/GourvesMMT15,
author = {Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot and
Stefano Moretti and
Kim Thang Nguyen},
title = {Congestion Games with Capacitated Resources},
journal = {Theory Comput. Syst.},
volume = {57},
number = {3},
pages = {598--616},
year = {2015},
url = {https://doi.org/10.1007/s00224-014-9541-0},
doi = {10.1007/S00224-014-9541-0},
timestamp = {Mon, 03 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/GourvesMMT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GourvesMT15,
author = {Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot and
Lydia Tlilane},
title = {Worst case compromises in matroids with applications to the allocation
of indivisible goods},
journal = {Theor. Comput. Sci.},
volume = {589},
pages = {121--140},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2015.04.029},
doi = {10.1016/J.TCS.2015.04.029},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GourvesMT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FariaGMM15,
author = {Lu{\'{e}}rbio Faria and
Laurent Gourv{\`{e}}s and
Carlos A. J. Martinhon and
J{\'{e}}r{\^{o}}me Monnot},
title = {The edge-recoloring cost of monochromatic and properly edge-colored
paths and cycles},
journal = {Theor. Comput. Sci.},
volume = {602},
pages = {89--102},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2015.08.016},
doi = {10.1016/J.TCS.2015.08.016},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FariaGMM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BazganBCFJLLMP15,
author = {Cristina Bazgan and
Ljiljana Brankovic and
Katrin Casel and
Henning Fernau and
Klaus Jansen and
Michael Lampis and
Mathieu Liedloff and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos},
title = {Algorithmic Aspects of Upper Domination},
journal = {CoRR},
volume = {abs/1506.07260},
year = {2015},
url = {http://arxiv.org/abs/1506.07260},
eprinttype = {arXiv},
eprint = {1506.07260},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BazganBCFJLLMP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AlfandariM14,
author = {Laurent Alfandari and
J{\'{e}}r{\^{o}}me Monnot},
title = {A note on the Clustered Set Covering Problem},
journal = {Discret. Appl. Math.},
volume = {164},
pages = {13--19},
year = {2014},
url = {https://doi.org/10.1016/j.dam.2011.11.030},
doi = {10.1016/J.DAM.2011.11.030},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/AlfandariM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DemangeMPR14,
author = {Marc Demange and
J{\'{e}}r{\^{o}}me Monnot and
Petrica C. Pop and
Bernard Ries},
title = {On the complexity of the selective graph coloring problem in some
special classes of graphs},
journal = {Theor. Comput. Sci.},
volume = {540},
pages = {89--102},
year = {2014},
url = {https://doi.org/10.1016/j.tcs.2013.04.018},
doi = {10.1016/J.TCS.2013.04.018},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DemangeMPR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/FerraioliGM14,
author = {Diodato Ferraioli and
Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot},
editor = {Ana L. C. Bazzan and
Michael N. Huhns and
Alessio Lomuscio and
Paul Scerri},
title = {On regular and approximately fair allocations of indivisible goods},
booktitle = {International conference on Autonomous Agents and Multi-Agent Systems,
{AAMAS} '14, Paris, France, May 5-9, 2014},
pages = {997--1004},
publisher = {{IFAAMAS/ACM}},
year = {2014},
url = {http://dl.acm.org/citation.cfm?id=2617405},
timestamp = {Thu, 25 Sep 2014 07:46:15 +0200},
biburl = {https://dblp.org/rec/conf/atal/FerraioliGM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/AbouEishaHLMR14,
author = {Hassan AbouEisha and
Shahid Hussain and
Vadim V. Lozin and
J{\'{e}}r{\^{o}}me Monnot and
Bernard Ries},
editor = {Zhao Zhang and
Lidong Wu and
Wen Xu and
Ding{-}Zhu Du},
title = {A Dichotomy for Upper Domination in Monogenic Classes},
booktitle = {Combinatorial Optimization and Applications - 8th International Conference,
{COCOA} 2014, Wailea, Maui, HI, USA, December 19-21, 2014, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8881},
pages = {258--267},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-12691-3\_20},
doi = {10.1007/978-3-319-12691-3\_20},
timestamp = {Wed, 11 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/AbouEishaHLMR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ecai/GourvesMT14,
author = {Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot and
Lydia Tlilane},
editor = {Torsten Schaub and
Gerhard Friedrich and
Barry O'Sullivan},
title = {Near Fairness in Matroids},
booktitle = {{ECAI} 2014 - 21st European Conference on Artificial Intelligence,
18-22 August 2014, Prague, Czech Republic - Including Prestigious
Applications of Intelligent Systems {(PAIS} 2014)},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {263},
pages = {393--398},
publisher = {{IOS} Press},
year = {2014},
url = {https://doi.org/10.3233/978-1-61499-419-0-393},
doi = {10.3233/978-1-61499-419-0-393},
timestamp = {Mon, 19 Jun 2023 16:36:09 +0200},
biburl = {https://dblp.org/rec/conf/ecai/GourvesMT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ifipTCS/GourvesMP14,
author = {Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot and
Aris Pagourtzis},
editor = {Josep D{\'{\i}}az and
Ivan Lanese and
Davide Sangiorgi},
title = {The Lazy Matroid Problem},
booktitle = {Theoretical Computer Science - 8th {IFIP} {TC} 1/WG 2.2 International
Conference, {TCS} 2014, Rome, Italy, September 1-3, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8705},
pages = {66--77},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-44602-7\_6},
doi = {10.1007/978-3-662-44602-7\_6},
timestamp = {Tue, 14 May 2019 10:00:36 +0200},
biburl = {https://dblp.org/rec/conf/ifipTCS/GourvesMP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aamas/EscoffierGM13,
author = {Bruno Escoffier and
Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot},
title = {Fair solutions for some multiagent optimization problems},
journal = {Auton. Agents Multi Agent Syst.},
volume = {26},
number = {2},
pages = {184--201},
year = {2013},
url = {https://doi.org/10.1007/s10458-011-9188-z},
doi = {10.1007/S10458-011-9188-Z},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/aamas/EscoffierGM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FritzilasMMR13,
author = {Epameinondas Fritzilas and
Martin Milanic and
J{\'{e}}r{\^{o}}me Monnot and
Yasm{\'{\i}}n {\'{A}}. R{\'{\i}}os{-}Sol{\'{\i}}s},
title = {Resilience and optimization of identifiable bipartite graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {4-5},
pages = {593--603},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.01.005},
doi = {10.1016/J.DAM.2012.01.005},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FritzilasMMR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GourvesLMM13,
author = {Laurent Gourv{\`{e}}s and
Adria Lyra and
Carlos A. J. Martinhon and
J{\'{e}}r{\^{o}}me Monnot},
title = {Complexity of trails, paths and circuits in arc-colored digraphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {6},
pages = {819--828},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.10.025},
doi = {10.1016/J.DAM.2012.10.025},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GourvesLMM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmaa/BoriaMP13,
author = {Nicolas Boria and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos},
title = {Reoptimization under Vertex Insertion: Max P\({}_{\mbox{K}}\)-Free
Subgraph and Max Planar Subgraph},
journal = {Discret. Math. Algorithms Appl.},
volume = {5},
number = {2},
year = {2013},
url = {https://doi.org/10.1142/S1793830913600045},
doi = {10.1142/S1793830913600045},
timestamp = {Wed, 12 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmaa/BoriaMP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BazganGM13,
author = {Cristina Bazgan and
Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot},
title = {Approximation with a fixed number of solutions of some multiobjective
maximization problems},
journal = {J. Discrete Algorithms},
volume = {22},
pages = {19--29},
year = {2013},
url = {https://doi.org/10.1016/j.jda.2013.06.006},
doi = {10.1016/J.JDA.2013.06.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BazganGM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BazganGMP13,
author = {Cristina Bazgan and
Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot and
Fanny Pascual},
title = {Single approximation for the biobjective Max {TSP}},
journal = {Theor. Comput. Sci.},
volume = {478},
pages = {41--50},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2013.01.021},
doi = {10.1016/J.TCS.2013.01.021},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BazganGMP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BoriaMP13,
author = {Nicolas Boria and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos},
title = {Reoptimization of maximum weight induced hereditary subgraph problems},
journal = {Theor. Comput. Sci.},
volume = {514},
pages = {61--74},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2012.10.037},
doi = {10.1016/J.TCS.2012.10.037},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BoriaMP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aldt/BarrotGLMR13,
author = {Nathana{\"{e}}l Barrot and
Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Lang and
J{\'{e}}r{\^{o}}me Monnot and
Bernard Ries},
editor = {Patrice Perny and
Marc Pirlot and
Alexis Tsouki{\`{a}}s},
title = {Possible Winners in Approval Voting},
booktitle = {Algorithmic Decision Theory - Third International Conference, {ADT}
2013, Bruxelles, Belgium, November 12-14, 2013, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8176},
pages = {57--70},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-41575-3\_5},
doi = {10.1007/978-3-642-41575-3\_5},
timestamp = {Mon, 03 Jan 2022 22:21:02 +0100},
biburl = {https://dblp.org/rec/conf/aldt/BarrotGLMR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/EscoffierMPS13,
author = {Bruno Escoffier and
J{\'{e}}r{\^{o}}me Monnot and
Fanny Pascual and
Olivier Spanjaard},
editor = {Paul G. Spirakis and
Maria J. Serna},
title = {Truthful Many-to-Many Assignment with Private Weights},
booktitle = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013,
Barcelona, Spain, May 22-24, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7878},
pages = {209--220},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38233-8\_18},
doi = {10.1007/978-3-642-38233-8\_18},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/ciac/EscoffierMPS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/GourvesMP13,
author = {Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot and
Aris Pagourtzis},
editor = {Leszek Gasieniec and
Frank Wolter},
title = {The Lazy Bureaucrat Problem with Common Arrivals and Deadlines: Approximation
and Mechanism Design},
booktitle = {Fundamentals of Computation Theory - 19th International Symposium,
{FCT} 2013, Liverpool, UK, August 19-21, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8070},
pages = {171--182},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40164-0\_18},
doi = {10.1007/978-3-642-40164-0\_18},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/GourvesMP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/GourvesMT13,
author = {Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot and
Lydia Tlilane},
editor = {Francesca Rossi},
title = {A Matroid Approach to the Worst Case Allocation of Indivisible Goods},
booktitle = {{IJCAI} 2013, Proceedings of the 23rd International Joint Conference
on Artificial Intelligence, Beijing, China, August 3-9, 2013},
pages = {136--142},
publisher = {{IJCAI/AAAI}},
year = {2013},
url = {http://www.aaai.org/ocs/index.php/IJCAI/IJCAI13/paper/view/6693},
timestamp = {Tue, 23 Jan 2024 13:25:46 +0100},
biburl = {https://dblp.org/rec/conf/ijcai/GourvesMT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/LozinMR13,
author = {Vadim V. Lozin and
J{\'{e}}r{\^{o}}me Monnot and
Bernard Ries},
editor = {Thierry Lecroq and
Laurent Mouchard},
title = {On the Maximum Independent Set Problem in Subclasses of Subcubic Graphs},
booktitle = {Combinatorial Algorithms - 24th International Workshop, {IWOCA} 2013,
Rouen, France, July 10-12, 2013, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8288},
pages = {314--326},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45278-9\_27},
doi = {10.1007/978-3-642-45278-9\_27},
timestamp = {Wed, 25 Sep 2019 18:08:04 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/LozinMR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/GourvesMT13,
author = {Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot and
Lydia Tlilane},
editor = {Yiling Chen and
Nicole Immorlica},
title = {A Protocol for Cutting Matroids Like Cakes},
booktitle = {Web and Internet Economics - 9th International Conference, {WINE}
2013, Cambridge, MA, USA, December 11-14, 2013, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8289},
pages = {216--229},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45046-4\_18},
doi = {10.1007/978-3-642-45046-4\_18},
timestamp = {Thu, 12 Aug 2021 18:47:48 +0200},
biburl = {https://dblp.org/rec/conf/wine/GourvesMT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aor/GourvesMP12,
author = {Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot and
Fanny Pascual},
title = {Cooperation in multiorganization matching},
journal = {Algorithmic Oper. Res.},
volume = {7},
number = {2},
year = {2012},
url = {http://journals.hil.unb.ca/index.php/AOR/article/view/20400},
timestamp = {Wed, 10 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/aor/GourvesMP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/GourvesLMM12,
author = {Laurent Gourv{\`{e}}s and
Adria Ramos de Lyra and
Carlos A. J. Martinhon and
J{\'{e}}r{\^{o}}me Monnot},
title = {On paths, trails and closed trails in edge-colored graphs},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {14},
number = {2},
pages = {57--74},
year = {2012},
url = {https://doi.org/10.46298/dmtcs.586},
doi = {10.46298/DMTCS.586},
timestamp = {Fri, 07 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmtcs/GourvesLMM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/im/EscoffierGM12,
author = {Bruno Escoffier and
Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot},
title = {Strategic Coloring of a Graph},
journal = {Internet Math.},
volume = {8},
number = {4},
pages = {424--455},
year = {2012},
url = {https://doi.org/10.1080/15427951.2012.709217},
doi = {10.1080/15427951.2012.709217},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/im/EscoffierGM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mss/ChevaleyreLMMX12,
author = {Yann Chevaleyre and
J{\'{e}}r{\^{o}}me Lang and
Nicolas Maudet and
J{\'{e}}r{\^{o}}me Monnot and
Lirong Xia},
title = {New candidates welcome! Possible winners with respect to the addition
of new candidates},
journal = {Math. Soc. Sci.},
volume = {64},
number = {1},
pages = {74--88},
year = {2012},
url = {https://doi.org/10.1016/j.mathsocsci.2011.12.003},
doi = {10.1016/J.MATHSOCSCI.2011.12.003},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mss/ChevaleyreLMMX12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/CouetouxMT12,
author = {Basile Cou{\"{e}}toux and
J{\'{e}}r{\^{o}}me Monnot and
Sonia Toubaline},
editor = {Guohui Lin},
title = {Complexity Results for the Empire Problem in Collection of Stars},
booktitle = {Combinatorial Optimization and Applications - 6th International Conference,
{COCOA} 2012, Banff, AB, Canada, August 5-9, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7402},
pages = {73--82},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31770-5\_7},
doi = {10.1007/978-3-642-31770-5\_7},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/CouetouxMT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ecai/GourvesMT12,
author = {Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot and
Lydia Tlilane},
editor = {Luc De Raedt and
Christian Bessiere and
Didier Dubois and
Patrick Doherty and
Paolo Frasconi and
Fredrik Heintz and
Peter J. F. Lucas},
title = {Approximate Tradeoffs on Matroids},
booktitle = {{ECAI} 2012 - 20th European Conference on Artificial Intelligence.
Including Prestigious Applications of Artificial Intelligence {(PAIS-2012)}
System Demonstrations Track, Montpellier, France, August 27-31 , 2012},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {242},
pages = {360--365},
publisher = {{IOS} Press},
year = {2012},
url = {https://doi.org/10.3233/978-1-61499-098-7-360},
doi = {10.3233/978-1-61499-098-7-360},
timestamp = {Mon, 19 Jun 2023 16:36:09 +0200},
biburl = {https://dblp.org/rec/conf/ecai/GourvesMT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iscopt/DemangeMPR12,
author = {Marc Demange and
J{\'{e}}r{\^{o}}me Monnot and
Petrica C. Pop and
Bernard Ries},
editor = {Ali Ridha Mahjoub and
Vangelis Markakis and
Ioannis Milis and
Vangelis Th. Paschos},
title = {Selective Graph Coloring in Some Special Classes of Graphs},
booktitle = {Combinatorial Optimization - Second International Symposium, {ISCO}
2012, Athens, Greece, April 19-21, 2012, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7422},
pages = {320--331},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32147-4\_29},
doi = {10.1007/978-3-642-32147-4\_29},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/iscopt/DemangeMPR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/EscoffierMPX12,
author = {Bruno Escoffier and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos and
Mingyu Xiao},
editor = {Dimitrios M. Thilikos and
Gerhard J. Woeginger},
title = {New Results on Polynomial Inapproximability and Fixed Parameter Approximability
of edge dominating set},
booktitle = {Parameterized and Exact Computation - 7th International Symposium,
{IPEC} 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7535},
pages = {25--36},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-33293-7\_5},
doi = {10.1007/978-3-642-33293-7\_5},
timestamp = {Mon, 08 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/EscoffierMPX12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/BoriaMP12,
author = {Nicolas Boria and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos},
editor = {David Fern{\'{a}}ndez{-}Baca},
title = {Reoptimization of Some Maximum Weight Induced Hereditary Subgraph
Problems},
booktitle = {{LATIN} 2012: Theoretical Informatics - 10th Latin American Symposium,
Arequipa, Peru, April 16-20, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7256},
pages = {73--84},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-29344-3\_7},
doi = {10.1007/978-3-642-29344-3\_7},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/BoriaMP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/GourvesMMT12,
author = {Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot and
Stefano Moretti and
Kim Thang Nguyen},
editor = {Maria J. Serna},
title = {Congestion Games with Capacitated Resources},
booktitle = {Algorithmic Game Theory - 5th International Symposium, {SAGT} 2012,
Barcelona, Spain, October 22-23, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7615},
pages = {204--215},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-33996-7\_18},
doi = {10.1007/978-3-642-33996-7\_18},
timestamp = {Mon, 03 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sagt/GourvesMMT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/valuetools/EscoffierGMM12,
author = {Bruno Escoffier and
Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot and
Stefano Moretti},
editor = {Bruno Gaujal and
Alain Jean{-}Marie and
Eduard A. Jorswieck and
Alexandre Seuret},
title = {Cost allocation protocols for network formation on connection situations},
booktitle = {6th International {ICST} Conference on Performance Evaluation Methodologies
and Tools, Cargese, Corsica, France, October 9-12, 2012},
pages = {228--234},
publisher = {{ICST/IEEE}},
year = {2012},
url = {https://doi.org/10.4108/valuetools.2012.250360},
doi = {10.4108/VALUETOOLS.2012.250360},
timestamp = {Tue, 04 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/valuetools/EscoffierGMM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/BoriaMP12,
author = {Nicolas Boria and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos},
editor = {Md. Saidur Rahman and
Shin{-}Ichi Nakano},
title = {Reoptimization of the Maximum Weighted {P} k -Free Subgraph Problem
under Vertex Insertion},
booktitle = {{WALCOM:} Algorithms and Computation - 6th International Workshop,
{WALCOM} 2012, Dhaka, Bangladesh, February 15-17, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7157},
pages = {76--87},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-28076-4\_10},
doi = {10.1007/978-3-642-28076-4\_10},
timestamp = {Tue, 21 Mar 2023 20:55:51 +0100},
biburl = {https://dblp.org/rec/conf/walcom/BoriaMP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/XiaLM11,
author = {Lirong Xia and
J{\'{e}}r{\^{o}}me Lang and
J{\'{e}}r{\^{o}}me Monnot},
editor = {Liz Sonenberg and
Peter Stone and
Kagan Tumer and
Pinar Yolum},
title = {Possible winners when new alternatives join: new results coming up!},
booktitle = {10th International Conference on Autonomous Agents and Multiagent
Systems {(AAMAS} 2011), Taipei, Taiwan, May 2-6, 2011, Volume 1-3},
pages = {829--836},
publisher = {{IFAAMAS}},
year = {2011},
url = {http://portal.acm.org/citation.cfm?id=2031736\&\#38;CFID=54178199\&\#38;CFTOKEN=61392764},
timestamp = {Fri, 18 Nov 2011 09:09:28 +0100},
biburl = {https://dblp.org/rec/conf/atal/XiaLM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/EscoffierGM11,
author = {Bruno Escoffier and
Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot},
editor = {Giuseppe Persiano},
title = {The Price of Optimum in a Matching Game},
booktitle = {Algorithmic Game Theory, 4th International Symposium, {SAGT} 2011,
Amalfi, Italy, October 17-19, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6982},
pages = {81--92},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-24829-0\_9},
doi = {10.1007/978-3-642-24829-0\_9},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/sagt/EscoffierGM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tark/ChevaleyreLMM11,
author = {Yann Chevaleyre and
J{\'{e}}r{\^{o}}me Lang and
Nicolas Maudet and
J{\'{e}}r{\^{o}}me Monnot},
editor = {Krzysztof R. Apt},
title = {Compilation and communication protocols for voting rules with a dynamic
set of candidates},
booktitle = {Proceedings of the 13th Conference on Theoretical Aspects of Rationality
and Knowledge (TARK-2011), Groningen, The Netherlands, July 12-14,
2011},
pages = {153--160},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/2000378.2000396},
doi = {10.1145/2000378.2000396},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tark/ChevaleyreLMM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/BazganGMP11,
author = {Cristina Bazgan and
Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot and
Fanny Pascual},
editor = {Roberto Solis{-}Oba and
Giuseppe Persiano},
title = {Single Approximation for Biobjective Max {TSP}},
booktitle = {Approximation and Online Algorithms - 9th International Workshop,
{WAOA} 2011, Saarbr{\"{u}}cken, Germany, September 8-9, 2011,
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7164},
pages = {49--62},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-29116-6\_5},
doi = {10.1007/978-3-642-29116-6\_5},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/waoa/BazganGMP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/BazganGM11,
author = {Cristina Bazgan and
Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot},
editor = {Roberto Solis{-}Oba and
Giuseppe Persiano},
title = {Approximation with a Fixed Number of Solutions of Some Biobjective
Maximization Problems},
booktitle = {Approximation and Online Algorithms - 9th International Workshop,
{WAOA} 2011, Saarbr{\"{u}}cken, Germany, September 8-9, 2011,
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7164},
pages = {233--246},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-29116-6\_20},
doi = {10.1007/978-3-642-29116-6\_20},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/BazganGM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1111-3690,
author = {Yann Chevaleyre and
J{\'{e}}r{\^{o}}me Lang and
Nicolas Maudet and
J{\'{e}}r{\^{o}}me Monnot and
Lirong Xia},
title = {New Candidates Welcome! Possible Winners with respect to the Addition
of New Candidates},
journal = {CoRR},
volume = {abs/1111.3690},
year = {2011},
url = {http://arxiv.org/abs/1111.3690},
eprinttype = {arXiv},
eprint = {1111.3690},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1111-3690.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HassinMS10,
author = {Refael Hassin and
J{\'{e}}r{\^{o}}me Monnot and
Danny Segev},
title = {The Complexity of Bottleneck Labeled Graph Problems},
journal = {Algorithmica},
volume = {58},
number = {2},
pages = {245--262},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9261-4},
doi = {10.1007/S00453-008-9261-4},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HassinMS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GourvesLMM10,
author = {Laurent Gourv{\`{e}}s and
Adria Lyra and
Carlos A. J. Martinhon and
J{\'{e}}r{\^{o}}me Monnot},
title = {The minimum reload s-t path, trail and walk problems},
journal = {Discret. Appl. Math.},
volume = {158},
number = {13},
pages = {1404--1417},
year = {2010},
url = {https://doi.org/10.1016/j.dam.2010.03.009},
doi = {10.1016/J.DAM.2010.03.009},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GourvesLMM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/CouetouxGMT10,
author = {Basile Cou{\"{e}}toux and
Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot and
Orestis Telelis},
title = {Labeled Traveling Salesman Problems: Complexity and approximation},
journal = {Discret. Optim.},
volume = {7},
number = {1-2},
pages = {74--85},
year = {2010},
url = {https://doi.org/10.1016/j.disopt.2010.02.003},
doi = {10.1016/J.DISOPT.2010.02.003},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/CouetouxGMT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/AlfandariM10,
author = {Laurent Alfandari and
J{\'{e}}r{\^{o}}me Monnot},
title = {Approximation of the Clustered Set Covering Problem},
journal = {Electron. Notes Discret. Math.},
volume = {36},
pages = {479--485},
year = {2010},
url = {https://doi.org/10.1016/j.endm.2010.05.061},
doi = {10.1016/J.ENDM.2010.05.061},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/AlfandariM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/EscoffierGMS10,
author = {Bruno Escoffier and
Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot and
Olivier Spanjaard},
title = {Two-stage stochastic matching and spanning tree problems: Polynomial
instances and approximation},
journal = {Eur. J. Oper. Res.},
volume = {205},
number = {1},
pages = {19--30},
year = {2010},
url = {https://doi.org/10.1016/j.ejor.2009.12.004},
doi = {10.1016/J.EJOR.2009.12.004},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/EscoffierGMS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/EscoffierGM10,
author = {Bruno Escoffier and
Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot},
title = {Complexity and approximation results for the connected vertex cover
problem in graphs and hypergraphs},
journal = {J. Discrete Algorithms},
volume = {8},
number = {1},
pages = {36--49},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2009.01.005},
doi = {10.1016/J.JDA.2009.01.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/EscoffierGM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/ChevaleyreLMM10,
author = {Yann Chevaleyre and
J{\'{e}}r{\^{o}}me Lang and
Nicolas Maudet and
J{\'{e}}r{\^{o}}me Monnot},
editor = {Maria Fox and
David Poole},
title = {Possible Winners when New Candidates Are Added: The Case of Scoring
Rules},
booktitle = {Proceedings of the Twenty-Fourth {AAAI} Conference on Artificial Intelligence,
{AAAI} 2010, Atlanta, Georgia, USA, July 11-15, 2010},
pages = {762--767},
publisher = {{AAAI} Press},
year = {2010},
url = {https://doi.org/10.1609/aaai.v24i1.7640},
doi = {10.1609/AAAI.V24I1.7640},
timestamp = {Mon, 04 Sep 2023 16:23:45 +0200},
biburl = {https://dblp.org/rec/conf/aaai/ChevaleyreLMM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/EscoffierGM10,
author = {Bruno Escoffier and
Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot},
editor = {Tiziana Calamoneri and
Josep D{\'{\i}}az},
title = {Strategic Coloring of a Graph},
booktitle = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010,
Rome, Italy, May 26-28, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6078},
pages = {155--166},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13073-1\_15},
doi = {10.1007/978-3-642-13073-1\_15},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/ciac/EscoffierGM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/EscoffierGM10,
author = {Bruno Escoffier and
Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot},
editor = {Boaz Patt{-}Shamir and
T{\'{\i}}naz Ekim},
title = {On the Impact of Local Taxes in a Set Cover Game},
booktitle = {Structural Information and Communication Complexity, 17th International
Colloquium, {SIROCCO} 2010, Sirince, Turkey, June 7-11, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6058},
pages = {2--13},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13284-1\_2},
doi = {10.1007/978-3-642-13284-1\_2},
timestamp = {Fri, 17 Apr 2020 13:19:16 +0200},
biburl = {https://dblp.org/rec/conf/sirocco/EscoffierGM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/ChattiGM10,
author = {Hatem Chatti and
Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot},
editor = {Jan van Leeuwen and
Anca Muscholl and
David Peleg and
Jaroslav Pokorn{\'{y}} and
Bernhard Rumpe},
title = {On a Labeled Vehicle Routing Problem},
booktitle = {{SOFSEM} 2010: Theory and Practice of Computer Science, 36th Conference
on Current Trends in Theory and Practice of Computer Science, Spindleruv
Ml{\'{y}}n, Czech Republic, January 23-29, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5901},
pages = {271--282},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-11266-9\_23},
doi = {10.1007/978-3-642-11266-9\_23},
timestamp = {Sat, 30 Sep 2023 09:57:10 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/ChattiGM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/GourvesLMM10,
author = {Laurent Gourv{\`{e}}s and
Adria Lyra and
Carlos A. J. Martinhon and
J{\'{e}}r{\^{o}}me Monnot},
editor = {Jan Kratochv{\'{\i}}l and
Angsheng Li and
Jir{\'{\i}} Fiala and
Petr Kolman},
title = {Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs},
booktitle = {Theory and Applications of Models of Computation, 7th Annual Conference,
{TAMC} 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6108},
pages = {222--233},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13562-0\_21},
doi = {10.1007/978-3-642-13562-0\_21},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/tamc/GourvesLMM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/GourvesM10,
author = {Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot},
editor = {Jan Kratochv{\'{\i}}l and
Angsheng Li and
Jir{\'{\i}} Fiala and
Petr Kolman},
title = {The Max \emph{k}-Cut Game and Its Strong Equilibria},
booktitle = {Theory and Applications of Models of Computation, 7th Annual Conference,
{TAMC} 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6108},
pages = {234--246},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13562-0\_22},
doi = {10.1007/978-3-642-13562-0\_22},
timestamp = {Sun, 21 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tamc/GourvesM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1012-3889,
author = {Bruno Escoffier and
Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot},
title = {Minimum regulation of uncoordinated matchings},
journal = {CoRR},
volume = {abs/1012.3889},
year = {2010},
url = {http://arxiv.org/abs/1012.3889},
eprinttype = {arXiv},
eprint = {1012.3889},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1012-3889.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/WerraDEMP09,
author = {Dominique de Werra and
Marc Demange and
Bruno Escoffier and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos},
title = {Weighted coloring on planar, bipartite and split graphs: Complexity
and approximation},
journal = {Discret. Appl. Math.},
volume = {157},
number = {4},
pages = {819--832},
year = {2009},
url = {https://doi.org/10.1016/j.dam.2008.06.013},
doi = {10.1016/J.DAM.2008.06.013},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/WerraDEMP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/GourvesLMMP09,
author = {Laurent Gourv{\`{e}}s and
Adria Lyra and
Carlos A. J. Martinhon and
J{\'{e}}r{\^{o}}me Monnot and
F{\'{a}}bio Protti},
title = {On s-t paths and trails in edge-colored graphs},
journal = {Electron. Notes Discret. Math.},
volume = {35},
pages = {221--226},
year = {2009},
url = {https://doi.org/10.1016/j.endm.2009.11.037},
doi = {10.1016/J.ENDM.2009.11.037},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/GourvesLMMP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/MilanicM09,
author = {Martin Milanic and
J{\'{e}}r{\^{o}}me Monnot},
title = {The Exact Weighted Independent Set Problem in Perfect Graphs and Related
Classes},
journal = {Electron. Notes Discret. Math.},
volume = {35},
pages = {317--322},
year = {2009},
url = {https://doi.org/10.1016/j.endm.2009.11.052},
doi = {10.1016/J.ENDM.2009.11.052},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/MilanicM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/AusielloEMP09,
author = {Giorgio Ausiello and
Bruno Escoffier and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos},
title = {Reoptimization of minimum and maximum traveling salesman's tours},
journal = {J. Discrete Algorithms},
volume = {7},
number = {4},
pages = {453--463},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.12.001},
doi = {10.1016/J.JDA.2008.12.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/AusielloEMP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/GourvesLMM09,
author = {Laurent Gourv{\`{e}}s and
Adria Lyra and
Carlos A. J. Martinhon and
J{\'{e}}r{\^{o}}me Monnot},
editor = {Mogens Nielsen and
Anton{\'{\i}}n Kucera and
Peter Bro Miltersen and
Catuscia Palamidessi and
Petr Tuma and
Frank D. Valencia},
title = {The Minimum Reload s-tPath/Trail/Walk Problems},
booktitle = {{SOFSEM} 2009: Theory and Practice of Computer Science, 35th Conference
on Current Trends in Theory and Practice of Computer Science, Spindleruv
Ml{\'{y}}n, Czech Republic, January 24-30, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5404},
pages = {621--632},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-540-95891-8\_55},
doi = {10.1007/978-3-540-95891-8\_55},
timestamp = {Fri, 30 Aug 2019 10:02:27 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/GourvesLMM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/GourvesMT09,
author = {Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot and
Orestis Telelis},
editor = {Stefano Leonardi},
title = {Selfish Scheduling with Setup Times},
booktitle = {Internet and Network Economics, 5th International Workshop, {WINE}
2009, Rome, Italy, December 14-18, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5929},
pages = {292--303},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-10841-9\_27},
doi = {10.1007/978-3-642-10841-9\_27},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/wine/GourvesMT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/GourvesM09,
author = {Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot},
editor = {Stefano Leonardi},
title = {On Strong Equilibria in the Max Cut Game},
booktitle = {Internet and Network Economics, 5th International Workshop, {WINE}
2009, Rome, Italy, December 14-18, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5929},
pages = {608--615},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-10841-9\_62},
doi = {10.1007/978-3-642-10841-9\_62},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wine/GourvesM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/MonnotT08,
author = {J{\'{e}}r{\^{o}}me Monnot and
Sophie Toulouse},
title = {Approximation results for the weighted P\({}_{\mbox{4}}\) partition
problem},
journal = {J. Discrete Algorithms},
volume = {6},
number = {2},
pages = {299--312},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2007.01.006},
doi = {10.1016/J.JDA.2007.01.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/MonnotT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/EscoffierMS08,
author = {Bruno Escoffier and
J{\'{e}}r{\^{o}}me Monnot and
Olivier Spanjaard},
title = {Some tractable instances of interval data minmax regret problems},
journal = {Oper. Res. Lett.},
volume = {36},
number = {4},
pages = {424--429},
year = {2008},
url = {https://doi.org/10.1016/j.orl.2007.12.004},
doi = {10.1016/J.ORL.2007.12.004},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/EscoffierMS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rairo/Monnot08,
author = {J{\'{e}}r{\^{o}}me Monnot},
title = {A note on the hardness results for the labeled perfect matching problems
in bipartite graphs},
journal = {{RAIRO} Oper. Res.},
volume = {42},
number = {3},
pages = {315--324},
year = {2008},
url = {https://doi.org/10.1051/ro:2008020},
doi = {10.1051/RO:2008020},
timestamp = {Wed, 02 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rairo/Monnot08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/EscoffierM08,
author = {Bruno Escoffier and
J{\'{e}}r{\^{o}}me Monnot},
title = {A better differential approximation ratio for symmetric {TSP}},
journal = {Theor. Comput. Sci.},
volume = {396},
number = {1-3},
pages = {63--70},
year = {2008},
url = {https://doi.org/10.1016/j.tcs.2008.01.002},
doi = {10.1016/J.TCS.2008.01.002},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/EscoffierM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/CouetouxGMT08,
author = {Basile Cou{\"{e}}toux and
Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot and
Orestis Telelis},
editor = {Seok{-}Hee Hong and
Hiroshi Nagamochi and
Takuro Fukunaga},
title = {On Labeled Traveling Salesman Problems},
booktitle = {Algorithms and Computation, 19th International Symposium, {ISAAC}
2008, Gold Coast, Australia, December 15-17, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5369},
pages = {776--787},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-92182-0\_68},
doi = {10.1007/978-3-540-92182-0\_68},
timestamp = {Thu, 27 Apr 2023 14:57:19 +0200},
biburl = {https://dblp.org/rec/conf/isaac/CouetouxGMT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/EscoffierMS08,
author = {Bruno Escoffier and
J{\'{e}}r{\^{o}}me Monnot and
Olivier Spanjaard},
editor = {Viliam Geffert and
Juhani Karhum{\"{a}}ki and
Alberto Bertoni and
Bart Preneel and
Pavol N{\'{a}}vrat and
M{\'{a}}ria Bielikov{\'{a}}},
title = {Some Tractable Instances of Interval Data Minmax Regret Problems:
Bounded Distance from Triviality},
booktitle = {{SOFSEM} 2008: Theory and Practice of Computer Science, 34th Conference
on Current Trends in Theory and Practice of Computer Science, Nov{\'{y}}
Smokovec, Slovakia, January 19-25, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4910},
pages = {280--291},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-77566-9\_24},
doi = {10.1007/978-3-540-77566-9\_24},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/EscoffierMS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/GourvesMP08,
author = {Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot and
Fanny Pascual},
editor = {Evripidis Bampis and
Martin Skutella},
title = {Cooperation in Multiorganization Matching},
booktitle = {Approximation and Online Algorithms, 6th International Workshop, {WAOA}
2008, Karlsruhe, Germany, September 18-19, 2008. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5426},
pages = {78--91},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-93980-1\_7},
doi = {10.1007/978-3-540-93980-1\_7},
timestamp = {Thu, 23 Sep 2021 11:48:40 +0200},
biburl = {https://dblp.org/rec/conf/waoa/GourvesMP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/GourvesM08,
author = {Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot},
editor = {Christos H. Papadimitriou and
Shuzhong Zhang},
title = {Three Selfish Spanning Tree Games},
booktitle = {Internet and Network Economics, 4th International Workshop, {WINE}
2008, Shanghai, China, December 17-20, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5385},
pages = {465--476},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-92185-1\_52},
doi = {10.1007/978-3-540-92185-1\_52},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/wine/GourvesM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HassinMS07,
author = {Refael Hassin and
J{\'{e}}r{\^{o}}me Monnot and
Danny Segev},
title = {Approximation algorithms and hardness results for labeled connectivity
problems},
journal = {J. Comb. Optim.},
volume = {14},
number = {4},
pages = {437--453},
year = {2007},
url = {https://doi.org/10.1007/s10878-007-9044-x},
doi = {10.1007/S10878-007-9044-X},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HassinMS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/MonnotT07,
author = {J{\'{e}}r{\^{o}}me Monnot and
Sophie Toulouse},
title = {The path partition problem and related problems in bipartite graphs},
journal = {Oper. Res. Lett.},
volume = {35},
number = {5},
pages = {677--684},
year = {2007},
url = {https://doi.org/10.1016/j.orl.2006.12.004},
doi = {10.1016/J.ORL.2006.12.004},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/MonnotT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/DemangeWMP07,
author = {Marc Demange and
Dominique de Werra and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos},
title = {Time slot scheduling of compatible jobs},
journal = {J. Sched.},
volume = {10},
number = {2},
pages = {111--127},
year = {2007},
url = {https://doi.org/10.1007/s10951-006-0003-7},
doi = {10.1007/S10951-006-0003-7},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/DemangeWMP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/MonnotT07,
author = {J{\'{e}}r{\^{o}}me Monnot and
Sophie Toulouse},
editor = {Jan van Leeuwen and
Giuseppe F. Italiano and
Wiebe van der Hoek and
Christoph Meinel and
Harald Sack and
Frantisek Pl{\'{a}}sil},
title = {The P\({}_{\mbox{k}}\) Partition Problem and Related Problems in Bipartite
Graphs},
booktitle = {{SOFSEM} 2007: Theory and Practice of Computer Science, 33rd Conference
on Current Trends in Theory and Practice of Computer Science, Harrachov,
Czech Republic, January 20-26, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4362},
pages = {422--433},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-69507-3\_36},
doi = {10.1007/978-3-540-69507-3\_36},
timestamp = {Fri, 21 Oct 2022 16:47:28 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/MonnotT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/EscoffierGM07,
author = {Bruno Escoffier and
Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot},
editor = {Andreas Brandst{\"{a}}dt and
Dieter Kratsch and
Haiko M{\"{u}}ller},
title = {Complexity and Approximation Results for the Connected Vertex Cover
Problem},
booktitle = {Graph-Theoretic Concepts in Computer Science, 33rd International Workshop,
{WG} 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {4769},
pages = {202--213},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74839-7\_20},
doi = {10.1007/978-3-540-74839-7\_20},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/EscoffierGM07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/HassinMS07,
author = {Refael Hassin and
J{\'{e}}r{\^{o}}me Monnot and
Danny Segev},
editor = {Andreas Brandst{\"{a}}dt and
Dieter Kratsch and
Haiko M{\"{u}}ller},
title = {The Complexity of Bottleneck Labeled Graph Problems},
booktitle = {Graph-Theoretic Concepts in Computer Science, 33rd International Workshop,
{WG} 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {4769},
pages = {328--340},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74839-7\_31},
doi = {10.1007/978-3-540-74839-7\_31},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/HassinMS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/GiannakosGMP07,
author = {Aristotelis Giannakos and
Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos},
editor = {Xiaotie Deng and
Fan Chung Graham},
title = {On the Performance of Congestion Games for Optimum Satisfiability
Problems},
booktitle = {Internet and Network Economics, Third International Workshop, {WINE}
2007, San Diego, CA, USA, December 12-14, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4858},
pages = {220--231},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77105-0\_22},
doi = {10.1007/978-3-540-77105-0\_22},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/wine/GiannakosGMP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/Monnot06,
author = {J{\'{e}}r{\^{o}}me Monnot},
title = {A simple approximation algorithm for {WIS} based on the approximability
in k},
journal = {Eur. J. Oper. Res.},
volume = {171},
number = {1},
pages = {346--348},
year = {2006},
url = {https://doi.org/10.1016/j.ejor.2005.01.058},
doi = {10.1016/J.EJOR.2005.01.058},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/Monnot06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/EscoffierMP06,
author = {Bruno Escoffier and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos},
title = {Weighted Coloring: further complexity and approximability results},
journal = {Inf. Process. Lett.},
volume = {97},
number = {3},
pages = {98--103},
year = {2006},
url = {https://doi.org/10.1016/j.ipl.2005.09.013},
doi = {10.1016/J.IPL.2005.09.013},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/EscoffierMP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/HassinMS06,
author = {Refael Hassin and
J{\'{e}}r{\^{o}}me Monnot and
Danny Segev},
editor = {Rastislav Kralovic and
Pawel Urzyczyn},
title = {Approximation Algorithms and Hardness Results for Labeled Connectivity
Problems},
booktitle = {Mathematical Foundations of Computer Science 2006, 31st International
Symposium, {MFCS} 2006, Star{\'{a}} Lesn{\'{a}}, Slovakia,
August 28-September 1, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4162},
pages = {480--491},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11821069\_42},
doi = {10.1007/11821069\_42},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/HassinMS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AusielloEMP06,
author = {Giorgio Ausiello and
Bruno Escoffier and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos},
editor = {Lars Arge and
Rusins Freivalds},
title = {Reoptimization of Minimum and Maximum Traveling Salesman's Tours},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {196--207},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_20},
doi = {10.1007/11785293\_20},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/AusielloEMP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/WerraDMP05,
author = {Dominique de Werra and
Marc Demange and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos},
title = {A hypocoloring model for batch scheduling},
journal = {Discret. Appl. Math.},
volume = {146},
number = {1},
pages = {3--26},
year = {2005},
url = {https://doi.org/10.1016/j.dam.2004.06.016},
doi = {10.1016/J.DAM.2004.06.016},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/WerraDMP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BazganHM05,
author = {Cristina Bazgan and
Refael Hassin and
J{\'{e}}r{\^{o}}me Monnot},
title = {Approximation algorithms for some vehicle routing problems},
journal = {Discret. Appl. Math.},
volume = {146},
number = {1},
pages = {27--42},
year = {2005},
url = {https://doi.org/10.1016/j.dam.2004.07.003},
doi = {10.1016/J.DAM.2004.07.003},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BazganHM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/Monnot05,
author = {J{\'{e}}r{\^{o}}me Monnot},
title = {Approximation algorithms for the maximum Hamiltonian path problem
with specified endpoint(s)},
journal = {Eur. J. Oper. Res.},
volume = {161},
number = {3},
pages = {721--735},
year = {2005},
url = {https://doi.org/10.1016/j.ejor.2003.09.007},
doi = {10.1016/J.EJOR.2003.09.007},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/Monnot05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Monnot05,
author = {J{\'{e}}r{\^{o}}me Monnot},
title = {The labeled perfect matching in bipartite graphs},
journal = {Inf. Process. Lett.},
volume = {96},
number = {3},
pages = {81--88},
year = {2005},
url = {https://doi.org/10.1016/j.ipl.2005.06.009},
doi = {10.1016/J.IPL.2005.06.009},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Monnot05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/HassinM05,
author = {Refael Hassin and
J{\'{e}}r{\^{o}}me Monnot},
title = {The maximum saving partition problem},
journal = {Oper. Res. Lett.},
volume = {33},
number = {3},
pages = {242--248},
year = {2005},
url = {https://doi.org/10.1016/j.orl.2004.07.007},
doi = {10.1016/J.ORL.2004.07.007},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/HassinM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BazganMPS05,
author = {Cristina Bazgan and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos and
Fabrice Serri{\`{e}}re},
title = {On the differential approximation of {MIN} {SET} {COVER}},
journal = {Theor. Comput. Sci.},
volume = {332},
number = {1-3},
pages = {497--513},
year = {2005},
url = {https://doi.org/10.1016/j.tcs.2004.12.022},
doi = {10.1016/J.TCS.2004.12.022},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BazganMPS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/AngelBGM05,
author = {Eric Angel and
Evripidis Bampis and
Laurent Gourv{\`{e}}s and
J{\'{e}}r{\^{o}}me Monnot},
editor = {Maciej Liskiewicz and
R{\"{u}}diger Reischuk},
title = {(Non)-Approximability for the Multi-criteria \emph{TSP}(1, 2)},
booktitle = {Fundamentals of Computation Theory, 15th International Symposium,
{FCT} 2005, L{\"{u}}beck, Germany, August 17-20, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3623},
pages = {329--340},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11537311\_29},
doi = {10.1007/11537311\_29},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/AngelBGM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/MonnotT05,
author = {J{\'{e}}r{\^{o}}me Monnot and
Sophie Toulouse},
editor = {Maciej Liskiewicz and
R{\"{u}}diger Reischuk},
title = {Approximation Results for the Weighted P\({}_{\mbox{4}}\) Partition
Problems},
booktitle = {Fundamentals of Computation Theory, 15th International Symposium,
{FCT} 2005, L{\"{u}}beck, Germany, August 17-20, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3623},
pages = {388--396},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11537311\_34},
doi = {10.1007/11537311\_34},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fct/MonnotT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ictcs/EscoffierMP05,
author = {Bruno Escoffier and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos},
editor = {Mario Coppo and
Elena Lodi and
G. Michele Pinna},
title = {Weighted Coloring: Further Complexity and Approximability Results},
booktitle = {Theoretical Computer Science, 9th Italian Conference, {ICTCS} 2005,
Siena, Italy, October 12-14, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3701},
pages = {205--214},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11560586\_17},
doi = {10.1007/11560586\_17},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/ictcs/EscoffierMP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Monnot05,
author = {J{\'{e}}r{\^{o}}me Monnot},
editor = {Xiaotie Deng and
Ding{-}Zhu Du},
title = {On Complexity and Approximability of the Labeled Maximum/Perfect Matching
Problems},
booktitle = {Algorithms and Computation, 16th International Symposium, {ISAAC}
2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3827},
pages = {934--943},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11602613\_93},
doi = {10.1007/11602613\_93},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/Monnot05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/BazganMPS05,
author = {Cristina Bazgan and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos and
Fabrice Serri{\`{e}}re},
editor = {Peter Vojt{\'{a}}s and
M{\'{a}}ria Bielikov{\'{a}} and
Bernadette Charron{-}Bost and
Ondrej S{\'{y}}kora},
title = {Greedy Differential Approximations for Min Set Cover},
booktitle = {{SOFSEM} 2005: Theory and Practice of Computer Science, 31st Conference
on Current Trends in Theory and Practice of Computer Science, Liptovsk{\'{y}}
J{\'{a}}n, Slovakia, January 22-28, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3381},
pages = {62--71},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/978-3-540-30577-4\_9},
doi = {10.1007/978-3-540-30577-4\_9},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/BazganMPS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/MonnotPT04,
author = {J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos and
Sophie Toulouse},
title = {Local approximations for maximum partial subgraph problem},
journal = {Oper. Res. Lett.},
volume = {32},
number = {3},
pages = {217--224},
year = {2004},
url = {https://doi.org/10.1016/j.orl.2003.08.004},
doi = {10.1016/J.ORL.2003.08.004},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/MonnotPT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/MonnotPWDE04,
author = {J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos and
Dominique de Werra and
Marc Demange and
Bruno Escoffier},
editor = {Rudolf Fleischer and
Gerhard Trippen},
title = {Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity
and Improved Approximation},
booktitle = {Algorithms and Computation, 15th International Symposium, {ISAAC}
2004, Hong Kong, China, December 20-22, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3341},
pages = {896--907},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30551-4\_76},
doi = {10.1007/978-3-540-30551-4\_76},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/MonnotPWDE04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/WerraDMP04,
author = {Dominique de Werra and
Marc Demange and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos},
editor = {Juraj Hromkovic and
Manfred Nagl and
Bernhard Westfechtel},
title = {The Hypocoloring Problem: Complexity and Approximability Results when
the Chromatic Number Is Small},
booktitle = {Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG
2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {3353},
pages = {377--388},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30559-0\_32},
doi = {10.1007/978-3-540-30559-0\_32},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/WerraDMP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/4or/MonnotS03,
author = {J{\'{e}}r{\^{o}}me Monnot and
Olivier Spanjaard},
title = {Bottleneck shortest paths on a partially ordered scale},
journal = {4OR},
volume = {1},
number = {3},
pages = {225--241},
year = {2003},
url = {https://doi.org/10.1007/s10288-003-0017-3},
doi = {10.1007/S10288-003-0017-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/4or/MonnotS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/appml/DemangeMP03,
author = {Marc Demange and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos},
title = {Differential approximation results for the Steiner tree problem},
journal = {Appl. Math. Lett.},
volume = {16},
number = {5},
pages = {733--739},
year = {2003},
url = {https://doi.org/10.1016/S0893-9659(03)00075-2},
doi = {10.1016/S0893-9659(03)00075-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/appml/DemangeMP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/MonnotPT03,
author = {J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos and
Sophie Toulouse},
title = {Differential approximation results for the traveling salesman problem
with distances 1 and 2},
journal = {Eur. J. Oper. Res.},
volume = {145},
number = {3},
pages = {557--568},
year = {2003},
url = {https://doi.org/10.1016/S0377-2217(02)00222-9},
doi = {10.1016/S0377-2217(02)00222-9},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/MonnotPT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/MonnotPT03,
author = {J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos and
Sophie Toulouse},
title = {Approximation algorithms for the traveling salesman problem},
journal = {Math. Methods Oper. Res.},
volume = {56},
number = {3},
pages = {387--405},
year = {2003},
url = {https://doi.org/10.1007/s001860200239},
doi = {10.1007/S001860200239},
timestamp = {Tue, 03 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mmor/MonnotPT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/BruggemannMW03,
author = {Tobias Br{\"{u}}ggemann and
J{\'{e}}r{\^{o}}me Monnot and
Gerhard J. Woeginger},
title = {Local search for the minimum label spanning tree problem with bounded
color classes},
journal = {Oper. Res. Lett.},
volume = {31},
number = {3},
pages = {195--201},
year = {2003},
url = {https://doi.org/10.1016/S0167-6377(02)00241-9},
doi = {10.1016/S0167-6377(02)00241-9},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/BruggemannMW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tsi/MonnotPT03,
author = {J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos and
Sophie Toulouse},
title = {Optima locaux garantis pour l'approximation diff{\'{e}}rentielle},
journal = {Tech. Sci. Informatiques},
volume = {22},
number = {3},
pages = {257--288},
year = {2003},
url = {https://doi.org/10.3166/tsi.22.257-288},
doi = {10.3166/TSI.22.257-288},
timestamp = {Wed, 24 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tsi/MonnotPT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BazganHM03,
author = {Cristina Bazgan and
Refael Hassin and
J{\'{e}}r{\^{o}}me Monnot},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Differential Approximation for Some Routing Problems},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {277--288},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_31},
doi = {10.1007/3-540-44849-7\_31},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BazganHM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Monnot02,
author = {J{\'{e}}r{\^{o}}me Monnot},
title = {Differential approximation results for the traveling salesman and
related problems},
journal = {Inf. Process. Lett.},
volume = {82},
number = {5},
pages = {229--235},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00287-3},
doi = {10.1016/S0020-0190(01)00287-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Monnot02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rairo/Monnot02,
author = {J{\'{e}}r{\^{o}}me Monnot},
title = {Differential approximation of NP-hard problems with equal size feasible
solutions},
journal = {{RAIRO} Oper. Res.},
volume = {36},
number = {4},
pages = {279--297},
year = {2002},
url = {https://doi.org/10.1051/ro:2003008},
doi = {10.1051/RO:2003008},
timestamp = {Wed, 02 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rairo/Monnot02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/DemangeWMP02,
author = {Marc Demange and
Dominique de Werra and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos},
editor = {Ludek Kucera},
title = {Weighted Node Coloring: When Stable Sets Are Expensive},
booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop,
{WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised
Papers},
series = {Lecture Notes in Computer Science},
volume = {2573},
pages = {114--125},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-36379-3\_11},
doi = {10.1007/3-540-36379-3\_11},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/DemangeWMP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Monnot01,
author = {J{\'{e}}r{\^{o}}me Monnot},
title = {The maximum f-depth spanning tree problem},
journal = {Inf. Process. Lett.},
volume = {80},
number = {4},
pages = {179--187},
year = {2001},
url = {https://doi.org/10.1016/S0020-0190(01)00160-0},
doi = {10.1016/S0020-0190(01)00160-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Monnot01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/MonnotPT01,
author = {J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos and
Sophie Toulouse},
editor = {Rusins Freivalds},
title = {Differential Approximation Results for the Traveling Salesman Problem
with Distances 1 and 2},
booktitle = {Fundamentals of Computation Theory, 13th International Symposium,
{FCT} 2001, Riga, Latvia, August 22-24, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2138},
pages = {275--286},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44669-9\_27},
doi = {10.1007/3-540-44669-9\_27},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/MonnotPT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 02:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
