Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
staff:zey [2022-02-16 12:50] berndzey |
staff:zey [2022-11-10 12:03] berndzey |
||
---|---|---|---|
Line 3: | Line 3: | ||
====== Dr. Bernd Zey ====== | ====== Dr. Bernd Zey ====== | ||
+ | |||
+ | |||
+ | Seit 01.11.2022 bin ich in der Abteilung [[https://fdm.tu-dortmund.de/|Forschungsdatenmanagment]] tätig. | ||
+ | |||
+ | |||
+ | ===== Outdated Informations ===== | ||
Line 13: | Line 19: | ||
| Fax: | +49 231 755-7740 | | | Fax: | +49 231 755-7740 | | ||
| E-Mail: | bernd.zey{{:staff:at.gif|}}tu-dortmund.de| | | E-Mail: | bernd.zey{{:staff:at.gif|}}tu-dortmund.de| | ||
+ | | Orcid | [[https://orcid.org/0000-0003-2551-9653|Orcid ID]]| | ||
Line 34: | Line 41: | ||
=== Refereed Conference Proceedings === | === Refereed Conference Proceedings === | ||
+ | |||
+ | |||
+ | * **Augmenting Graphs with Maximal Matchings**\\ //Maike Buchin, Antonia Kalb, Bernd Zey// \\ European Workshop on Computational Geometry (EuroCG), 2022 | ||
+ | |||
* **[[http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=9533|An exact algorithm for the Steiner forest problem]]**\\ //Daniel Schmidt, Bernd Zey, and Francois Margot// \\ European Symposium on Algorithms (ESA), Leibniz International Proceedings in Informatics (LIPIcs), pp. 70:1-70:14, 2018, **awarded ESA track B best paper** | * **[[http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=9533|An exact algorithm for the Steiner forest problem]]**\\ //Daniel Schmidt, Bernd Zey, and Francois Margot// \\ European Symposium on Algorithms (ESA), Leibniz International Proceedings in Informatics (LIPIcs), pp. 70:1-70:14, 2018, **awarded ESA track B best paper** | ||
Line 77: | Line 88: | ||
===== Teaching/Lehre (in German) ===== | ===== Teaching/Lehre (in German) ===== | ||
+ | * Sommersemester 2022 | ||
+ | * [[https://ls11-www.cs.tu-dortmund.de/buchin/teaching/ea2022uebung | Effiziente Algorithmen (Übung)]] | ||
* Wintersemester 2021/2022 | * Wintersemester 2021/2022 | ||
* [[https://ls11-www.cs.tu-dortmund.de/teaching/eidp2122 | Vorlesung Einführung in die Programmierung]] | * [[https://ls11-www.cs.tu-dortmund.de/teaching/eidp2122 | Vorlesung Einführung in die Programmierung]] | ||
Line 155: | Line 168: | ||
* **Maurits Wrubel**: Graph-Dekomposition für Max-Flow-Berechnungen, 2021 | * **Maurits Wrubel**: Graph-Dekomposition für Max-Flow-Berechnungen, 2021 | ||
* **Franziska Schmidt**: Korrektur azyklischer Flüsse zur Reduktion maximaler Flüsse, 2022 | * **Franziska Schmidt**: Korrektur azyklischer Flüsse zur Reduktion maximaler Flüsse, 2022 | ||
- | + | * **Mira Schwartz**: Ganzzahlige lineare Programme für maximale geometrische Matchings, 2022 | |
- | * [[http://ls11-www.cs.tu-dortmund.de/people/chimani/seminarfolien.html | Hinweise zur Foliengestaltung]] (von Markus Chimani) | + | * **Burak Özkan**: Random Walks und deren Cover Time, 2022 |