Accepted papers – University of Copenhagen

Forward this page to a friend Resize Print Bookmark and Share

Home > Accepted papers

Submissions: 81; Accepted: 36; Rejected: 45

Accepted papers

  1. Luca Allulli, Giuseppe F. Italiano, and Federico Santaroni. Exploiting GPS Data in Public Transport Journey Planners
  2. Lukas Barth, Stephen Kobourov, and Sergey Pupyrev. Experimental Comparison of Semantic Word Clouds
  3. Martin Bergner, Marco Lübbecke, and Jonas Witt. A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs
  4. Attila Bernath, Krzysztof Ciebiera, Piotr Godlewski, and Piotr Sankowski. Implementation of the Iterative Relaxation Algorithm for the Minimum Bounded-Degree Spanning Tree Problem
  5. Tamanna Chhabra and Jorma Tarhio. Order-Preserving Matching with Filtration
  6. David Coudert, Dorian Mazauric, and Nicolas Nisse. Experimental Evaluation of a Branch and Bound Algorithm for computing Pathwidth
  7. Livio De La Cruz, Stephen Kobourov, Sergey Pupyrev, Paul S. Shen, and Sankar Veeramoni. Computing Consensus Curves
  8. Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci and Guido Proietti. Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches
  9. Daniel Delling, Andrew Goldberg, Ruslan Savchenko, and Renato Werneck. Hub Labels: Theory and Practice
  10. Shuhei Denzumi, Jun Kawahara, Koji Tsuda, Hiroki Arimura, Shin-Ichi Minato, and Kunihiko Sadakane. DenseZDD: A Compact and Fast Index for Families of Sets
  11. Julian Dibbelt, Ben Strasser, and Dorothea Wagner. Customizable Contraction Hierarchies
  12. David Eppstein, Michael Goodrich, Michael Mitzenmacher, and Paweł Pszona. Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket
  13. Stephan Erb, Moritz Kobitzsch, and Peter Sanders. Parallel Bi-Objective Shortest Paths using Weight-Balanced B-Trees with Bulk Updates
  14. Martin Farach-Colton, Katia Leal, Miguel A. Mosteiro, and Christopher Thraves. Dynamic Windows Scheduling with Reallocations
  15. Donatella Firmani, Giuseppe F. Italiano, and Marco Querini. Engineering Color Barcode Algorithms for Mobile Applications
  16. Jose Fuentes-Sepúlveda, Erick Elejalde, Leo Ferres, and Diego Seco. Efficient Wavelet Tree Construction and Querying for Multicore Architectures
  17. Andreas Gemsa, Martin Nöllenburg, and Ignaz Rutter. Evaluation of Labeling Strategies for Rotating Maps
  18. Loukas Georgiadis, Luigi Laura, Nikos Parotsidis, and Robert Tarjan. Loop Nesting Forests, Dominators, and Applications
  19. Roland Glantz, Henning Meyerhenke, and Christian Schulz. Tree-based Coarsening and Partitioning of Complex Networks
  20. Simon Gog, Timo Beller, Alistair Moffat, and Matthias Petri. From Theory to Practice: Plug and Play with Succinct Data Structures
  21. Simon Gog and Gonzalo Navarro. Improved and Extended Locating Functionality on Compressed Suffix Arrays
  22. Sepp Hartung, Clemens Hoffmann, and André Nichterlein. Improved Upper and Lower Bound Heuristics for Degree Anonymization in Social Networks
  23. Tommi Hirvola and Jorma Tarhio. Approximate Online Matching of Circular Strings
  24. Juha Kärkkäinen and Dominik Kempa. LCP Array Construction in External Memory
  25. Yasuaki Kobayashi, Keita Komuro, and Hisao Tamaki. Search Space Reduction through Commitments in Pathwidth Computation: An Experimental Study
  26. Sven O. Krumke, Alain Quilliot, Annegret Wagler, and Jan-Thierry Wegener. Relocation in Carsharing Systems using Flows in Time-Expanded Networks
  27. Aapo Kyrola, Julian Shun, and Guy Blelloch. Beyond Synchronous Computation: New Techniques for External Memory Graph Algorithms
  28. Jesper Larsson, Kasper Fuglsang, and Kenneth Karlsson. Efficient Representation for Online Suffix Tree Construction
  29. Iain McBride, David F. Manlove, and Peter Biro. The Hospitals/Residents Problem with Couples: Complexity and Integer Programming Models
  30. Henning Meyerhenke, Peter Sanders, and Christian Schulz. Partitioning Complex Networks via Size-constrained Clustering
  31. Ingo Müller, Peter Sanders, Robert Schulze, and Wei Zhou. Retrieval and Perfect Hashing using Fingerprinting
  32. Gonzalo Navarro and Alberto Ordóñez Pereira. Faster Compressed Suffix Trees for Repetitive Text Collections
  33. Samuel Rosat, Issmail Elhallaoui, François Soumis, and Andrea Lodi. Integral Simplex Using Decomposition with Primal Cuts
  34. Noy Rotbart, Marcos Vaz Salles, and Iasonas Zotos. An Evaluation of Dynamic Labeling Schemes for Tree Networks
  35. Yoshimasa Takabatake, Yasuo Tabei, and Hiroshi Sakamoto. Improved ESP-Index: A Practical Self-Index for Highly Repetitive Texts
  36. Maurício J. O. Zambon, Pedro J. de Rezende, and Cid C. de Souza. An Exact Algorithm for the Chromatic Art Gallery Problem