Differences
This shows you the differences between two versions of the page.
|
teaching:seminarae-ss2018 [2018-05-22 12:19] |
teaching:seminarae-ss2018 [2018-05-24 16:39] |
||
|---|---|---|---|
| Line 34: | Line 34: | ||
| - | ^ Betreuer/in ^ Teilnehmer/in ^ Autor/innen ^ Titel ^ Quelle ^ | + | ^ Betreuer/in ^ Teilnehmer/in ^ Autor/innen ^ Titel ^ Quelle ^ |
| - | | Adalat Jabrayilov | Uriel Elias Wieblitz | Costa, Cordeau, Laporte | [[https://pdfs.semanticscholar.org/b4da/88e9ffad32e72b357a7d1a890395f680d28b.pdf|Models and branch-and-cut algorithms for the Steiner tree problem with revenues, budget and hop constraints]] | Networks 53 (2), 2009 | | + | | Adalat Jabrayilov | Uriel Elias Wieblitz | Costa, Cordeau, Laporte | [[https://pdfs.semanticscholar.org/b4da/88e9ffad32e72b357a7d1a890395f680d28b.pdf|Models and branch-and-cut algorithms for the Steiner tree problem with revenues, budget and hop constraints]] | Networks 53 (2), 2009 | |
| - | | ::: | Johannes Mundorf | Layeb, Hajri, Haouari | [[https://www.researchgate.net/publication/261073477_Solving_the_Steiner_tree_problem_with_revenues_budget_and_hop_constraints_to_optimality|Solving the Steiner tree problem with revenues, budget and hop constraints to optimality]] | ICMSAO 2013 | | + | | ::: | Johannes Mundorf | Layeb, Hajri, Haouari | [[https://www.researchgate.net/publication/261073477_Solving_the_Steiner_tree_problem_with_revenues_budget_and_hop_constraints_to_optimality|Solving the Steiner tree problem with revenues, budget and hop constraints to optimality]] | ICMSAO 2013 | |
| - | | Andre Droschinsky | Hendrik Hildebrandt | Goldberg, Hed, Kaplan, Tarjan | [[https://link.springer.com/article/10.1007%2Fs00224-017-9776-7| Minimum-Cost Flows in Unit-Capacity Networks]] | Theory Comput. Syst. 61(4), 2017 | | + | | Andre Droschinsky | Dennis Misera | Hansen, Kaplan, Tarjan, Zwick | [[https://link.springer.com/chapter/10.1007%2F978-3-662-47672-7_56| Hollow Heaps]] | ICALP 2015 | |
| - | | ::: | Dennis Misera | Hansen, Kaplan, Tarjan, Zwick | [[https://link.springer.com/chapter/10.1007%2F978-3-662-47672-7_56| Hollow Heaps]] | ICALP 2015 | | + | | Bernd Zey | Daniel Kurowski | Paul, Freund, Ferber, Shmoys, Williamson | [[http://drops.dagstuhl.de/opus/volltexte/2017/7837/|Prize-Collecting TSP with a Budget Constraint]] | ESA 2017 | |
| - | | Bernd Zey | Daniel Kurowski | Paul, Freund, Ferber, Shmoys, Williamson | [[http://drops.dagstuhl.de/opus/volltexte/2017/7837/|Prize-Collecting TSP with a Budget Constraint]] | ESA 2017 | | + | | Christiane Spisla | Scarlett Gebski | Aulbach, Fink, Schuhmann, Wolff | [[https://arxiv.org/pdf/1409.0499.pdf| Drawing Graphs within Restricted Area]] | GD 2014 | |
| - | | Christiane Spisla | Scarlett Gebski | Aulbach, Fink, Schuhmann, Wolff | [[https://arxiv.org/pdf/1409.0499.pdf| Drawing Graphs within Restricted Area]] | GD 2014 | | + | | Christine Dahn | Jens Zentgraf | Holm, Italiano, Karczmarz, Łącki, Rotenberg, Sankowski | [[https://arxiv.org/pdf/1706.10228.pdf| Contracting a Planar Graph Efficiently]] | ESA 2017 | |
| - | | Christine Dahn | Jens Zentgraf | Holm, Italiano, Karczmarz, Łącki, Rotenberg, Sankowski | [[https://arxiv.org/pdf/1706.10228.pdf| Contracting a Planar Graph Efficiently]] | ESA 2017 | | + | | ::: | Cedric Schinner | Nocaj, Ortmann, Brandes | [[http://kops.uni-konstanz.de/bitstream/handle/123456789/30583/Nocaj_0-284485.pdf|Untangling Hairballs - From 3 to 14 Degrees of Separation]] | GD 2014 | |
| - | | ::: | Cedric Schinner | Nocaj, Ortmann, Brandes | [[http://kops.uni-konstanz.de/bitstream/handle/123456789/30583/Nocaj_0-284485.pdf|Untangling Hairballs - From 3 to 14 Degrees of Separation]] | GD 2014 | | + | | Denis Kurz | Fabian Smolinski | Delling, Dibbelt, Pajor, Zündorf | [[https://doi.org/10.4230/OASIcs.ATMOS.2017.8|Faster Transit Routing by Hyper Partitioning]] | ATMOS 2017 | |
| - | | Denis Kurz | Fabian Smolinski | Delling, Dibbelt, Pajor, Zündorf | [[https://doi.org/10.4230/OASIcs.ATMOS.2017.8|Faster Transit Routing by Hyper Partitioning]] | ATMOS 2017 | | + | | ::: | Philipp Kramer | Wagner, Zündorf | [[https://doi.org/10.4230/OASIcs.ATMOS.2017.7|Public Transit Routing with Unrestricted Walking]] | ATMOS 2017 | |
| - | | ::: | Philipp Kramer | Wagner, Zündorf | [[https://doi.org/10.4230/OASIcs.ATMOS.2017.7|Public Transit Routing with Unrestricted Walking]] | ATMOS 2017 | | + | | Lutz Oettershagen | Hermann Foot | Strehler, Merting, Schwan | [[https://www.sciencedirect.com/science/article/pii/S0191261516304404|Energy-efficient shortest routes for electric and hybrid vehicles]] | Transportation Research Part B: Methodological 103, 2017 | |
| - | | Lutz Oettershagen | Hermann Foot | Strehler, Merting, Schwan | [[https://www.sciencedirect.com/science/article/pii/S0191261516304404|Energy-efficient shortest routes for electric and hybrid vehicles]] | Transportation Research Part B: Methodological 103, 2017 | | + | | ::: | Julius Adamek | Wu, Cheng, Huang, Ke, Lu, Xu | [[https://dl.acm.org/citation.cfm?id=2732945|Path Problems in Temporal Graphs]] | VLDB 2014 | |
| - | | ::: | Julius Adamek | Wu, Cheng, Huang, Ke, Lu, Xu | [[https://dl.acm.org/citation.cfm?id=2732945|Path Problems in Temporal Graphs]] | VLDB 2014 | | + | | Nils Kriege | Artur Ljulin | Engler, El-Kebir, Mulder, Mark, Geerke, Klau | [[https://peerj.com/preprints/3250.pdf| Enumerating common molecular substructures]] | PeerJ Preprints 2017 | |
| - | | Nils Kriege | Artur Ljulin | Engler, El-Kebir, Mulder, Mark, Geerke, Klau | [[https://peerj.com/preprints/3250.pdf| Enumerating common molecular substructures]] | PeerJ Preprints 2017 | | + | | Till Schäfer | Christian Bohr | Badanidiyuru, Mirzasoleiman, Karbasi, Krause | [[https://doi.org/10.1145/2623330.2623637 | Streaming Submodular Maximization: Massive Data Summarization on the Fly]] | SIGKDD 2014 | |
| - | | Till Schäfer | Christian Bohr | Badanidiyuru, Mirzasoleiman, Karbasi, Krause | [[https://doi.org/10.1145/2623330.2623637 | Streaming Submodular Maximization: Massive Data Summarization on the Fly]] | SIGKDD 2014 | | + | |
| ===== Anmeldung und Vorbesprechung ===== | ===== Anmeldung und Vorbesprechung ===== | ||