Accepted papers

Accepted papers for MASSIVE 2012 

  • Deepak Ajwani and Norbert Zeh
    Topological Sorting of Large DAGs with Small Path Cover
  • Lars Arge, Herman Haverkort and Constantinos Tsirogiannis
    Fast Generation of Multiple Resolution Instances of Raster Data Sets
  • Lars Arge, Michael Goodrich and Freek van Walderveen
    Computing Betweenness Centrality in External Memory
  • Tetsuo Asano, Maike Buchin, Kevin Buchin, Matias Korman, Wolfgang Mulzer, Günter Rote and André Schulz
    Memory-Constrained Algorithms for Simple Polygons
  • Giorgio Ausiello, Donatella Firmani, Luigi Laura and Emanuele Paracone
    Large-Scale Graph Biconnectivity in MapReduce
  • Jérémy Barbay, Ankur Gupta, Srinivasa Rao Satti and Jonathan P. Sorenson
    Near-Optimal Online Multiselection in Internal and External Memory
  • Gerth Stølting Brodal, Spyros Sioutas, Konstantinos Tsakalidis and Kostas Tsichlas
    Fully Persistent B-Trees
  • Jan Bulánek, Michal Koucký, Michael Saks
    The online labeling problem
  • Dan Feldman, Melanie Schmidt and Christian Sohler
    Turning big data into tiny data: Constant-size coresets for k-means, PCA and projective clustering
  • Ahmed Helmi, Jérémie Lumbroso, Conrado Martínez and Alfredo Viola
    Data Streams as Random Permutations: the Distinct Element Problem
  • Casper Kejlberg-Rasmussen, Konstantinos Tsakalidis and Kostas Tsichlas
    I/O-Efficient Dynamic Planar Range Skyline Queries
  • Elad Verbin and Wei Yu
    Data Structure Lower Bounds on Random Access to Grammar-Compressed Strings