Publications



Diploma, PhD and Habilitation Theses

  1. Maximal spannende Baumprobleme mit einer Hierarchie von zwei Entscheidungsträgern (in German), Diplomarbeit, 2002.
    english summary: Maximal spanning tree problems with a hierarchy of two decision makers

  2. Variants of the Assignment Problem and of the Transportation Problem, PhD Thesis, 2004.

  3. Location Problems with variable input, Habilitation Thesis, 2009.


Published Articles in Journals and Proceedings

  1. E. Gassner and S.O. Krumke, Deterministic Online Optical Call Admission Revisited, Lecture notes in computer science 3879 (2006), 190–202.
    extended abstract in Oberwolfach Reports 2(4) (2005), 2918–2920.

  2. R.E. Burkard, E. Gassner and J. Hatzl, A linear time algorithm for the reverse 1-median problem on a cycle, Networks 48 (2006), 16–23.

  3. E. Gassner, M. Jünger, M. Percan, M. Schulz, and M. Schaefer, Simultaneous Graph Embeddings with Fixed Edges, Lecture notes in computer science 4271 (2006), 325–335.

  4. A. Estrella-Balderrama, E. Gassner, M. Jünger, M. Percan, M. Schaefer, and M. Schulz, Simultaneous Geometric Graph Embeddings, Lecture notes in computer science 4875 (2008), 280–290.

  5. R.E. Burkard, E. Gassner and J. Hatzl, Reverse 2-Median Problem on Trees, Discrete Applied Mathematics 156 (2008), 1963–1976.

  6. E. Gassner, The Inverse 1-Maxian Problem with edge length modification, Journal of Combinatorial Optimization 16 (2008), 50–67.

  7. E. Gassner and J. Hatzl, A Parity Domination Problem in Graphs with Bounded Treewidth and Distance-Hereditary Graphs, Computing 82 (2008), 171–187.

  8. E. Gassner, J. Hatzl, S.O. Krumke, H. Sperber, and G.J. Woeginger, How hard is it to find extreme Nash equilibria in network congestion games? Proceedings of the 4th Workshop on Internet and Network Economics, Lecture notes in computer science 5385 (2008), 82–93 (extended abstract).

  9. R.E. Burkard, M. Galavii, and E. Gassner, Inverse 1-median Problems Proceedings of the Workshop on Combinatorial Optimization, Oberwolfach Report 51 (2008), 2908–2909 (extended abstract).

  10. E. Gassner, Up- and downgrading the 1-center in a network, European Journal of Operational Research 198 (2009), 370–377.

  11. E. Gassner, The Steiner Subgraph Problem Revisited, Journal of Discrete Algorithms 8 (2010), 154–163.

  12. E. Gassner, J. Hatzl, S.O. Krumke, H. Sperber, and G. J. Woeginger, How hard is it to find extreme Nash equilibria in network congestion games? Theoretical Computer Science 410, Issues 47–49 (2009), 4989–4999.

  13. E. Gassner and B. Klinz, The computational complexity of bilevel assignment problems, 4OR 7, No. 4 (2009), 379–394.

  14. E. Gassner, J. Hatzl, S.O. Krumke, and S. Saliba, Clever or Smart: Strategies for the Online Target Date Assignment Problem, Discrete Applied Mathematics 158, Issue 1 (2010), 71–79.

  15. E. Gassner, A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric, Graz University of Technology (FOSP Algorithms & mathematical modelling), Annals of Operations Research 172, No. 1 (2009), 393–404.

  16. E. Gassner and B. Klinz, A fast parametric assignment algorithm with applications in max-algebra, Networks 55, Issue 2 (2010), 61–77.

  17. R.E. Burkard, E. Gassner, and M. Galavii, The inverse Fermat-Weber problem, Graz University of Technology (FOSP Algorithms & mathematical modelling), European Journal of Operational Research 206, Issue 1 (2010), 11–17.


Articles accepted for publications

  1. E. Gassner, Up- and downgrading the 1-median in a network, to appear in Networks.

  2. E. Gassner, An inverse approach to convex ordered median problems in trees, Graz University of Technology (FOSP Algorithms & mathematical modelling) Report 2008-16 (2008), to appear in Journal of Combinatorial Optimization.

  3. E. Gassner, The partial inverse minimum cut problem with L_1-norm is strongly NP-hard, Graz University of Technology (FOSP Algorithms & mathematical modelling) Report 2009-10 (2009), to appear in RAIRO Operations Research.


Preprints

  1. M.W. Altenhöfer, E. Gassner, R. Jacob, and S.O. Krumke, Oracle-guided search in sorted matrices improving balanced flow computation, Graz University of Technology (FOSP Algorithms & mathematical modelling) Report 2008-13 (2008).

  2. F. Baroughi Bonab, R.E. Burkard, and E. Gassner Inverse p-Median Problems with Variable Edge Lengths, Graz University of Technology (FOSP Algorithms & mathematical modelling) Report 2009-13 (2009).

  3. E. Gassner Selected partial inverse combinatorial optimization problems with forbidden elements, Graz University of Technology (FOSP Algorithms & mathematical modelling) Report 2009-15 (2009).

  4. E. Gassner The computational complexity of continuous-discrete bilevel network problems, Graz University of Technology (FOSP Algorithms & mathematical modelling) Report 2009-16 (2009).