Journal: Algorithmica

Volume 83, Issue 2

413 -- 446Santanu Bhowmick, Tanmay Inamdar 0002, Kasturi R. Varadarajan. Fault-Tolerant Covering Problems in Metric Spaces
447 -- 530Vittorio Bilò, Marios Mavronicolas. The Complexity of Computational Problems About Nash Equilibria in Symmetric Win-Lose Games
531 -- 552Angel A. Cantu, Austin Luchsinger, Robert T. Schweller, Tim Wylie. Covert Computation in Self-Assembled Circuits
553 -- 575Zeev Nutov. On the Tree Augmentation Problem
576 -- 588Ghurumuruhan Ganesan. Constrained Minimum Passage Time in Random Geometric Graphs
589 -- 612Myriam Preissmann, Cléophée Robin, Nicolas Trotignon. On the Complexity of Colouring Antiprismatic Graphs
613 -- 640Akira Matsubayashi. Non-Greedy Online Steiner Trees on Outerplanar Graphs
641 -- 666Therese C. Biedl, Saeed Mehrabi 0001. On Orthogonally Guarding Orthogonal Polygons with Bounded Treewidth
667 -- 694Harry Buhrman, Matthias Christandl, Michal Koucký 0001, Zvi Lotker, Boaz Patt-Shamir, Nikolai K. Vereshchagin. High Entropy Random Selection Protocols
695 -- 725Diodato Ferraioli, Carmine Ventre. Approximation Guarantee of OSP Mechanisms: The Case of Machine Scheduling and Facility Location
726 -- 752Robert Ganian, Sebastian Ordyniak. The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths
753 -- 774Akanksha Agrawal, Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi. Simultaneous Feedback Edge Set: A Parameterized Perspective