The following pages link to Jérôme Monnot (Q243583):
Displaying 50 items.
- Efficient reallocation under additive and responsive preferences (Q2272381) (← links)
- Extension of some edge graph problems: standard and parameterized complexity (Q2291420) (← links)
- On a simple hedonic game with graph-restricted communication (Q2292629) (← links)
- Extension of Vertex Cover and Independent Set in some classes of graphs (Q2294045) (← links)
- Extension and its price for the Connected Vertex Cover problem (Q2301752) (← links)
- Correction to: ``Weighted upper edge cover: complexity and approximability'' (Q2327516) (← links)
- Weighted upper edge cover: complexity and approximability (Q2327526) (← links)
- Approximate tradeoffs on weighted labeled matroids (Q2341761) (← links)
- New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set (Q2345984) (← links)
- Worst case compromises in matroids with applications to the allocation of indivisible goods (Q2346382) (← links)
- Weighted upper domination number (Q2413167) (← links)
- Complexity and approximability of extended spanning star forest problems in general and complete graphs (Q2419107) (← links)
- Approximation algorithms and hardness results for labeled connectivity problems (Q2426652) (← links)
- On the complexity of the selective graph coloring problem in some special classes of graphs (Q2453167) (← links)
- The path partition problem and related problems in bipartite graphs (Q2465958) (← links)
- A simple approximation algorithm for WIS based on the approximability in \(k\)-partite graphs (Q2576274) (← links)
- A Boundary Property for Upper Domination (Q2819507) (← links)
- Upper Domination: Complexity and Approximation (Q2819508) (← links)
- Algorithmic Aspects of Upper Domination: A Parameterised Perspective (Q2830063) (← links)
- On s-t paths and trails in edge-colored graphs (Q2840541) (← links)
- The Exact Weighted Independent Set Problem in Perfect Graphs and Related Classes (Q2840556) (← links)
- The Lazy Bureaucrat Problem with Common Arrivals and Deadlines: Approximation and Mechanism Design (Q2842783) (← links)
- REOPTIMIZATION UNDER VERTEX INSERTION: MAX P<sub>k</sub>-FREE SUBGRAPH AND MAX PLANAR SUBGRAPH (Q2846477) (← links)
- (Q2865888) (← links)
- Possible Winners in Approval Voting (Q2868547) (← links)
- On the Maximum Independent Set Problem in Subclasses of Subcubic Graphs (Q2870037) (← links)
- Approximation of the Clustered Set Covering Problem (Q2883599) (← links)
- Reoptimization of the Maximum Weighted P k -Free Subgraph Problem under Vertex Insertion (Q2889902) (← links)
- Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems (Q2894455) (← links)
- Single Approximation for Biobjective Max TSP (Q2896377) (← links)
- Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems (Q2896393) (← links)
- A Protocol for Cutting Matroids Like Cakes (Q2937759) (← links)
- A Dichotomy for Upper Domination in Monogenic Classes (Q2942401) (← links)
- Strategic Scheduling Games: Equilibria and Efficiency (Q2958675) (← links)
- Conference Program Design with Single-Peaked and Single-Crossing Preferences (Q2959832) (← links)
- Selfish Transportation Games (Q2971133) (← links)
- (Q3059314) (← links)
- (Q3059325) (← links)
- (Q3070857) (← links)
- (Q3070909) (← links)
- The Price of Optimum in a Matching Game (Q3095261) (← links)
- Complexity Results for the Empire Problem in Collection of Stars (Q3167350) (← links)
- Selective Graph Coloring in Some Special Classes of Graphs (Q3167636) (← links)
- The Lazy Matroid Problem (Q3190151) (← links)
- On a Labeled Vehicle Routing Problem (Q3401097) (← links)
- (Q3457236) (← links)
- Complexity and Approximation Results for the Connected Vertex Cover Problem (Q3508568) (← links)
- The Complexity of Bottleneck Labeled Graph Problems (Q3508579) (← links)
- Strategic Coloring of a Graph (Q3563000) (← links)
- Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs (Q3569078) (← links)