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