V. Osipov, P. Sanders and J. Singler. "The Filter-Kruskal Minimum Spanning Tree Algorithm". 10th Workshop on Algorithm Engineering and Experiments (ALENEX). 2009. pp. 52-61.[More][Online version][Bibtex]
U. Meyer and V. Osipov. "Design and Implementation of a Practical I/O-efficient Shortest Paths Algorithm". 10th Workshop on Algorithm Engineering and Experiments (ALENEX). 2009. pp. 85-96.[More][Online version][Bibtex]
F. Putze, P. Sanders and J. Singler. "Cache-, Hash- and Space-Efficient Bloom Filters", ACM Journal of Experimental Algorithmics, Vol. 14. 2009, pp. 4.4-4.18.[More][Online version][Bibtex]
V. H. Batista, D. L. Millman, S. Pion and J. Singler. "Parallel Geometric Algorithms for Multi-Core Computers". 25th Annual Symposium on Computational Geometry (SoCG). 2009. pp. 217-226.[More][Online version][Bibtex]
A. Beckmann, R. Dementiev and J. Singler. "Building A Parallel Pipelined External Memory Algorithm Library". 23rd IEEE International Parallel {&} Distributed Processing Symposium (IPDPS). 2009.[More][Online version][Bibtex]
F. Eisenbrand and T. Rothvoß. "New Hardness Results for Diophantine Approximation". Proceedings of the 12th Intl. Workshop on Approximation Algorithms
for Combinatorial Optimization Problems (APPROX 2009). 2009. pp. 98-110.[More][Online version][Bibtex]
C. Patvardhan, P. Prakash and A. Srivastav. "A Novel Quantum-inspired Evolutionary Algorithm for the Quadratic Knapsack Problem". Proceedings of the International Conference on Operations Research Applications In Engineering And Management, Tiruchirappalli, India, May 2009 (ICOREM 2009). 2009. pp. 2061-2064.[More][Bibtex]
R. Görke and C. Staudt. "A Generator for Dynamic Clustered Random Graphs". ITI Wagner, Department of Informatics, Universität Karlsruhe. 2009.[More][Online version][Bibtex]
S. Wetzel et al. "Interactive exploration of chemical space with Scaffold Hunter", Nat Chem Biol, Vol. 5, 08, 2009, pp. 581-583.[More][Online version][Bibtex]
M. Schnee. "Fully realistic multi-criteria timetable information systems". Fachbereich Informatik, Technische Universität Darmstadt. 2009.[More][Bibtex]
G. S. Brodal, A. G. Jorgensen, G. Moruz and T. Molhave. "Counting in the Presence of Memory Faults". Proc. 20th International Symposium on Algorithms and Computation. 2009. pp. 842-851.[More][Bibtex]
A. Kovacs, U. Meyer, G. Moruz and A. Negoescu. "Online Paging for Flash Memory Devices". 20th International Symposium on Algorithms and Computation. 2009. pp. 842-851.[More][Online version][Bibtex]
D. Ajwani, A. Beckmann, R. Jacob, U. Meyer and G. Moruz. "On computational models for flash memory devices". 8th International Symposium on Experimental Algorithms. 2009. pp. 16-27.[More][Online version][Bibtex]
A. Schöbel and A. Kratz. "A bicriteria approach for robust timetabling". Springer. 2009. pp. 119-144.[More][Bibtex]
S. Cicerone et al.. "Recoverable robustness in shunting and timetabling". Springer. 2009. pp. 28-60.[More][Bibtex]
S. Eggert, L. Kliemann and A. Srivastav. "Bipartite Graph Matchings in the Semi-Streaming Model". Proceedings of the 17th Annual European Symposium on Algorithms (ESA). 2009. pp. 492-503.[More][Online version][Bibtex]
L. Kliemann and A. Srivastav. "Experimental Study of Non-Oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b-Matching". Proceedings of the 8th International Symposium on Experimental and Efficient Algorithms (SEA). 2009. pp. 185-196.[More][Bibtex]
M. Chimani, C. Gutwenger, P. Mutzel and H.-M. Wong. "Upward Planarization Layout". Graph Drawing. 2009. pp. 94-106.[More][Bibtex]
B. Doerr, T. Friedrich and T. Sauerwald. "Quasirandom Rumor Spreading: Expanders, Push vs.\ Pull, and Robustness". 36th International Colloquium on Automata, Languages and Programming (ICALP). 2009. pp. 366-377.[More][Bibtex]
B. Doerr, T. Friedrich, M. Künnemann and T. Sauerwald. "Quasirandom Rumor Spreading: An Experimental Analysis". 10th Workshop on Algorithm Engineering and Experiments (ALENEX). 2009. pp. 145-153.[More][Bibtex]
B. Doerr, M. Gnewuch and M. Wahlström. "Implementation of a Component-By-Component Algorithm to Generate Small Low-Discrepancy Samples". L. Ecuyer, Pierre, Owen and A. B. eds. Springer Berlin Heidelberg. 2009. pp. 323-338.[More][Online version][Bibtex]
B. Doerr and M. Wahlström. "Randomized Rounding in the Presence of a Cardinality Constraint". 10th Workshop on Algorithm Engineering and Experiments (ALENEX). 2009. pp. 162-174.[More][Bibtex]
R. Koch, B. Peis, M. Skutella and A. Wiese. "Real-Time Message Routing and Scheduling". 12th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2009). 2009. pp. 217-230.[More][Online version][Bibtex]
E. Althaus and D. Dumitriu. "Fast and Accurate Bounds on Linear Programs". 8th International Symposium on Experimental Algorithms (SEA). 2009. pp. 40-50.[More][Online version][Bibtex]
C. Buchheim and G. Rinaldi. "Terse Integer Linear Programs for Boolean Optimization", Journal on Satisfiability, Boolean Modeling and Computation, Vol. 6. 2009, pp. 121-139.[More][Online version][Bibtex]
