Elisabeth Gassner

发表

Up- and downgrading the 1-median in a network

Elisabeth Gassner, 2008 .

The partial inverse minimum cut problem with norm is strongly NP-hard Elisabeth Gassner Project Area ( s )

Elisabeth Gassner, 2009 .

A fast parametric assignment algorithm with applications in max-algebra

Elisabeth Gassner, Bettina Klinz, 2010 .

Oracle-guided search in sorted matrices improving balanced flow compuatation

S. Krumke, R. Jacob, Elisabeth Gassner, 2008 .

The computational complexity of bilevel assignment problems

Bettina Klinz, Elisabeth Gassner, Elisabeth Gassner, 2009, 4OR.

A fast parametric assignment algorithm with applications in max‐algebra

Bettina Klinz, Elisabeth Gassner, Elisabeth Gassner, 2010, Networks.

The Steiner Forest Problem revisited

Elisabeth Gassner, Elisabeth Gassner, 2010, J. Discrete Algorithms.

A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs

Elisabeth Gassner, Johannes Hatzl, Elisabeth Gassner, 2008, Computing.

Simultaneous Geometric Graph Embeddings

Michael Jünger, Alejandro Estrella-Balderrama, Marcus Schaefer, 2007, GD.

The Steiner Subgraph Problem Revisited

Elisabeth Gassner, Elisabeth Gassner, 2008 .

A fast parametric assignment algorithm with applications in max-algebra

E. Cheng, L. Lipták, Elisabeth Gassner, 2010 .

The partial inverse minimum cut problem with L 1-norm is strongly NP-hard

Elisabeth Gassner, 2010, RAIRO Oper. Res..