Volume 70, Issue 2

October 2014

Special Issue: Theoretical Informatics

Issue Editor:

10 articles in this issue

Editorial
David Fernández-Baca
EditorialNotes 05 June 2014 Pages: 149 - 151
A Generalization of the Convex Kakeya Problem
Hee-Kap Ahn
Sang Won Bae
Antoine Vigneron
OriginalPaper 19 September 2013 Pages: 152 - 170
An Equivariance Theorem with Applications to Renaming
Armando Castañeda
Maurice Herlihy
Sergio Rajsbaum
OriginalPaper 27 November 2013 Pages: 171 - 194
Solving the 2-Disjoint Connected Subgraphs Problem Faster than 2ⁿ
Marek Cygan
Marcin Pilipczuk
Jakub Onufry Wojtaszczyk
OriginalPaper Open access 31 May 2013 Pages: 195 - 207
A Randomized Sieving Algorithm for Approximate Integer Programming
Daniel Dadush
OriginalPaper 20 September 2013 Pages: 208 - 244
Computing H-Joins with Application to 2-Modular Decomposition
Michel Habib
Antoine Mamcarz
Fabien de Montgolfier
OriginalPaper 04 September 2013 Pages: 245 - 266
Analysis of the Strategy “Hiring Above the \(m\)-th Best Candidate”
Ahmed Helmi
Conrado Martínez
Alois Panholzer
OriginalPaper 06 June 2014 Pages: 267 - 300
Random Walks, Bisections and Gossiping in Circulant Graphs
Bernard Mans
Igor Shparlinski
OriginalPaper 11 July 2013 Pages: 301 - 325
The Feedback Arc Set Problem with Triangle Inequality Is a Vertex Cover Problem
Monaldo Mastrolilli
OriginalPaper 13 July 2013 Pages: 326 - 339
Degree Constrained Node-Connectivity Problems
Zeev Nutov
OriginalPaper 13 November 2013 Pages: 340 - 364

Search