Deterministic Online Optical Call Admission Revisited. - Elisabeth Gassner; Sven Oliver Krumke (WAOA, 2005)

Simultaneous Graph Embeddings with Fixed Edges. - Elisabeth Gassner; Michael Jünger; Merijam Percan; Marcus Schaefer 001; Michael Schulz 001 (WG, 2006)

A linear time algorithm for the reverse 1-median problem on a cycle. - Rainer E. Burkard; Elisabeth Gassner; Johannes Hatzl (Networks, 2006)

Simultaneous Geometric Graph Embeddings. - Alejandro Estrella-Balderrama; Elisabeth Gassner; Michael Jünger; Merijam Percan; Marcus Schaefer 001; Michael Schulz 001 (GD, 2007)

A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs. - Elisabeth Gassner; Johannes Hatzl (Computing, 2008)

Reverse 2-median problem on trees. - Rainer E. Burkard; Elisabeth Gassner; Johannes Hatzl (Discret. Appl. Math., 2008)

The inverse 1-maxian problem with edge length modification. - Elisabeth Gassner (J. Comb. Optim., 2008)

The computational complexity of bilevel assignment problems. - Elisabeth Gassner; Bettina Klinz (4OR, 2009)

A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric. - Elisabeth Gassner (Ann. Oper. Res., 2009)

Up- and downgrading the 1-center in a network. - Elisabeth Gassner (Eur. J. Oper. Res., 2009)

How hard is it to find extreme Nash equilibria in network congestion games? - Elisabeth Gassner; Johannes Hatzl; Sven Oliver Krumke; Heike Sperber; Gerhard J. Woeginger (Theor. Comput. Sci., 2009)

clever or smart: Strategies for the online target date assignment problem. - Elisabeth Gassner; Johannes Hatzl; Sven Oliver Krumke; Sleman Saliba (Discret. Appl. Math., 2010)

The inverse Fermat-Weber problem. - Rainer E. Burkard; Mohammadreza Galavii; Elisabeth Gassner (Eur. J. Oper. Res., 2010)

The Steiner Forest Problem revisited. - Elisabeth Gassner (J. Discrete Algorithms, 2010)

A fast parametric assignment algorithm with applications in max-algebra. - Elisabeth Gassner; Bettina Klinz (Networks, 2010)

The partial inverse minimum cut problem with L 1-norm is strongly NP-hard. - Elisabeth Gassner (RAIRO Oper. Res., 2010)

Inverse p-median problems with variable edge lengths. - Fahimeh Baroughi Bonab; Rainer E. Burkard; Elisabeth Gassner (Math. Methods Oper. Res., 2011)

An inverse approach to convex ordered median problems in trees. - Elisabeth Gassner (J. Comb. Optim., 2012)