Year: 2007

• M. Gaertler, R. Görke and D. Wagner. "Significance-Driven Graph Clustering". Proceedings of the 3rd International Conference on Algorithmic Aspects in Information and Management (AAIM'07). 2007. pp. 11-26. [More] [Online version] [Bibtex]
• S. Lang. "Protein domain decomposition using spectral graph partitioning". 2007. [More] [Online version] [Bibtex]
• M. Freidinger. "Minimale Schnitte und Schnittbäume". 2007. [More] [Online version] [Bibtex]
• N. Megow, R. H. Möhring and J. Schulz. "Turnaround Scheduling in Chemical Manufacturing". Proceedings of MAPSP '07. 2007. [More] [Bibtex]
• D. Feldman, M. Monemizadeh and C. Sohler. "A PTAS for k-means clustering based on weak coresets". Proceedings of the 23th annual symposium on Computational geometry, SoCG 2007. 2007. pp. 11-18. [More] [Bibtex]
• G. Italiano, P. Mutzel, P. Sanders and M. Skutella. "Proc. Intern. Oberwolfach Workshop on Algorithm Engineering Oberwolfach Report No. 25/2007". 2007. [More] [Bibtex]
• M. Percan. "Constrained Planarity and Augmentation Problems". Universität zu Köln. 2007. [More] [Bibtex]
• T. Kerkhof. "Algorithmen zur Bestimmung von guten Graph-Einbettungen für orthogonale Zeichnungen". 2007. [More] [Bibtex]
• M. Bachra. "Geradliniges Zeichnen von Cluster-Graphen im Divide-and-Conquer-Ansatz". 2007. [More] [Bibtex]
• M. Jansen. "Ein Branch-and-Cut Ansatz für das Maximum C-planare Subgraphen Problem". 2007. [More] [Bibtex]
• A. Kunert. "Layoutverfahren für biologische Netzwerke". 2007. [More] [Bibtex]
• M. Chimani and C. Gutwenger. "Algorithms for the Hypergraph and the Minor Crossing NumberProblems". ISAAC. 2007. pp. 184-195. [More] [Bibtex]
• S. Wetzel, K. Klein, A. Schuffenhauer, P. Ertl, P. Mutzel and H. Waldmann. "Software-assisted scaffold tree analysis of large compound collections". 2007. [More] [Bibtex]
• U. Brandes et al.. "Colored Simultaneous Geometric Embeddings". COCOON. 2007. pp. 254-263. [More] [Bibtex]
• L. Frias and J. Singler. "Parallelization of Bulk Operations for STL Dictionaries". Workshop on Highly Parallel Processing on a Chip (HPPC). 2007. pp. 49-59. [More] [Online version] [Bibtex]
• F. Putze, P. Sanders and J. Singler. "Cache-, Hash- and Space-Efficient Bloom Filters". 6th Workshop on Experimental Algorithms (WEA). 2007. pp. 108-121. [More] [Online version] [Bibtex]
• J. Singler, P. Sanders and F. Putze. "The Multi-Core Standard Template Library". Euro-Par 2007: Parallel Processing. 2007. pp. 682-694. [More] [Online version] [Bibtex]
• S. Wagner and D. Wagner. "Comparing Clusterings -- An Overview". Universität Karlsruhe (TH). Tech. Rep. 2006-04. 2007. [More] [Online version] [Bibtex]
• C. Buchheim and G. Rinaldi. "Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case", SIAM Journal on Optimization, Vol. 18. 2007, pp. 1398-1413. [More] [Online version] [Bibtex]

Year: 2002

• E. Althaus, A. Bockmayr, M. Elf, M. Jünger, T. Kasper and K. Mehlhorn. "SCIL - Symbolic Constraints in Integer Linear Programming". Proceedings of the 10th Annual European Symposium on Algorithms. 2002. pp. 75-87. [More] [Online version] [Bibtex]

No year

• D. Emig et al.. "Integration and visualization of exon expression data with domain interaction networks". [More] [Bibtex]