A Moderately Exponential Time Algorithm for k-IBDD Satisfiability Atsuki NagaoKazuhisa SetoJunichi Teruyama OriginalPaper 20 June 2017 Pages: 2725 - 2741
A Clustering-Based Approach to Kinetic Closest Pair Zahed RahmatiTimothy M. Chan OriginalPaper 21 June 2017 Pages: 2742 - 2756
Rank Reduction of Oriented Graphs by Vertex and Edge Deletions Syed M. MeesumSaket Saurabh OriginalPaper 05 July 2017 Pages: 2757 - 2776
Scheduling Distributed Clusters of Parallel Machines : Primal-Dual and LP-based Approximation Algorithms Riley MurraySamir KhullerMegan Chao OriginalPaper 19 July 2017 Pages: 2777 - 2798
Upper Domination: Towards a Dichotomy Through Boundary Properties Hassan AbouEishaShahid HussainViktor Zamaraev OriginalPaper 14 July 2017 Pages: 2799 - 2817
The A Priori Traveling Repairman Problem Martijn van EeRené Sitters OriginalPaper Open access 28 July 2017 Pages: 2818 - 2833
The Induced Separation Dimension of a Graph Emile ZiedanDeepak RajendraprasadJérémie Dusart OriginalPaper 31 July 2017 Pages: 2834 - 2848
Dual-Based Approximation Algorithms for Cut-Based Network Connectivity Problems Benjamin Grimmer OriginalPaper 07 August 2017 Pages: 2849 - 2873
Complexity of Secure Sets Bernhard BliemStefan Woltran OriginalPaper Open access 14 August 2017 Pages: 2909 - 2940
Clique Clustering Yields a PTAS for Max-Coloring Interval Graphs Tim Nonner OriginalPaper 17 August 2017 Pages: 2941 - 2956
A Note on Submodular Function Minimization with Covering Type Linear Constraints Naoyuki Kamiyama OriginalPaper 14 August 2017 Pages: 2957 - 2971