Volume 70, Issue 1

September 2014

Special Issue: Computing and Combinatorics

Issue Editors:

8 articles in this issue

Editorial: COCOON 2012 Special Issue
Joachim Gudmundsson
Julián Mestre
Taso Viglas
EditorialNotes 13 June 2014 Pages: 1 - 1
A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree Network
Binay Bhattacharya
Tsunehiko Kameda
Zhao Song
OriginalPaper 16 November 2013 Pages: 2 - 21
A Simple D ²-Sampling Based PTAS for k-Means and Other Clustering Problems
Ragesh Jaiswal
Amit Kumar
Sandeep Sen
OriginalPaper 21 September 2013 Pages: 22 - 46
Lower Bounds Against Weakly-Uniform Threshold Circuits
Ruiwen Chen
Valentine Kabanets
Jeff Kinne
OriginalPaper 29 August 2013 Pages: 47 - 75
Online Unweighted Knapsack Problem with Removal Cost
Xin Han
Yasushi Kawase
Kazuhisa Makino
OriginalPaper 27 August 2013 Pages: 76 - 91
Online Coloring of Bipartite Graphs with and without Advice
Maria Paola Bianchi
Hans-Joachim Böckenhauer
Lucia Keller
OriginalPaper 14 August 2013 Pages: 92 - 111
Geodesic Order Types
Oswin Aichholzer
Matias Korman
Birgit Vogtenhuber
OriginalPaper 10 August 2013 Pages: 112 - 128
Towards Optimal and Expressive Kernelization for d-Hitting Set
René van Bevern
OriginalPaper 03 April 2013 Pages: 129 - 147

Search