Year: 2009

  • D. Ajwani, R. Dementiev and U. Meyer. "Breadth first search on massive graphs". Shortest Path Computations: Ninth DIMACS Challenge. 2009. pp. 291-307. [More] [Bibtex]
  • M. R. Ackermann and J. Blömer. "Coresets and Approximate Clustering for Bregman Divergences". SODA 2009. 2009. pp. 1088-1097. [More] [Bibtex]
  • A. Beckmann, R. Dementiev and J. Singler. "Building A Parallel Pipelined External Memory Algorithm Library_1". 23rd IEEE International Symposium on Parallel and Distributed Processing. 2009. pp. 1-10. [More] [Bibtex]
  • A. Beckmann, R. Dementiev and J. Singler. "Building A Parallel Pipelined External Memory Algorithm Library". 23rd IEEE International Symposium on Parallel and Distributed Processing. 2009. pp. 1-10. [More] [Bibtex]
  • D. Ajwani and U. Meyer. "Design and Engineering of External Memory Traversal Algorithms for General Graphs". Algorithmics of Large and Complex Networks. 2009. pp. 1-33. [More] [Bibtex]
  • A. Kerren et al.. "On Open Problems in Biological Network Visualization". Graph Drawing. 2009. pp. 256-267. [More] [Bibtex]
  • M. Gronemann. "Engineering the Fast-Multipole-Multilevel Method for multicore and SIMD architectures". Lehrstuhl für Algorithm Engineering, Fakultät für Informatik, Technische Universität Dortmund. 2009. [More] [Bibtex]
  • C. Gutwenger, S.-H. Hong, P. Mutzel and P. Eades. "Graph Drawing Algorithms". M. Atallah and M. Blanton eds. Chapman and Hall. 2009. pp. 6-1-6-28. [More] [Bibtex]
  • P. Mutzel. "The Crossing Number of Graphs: Theory and Computation". Efficient Algorithms, Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday. S. Albers, H. Alt and S. Näher eds. 2009. pp. 305-317. [More] [Bibtex]
  • P. Mutzel. "Optimization in Leveled Graphs". Floudas, C. A., Pardalos and P. M. eds. Springer. 2009. pp. 2813-2820. [More] [Bibtex]
  • P. Sanders. "Algorithm Engineering -- An Attempt at a Definition". Efficient Algorithms. 2009. pp. 321-340. [More] [Online version] [Bibtex]
  • M. Jünger and M. Schulz. "Intersection graphs in simultaneous embedding with fixed edges". Universität zu Köln. 2009. [More] [Bibtex]
  • K. Klein, N. Kriege, P. Mutzel, H. Waldmann and S. Wetzel. "Scaffold Hunter - Interactive Exploration of Chemical Space". Graph Drawing. 2009. pp. 426-427. [More] [Bibtex]
  • M. Chimani, C. Gutwenger, P. Mutzel and C. Wolf. "Inserting a vertex into a planar graph". SODA '09: Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms. 2009. pp. 375-383. [More] [Bibtex]
  • M. Chimani, P. Hliněný and P. Mutzel. "Approximating the Crossing Number of Apex Graphs". Graph Drawing. 2009. pp. 432-434. [More] [Bibtex]
  • C. Gutwenger, M. Jünger, P. Mutzel, M. Schulz and J. J. Fowler. "An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges". 2009. pp. 157-168. [More] [Online version] [Bibtex]
  • E. Günther, F. G. König and N. Megow. "The Bin-Scheduling Problem". Proceedings of MAPSP '09. 2009. [More] [Bibtex]
  • A. Berger, D. Delling, A. Gebhardt and M. Müller-Hannemann. "Accelerating Time-Dependent Multi-Criteria Timetable Information is Harder Than Expected". ATMOS 2009 - 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. J. Clausen and G. D. Stefano eds. 2009. [More] [Online version] [Bibtex]
  • M. Müller-Hannemann and M. Schnee. "Efficient Timetable Information in the Presence of Delays". Robust and Online Large-Scale Optimization. R. K. Ahuja, R. H. Möhring and C. D. Zaroliagis eds. 2009. pp. 249-272. [More] [Online version] [Bibtex]
  • A. Berger and M. Müller-Hannemann. "Subpath-Optimality of Multi-Criteria Shortest Paths in Time- and Event-Dependent Networks". Institute of Computer Science, Martin-Luther-Universität Halle-Wittenberg. 2009. [More] [Online version] [Bibtex]
  • H. Meyerhenke. "Dynamic Load Balancing for Parallel Numerical Simulations Based on Repartitioning with Disturbed Diffusion". Proc. Internatl. Conference on Parallel and Distributed Systems (ICPADS'09). 2009. pp. 150-157. [More] [Online version] [Bibtex]
  • H. Meyerhenke, B. Monien and S. Schamberger. "Graph Partitioning and Disturbed Diffusion", Parallel Computing, Vol. 35. 2009, pp. 544-569. [More] [Online version] [Bibtex]
  • H. Meyerhenke, B. Monien and T. Sauerwald. "A New Diffusion-based Multilevel Algorithm for Computing Graph Partitions", Journal of Parallel and Distributed Computing, Vol. 69. 2009, pp. 750-761. [More] [Online version] [Bibtex]
  • A. Karrenbauer and T. Rothvoß. "An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-time Scheduling". 17th Annual European Symposium on Algorithms (ESA 2009). 2009. pp. 432-443. [More] [Online version] [Bibtex]
  • R. I. Davis, T. Rothvoß, S. K. Baruah and A. Burns. "Exact quantification of the suboptimality of uniprocessor fixed priority pre-emptive scheduling", Real-Time Systems, Vol. 43. 2009. [More] [Online version] [Bibtex]
Results 151 - 175 of 271
<< Start < Prev 1 2 3 4 5 6 7 8 9 10 Next > End >>