The following pages link to Elisabeth Gassner (Q421272):
Displaying 16 items.
- An inverse approach to convex ordered median problems in trees (Q421273) (← links)
- Inverse \(p\)-median problems with variable edge lengths (Q532535) (← links)
- A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs (Q938338) (← links)
- The inverse 1-maxian problem with edge length modification (Q941835) (← links)
- Reverse 2-median problem on trees (Q943832) (← links)
- Clever or smart: strategies for the online target date assignment problem (Q968114) (← links)
- The Steiner forest problem revisited (Q972355) (← links)
- The inverse Fermat-Weber problem (Q976390) (← links)
- The computational complexity of bilevel assignment problems (Q976987) (← links)
- Up- and downgrading the 1-center in a network (Q1026756) (← links)
- How hard is it to find extreme Nash equilibria in network congestion games? (Q1034618) (← links)
- A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric (Q2267315) (← links)
- A fast parametric assignment algorithm with applications in max-algebra (Q3057132) (← links)
- The partial inverse minimum cut problem with<i>L</i><sub>1</sub>-norm is strongly NP-hard (Q3057531) (← links)
- A linear time algorithm for the reverse 1‐median problem on a cycle (Q5487819) (← links)
- Approximation and Online Algorithms (Q5898473) (← links)
