Differences
This shows you the differences between two versions of the page.
|
staff:jabrayilov [2018-10-19 14:37] |
staff:jabrayilov [2019-01-16 10:50] |
||
|---|---|---|---|
| Line 24: | Line 24: | ||
| ==== Refereed Conference Articles ==== | ==== Refereed Conference Articles ==== | ||
| - | * **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 | + | * **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. | * **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. | ||
| - | * **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//, \\ Accepted at ALENEX 2019 | + | * **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 ==== | ==== Thesis ==== | ||