Publications

Filter:
 

Year: 2010

  • V. Osipov and P. Sanders. "n-Level Graph Partitioning". 18th European Symposium on Algorithms (ESA). 2010. [More] [Bibtex]
  • B. Peis, S. Stiller and A. Wiese. "Policies for Periodic Packet Routing". Proceedings of the 21st International Symposium on Algorithms and Computation (ISAAC 2010). 2010. pp. 266-278. [More] [Bibtex]
  • D. Feldman, M. Monemizadeh, C. Sohler and D. P. Woodruff. "Coresets and sketches for high dimensional subspace approximation problems". Proceedings of the 21th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010. 2010. pp. 630-649. [More] [Bibtex]
  • M. R. Ackermann, C. Lammersen, M. Märtens, C. Raupach, C. Sohler and K. Swierkot. "StreamKMtt ++: A Clustering Algorithm for Data Streams". Proceedings of the Workshop on Algorithm Engineering and Experiments, ALENEX 2010. 2010. pp. 175-187. [More] [Bibtex]
  • A. Krüger, V. Leutnant, R. Häb-Umbach, M. R. Ackermann and J. Blömer. "On the Initialisation of Dynamic Models for Speech Features". Sprachkommunikation 2010 -- Beiträge der 9. ITG-Fachtagung. 2010. pp. 25:1-4. [More] [Bibtex]
  • M. Müller-Hannemann and S. Schirra eds. Algorithm Engineering --- Bridging the gap between algorithm theory and practice. Springer, Heidelberg. 2010. [More] [Bibtex]
  • A. Berger and M. Müller-Hannemann. "Uniform Sampling of Directed Graphs with a Fixed Degree Sequence". Proceedings of WG 2010. 2010. pp. 220-231. [More] [Bibtex]
  • F. Gieseke, G. Moruz and J. Vahrenhold. "Resilient K-d Trees: K-Means in Space Revisited". Proc. 10th IEEE International Conference on Data Mining. 2010. pp. 815-820. [More] [Bibtex]
  • M. Goerigk and A. Schöbel. "An Empirical Analysis of Robustness Concepts for Timetabling". Proceedings of the 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. T. Erlebach and M. Lübbecke eds. 2010. pp. 100-113. [More] [Online version] [Bibtex]
  • A. Schöbel. "Light Robustness and the trade-off between robustness and nominal quality". Preprint-Reihe, Institut für Numerische und Angewandte Mathematik, Georg-August Universität Göttingen. 2010. [More] [Bibtex]
  • B. Doerr, M. Künnemann and M. Wahlström. "Randomized Rounding for Routing and Covering Problems: Experiments and Improvements". SEA. 2010. pp. 190-201. [More] [Bibtex]
  • B. Doerr, M. Gnewuch and M. Wahlström. "Algorithmic construction of low-discrepancy point sets via dependent randomized rounding", Journal of Complexity, Vol. 26. 2010, pp. 490-507. [More] [Online version] [Bibtex]
  • H. Meyerhenke. "Beyond Good Shapes: Diffusion-based Graph Partitioning is Relaxed Cut Optimization". Proc. 21st International Symposium on Algorithms and Computation (ISAAC'10). 2010. [More] [Bibtex]
  • J. Gehweiler and H. Meyerhenke. "A Distributed Diffusive Heuristic for Clustering a Virtual P2P Supercomputer". Proc. 7th High-Performance Grid Computing Workshop (HGCW'10) in conjunction with 24th Intl. Parallel and Distributed Processing Symposium (IPDPS'10). 2010. [More] [Bibtex]
  • B. Peis, M. Skutella and A. Wiese. "Packet Routing: Complexity and Algorithms". Berlin : Springer. 2010. pp. 217-228. [More] [Online version] [Bibtex]
  • C. Buchheim, A. Wiegele and L. Zheng. "Exact Algorithms for the Quadratic Linear Ordering Problem", INFORMS Journal on Computing, Vol. 22. 2010, pp. 168-177. [More] [Online version] [Bibtex]
  • C. Buchheim, F. Liers and M. Oswald. "Speeding up IP-based Algorithms for Constrained Quadratic 0-1 Optimization", Mathematical Programming (Series B), Vol. 124. 2010, pp. 513-535. [More] [Online version] [Bibtex]
  • F. Baumann, C. Buchheim and F. Liers. "Exact Bipartite Crossing Minimization under Tree Constraints". 9th International Symposium on Experimental Algorithms – SEA 2010. 2010. pp. 118-128. [More] [Online version] [Bibtex]
  • F. Baumann and C. Buchheim. "Submodular Formulations for Range Assignment Problems". International Symposium on Combinatorial Optimization – ISCO 2010. 2010. pp. 239-246. [More] [Online version] [Bibtex]
  • N. Leischner, V. Osipov and P. Sanders. "GPU Sample Sort". 24th IEEE International Symposium on Parallel and Distributed Processing (IPDPS). 2010. pp. 1 -10. [More] [Online version] [Bibtex]

Year: 2009

  • M. Holzer, F. Schulz, D. Wagner, G. Prasinos and C. Zaroliagis. "Engineering planar separator algorithms", ACM Journal of Experimental Algorithmics, Vol. 14, December, 2009, pp. 1-31. [More] [Online version] [Bibtex]
  • C. Neumann. "Semi-External Stable-Marriage". Bachelor Thesis, Goethe University Frankfurt am Main. 2009. [More] [Bibtex]
  • R. Görke, T. Hartmann and D. Wagner. "Dynamic Graph Clustering Using Minimum-Cut Trees". Algorithms and Data Structures, 11th International Workshop (WADS'09). F. Dehne, J.-R. Sack and R. Tamassia eds. 2009. pp. 339-350. [More] [Online version] [Bibtex]
  • D. Delling, R. Görke, C. Schulz and D. Wagner. "ORCA Reduction and ContrAction Graph Clustering". Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management (AAIM'09). A. V. Goldberg and Y. Zhou eds. 2009. pp. 152-165. [More] [Online version] [Bibtex]
  • S. Mukhtar. "Dynamische Clusteranalyse für DM-Verkaufsdaten". Department of Informatics. 2009. [More] [Online version] [Bibtex]
Results 126 - 150 of 271
<< Start < Prev 1 2 3 4 5 6 7 8 9 10 Next > End >>