On the Complexity of Broadcast Domination and Multipacking in Digraphs Florent FoucaudBenjamin GrasFlorian Sikora OriginalPaper 26 April 2021 Pages: 2651 - 2677
Strongly Stable and Maximum Weakly Stable Noncrossing Matchings Koki HamadaShuichi MiyazakiKazuya Okamoto OriginalPaper Open access 15 May 2021 Pages: 2678 - 2696
Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions Toru Hasunuma OriginalPaper 25 May 2021 Pages: 2697 - 2718
Online Node- and Edge-Deletion Problems with Advice Li-Hsuan ChenLing-Ju HungPeter Rossmanith OriginalPaper Open access 30 June 2021 Pages: 2719 - 2753
Finding Temporal Paths Under Waiting Time Constraints Arnaud CasteigtsAnne-Sophie HimmelPhilipp Zschoche OriginalPaper Open access 04 June 2021 Pages: 2754 - 2802
Scheduling in the Random-Order Model Susanne AlbersMaximilian Janke OriginalPaper Open access 09 June 2021 Pages: 2803 - 2832
Best Fit Bin Packing with Random Order Revisited Susanne AlbersArindam KhanLeon Ladewig OriginalPaper Open access 01 July 2021 Pages: 2833 - 2858
A Queueing Network-Based Distributed Laplacian Solver Iqra Altaf GillaniAmitabha Bagchi OriginalPaper 25 June 2021 Pages: 2859 - 2894
A New Lower Bound for Deterministic Truthful Scheduling Yiannis GiannakopoulosAlexander HammerlDiogo Poças OriginalPaper 23 June 2021 Pages: 2895 - 2913
On Girth and the Parameterized Complexity of Token Sliding and Token Jumping Valentin BartierNicolas BousquetAmer E. Mouawad OriginalPaper 08 July 2021 Pages: 2914 - 2951