default search action
Jérôme Monnot
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
- [j74]Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
:
Extension of some edge graph problems: Standard, parameterized and approximation complexity. Discret. Appl. Math. 340: 183-201 (2023) - [j73]Vittorio Bilò
Project games. Theor. Comput. Sci. 940(Part): 97-111 (2023) - 2022
- [j72]Eun Jung Kim, Martin Milanic
Complexity and algorithms for constant diameter augmentation problems. Theor. Comput. Sci. 904: 15-26 (2022) - [j71]Katrin Casel, Henning Fernau
On the complexity of solution extension of optimization problems. Theor. Comput. Sci. 904: 48-65 (2022) - [j70]Mehdi Khosravian Ghadikolaei, Nikolaos Melissinos
Extension and its price for the connected vertex cover problem. Theor. Comput. Sci. 904: 66-80 (2022) - 2021
- [j69]Nina Chiarelli, Berenice Martínez-Barona, Martin Milanic
Strong cliques in diamond-free graphs. Theor. Comput. Sci. 858: 49-63 (2021) - [j68]Jérôme Monnot, Henning Fernau
Algorithmic aspects of upper edge domination. Theor. Comput. Sci. 877: 46-57 (2021) - [c76]Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora:
Abundant Extensions. CIAC 2021: 3-17 - [c75]Nicolas Boria, Laurent Gourvès, Vangelis Th. Paschos, Jérôme Monnot:
The Maximum Duo-Preservation String Mapping Problem with Bounded Alphabet. WABI 2021: 5:1-5:12 - 2020
- [j67]Haris Aziz
Computing and testing Pareto optimal committees. Auton. Agents Multi Agent Syst. 34(1): 24 (2020) - [j66]Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora:
Weighted Upper Edge Cover: Complexity and Approximability. J. Graph Algorithms Appl. 24(2): 65-88 (2020) - [j65]Ararat Harutyunyan, Michael Lampis, Vadim V. Lozin, Jérôme Monnot:
Maximum independent sets in subcubic graphs: New results. Theor. Comput. Sci. 846: 14-26 (2020) - [c74]Ararat Harutyunyan, Mehdi Khosravian Ghadikolaei, Nikolaos Melissinos
On the Complexity of the Upper r-Tolerant Edge Cover Problem. TTCS 2020: 32-47 - [c73]Nina Chiarelli, Berenice Martínez-Barona, Martin Milanic, Jérôme Monnot, Peter Mursic:
Strong Cliques in Diamond-Free Graphs. WG 2020: 261-273
2010 – 2019
- 2019
- [j64]Laurent Gourvès, Jérôme Monnot
On maximin share allocations in matroids. Theor. Comput. Sci. 754: 50-64 (2019) - [j63]Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei
Complexity and approximability of extended Spanning Star Forest problems in general and complete graphs. Theor. Comput. Sci. 775: 1-15 (2019) - [j62]Haris Aziz
Efficient reallocation under additive and responsive preferences. Theor. Comput. Sci. 790: 1-15 (2019) - [c72]Vittorio Bilò
Project Games. CIAC 2019: 75-86 - [c71]Katrin Casel, Henning Fernau
Extension of Vertex Cover and Independent Set in Some Classes of Graphs. CIAC 2019: 124-136 - [c70]Katrin Casel, Henning Fernau
Extension of Some Edge Graph Problems: Standard and Parameterized Complexity. FCT 2019: 185-200 - [c69]Mehdi Khosravian Ghadikolaei, Nikolaos Melissinos
Extension and Its Price for the Connected Vertex Cover Problem. IWOCA 2019: 315-326 - [c68]Vittorio Bilò
On a Simple Hedonic Game with Graph-Restricted Communication. SAGT 2019: 252-265 - [c67]Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora:
Weighted Upper Edge Cover: Complexity and Approximability. WALCOM 2019: 235-247 - [c66]Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei
Correction to: Weighted Upper Edge Cover: Complexity and Approximability. WALCOM 2019 - [c65]Ararat Harutyunyan, Michael Lampis, Vadim V. Lozin, Jérôme Monnot:
Maximum Independent Sets in Subcubic Graphs: New Results. WG 2019: 40-52 - 2018
- [j61]Hassan AbouEisha
Upper Domination: Towards a Dichotomy Through Boundary Properties. Algorithmica 80(10): 2799-2817 (2018) - [j60]Laurent Gourvès, Jérôme Monnot, Lydia Tlilane:
Subset sum problems with digraph constraints. J. Comb. Optim. 36(3): 937-964 (2018) - [j59]Cristina Bazgan, Ljiljana Brankovic
The many facets of upper domination. Theor. Comput. Sci. 717: 2-25 (2018) - [i11]Haris Aziz, Jérôme Lang, Jérôme Monnot:
Computing and Testing Pareto Optimal Committees. CoRR abs/1803.06644 (2018) - [i10]Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei
On the Complexity of Solution Extension of Optimization Problems. CoRR abs/1810.04553 (2018) - [i9]Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei
Extension of vertex cover and independent set in some classes of graphs and generalizations. CoRR abs/1810.04629 (2018) - [i8]Ararat Harutyunyan, Michael Lampis, Vadim V. Lozin, Jérôme Monnot:
Maximum Independent Sets in Subcubic Graphs: New Results. CoRR abs/1810.10940 (2018) - [i7]Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei
Weighted Upper Edge Cover: Complexity and Approximability. CoRR abs/1811.02599 (2018) - 2017
- [j58]Bruno Escoffier, Laurent Gourvès, Jérôme Monnot:
The Price of Optimum: Complexity and Approximation for a Matching Game. Algorithmica 77(3): 836-866 (2017) - [j57]Arman Boyaci, Jérôme Monnot:
Weighted upper domination number. Electron. Notes Discret. Math. 62: 171-176 (2017) - [j56]Laurent Gourvès, Jérôme Monnot, Fanny Pascual, Daniel Vanderpooten
Bi-objective matchings with the triangle inequality. Theor. Comput. Sci. 670: 1-10 (2017) - [c64]Jérôme Lang, Jérôme Monnot, Arkadii Slinko, William S. Zwicker:
Beyond Electing and Ranking: Collective Dominating Chains, Dominating Subsets and Dichotomies. AAMAS 2017: 24-32 - [c63]Laurent Gourvès, Jérôme Monnot:
Approximate Maximin Share Allocations in Matroids. CIAC 2017: 310-321 - [c62]Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei
Extended Spanning Star Forest Problems. COCOA (1) 2017: 195-209 - [c61]Dimitris Fotakis, Laurent Gourvès, Jérôme Monnot:
Selfish Transportation Games. SOFSEM 2017: 176-187 - 2016
- [c60]Cristina Bazgan, Ljiljana Brankovic
Algorithmic Aspects of Upper Domination: A Parameterised Perspective. AAIM 2016: 113-124 - [c59]Haris Aziz
Optimal Reallocation under Additive and Ordinal Preferences. AAMAS 2016: 402-410 - [c58]Haris Aziz
Computing Pareto Optimal Committees. IJCAI 2016: 60-66 - [c57]Ioannis Caragiannis, Laurent Gourvès, Jérôme Monnot:
Achieving Proportional Representation in Conference Programs. IJCAI 2016: 144-150 - [c56]Piotr Faliszewski, Laurent Gourvès, Jérôme Lang, Julien Lesca, Jérôme Monnot:
How Hard Is It for a Party to Nominate an Election Winner?. IJCAI 2016: 257-263 - [c55]Hassan AbouEisha
A Boundary Property for Upper Domination. IWOCA 2016: 229-240 - [c54]Cristina Bazgan, Ljiljana Brankovic
Upper Domination: Complexity and Approximation. IWOCA 2016: 241-252 - [c53]Dimitris Fotakis, Laurent Gourvès, Jérôme Monnot:
Conference Program Design with Single-Peaked and Single-Crossing Preferences. WINE 2016: 221-235 - [i6]Haris Aziz, Péter Biró, Jérôme Lang, Julien Lesca, Jérôme Monnot:
Optimal Reallocation under Additive and Ordinal Preferences. CoRR abs/1604.01091 (2016) - [i5]Laurent Gourvès, Jérôme Monnot, Lydia Tlilane:
Subset Sum Problems With Digraph Constraints. CoRR abs/1609.01078 (2016) - [i4]Hassan AbouEisha
Upper Domination: towards a dichotomy through boundary properties. CoRR abs/1609.01510 (2016) - 2015
- [j55]Laurent Gourvès, Jérôme Monnot, Lydia Tlilane:
Approximate tradeoffs on weighted labeled matroids. Discret. Appl. Math. 184: 154-166 (2015) - [j54]Jérôme Monnot:
A note on the traveling salesman reoptimization problem under vertex insertion. Inf. Process. Lett. 115(3): 435-438 (2015) - [j53]Vadim V. Lozin
On the maximum independent set problem in subclasses of subcubic graphs. J. Discrete Algorithms 31: 104-112 (2015) - [j52]Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos, Mingyu Xiao:
New Results on Polynomial Inapproximabilityand Fixed Parameter Approximability of Edge Dominating Set. Theory Comput. Syst. 56(2): 330-346 (2015) - [j51]Laurent Gourvès, Jérôme Monnot, Stefano Moretti, Kim Thang Nguyen:
Congestion Games with Capacitated Resources. Theory Comput. Syst. 57(3): 598-616 (2015) - [j50]Laurent Gourvès, Jérôme Monnot, Lydia Tlilane:
Worst case compromises in matroids with applications to the allocation of indivisible goods. Theor. Comput. Sci. 589: 121-140 (2015) - [j49]Luérbio Faria, Laurent Gourvès, Carlos A. J. Martinhon, Jérôme Monnot:
The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles. Theor. Comput. Sci. 602: 89-102 (2015) - [i3]Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos:
Algorithmic Aspects of Upper Domination. CoRR abs/1506.07260 (2015) - 2014
- [j48]Laurent Alfandari, Jérôme Monnot:
A note on the Clustered Set Covering Problem. Discret. Appl. Math. 164: 13-19 (2014) - [j47]Marc Demange, Jérôme Monnot, Petrica C. Pop
On the complexity of the selective graph coloring problem in some special classes of graphs. Theor. Comput. Sci. 540: 89-102 (2014) - [c52]Diodato Ferraioli, Laurent Gourvès, Jérôme Monnot:
On regular and approximately fair allocations of indivisible goods. AAMAS 2014: 997-1004 - [c51]Hassan AbouEisha
A Dichotomy for Upper Domination in Monogenic Classes. COCOA 2014: 258-267 - [c50]Laurent Gourvès, Jérôme Monnot, Lydia Tlilane:
Near Fairness in Matroids. ECAI 2014: 393-398 - [c49]Laurent Gourvès, Jérôme Monnot, Aris Pagourtzis
The Lazy Matroid Problem. IFIP TCS 2014: 66-77 - 2013
- [j46]Bruno Escoffier, Laurent Gourvès, Jérôme Monnot:
Fair solutions for some multiagent optimization problems. Auton. Agents Multi Agent Syst. 26(2): 184-201 (2013) - [j45]Epameinondas Fritzilas, Martin Milanic
Resilience and optimization of identifiable bipartite graphs. Discret. Appl. Math. 161(4-5): 593-603 (2013) - [j44]Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot:
Complexity of trails, paths and circuits in arc-colored digraphs. Discret. Appl. Math. 161(6): 819-828 (2013) - [j43]Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos:
Reoptimization under Vertex Insertion: Max PK-Free Subgraph and Max Planar Subgraph. Discret. Math. Algorithms Appl. 5(2) (2013) - [j42]Cristina Bazgan, Laurent Gourvès, Jérôme Monnot:
Approximation with a fixed number of solutions of some multiobjective maximization problems. J. Discrete Algorithms 22: 19-29 (2013) - [j41]Cristina Bazgan, Laurent Gourvès, Jérôme Monnot, Fanny Pascual:
Single approximation for the biobjective Max TSP. Theor. Comput. Sci. 478: 41-50 (2013) - [j40]Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos:
Reoptimization of maximum weight induced hereditary subgraph problems. Theor. Comput. Sci. 514: 61-74 (2013) - [c48]Nathanaël Barrot, Laurent Gourvès, Jérôme Lang, Jérôme Monnot, Bernard Ries:
Possible Winners in Approval Voting. ADT 2013: 57-70 - [c47]Bruno Escoffier, Jérôme Monnot, Fanny Pascual, Olivier Spanjaard:
Truthful Many-to-Many Assignment with Private Weights. CIAC 2013: 209-220 - [c46]Laurent Gourvès, Jérôme Monnot, Aris Pagourtzis
The Lazy Bureaucrat Problem with Common Arrivals and Deadlines: Approximation and Mechanism Design. FCT 2013: 171-182 - [c45]Laurent Gourvès, Jérôme Monnot, Lydia Tlilane:
A Matroid Approach to the Worst Case Allocation of Indivisible Goods. IJCAI 2013: 136-142 - [c44]Vadim V. Lozin
On the Maximum Independent Set Problem in Subclasses of Subcubic Graphs. IWOCA 2013: 314-326 - [c43]Laurent Gourvès, Jérôme Monnot, Lydia Tlilane:
A Protocol for Cutting Matroids Like Cakes. WINE 2013: 216-229 - 2012
- [j39]Laurent Gourvès, Jérôme Monnot, Fanny Pascual:
Cooperation in multiorganization matching. Algorithmic Oper. Res. 7(2) (2012) - [j38]Laurent Gourvès, Adria Ramos de Lyra, Carlos A. J. Martinhon, Jérôme Monnot
On paths, trails and closed trails in edge-colored graphs. Discret. Math. Theor. Comput. Sci. 14(2): 57-74 (2012) - [j37]Bruno Escoffier, Laurent Gourvès, Jérôme Monnot:
Strategic Coloring of a Graph. Internet Math. 8(4): 424-455 (2012) - [j36]Yann Chevaleyre, Jérôme Lang, Nicolas Maudet
New candidates welcome! Possible winners with respect to the addition of new candidates. Math. Soc. Sci. 64(1): 74-88 (2012) - [c42]Basile Couëtoux, Jérôme Monnot, Sonia Toubaline:
Complexity Results for the Empire Problem in Collection of Stars. COCOA 2012: 73-82 - [c41]Laurent Gourvès, Jérôme Monnot, Lydia Tlilane:
Approximate Tradeoffs on Matroids. ECAI 2012: 360-365 - [c40]Marc Demange, Jérôme Monnot, Petrica C. Pop
Selective Graph Coloring in Some Special Classes of Graphs. ISCO 2012: 320-331 - [c39]Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos, Mingyu Xiao:
New Results on Polynomial Inapproximability and Fixed Parameter Approximability of edge dominating set. IPEC 2012: 25-36 - [c38]Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos:
Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems. LATIN 2012: 73-84 - [c37]Laurent Gourvès, Jérôme Monnot, Stefano Moretti, Kim Thang Nguyen:
Congestion Games with Capacitated Resources. SAGT 2012: 204-215 - [c36]Bruno Escoffier, Laurent Gourvès, Jérôme Monnot, Stefano Moretti:
Cost allocation protocols for network formation on connection situations. VALUETOOLS 2012: 228-234 - [c35]Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos:
Reoptimization of the Maximum Weighted P k -Free Subgraph Problem under Vertex Insertion. WALCOM 2012: 76-87 - 2011
- [c34]Lirong Xia, Jérôme Lang, Jérôme Monnot:
Possible winners when new alternatives join: new results coming up! AAMAS 2011: 829-836 - [c33]Bruno Escoffier, Laurent Gourvès, Jérôme Monnot:
The Price of Optimum in a Matching Game. SAGT 2011: 81-92 - [c32]Yann Chevaleyre, Jérôme Lang, Nicolas Maudet
Compilation and communication protocols for voting rules with a dynamic set of candidates. TARK 2011: 153-160 - [c31]Cristina Bazgan, Laurent Gourvès, Jérôme Monnot, Fanny Pascual:
Single Approximation for Biobjective Max TSP. WAOA 2011: 49-62 - [c30]Cristina Bazgan, Laurent Gourvès, Jérôme Monnot:
Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems. WAOA 2011: 233-246 - [i2]Yann Chevaleyre, Jérôme Lang, Nicolas Maudet, Jérôme Monnot, Lirong Xia:
New Candidates Welcome! Possible Winners with respect to the Addition of New Candidates. CoRR abs/1111.3690 (2011) - 2010
- [j35]Refael Hassin, Jérôme Monnot, Danny Segev:
The Complexity of Bottleneck Labeled Graph Problems. Algorithmica 58(2): 245-262 (2010) - [j34]Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot:
The minimum reload s-t path, trail and walk problems. Discret. Appl. Math. 158(13): 1404-1417 (2010) - [j33]Basile Couëtoux, Laurent Gourvès, Jérôme Monnot, Orestis Telelis:
Labeled Traveling Salesman Problems: Complexity and approximation. Discret. Optim. 7(1-2): 74-85 (2010) - [j32]Laurent Alfandari, Jérôme Monnot:
Approximation of the Clustered Set Covering Problem. Electron. Notes Discret. Math. 36: 479-485 (2010) - [j31]Bruno Escoffier, Laurent Gourvès, Jérôme Monnot, Olivier Spanjaard:
Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation. Eur. J. Oper. Res. 205(1): 19-30 (2010) - [j30]Bruno Escoffier, Laurent Gourvès, Jérôme Monnot:
Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs. J. Discrete Algorithms 8(1): 36-49 (2010) - [c29]Yann Chevaleyre, Jérôme Lang, Nicolas Maudet, Jérôme Monnot:
Possible Winners when New Candidates Are Added: The Case of Scoring Rules. AAAI 2010: 762-767 - [c28]Bruno Escoffier, Laurent Gourvès, Jérôme Monnot:
Strategic Coloring of a Graph. CIAC 2010: 155-166 - [c27]Bruno Escoffier, Laurent Gourvès, Jérôme Monnot:
On the Impact of Local Taxes in a Set Cover Game. SIROCCO 2010: 2-13 - [c26]Hatem Chatti, Laurent Gourvès, Jérôme Monnot:
On a Labeled Vehicle Routing Problem. SOFSEM 2010: 271-282 - [c25]Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot:
Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs. TAMC 2010: 222-233 - [c24]Laurent Gourvès, Jérôme Monnot:
The Max k-Cut Game and Its Strong Equilibria. TAMC 2010: 234-246 - [i1]Bruno Escoffier, Laurent Gourvès, Jérôme Monnot:
Minimum regulation of uncoordinated matchings. CoRR abs/1012.3889 (2010)
2000 – 2009
- 2009
- [j29]Dominique de Werra, Marc Demange, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos:
Weighted coloring on planar, bipartite and split graphs: Complexity and approximation. Discret. Appl. Math. 157(4): 819-832 (2009) - [j28]Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot, Fábio Protti:
On s-t paths and trails in edge-colored graphs. Electron. Notes Discret. Math. 35: 221-226 (2009) - [j27]Martin Milanic, Jérôme Monnot:
The Exact Weighted Independent Set Problem in Perfect Graphs and Related Classes. Electron. Notes Discret. Math. 35: 317-322 (2009) - [j26]Giorgio Ausiello, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos:
Reoptimization of minimum and maximum traveling salesman's tours. J. Discrete Algorithms 7(4): 453-463 (2009) - [c23]Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot:
The Minimum Reload s-tPath/Trail/Walk Problems. SOFSEM 2009: 621-632 - [c22]Laurent Gourvès, Jérôme Monnot, Orestis Telelis:
Selfish Scheduling with Setup Times. WINE 2009: 292-303 - [c21]Laurent Gourvès, Jérôme Monnot:
On Strong Equilibria in the Max Cut Game. WINE 2009: 608-615 - 2008
- [j25]Jérôme Monnot, Sophie Toulouse:
Approximation results for the weighted P4 partition problem. J. Discrete Algorithms 6(2): 299-312 (2008) - [j24]Bruno Escoffier, Jérôme Monnot, Olivier Spanjaard:
Some tractable instances of interval data minmax regret problems. Oper. Res. Lett. 36(4): 424-429 (2008) - [j23]Jérôme Monnot:
A note on the hardness results for the labeled perfect matching problems in bipartite graphs. RAIRO Oper. Res. 42(3): 315-324 (2008) - [j22]Bruno Escoffier, Jérôme Monnot:
A better differential approximation ratio for symmetric TSP. Theor. Comput. Sci. 396(1-3): 63-70 (2008) - [c20]Basile Couëtoux, Laurent Gourvès, Jérôme Monnot, Orestis Telelis:
On Labeled Traveling Salesman Problems. ISAAC 2008: 776-787 - [c19]Bruno Escoffier, Jérôme Monnot, Olivier Spanjaard:
Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality. SOFSEM 2008: 280-291 - [c18]Laurent Gourvès, Jérôme Monnot, Fanny Pascual:
Cooperation in Multiorganization Matching. WAOA 2008: 78-91 - [c17]Laurent Gourvès, Jérôme Monnot:
Three Selfish Spanning Tree Games. WINE 2008: 465-476 - 2007
- [j21]Refael Hassin, Jérôme Monnot, Danny Segev:
Approximation algorithms and hardness results for labeled connectivity problems. J. Comb. Optim. 14(4): 437-453 (2007) - [j20]Jérôme Monnot, Sophie Toulouse:
The path partition problem and related problems in bipartite graphs. Oper. Res. Lett. 35(5): 677-684 (2007) - [j19]Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos:
Time slot scheduling of compatible jobs. J. Sched. 10(2): 111-127 (2007) - [c16]Jérôme Monnot, Sophie Toulouse:
The Pk Partition Problem and Related Problems in Bipartite Graphs. SOFSEM (1) 2007: 422-433 - [c15]Bruno Escoffier, Laurent Gourvès, Jérôme Monnot:
Complexity and Approximation Results for the Connected Vertex Cover Problem. WG 2007: 202-213 - [c14]Refael Hassin, Jérôme Monnot, Danny Segev:
The Complexity of Bottleneck Labeled Graph Problems. WG 2007: 328-340 - [c13]Aristotelis Giannakos, Laurent Gourvès, Jérôme Monnot, Vangelis Th. Paschos:
On the Performance of Congestion Games for Optimum Satisfiability Problems. WINE 2007: 220-231 - 2006
- [j18]Jérôme Monnot:
A simple approximation algorithm for WIS based on the approximability in k. Eur. J. Oper. Res. 171(1): 346-348 (2006) - [j17]Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos:
Weighted Coloring: further complexity and approximability results. Inf. Process. Lett. 97(3): 98-103 (2006) - [c12]Refael Hassin, Jérôme Monnot, Danny Segev:
Approximation Algorithms and Hardness Results for Labeled Connectivity Problems. MFCS 2006: 480-491 - [c11]Giorgio Ausiello, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos:
Reoptimization of Minimum and Maximum Traveling Salesman's Tours. SWAT 2006: 196-207 - 2005
- [j16]Dominique de Werra, Marc Demange, Jérôme Monnot, Vangelis Th. Paschos:
A hypocoloring model for batch scheduling. Discret. Appl. Math. 146(1): 3-26 (2005) - [j15]Cristina Bazgan, Refael Hassin, Jérôme Monnot:
Approximation algorithms for some vehicle routing problems. Discret. Appl. Math. 146(1): 27-42 (2005) - [j14]Jérôme Monnot:
Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s). Eur. J. Oper. Res. 161(3): 721-735 (2005) - [j13]Jérôme Monnot:
The labeled perfect matching in bipartite graphs. Inf. Process. Lett. 96(3): 81-88 (2005) - [j12]Refael Hassin, Jérôme Monnot:
The maximum saving partition problem. Oper. Res. Lett. 33(3): 242-248 (2005) - [j11]Cristina Bazgan, Jérôme Monnot, Vangelis Th. Paschos, Fabrice Serrière:
On the differential approximation of MIN SET COVER. Theor. Comput. Sci. 332(1-3): 497-513 (2005) - [c10]Eric Angel, Evripidis Bampis, Laurent Gourvès, Jérôme Monnot:
(Non)-Approximability for the Multi-criteria TSP(1, 2). FCT 2005: 329-340 - [c9]Jérôme Monnot, Sophie Toulouse:
Approximation Results for the Weighted P4 Partition Problems. FCT 2005: 388-396 - [c8]Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos:
Weighted Coloring: Further Complexity and Approximability Results. ICTCS 2005: 205-214 - [c7]Jérôme Monnot:
On Complexity and Approximability of the Labeled Maximum/Perfect Matching Problems. ISAAC 2005: 934-943 - [c6]Cristina Bazgan, Jérôme Monnot, Vangelis Th. Paschos, Fabrice Serrière:
Greedy Differential Approximations for Min Set Cover. SOFSEM 2005: 62-71 - 2004
- [j10]Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse:
Local approximations for maximum partial subgraph problem. Oper. Res. Lett. 32(3): 217-224 (2004) - [c5]Jérôme Monnot, Vangelis Th. Paschos, Dominique de Werra, Marc Demange, Bruno Escoffier:
Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation. ISAAC 2004: 896-907 - [c4]Dominique de Werra, Marc Demange, Jérôme Monnot, Vangelis Th. Paschos:
The Hypocoloring Problem: Complexity and Approximability Results when the Chromatic Number Is Small. WG 2004: 377-388 - 2003
- [j9]Jérôme Monnot, Olivier Spanjaard:
Bottleneck shortest paths on a partially ordered scale. 4OR 1(3): 225-241 (2003) - [j8]Marc Demange, Jérôme Monnot, Vangelis Th. Paschos:
Differential approximation results for the Steiner tree problem. Appl. Math. Lett. 16(5): 733-739 (2003) - [j7]Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse:
Differential approximation results for the traveling salesman problem with distances 1 and 2. Eur. J. Oper. Res. 145(3): 557-568 (2003) - [j6]Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse:
Approximation algorithms for the traveling salesman problem. Math. Methods Oper. Res. 56(3): 387-405 (2003) - [j5]Tobias Brüggemann, Jérôme Monnot, Gerhard J. Woeginger:
Local search for the minimum label spanning tree problem with bounded color classes. Oper. Res. Lett. 31(3): 195-201 (2003) - [j4]Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse:
Optima locaux garantis pour l'approximation différentielle. Tech. Sci. Informatiques 22(3): 257-288 (2003) - [c3]Cristina Bazgan, Refael Hassin, Jérôme Monnot:
Differential Approximation for Some Routing Problems. CIAC 2003: 277-288 - 2002
- [j3]Jérôme Monnot:
Differential approximation results for the traveling salesman and related problems. Inf. Process. Lett. 82(5): 229-235 (2002) - [j2]Jérôme Monnot:
Differential approximation of NP-hard problems with equal size feasible solutions. RAIRO Oper. Res. 36(4): 279-297 (2002) - [c2]Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos:
Weighted Node Coloring: When Stable Sets Are Expensive. WG 2002: 114-125 - 2001
- [j1]Jérôme Monnot:
The maximum f-depth spanning tree problem. Inf. Process. Lett. 80(4): 179-187 (2001) - [c1]Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse:
Differential Approximation Results for the Traveling Salesman Problem with Distances 1 and 2. FCT 2001: 275-286
Coauthor Index
[j73] [c75] [j64] [c72] [c68] [j60] [j58] [j56] [c63] [c61] [c57] [c56] [c53] [i5] [j55] [j51] [j50] [j49] [c52] [c50] [c49] [j46] [j44] [j42] [j41] [c48] [c46] [c45] [c43] [j39] [j38] [j37] [c41] [c37] [c36] [c33] [c31] [c30] [j34] [j33] [j31] [j30] [c28] [c27] [c26] [c25] [c24] [i1] [j28] [c23] [c22] [c21] [c20] [c18] [c17] [c15] [c13] [c10]
Carlos Alberto de Jesus Martinhon
aka: Carlos A. J. Martinhon
aka: Carlos A. J. Martinhon
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:23 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: