Fault-Tolerant Approximate Shortest-Path Trees Davide BilòLuciano GualàGuido Proietti OriginalPaper 15 November 2017 Pages: 3437 - 3460
The Densest Subgraph Problem with a Convex/Concave Size Function Yasushi KawaseAtsushi Miyauchi OriginalPaper 20 December 2017 Pages: 3461 - 3480
A Polynomial Kernel for Trivially Perfect Editing Pål Grønås DrangeMichał Pilipczuk OriginalPaper Open access 28 December 2017 Pages: 3481 - 3524
An Improved Upper Bound on Maximal Clique Listing via Rectangular Fast Matrix Multiplication Carlo CominRomeo Rizzi OriginalPaper 02 January 2018 Pages: 3525 - 3562
Quantifying Competitiveness in Paging with Locality of Reference Susanne AlbersDario Frascaria OriginalPaper Open access 23 January 2018 Pages: 3563 - 3596
Parameterized Complexity of Length-bounded Cuts and Multicuts Pavel DvořákDušan Knop OriginalPaper 22 January 2018 Pages: 3597 - 3617
The Sandwich Problem for Decompositions and Almost Monotone Properties Maria ChudnovskyCelina M. H. de FigueiredoSophie Spirkl OriginalPaper 19 January 2018 Pages: 3618 - 3645
Canonical Representations for Circular-Arc Graphs Using Flip Sets Maurice Chandoo OriginalPaper 23 January 2018 Pages: 3646 - 3672
Self-Stabilizing Balls and Bins in Batches Petra BerenbrinkTom FriedetzkyChris Wastell OriginalPaper 15 February 2018 Pages: 3673 - 3703
Not-All-Equal and 1-in-Degree Decompositions: Algorithmic Complexity and Applications Ali DehghanMohammad-Reza SadeghiArash Ahadi OriginalPaper 07 February 2018 Pages: 3704 - 3727
Dynamic Path Queries in Linear Space Meng HeJ. Ian MunroGelin Zhou OriginalPaper 02 February 2018 Pages: 3728 - 3765
Path Refinement in Weighted Regions Amin GheibiAnil MaheshwariChristian Scheffer OriginalPaper 16 February 2018 Pages: 3766 - 3802
Quasimetric Embeddings and Their Applications Facundo MémoliAnastasios SidiropoulosVijay Sridhar OriginalPaper 13 February 2018 Pages: 3803 - 3824
Approximation Schemes for Minimizing the Maximum Lateness on a Single Machine with Release Times Under Non-availability or Deadline Constraints Imed KacemHans Kellerer OriginalPaper Open access 20 February 2018 Pages: 3825 - 3843
\((k,n-k)\)-Max-Cut: An \(\mathcal{O}^*(2^p)\)-Time Algorithm and a Polynomial Kernel Saket SaurabhMeirav Zehavi OriginalPaper 20 February 2018 Pages: 3844 - 3860
Online Packet Scheduling for CIOQ and Buffered Crossbar Switches Kamal Al-BawaniMatthias EnglertMatthias Westermann OriginalPaper 05 March 2018 Pages: 3861 - 3888
Fast Approximation Algorithms for p-Centers in Large \(\delta \)-Hyperbolic Graphs Katherine EdwardsW. Sean KennedyIraj Saniee OriginalPaper 20 March 2018 Pages: 3889 - 3907
Counting Minimum Weight Arborescences Koyo HayashiSatoru Iwata OriginalPaper 22 March 2018 Pages: 3908 - 3919
Lift-and-Project Methods for Set Cover and Knapsack Eden ChlamtáčZachary FriggstadKonstantinos Georgiou OriginalPaper 28 March 2018 Pages: 3920 - 3942
Extreme Witnesses and Their Applications Andrzej LingasMia Persson OriginalPaper Open access 06 August 2018 Pages: 3943 - 3957
The Fast Search Number of a Complete k-Partite Graph Yuan XueBoting YangSandra Zilles OriginalPaper 21 May 2018 Pages: 3959 - 3981
