Publications

Filter:
 

Year: 2011

  • R. Görke, P. Maillard, A. Schumm, C. Staudt and D. Wagner. "Dynamic Graph Clustering Combining Modularity and Smoothness". ITI Wagner, Department of Informatics, Karlsruhe Institute of Technology (KIT). 2011. [More] [Online version] [Bibtex]
  • R. Görke, T. Hartmann and D. Wagner. "Dynamic Graph Clustering Using Minimum-Cut Trees". ITI Wagner, Department of Informatics, Karlsruhe Institute of Technology (KIT). 2011. [More] [Online version] [Bibtex]
  • C. Doll, T. Hartmann and D. Wagner. "Fully-Dynamic Hierarchical Graph Clustering Using Cut Trees". ITI Wagner, Department of Informatics, Karlsruhe Institute of Technology (KIT). 2011. [More] [Online version] [Bibtex]
  • M. R. Ackermann, J. Blömer, D. Kuntze and C. Sohler. "Analysis of Agglomerative Clustering". 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011. 2011. pp. 308-319. [More] [Bibtex]
  • U. Meyer, A. Negoescu and V. Weichert. "New Bounds for Old Algorithms: On the Average-Case Behavior of Classic Single-Source Shortest-Paths Approaches". Theory and Practice of Algorithms in (Computer) Systems - First International ICST Conference, TAPAS 2011, Rome, Italy, April 18-20, 2011. Proceedings. 2011. pp. 217-228. [More] [Bibtex]
  • A. Berger, M. Müller-Hannemann, S. Rechner and A. Zock. "Efficient Computation of Time-Dependent Centralities in Air Transportation Networks". WALCOM 2011. 2011. pp. 77-88. [More] [Bibtex]
  • M. Goerigk, M. Knoth, M. Müller-Hannemann, A. Schöbel and M. Schmidt. "The Price of Robustness in Timetable Information". Institut für Informatik, Martin-Luther-Universität Halle-Wittenberg. Tech. Rep. 2011/3. 2011. [More] [Bibtex]
  • A. Berger, A. Gebhardt, M. Müller-Hannemann and M. Ostrowski. "Stochastic Delay Prediction in Large Train Networks". Institut für Informatik, Martin-Luther-Universität Halle-Wittenberg. Tech. Rep. 2011/1. 2011. [More] [Bibtex]
  • A. Berger, C. Blaar, A. Gebhardt, M. Müller-Hannemann and M. Schnee. "Passenger-oriented Train Disposition". Institut für Informatik, Martin-Luther-Universität Halle-Wittenberg. Tech. Rep. 2011/2. 2011. [More] [Bibtex]
  • T. Gunkel, M. Schnee and M. Müller-Hannemann. "How to find good night train connections", Networks, Vol. 57. 2011, pp. 19-27. [More] [Bibtex]
  • G. Moruz and A. Negoescu. "OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm". 2011. [More] [Bibtex]
  • M. Goerigk and A. Schöbel. "A Scenario-Based Approach for Robust Linear Optimization". The 1st International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems (TAPAS). 2011. [More] [Bibtex]

Year: 2010

  • M. Holtgrewe. "Mason - a read simulator for second generation sequencing data". Fachbereich für Mathematik und Informatik, Freie Universität Berlin. Tech. Rep. TR-B-10-06. 2010. [More] [Online version] [Bibtex]
  • R. Görke, A. Meyer-Bäse, C. G. Wagner, H. He, M. R. Emmett and C. A. Conrad. "Determining and interpreting correlations in lipidomic networks found in glioblastoma cells", BMC Systems Biology, Vol. 4, September, 2010. [More] [Online version] [Bibtex]
  • O. F. Lafou. "Engineering von Modularity-basiertem Graphenclustern,". 2010. [More] [Online version] [Bibtex]
  • M. R. Ackermann, J. Blömer and C. Sohler. "Clustering for Metric and Non-Metric Distance Measures", ACM Transactions on Algorithms, Vol. 6, August, 2010, pp. 59:1-26. [More] [Bibtex]
  • K. -. Pukall. "Modelling and Analysis of Flash Memory Translation Layers". Bachelor Thesis, Goethe University Frankfurt am Main. 2010. [More] [Bibtex]
  • A. Schöbel. "Controlling the level of robustness in timetabling and scheduling: A bicriterias approach". Proceedings of the TRISTAN VII conference. G. Hasle ed. 2010. pp. 689-693. [More] [Bibtex]
  • R. Görke, P. Maillard, C. Staudt and D. Wagner. "Modularity-Driven Clustering of Dynamic Graphs". Proceedings of the 9th International Symposium on Experimental Algorithms (SEA'10). P. Festa ed. 2010. pp. 436-448. [More] [Online version] [Bibtex]
  • A. Meyer-Bäse, R. Görke, H. He, M. R. Emmett, A. G. Marshall and C. A. Conrad. "Computational techniques to the topology and dynamics of lipidomic networks found in glioblastoma cells". Proceedings of SPIE 7704: Evolutionary and Bio-Inspired Computation: Theory and Applications IV (2010). 2010. [More] [Online version] [Bibtex]
  • C. Staudt. "Experimental Evaluation of Dynamic Graph Clustering Algorithms". 2010. [More] [Online version] [Bibtex]
  • R. Görke. "An Algorithmic Walk from Static to Dynamic Graph Clustering". Department of Informatics. 2010. [More] [Online version] [Bibtex]
  • R. Görke, M. Gaertler, F. Hübner and D. Wagner. "Computational Aspects of Lucidity-Driven Graph Clustering", Journal of Graph Algorithms and Applications, Vol. 14, January, 2010, pp. 165-197. [More] [Online version] [Bibtex]
  • H. Poppe. "Approximative Suche in Textindizes". Technische Universität München. 2010. [More] [Online version] [Bibtex]
  • A. Dau. "Analyse der Struktur und statistischer Eigenschaften von Texten und Erzeugung zufälliger Texte". Technische Universität München. 2010. [More] [Online version] [Bibtex]
Results 76 - 100 of 271
<< Start < Prev 1 2 3 4 5 6 7 8 9 10 Next > End >>