Differences
This shows you the differences between two versions of the page.
|
teaching:seminarae-ss2016 [2016-07-12 10:21] |
teaching:seminarae-ss2016 [2016-07-19 15:12] |
||
|---|---|---|---|
| Line 40: | Line 40: | ||
| ^ ^ (verlinkter) Titel ^ Autoren ^ Konferenz ^ Teilnehmer ^ Betreuer ^ | ^ ^ (verlinkter) Titel ^ Autoren ^ Konferenz ^ Teilnehmer ^ Betreuer ^ | ||
| - | | 1. | [[http://dl.acm.org/citation.cfm?id=1718537|A sketch-based distance oracle for web-scale graphs]] | Das Sarma, Gollapudi, Najork, Panigrahy | WSDM 2010 | Jan Möller | [[:staff:morris|Christopher Morris]] | | + | | 1. | [[http://ac.els-cdn.com/S0166218X05003094/1-s2.0-S0166218X05003094-main.pdf?_tid=cd899d82-fa5b-11e5-88e0-00000aab0f26&acdnat=1459770970_3ce4ca5424ecbfb1d1b596412bb70460|A Branch-and-Cut algorithm for graph coloring]] | Méndez-Díaz, Zabala | DAM 2005 | Manuel Barbi | [[:staff:jabrayilov|Adalat Jabrayilov]] | |
| - | | 2. | [[http://link.springer.com/content/pdf/10.1007%2F978-3-642-45030-3_52.pdf|An O*(1.1939^n) time algorithm for minimum weighted dominating induced matching]] | Lin, Mizrahi, Szwarcfiter | ISAAC 2013 | Oliver Zietek | [[:staff:droschinsky|Andre Droschinsky]] | | + | | 2. | [[http://arxiv.org/pdf/1409.8318v1.pdf|Strong Steiner Tree Approximations in Practice]] | Bayer, Chimani | CoRR 2014 | Sergei Harder | [[:staff:zey|Bernd Zey]] | |
| - | | 3. | [[http://link.springer.com/chapter/10.1007%2F978-3-319-07959-2_10| Parallel Bi-objective Shortest Paths Using Weight-Balanced B-trees with Bulk Updates]] | Erb, Kobitzsch, Sanders | SEA 2014 | John Sarrazin | [[:staff:boekler|Fritz Bökler]] | | + | | 3. | [[http://dl.acm.org/citation.cfm?id=1718537|A sketch-based distance oracle for web-scale graphs]] | Das Sarma, Gollapudi, Najork, Panigrahy | WSDM 2010 | Jan Möller | [[:staff:morris|Christopher Morris]] | |
| - | | 4. | [[http://ac.els-cdn.com/S0166218X05003094/1-s2.0-S0166218X05003094-main.pdf?_tid=cd899d82-fa5b-11e5-88e0-00000aab0f26&acdnat=1459770970_3ce4ca5424ecbfb1d1b596412bb70460|A Branch-and-Cut algorithm for graph coloring]] | Méndez-Díaz, Zabala | DAM 2005 | Manuel Barbi | [[:staff:jabrayilov|Adalat Jabrayilov]] | | + | | 4. | [[http://link.springer.com/chapter/10.1007%2F978-3-319-07959-2_10| Parallel Bi-objective Shortest Paths Using Weight-Balanced B-trees with Bulk Updates]] | Erb, Kobitzsch, Sanders | SEA 2014 | John Sarrazin | [[:staff:boekler|Fritz Bökler]] | |
| - | | 5. | [[http://arxiv.org/pdf/1409.8318v1.pdf|Strong Steiner Tree Approximations in Practice]] | Bayer, Chimani | CoRR 2014 | Sergei Harder | [[:staff:zey|Bernd Zey]] | | + | | 5. | [[http://dx.doi.org/10.1007/978-3-642-40450-4_13|Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement]] | Berkholz, Bonsma, Grohe | ESA 2013 | Dennis Ciba | [[:staff:kriege|Nils Kriege]] | |
| - | | 6. | [[http://dx.doi.org/10.1007/978-3-642-40450-4_13|Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement]] | Berkholz, Bonsma, Grohe | ESA 2013 | Dennis Ciba | [[:staff:kriege|Nils Kriege]] | | + | | 6. | [[http://dx.doi.org/10.1007/978-3-662-44777-2_42|Dimension Reduction via Colour Refinement]] | Grohe, Kersting, Mladenov, Selman | ESA 2014 | Mirko Bunse | [[:staff:mutzel|Petra Mutzel]] | |
| - | | 7. | [[http://dx.doi.org/10.1007/978-3-662-44777-2_42|Dimension Reduction via Colour Refinement]] | Grohe, Kersting, Mladenov, Selman | ESA 2014 | Mirko Bunse | [[:staff:mutzel|Petra Mutzel]] | | + | |
| + | Die Vorträge werden vom 25.-26.07.2016 im Raum 304, OH14 gehalten. | ||
| + | |||
| + | ^ ^ Montag, 25.07.2016 ^ Dienstag, 26.07.2016 ^ | | ||
| + | ^ 9:00-10:00 | **A Branch-and-Cut algorithm for graph coloring** \\ //Manuel Barbi// | ^ | | ||
| + | ^ 10:00-11:00 | **Strong Steiner Tree Approximations in Practice** \\ //Sergei Harder// | **A sketch-based distance oracle for \\ web-scale graphs** \\ //Jan Möller// ^ 10:00-11:00 | | ||
| + | ^ | | **Parallel Bi-objective Shortest Paths Using \\ Weight-Balanced B-trees with Bulk Updates** \\ //John Sarrazin// ^ 11:00-12:00 | | ||
| + | ^ ::: | ::: | (Pause) ^ 12:00:13:30 | | ||
| + | ^ ::: | ::: | **Tight Lower and Upper Bounds for the Complexity \\ of Canonical Colour Refinement** \\ //Dennis Ciba// ^ 13:30-14:30 | | ||
| + | ^ ::: | ::: | **Dimension Reduction via Colour Refinement** \\ //Mirko Bunse// ^ 14:30-15:30 | | ||
| ===== Anmeldung und Vorbesprechung ===== | ===== Anmeldung und Vorbesprechung ===== | ||