Jérôme Monnot
Orcid: 0000-0002-7452-6553
According to our database1,
Jérôme Monnot
authored at least 139 papers
between 2001 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
2005
2010
2015
2020
0
5
10
2
3
2
3
3
5
3
8
2
7
4
7
4
4
3
2
6
1
6
2
1
2
1
4
4
8
4
5
7
4
5
3
3
3
4
2
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2023
Extension of some edge graph problems: Standard, parameterized and approximation complexity.
Discret. Appl. Math., December, 2023
2022
Theor. Comput. Sci., 2022
Theor. Comput. Sci., 2022
Theor. Comput. Sci., 2022
2021
Proceedings of the 21st International Workshop on Algorithms in Bioinformatics, 2021
Abundant Extensions.
Proceedings of the Algorithms and Complexity - 12th International Conference, 2021
2020
J. Graph Algorithms Appl., 2020
Auton. Agents Multi Agent Syst., 2020
Proceedings of the Topics in Theoretical Computer Science, 2020
2019
Complexity and approximability of extended Spanning Star Forest problems in general and complete graphs.
Theor. Comput. Sci., 2019
Theor. Comput. Sci., 2019
Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019
Proceedings of the Algorithmic Game Theory - 12th International Symposium, 2019
Proceedings of the Fundamentals of Computation Theory - 22nd International Symposium, 2019
Proceedings of the Algorithms and Complexity - 11th International Conference, 2019
2018
Extension of vertex cover and independent set in some classes of graphs and generalizations.
CoRR, 2018
Algorithmica, 2018
2017
Algorithmica, 2017
Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017
Proceedings of the Combinatorial Optimization and Applications, 2017
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017
Beyond Electing and Ranking: Collective Dominating Chains, Dominating Subsets and Dichotomies.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017
2016
Proceedings of the Web and Internet Economics - 12th International Conference, 2016
Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016
Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016
Proceedings of the Algorithmic Aspects in Information and Management, 2016
2015
Worst case compromises in matroids with applications to the allocation of indivisible goods.
Theor. Comput. Sci., 2015
The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles.
Theor. Comput. Sci., 2015
New Results on Polynomial Inapproximabilityand Fixed Parameter Approximability of Edge Dominating Set.
Theory Comput. Syst., 2015
J. Discrete Algorithms, 2015
Inf. Process. Lett., 2015
2014
On the complexity of the selective graph coloring problem in some special classes of graphs.
Theor. Comput. Sci., 2014
Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014
Proceedings of the Combinatorial Optimization and Applications, 2014
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014
2013
Theor. Comput. Sci., 2013
Approximation with a fixed number of solutions of some multiobjective maximization problems.
J. Discrete Algorithms, 2013
Reoptimization under Vertex Insertion: Max P<sub>K</sub>-Free Subgraph and Max Planar Subgraph.
Discret. Math. Algorithms Appl., 2013
Discret. Appl. Math., 2013
Discret. Appl. Math., 2013
Auton. Agents Multi Agent Syst., 2013
Proceedings of the Web and Internet Economics - 9th International Conference, 2013
Proceedings of the IJCAI 2013, 2013
The Lazy Bureaucrat Problem with Common Arrivals and Deadlines: Approximation and Mechanism Design.
Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013
Proceedings of the Algorithms and Complexity, 8th International Conference, 2013
Proceedings of the Algorithmic Decision Theory - Third International Conference, 2013
2012
New candidates welcome! Possible winners with respect to the addition of new candidates.
Math. Soc. Sci., 2012
Discret. Math. Theor. Comput. Sci., 2012
Reoptimization of the Maximum Weighted P k -Free Subgraph Problem under Vertex Insertion.
Proceedings of the WALCOM: Algorithms and Computation - 6th International Workshop, 2012
Proceedings of the 6th International ICST Conference on Performance Evaluation Methodologies and Tools, 2012
Proceedings of the LATIN 2012: Theoretical Informatics, 2012
New Results on Polynomial Inapproximability and Fixed Parameter Approximability of edge dominating set.
Proceedings of the Parameterized and Exact Computation - 7th International Symposium, 2012
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012
Proceedings of the Combinatorial Optimization and Applications, 2012
2011
Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems.
Proceedings of the Approximation and Online Algorithms - 9th International Workshop, 2011
Compilation and communication protocols for voting rules with a dynamic set of candidates.
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2011), 2011
Proceedings of the Algorithmic Game Theory, 4th International Symposium, 2011
Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 2011
2010
Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs.
J. Discrete Algorithms, 2010
Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation.
Eur. J. Oper. Res., 2010
Electron. Notes Discret. Math., 2010
Discret. Optim., 2010
Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010
Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010
Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010
Proceedings of the Structural Information and Communication Complexity, 2010
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010
2009
J. Discrete Algorithms, 2009
Electron. Notes Discret. Math., 2009
Weighted coloring on planar, bipartite and split graphs: Complexity and approximation.
Discret. Appl. Math., 2009
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009
Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009
2008
Theor. Comput. Sci., 2008
A note on the hardness results for the labeled perfect matching problems in bipartite graphs.
RAIRO Oper. Res., 2008
Oper. Res. Lett., 2008
J. Discrete Algorithms, 2008
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008
Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality.
Proceedings of the SOFSEM 2008: Theory and Practice of Computer Science, 2008
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008
2007
Oper. Res. Lett., 2007
J. Comb. Optim., 2007
Proceedings of the Internet and Network Economics, Third International Workshop, 2007
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007
Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007
2006
Inf. Process. Lett., 2006
Eur. J. Oper. Res., 2006
2005
Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s).
Eur. J. Oper. Res., 2005
Discret. Appl. Math., 2005
Proceedings of the SOFSEM 2005: Theory and Practice of Computer Science, 2005
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005
Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005
Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005
2004
The Hypocoloring Problem: Complexity and Approximability Results when the Chromatic Number Is Small.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004
Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004
2003
Tech. Sci. Informatiques, 2003
Oper. Res. Lett., 2003
Math. Methods Oper. Res., 2003
Differential approximation results for the traveling salesman problem with distances 1 and 2.
Eur. J. Oper. Res., 2003
Appl. Math. Lett., 2003
Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003
2002
RAIRO Oper. Res., 2002
Inf. Process. Lett., 2002
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002
2001