Differences
This shows you the differences between two versions of the page.
| — |
staff:jabrayilov [2019-10-04 13:17] (current) |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| + | ====== Adalat Jabrayilov ====== | ||
| + | |||
| + | | Room: | 242 | | ||
| + | | Phone: | +49 231 755-7743 | | ||
| + | | Fax: | +49 231 755-7740 | | ||
| + | | E-Mail: | vorname.name{{:staff:at.gif|}}tu-dortmund.de| | ||
| + | |||
| + | ===== Research Interests ===== | ||
| + | |||
| + | |||
| + | * Combinatorial Optimization and Graph Theory | ||
| + | * Convex optimization, Integer Programming, Branch&Cut, Primal-Dual Algorithms | ||
| + | * Network Flow Problems | ||
| + | * Randomized Algorithms | ||
| + | |||
| + | ===== Project ===== | ||
| + | |||
| + | [[https://ls11-www.cs.uni-dortmund.de/mutzel/projectscompactgraphdrawing|Compact Graph Drawing with Port Constraints]] | ||
| + | |||
| + | [[https://ls11-www.cs.uni-dortmund.de/mutzel/gdbenchmarks|Benchmarks zum Paper **Compact Layered Drawings of General Directed Graphs** (2016) von Adalat Jabrayilov, Sven Mallach, Petra Mutzel, Ulf Ruegg, und Reinhard von Hanxleden]] | ||
| + | ===== Publications ===== | ||
| + | |||
| + | ==== Refereed Conference Articles ==== | ||
| + | |||
| + | * **A new Integer Linear Program for the Steiner Tree Problem with Revenues, Budget and Hop Constraints ** ([[https://arxiv.org/abs/1806.10697|extended arXiv version]]) \\ //Adalat Jabrayilov, Petra Mutzel//, \\ Proceedings of Algorithm Engineering and Experiments (ALENEX2019), pages 107-116, SIAM, 2019 | ||
| + | |||
| + | * **New Integer Linear Programming Models for the Vertex Coloring Problem** \\ //Adalat Jabrayilov, Petra Mutzel//, \\ 13th Latin American Theoretical Informatics Symposium (LATIN 2018), LNCS 10807, pages 640–652, Springer, 2018. | ||
| + | |||
| + | * **Compact Layered Drawings of General Directed Graphs**\\ //Adalat Jabrayilov, Sven Mallach, Petra Mutzel, Ulf Ruegg, and Reinhard von Hanxleden//, \\ 24nd International Symposium on Graph Drawing and Network Visualization (GD 2016), LNCS 9801, pages 209–221, Springer, 2016 | ||
| + | |||
| + | |||
| + | ==== Thesis ==== | ||
| + | |||
| + | * **[[https://ls11-www.cs.tu-dortmund.de/_media/techreports/tr15-02.pdf| TR15-02: Baumzerlegungsbasierte Algorithmen für das Steinerbaumproblem]]** \\ //Adalat Jabrayilov, \\ //Diplomarbeit (Master's thesis), TU Dortmund, Mai 2015 | ||
| + | |||
| + | ===== Teaching ===== | ||
| + | |||
| + | ==== Supervised Bachelor/Master/Diploma-Theses ==== | ||
| + | |||
| + | * Scarlett Gebski (BT, 2016): **Algorithmen zur Visualisierung von Graphen in einem vordefinierten Seitenverhältnis** | ||
| + | * Cedric Schinner (BT, 2016): **Realisierung eines baumzerlegungsbasierten Algorithmus für das Steinerbaumproblem** | ||
| + | * Daniel Matuszczyk (BT, 2017): **Multilevel Layout Methoden für Cluster-Graphen** | ||
| + | * Marco Kuhnke (MT, 2017): **Graphenalgorithmische Ansätze zur Berechnung optimaler Aufstellungen in Mannschaftssportarten ** | ||
| + | * Yannick von Kienle (BT, 2019): ** Evaluierung von ILP-Formulierungen für tiefenbeschränkte minimale Spannbäume ** | ||
| + | * Scarlett Gebski (MT, 2019): ** Die Analyse der Zusammenhänge von k-dimensionalen Weisfeiler-Leman Algorithmen und Sherali-Adams-Relaxierungen** | ||