Volume 78, Issue 4

August 2017

Special Issue on the European Symposium on Algorithms

Issue Editors:

9 articles in this issue

Guest Editors’ Foreword
Nikhil Bansal
Irene Finocchi
EditorialNotes 24 April 2017 Pages: 1107 - 1108
An Experimental Evaluation of the Best-of-Many Christofides’ Algorithm for the Traveling Salesman Problem
Kyle Genova
David P. Williamson
OriginalPaper 24 February 2017 Pages: 1109 - 1130
Improved Analysis of Complete-Linkage Clustering
Anna Großwendt
Heiko Röglin
OriginalPaper 06 February 2017 Pages: 1131 - 1150
How to Sort by Walking and Swapping on Paths and Trees
Daniel Graf
OriginalPaper 03 February 2017 Pages: 1151 - 1181
On the Approximability of Digraph Ordering
Sreyash Kenkre
Vinayaka Pandit
Rishi Saket
OriginalPaper 18 October 2016 Pages: 1182 - 1205
Multicuts in Planar and Bounded-Genus Graphs with Bounded Number of Terminals
Éric Colin de Verdière
OriginalPaper 30 November 2016 Pages: 1206 - 1224
Explicit Expanding Expanders
Michael Dinitz
Michael Schapira
Asaf Valadarsky
OriginalPaper 28 December 2016 Pages: 1225 - 1245
Scheduling with Deadlines and Buffer Management with Processing Requirements
Yossi Azar
Oren Gilon
OriginalPaper 30 November 2016 Pages: 1246 - 1262
I/O-Efficient Similarity Join
Rasmus Pagh
Ninh Pham
Morten Stöckel
OriginalPaper 06 February 2017 Pages: 1263 - 1283

Search