Year: 2008

  • T. Hartmann. "Clustering Dynamic Graphs with Guaranteed Quality". Department of Informatics. 2008. [More] [Online version] [Bibtex]
  • S. Nagel. "Optimisation of Clustering Algorithms for the Identification of Customer Profiles from Shopping Cart Data". Department of Informatics. 2008. [More] [Online version] [Bibtex]
  • D. Delling, M. Gaertler, R. Görke and D. Wagner. "Engineering Comparators for Graph Clusterings". Proceedings of the 4th International Conference on Algorithmic Aspects in Information and Management (AAIM'08). 2008. pp. 131-142. [More] [Online version] [Bibtex]
  • C. Schulz. "Design and Experimental Evaluation of a Local Graph Clustering Algorithm". 2008. [More] [Online version] [Bibtex]
  • M. Holzer. "Engineering Planar-Separator and Shortest-Path Algorithms". Department of Informatics. 2008. [More] [Online version] [Bibtex]
  • F. Hübner. "The Dynamic Graph Clustering Problem - ILP-Based Approaches Balancing Optimality and the Mental Map". Department of Informatics. 2008. [More] [Online version] [Bibtex]
  • H. Meyerhenke. "Disturbed Diffusive Processes for Solving Partitioning Problems on Graphs". Universität Paderborn. 2008. [More] [Bibtex]
  • M. Krings. "LP-basierte Heuristiken für Graphenclusterung mit Modularity als Qualitätsmaß". 2008. [More] [Online version] [Bibtex]
  • D. Glaser. "Zeitexpandiertes Graphenclustern - Modellierung und Experimente". Department of Informatics. 2008. [More] [Online version] [Bibtex]
  • U. Brandes et al. "On Modularity Clustering", IEEE Transactions on Knowledge and Data Engineering, Vol. 20, February, 2008, pp. 172-188. [More] [Online version] [Bibtex]
  • S. Kottler, M. Kaufmann and C. Sinz. "Computation of Renameable Horn Backdoors". Theory and Applications of Satisfiability Testing. 2008. [More] [Online version] [Bibtex]
  • S. Kottler, M. Kaufmann and C. Sinz. "A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors". Theory and Applications of Satisfiability Testing. 2008. [More] [Online version] [Bibtex]
  • D. Ajwani, I. Malinger, U. Meyer and S. Toledo. "Characterizing the Performance of Flash Memory Storage Devices". 7th International Workshop on Experimental Algorithms. 2008. pp. 208-219. [More] [Bibtex]
  • U. Meyer. "On Trade-Offs in External-Memory Diameter Approximation". 11th Scandinavian Workshop on Algorithm Theory. 2008. pp. 426-436. [More] [Bibtex]
  • U. Meyer. "On Dynamic Breadth-First Search in External-Memory". 25th Annual Symposium on Theoretical Aspects of Computer Science. 2008. [More] [Bibtex]
  • M. Albrecht et al.. "A graph-drawing perspective to some open problems in molecular biology". Technische Universität Dortmund. 2008. [More] [Bibtex]
  • M. Schulz. "Simultaneous Graph Drawing". Universität zu Köln. 2008. [More] [Bibtex]
  • M. Chimani. "Exact Crossing Minimization". Technische Universität Dortmund. 2008. [More] [Bibtex]
  • B. T. Zey. "Algorithms for Planar Graph Augmentation". 2008. [More] [Bibtex]
  • S. Mallach. "Beschleunigung ausgewählter paralleler Standard Template Library Algorithmen". 2008. [More] [Bibtex]
  • C. Wolf. "Inserting a vertex into a planar graph". 2008. [More] [Bibtex]
  • M. Baum. "Quasi-Orthogonales Zeichnen von Cluster-Graphen mit Kantenbündelungen". 2008. [More] [Bibtex]
  • G. Bartel. "Zerlegungsstrategien für Multilevel-Graphdrawing-Verfahren". 2008. [More] [Bibtex]
  • D. Emig, K. Klein, A. Kunert, P. Mutzel and M. Albrecht. "Visualizing Domain Interaction Networks and the Impact of Alternative Splicing Events". MEDIVIS '08: Proceedings of the 2008 Fifth International Conference BioMedical? Visualization: Information Visualization in Medical and Biomedical Informatics. 2008. pp. 36-43. [More] [Online version] [Bibtex]
  • M. Chimani, P. Mutzel and I. M. Bomze. "A New Approach to Exact Crossing Minimization". ESA. 2008. pp. 284-296. [More] [Bibtex]
Results 201 - 225 of 271
<< Start < Prev 1 2 3 4 5 6 7 8 9 10 Next > End >>