In memory of Jérôme Monnot
From MaRDI portal
Publication:2140557
DOI10.1016/j.tcs.2022.01.045zbMath1486.01058OpenAlexW4280493292MaRDI QIDQ2140557
Laurent Gourvès, Vangelis Th. Paschos, Bruno Escoffier
Publication date: 23 May 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.01.045
Cites Work
- Local fairness in hedonic games via individual threshold coalitions
- Blocking total dominating sets via edge contractions
- Recoloring subgraphs of \(K_{2n}\) for sports scheduling
- Algorithmic aspects of upper edge domination
- Generalised online colouring problems in overlap graphs
- Approximation of the double traveling salesman problem with multiple stacks
- On the complexity of independent dominating set with obligations in graphs
- Complexity and algorithms for constant diameter augmentation problems
- Beyond pairwise comparisons in social choice: a setwise Kemeny aggregation problem
- On the complexity of solution extension of optimization problems
- Extension and its price for the connected vertex cover problem
- Improved budgeted connected domination and budgeted edge-vertex domination
- Reallocating multiple facilities on the line
- Improved bi-criteria approximation schemes for load balancing on unrelated machines with cost constraints
- Efficiency and equity in the multi organization scheduling problem
- Maximum independent sets in subcubic graphs: new results
- Strong cliques in diamond-free graphs
This page was built for publication: In memory of Jérôme Monnot
