Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Daniel P. Kennedy
Dan Graur
Barbara Aquilani
Xi Song
Roland Zumkeller
Maximilian Dürr
Liangliang Shang
H. T. Kung
Chen Ma
Kevin Wampler
Home
/
Author
/
JÉRÔME MONNOT
Author Info
Open Visualization
Name
Affiliation
Papers
JÉRÔME MONNOT
CNRS, FRE 3234, F-75775 Paris, France and Université de Paris-Dauphine, LAMSADE, F-75775 Paris, France
118
Collaborators
Citations
PageRank
86
512
55.74
Referers
Referees
References
685
1184
1362
Search Limit
100
1000
Publications (100 rows)
Collaborators (86 rows)
Referers (100 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
Algorithmic Aspects Of Upper Edge Domination
0
0.34
2021
Weighted Upper Edge Cover: Complexity and Approximability.
0
0.34
2020
On the Complexity of the Upper r-Tolerant Edge Cover Problem.
0
0.34
2020
Maximum independent sets in subcubic graphs: New results.
0
0.34
2020
Extension of Some Edge Graph Problems - Standard and Parameterized Complexity.
0
0.34
2019
Extension of Vertex Cover and Independent Set in Some Classes of Graphs.
0
0.34
2019
Correction to: Weighted Upper Edge Cover: Complexity and Approximability.
0
0.34
2019
On a Simple Hedonic Game with Graph-Restricted Communication.
0
0.34
2019
Efficient Reallocation under Additive and Responsive Preferences
1
0.35
2019
Extension and Its Price for the Connected Vertex Cover Problem.
0
0.34
2019
Maximum Independent Sets In Subcubic Graphs: New Results
0
0.34
2018
Extension of vertex cover and independent set in some classes of graphs and generalizations.
0
0.34
2018
Subset Sum Problems With Digraph Constraints.
1
0.36
2018
Upper Domination: towards a dichotomy through boundary properties.
0
0.34
2018
On the complexity of solution extension of optimization problems
0
0.34
2018
The Price of Optimum: Complexity and Approximation for a Matching Game
1
0.35
2017
Approximate Maximin Share Allocations in Matroids.
3
0.39
2017
Beyond Electing and Ranking: Collective Dominating Chains, Dominating Subsets and Dichotomies.
1
0.37
2017
Selfish Transportation Games.
0
0.34
2017
Weighted upper domination number
1
0.36
2017
Bi-objective matchings with the triangle inequality.
0
0.34
2017
A Boundary Property For Upper Domination
4
0.46
2016
Achieving Proportional Representation in Conference Programs.
0
0.34
2016
Upper Domination: Complexity And Approximation
3
0.40
2016
Computing Pareto Optimal Committees.
6
0.48
2016
Conference Program Design with Single-Peaked and Single-Crossing Preferences.
0
0.34
2016
Optimal Reallocation under Additive and Ordinal Preferences.
7
0.62
2016
Algorithmic Aspects of Upper Domination: A Parameterised Perspective.
2
0.36
2016
Worst case compromises in matroids with applications to the allocation of indivisible goods
4
0.40
2015
Approximate tradeoffs on weighted labeled matroids.
2
0.40
2015
The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles
1
0.36
2015
A note on the traveling salesman reoptimization problem under vertex insertion.
5
0.42
2015
On the complexity of the selective graph coloring problem in some special classes of graphs.
8
0.52
2014
The Lazy Matroid Problem.
1
0.35
2014
On regular and approximately fair allocations of indivisible goods.
2
0.45
2014
Resilience and optimization of identifiable bipartite graphs
2
0.47
2013
Possible Winners in Approval Voting.
1
0.37
2013
Reoptimization of maximum weight induced hereditary subgraph problems
7
0.48
2013
On the maximum independent set problem in subclasses of subcubic graphs
6
0.45
2013
Complexity of trails, paths and circuits in arc-colored digraphs
5
0.47
2013
The lazy bureaucrat problem with common arrivals and deadlines: approximation and mechanism design
2
0.38
2013
Fair solutions for some multiagent optimization problems
9
0.51
2013
A Protocol for Cutting Matroids Like Cakes.
4
0.46
2013
Single approximation for the biobjective Max TSP
0
0.34
2013
Approximation with a fixed number of solutions of some multiobjective maximization problems
2
0.37
2013
Reoptimization Under Vertex Insertion: Max P-K-Free Subgraph And Max Planar Subgraph
1
0.35
2013
Approximate Tradeoffs on Matroids.
1
0.35
2012
Complexity Results for the Empire Problem in Collection of Stars.
0
0.34
2012
Reoptimization of the Maximum Weighted P k -Free Subgraph Problem under Vertex Insertion.
2
0.37
2012
New Results on Polynomial Inapproximabilityand Fixed Parameter Approximability of Edge Dominating Set
7
0.51
2012
1
2
50 / page
