Bettina Klinz

Publication Activity (10 Years)

Years Active: 1993-2024
Publications (10 Years): 5

Top Topics

Shortest Path Problem

Top Venues

Discret. Optim.

Oper. Res. Lett.

Publications

Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger
The bipartite travelling salesman problem: A pyramidally solvable case. Oper. Res. Lett. 55 (2024)
Eranda Çela, Bettina Klinz, Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf
A linear time algorithm for linearizing quadratic and higher-order shortest path problems. CoRR (2023)
Eranda Çela, Bettina Klinz, Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf
A Linear Time Algorithm for Linearizing Quadratic and Higher-Order Shortest Path Problems. IPCO (2023)
Eranda Çela, Bettina Klinz, Stefan Lendl, James B. Orlin, Gerhard J. Woeginger, Lasse Wulf
Linearizable Special Cases of the Quadratic Shortest Path Problem. WG (2021)
Ante Custic, Bettina Klinz
The constant objective value property for multidimensional assignment problems. Discret. Optim. 19 (2016)
Ante Custic, Bettina Klinz, Gerhard J. Woeginger
Geometric versions of the three-dimensional assignment problem under general norms. Discret. Optim. 18 (2015)
Vladimir G. Deineko, Bettina Klinz, Alexander Tiskin, Gerhard J. Woeginger
Four-point conditions for the TSP: The complete complexity classification. Discret. Optim. 14 (2014)
Ante Custic, Bettina Klinz, Gerhard J. Woeginger
Geometric versions of the 3-dimensional assignment problem under general norms. CoRR (2014)
Ante Custic, Bettina Klinz, Gerhard J. Woeginger
Planar 3-dimensional assignment problems with Monge-like cost arrays. CoRR (2014)
Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger
Uniqueness in quadratic and hyperbolic 0-1 programming problems. CoRR (2013)
Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger
Uniqueness in quadratic and hyperbolic 0-1 programming problems. Oper. Res. Lett. 41 (6) (2013)
Bettina Klinz, Gerhard J. Woeginger
The Northwest corner rule revisited. Discret. Appl. Math. 159 (12) (2011)
Elisabeth Gassner, Bettina Klinz
A fast parametric assignment algorithm with applications in max-algebra. Networks 55 (2) (2010)
Elisabeth Gassner, Bettina Klinz
The computational complexity of bilevel assignment problems. 4OR 7 (4) (2009)
Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger
The complexity of computing the Muirhead-Dalton distance. Math. Soc. Sci. 57 (2) (2009)
Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger
Polygons with inscribed circles and prescribed side lengths. Appl. Math. Lett. 22 (5) (2009)
Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger
Exact algorithms for the Hamiltonian cycle problem in planar graphs. Oper. Res. Lett. 34 (3) (2006)
Bettina Klinz, Ulrich Pferschy, Joachim Schauer
ILP Models for a Nurse Scheduling Problem. OR (2006)
Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger
Four point conditions and exponential neighborhoods for symmetric TSP. SODA (2006)
Eranda Çela, Bettina Klinz, Christophe Meyer
Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem. J. Comb. Optim. 12 (3) (2006)
Bettina Klinz, Gerhard J. Woeginger
Faster algorithms for computing power indices in weighted voting games. Math. Soc. Sci. 49 (1) (2005)
Bettina Klinz, Gerhard J. Woeginger
Minimum-cost dynamic flows: The series-parallel case. Networks 43 (3) (2004)
Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger
Which matrices are immune against the transportation paradox? Discret. Appl. Math. 130 (3) (2003)
Bettina Klinz
Book Reviews. Math. Methods Oper. Res. 56 (3) (2003)
Rainer E. Burkard, Bettina Klinz, Jianzhong Zhang
Bottleneck Capacity Expansion Problems with General Budget Constraints. RAIRO Oper. Res. 35 (1) (2001)
Bettina Klinz, Gerhard J. Woeginger
The Steiner Tree Problem in Kalmanson Matrices and in Circulant Matrices. J. Comb. Optim. 3 (1) (1999)
Bettina Klinz, Gerhard J. Woeginger
A note on the bottleneck graph partition problem. Networks 33 (3) (1999)
Rainer E. Burkard, Karin Feldbacher, Bettina Klinz, Gerhard J. Woeginger
Minimum-cost strong network orientation problems: Classification, complexity, and algorithms. Networks 33 (1) (1999)
Mihály Hujter, Bettina Klinz, Gerhard J. Woeginger
A note on the complexity of the transportation problem with a permutable demand vector. Math. Methods Oper. Res. 50 (1) (1999)
Bettina Klinz, Gerhard J. Woeginger
One, two, three, many, or: complexity aspects of dynamic network flows with dedicated arcs. Oper. Res. Lett. 22 (4-5) (1998)
Rainer E. Burkard, Bettina Klinz, Rüdiger Rudolf
Perspectives of Monge Properties in Optimization. Discret. Appl. Math. 70 (2) (1996)
Bettina Klinz, Gerhard J. Woeginger
One, Two, Three, Many, or: Complexity Aspects of Dynamic Network Flows with Dedicated Arcs. WG (1996)
Bettina Klinz, Gerhard J. Woeginger
A New Efficiently Solvable Special Case of the Three-Dimensional Axial Bottleneck Assignment Problem. Combinatorics and Computer Science (1995)
Bettina Klinz, Rüdiger Rudolf, Gerhard J. Woeginger
on the Recognition of Permuted Bottleneck Monge Matrices. Discret. Appl. Math. 63 (1) (1995)
Bettina Klinz, Gerhard J. Woeginger
Minimum Cost Dynamic Flows: The Series-Parallel Case. IPCO (1995)
Bettina Klinz, Rüdiger Rudolf, Gerhard J. Woeginger
Permuting Matrices to Avoid Forbidden Submatrices. Discret. Appl. Math. 60 (1-3) (1995)
Rainer E. Burkard, Karin Dlaska, Bettina Klinz
The quickest flow problem. ZOR Methods Model. Oper. Res. 37 (1) (1993)
Bettina Klinz, Rüdiger Rudolf, Gerhard J. Woeginger
On the Recognition of Permuted Bottleneck Monge Matrices. ESA (1993)
Rainer E. Burkard, Eranda Çela, Bettina Klinz
On the Biquadratic Assignment Problem. Quadratic Assignment and Related Problems (1993)