Binary Search in Graphs Revisited Argyrios DeligkasGeorge B. MertziosPaul G. Spirakis OriginalPaper Open access 22 August 2018 Pages: 1757 - 1780
Online Algorithms for Maximum Cardinality Matching with Edge Arrivals Niv BuchbinderDanny SegevYevgeny Tkach OriginalPaper 27 August 2018 Pages: 1781 - 1799
O(f) Bi-criteria Approximation for Capacitated Covering with Hard Capacities Mong-Jen KaoHai-Lun TuD. T. Lee OriginalPaper 22 August 2018 Pages: 1800 - 1817
Characterizing and Recognizing 4-Map Graphs Franz J. Brandenburg OriginalPaper 27 August 2018 Pages: 1818 - 1843
Computing the Number of Induced Copies of a Fixed Graph in a Bounded Degree Graph Viresh PatelGuus Regts OriginalPaper Open access 05 September 2018 Pages: 1844 - 1858
The k-Server Problem with Advice in d Dimensions and on the Sphere Elisabet BurjonsDennis KommMarcel Schöngens OriginalPaper 19 September 2018 Pages: 1859 - 1880
Deterministic Leader Election Takes \(\Theta (D + \log n)\) Bit Rounds A. CasteigtsY. MétivierA. Zemmari OriginalPaper 27 September 2018 Pages: 1901 - 1920
Building an Optimal Point-Location Structure in \(O( sort (n))\) I/Os Xiaocheng HuCheng ShengYufei Tao OriginalPaper 28 September 2018 Pages: 1921 - 1937
Online Dominating Set Joan BoyarStephan J. EidenbenzKim S. Larsen OriginalPaper 25 September 2018 Pages: 1938 - 1964
Dynamic Graph Stream Algorithms in o(n) Space Zengfeng HuangPan Peng OriginalPaper Open access 25 September 2018 Pages: 1965 - 1987
Streaming Pattern Matching with d Wildcards Shay GolanTsvi KopelowitzEly Porat OriginalPaper 13 October 2018 Pages: 1988 - 2015
When Can Graph Hyperbolicity be Computed in Linear Time? Till FluschnikChristian KomusiewiczNimrod Talmon OriginalPaper 13 October 2018 Pages: 2016 - 2045
On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings Michael A. BekosHenry FörsterMichael Kaufmann OriginalPaper 22 October 2018 Pages: 2046 - 2071
Succinct Summing over Sliding Windows Ran Ben BasatGil EinzigerYaron Kassner OriginalPaper 01 November 2018 Pages: 2072 - 2091
Computing Dense Tensor Decompositions with Optimal Dimension Trees Oguz KayaYves Robert OriginalPaper 22 October 2018 Pages: 2092 - 2121