


default search action
Theoretical Computer Science, Volume 904
Volume 904, February 2022
- Christian Laforest, Timothée Martinod:
On the complexity of independent dominating set with obligations in graphs. 1-14 - Eun Jung Kim, Martin Milanic
, Jérôme Monnot, Christophe Picouleau:
Complexity and algorithms for constant diameter augmentation problems. 15-26 - Hugo Gilbert
, Tom Portoleau, Olivier Spanjaard
:
Beyond pairwise comparisons in social choice: A setwise Kemeny aggregation problem. 27-47 - Katrin Casel, Henning Fernau
, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora
:
On the complexity of solution extension of optimization problems. 48-65 - Mehdi Khosravian Ghadikolaei, Nikolaos Melissinos
, Jérôme Monnot, Aris Pagourtzis:
Extension and its price for the connected vertex cover problem. 66-80

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.