Elisabeth Gassner

According to our database1, Elisabeth Gassner authored at least 18 papers between 2005 and 2012.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2012
An inverse approach to convex ordered median problems in trees.
J. Comb. Optim., 2012

2011
Inverse <i>p</i>-median problems with variable edge lengths.
Math. Methods Oper. Res., 2011

2010
The partial inverse minimum cut problem with <i>L</i> <sub>1</sub>-norm is strongly NP-hard.
RAIRO Oper. Res., 2010

A fast parametric assignment algorithm with applications in max-algebra.
Networks, 2010

The Steiner Forest Problem revisited.
J. Discrete Algorithms, 2010

The inverse Fermat-Weber problem.
Eur. J. Oper. Res., 2010

clever or smart: Strategies for the online target date assignment problem.
Discret. Appl. Math., 2010

2009
How hard is it to find extreme Nash equilibria in network congestion games?
Theor. Comput. Sci., 2009

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

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

The computational complexity of bilevel assignment problems.
4OR, 2009

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

Reverse 2-median problem on trees.
Discret. Appl. Math., 2008

A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs.
Computing, 2008

2007
Simultaneous Geometric Graph Embeddings.
Proceedings of the Graph Drawing, 15th International Symposium, 2007

2006
A linear time algorithm for the reverse 1-median problem on a cycle.
Networks, 2006

Simultaneous Graph Embeddings with Fixed Edges.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006

2005
Deterministic Online Optical Call Admission Revisited.
Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005


  Loading...