Differences

This shows you the differences between two versions of the page.

Link to this comparison view

teaching:seminarae-ws2015 [2015-11-23 11:22]
teaching:seminarae-ws2015 [2016-02-11 13:52]
Line 51: Line 51:
 | 8. | [[http://​arxiv.org/​pdf/​1409.0035.pdf|Computing Classic Closeness Centrality, at Scale]] | Cohen, Delling, Pajor, Werneck | ACM Conference on Social Networks 2014 |  Patrik Elfert ​ |  [[:​staff:​mutzel|Petra Mutzel]] ​ | | 8. | [[http://​arxiv.org/​pdf/​1409.0035.pdf|Computing Classic Closeness Centrality, at Scale]] | Cohen, Delling, Pajor, Werneck | ACM Conference on Social Networks 2014 |  Patrik Elfert ​ |  [[:​staff:​mutzel|Petra Mutzel]] ​ |
 | 9. | [[http://​dx.doi.org/​10.1007/​978-3-662-48350-3_52|Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search]] | Goldberg, Hed, Kaplan, Kohli, Tarjan, Werneck | ESA 2015 |  Christian Everke ​ |  [[:​staff:​kurz|Denis Kurz]] ​ | | 9. | [[http://​dx.doi.org/​10.1007/​978-3-662-48350-3_52|Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search]] | Goldberg, Hed, Kaplan, Kohli, Tarjan, Werneck | ESA 2015 |  Christian Everke ​ |  [[:​staff:​kurz|Denis Kurz]] ​ |
-| 10. | [[http://​dx.doi.org/​10.1007/​978-3-319-20086-6_21|Public Transit ​Routing]] | Delling, Dibbelt, Pajor, Werneck | SEA 2015 |  Kai Sauerwald ​ |  [[:​staff:​kurz|Denis Kurz]] ​ |+| 10. | [[http://​dx.doi.org/​10.1007/​978-3-319-20086-6_21|Public Transit ​Labeling]] | Delling, Dibbelt, Pajor, Werneck | SEA 2015 |  Kai Sauerwald ​ |  [[:​staff:​kurz|Denis Kurz]] ​ |
  
 Auf alle Artikel kann aus dem Uni-Netzwerk (oder mittels VPN von zu Hause aus) zugegriffen werden. Auf alle Artikel kann aus dem Uni-Netzwerk (oder mittels VPN von zu Hause aus) zugegriffen werden.
  
 Die Vorträge werden am 16./​17.02.2016 im Raum 202, OH14 gehalten. Die Vorträge werden am 16./​17.02.2016 im Raum 202, OH14 gehalten.
 +
 +
 +| ^  Dienstag, 16.02.2016 ​ ^  Mittwoch, 17.02.2016 ​ ^
 +^   ​9:​30-10:​30 ​ |  |  **Approximate Graph Mining with Label Costs** \\ //Erik Thordsen// ​ |
 +^  10:​30-11:​30 ​ |  **Efficient Implementation of a Synchronous \\ Parallel Push-Relabel Algorithm** \\ //Marcel Bargull// ​ |  **Standardized Mutual Information for Clustering Comparisons:​ \\ One Step Further in Adjustment for Chance** \\ //Lutz Oettershagen// ​ |
 +^  11:​30-12:​30 ​ |  **Faster and More Dynamic Maximum Flow \\ by Incremental Breadth-First Search** \\ //Christian Everke// ​ |  **Random Features for Large-Scale Kernel Machines** \\ //Tim Schendekehl// ​ |
 +^               ​| ​ (Mittagspause) ​ |  (Mittagspause) ​ |
 +^  13:​30-14:​30 ​ |  **ParetoPrep:​ Fast Computation of Path Skylines Queries** \\ //Jan Goclik// ​ |  **Computing Classic Closeness Centrality, at Scale** \\ //Patrik Elfert// ​ |
 +^  14:​30-15:​30 ​ |  **Public Transit Labeling** \\ //Kai Sauerwald// ​ |  **Fast Approximation of Betweenness Centrality \\ through Sampling** \\ //David Losch// ​ |
 +^  15:​30-16:​30 ​ |  **Thinning out Steiner trees: A Node-Based Model \\ for Uniform Edge Costs** \\ //Shabnam Tabatabaian// ​ |  |
  
  
 
Last modified: 2016-02-11 13:52 (external edit)
DokuWikiRSS-Feed