On the Biquadratic Assignment Problem. - Rainer E. Burkard; Eranda Çela; Bettina Klinz (Quadratic Assignment and Related Problems, 1993)

The quickest flow problem. - Rainer E. Burkard; Karin Dlaska; Bettina Klinz (ZOR Methods Model. Oper. Res., 1993)

A New Efficiently Solvable Special Case of the Three-Dimensional Axial Bottleneck Assignment Problem. - Bettina Klinz; Gerhard J. Woeginger (Combinatorics and Computer Science, 1995)

Permuting Matrices to Avoid Forbidden Submatrices. - Bettina Klinz; Rüdiger Rudolf; Gerhard J. Woeginger (Discret. Appl. Math., 1995)

on the Recognition of Permuted Bottleneck Monge Matrices. - Bettina Klinz; Rüdiger Rudolf; Gerhard J. Woeginger (Discret. Appl. Math., 1995)

Perspectives of Monge Properties in Optimization. - Rainer E. Burkard; Bettina Klinz; Rüdiger Rudolf (Discret. Appl. Math., 1996)

One, two, three, many, or: complexity aspects of dynamic network flows with dedicated arcs. - Bettina Klinz; Gerhard J. Woeginger (Oper. Res. Lett., 1998)

The Steiner Tree Problem in Kalmanson Matrices and in Circulant Matrices. - Bettina Klinz; Gerhard J. Woeginger (J. Comb. Optim., 1999)

A note on the complexity of the transportation problem with a permutable demand vector. - Mihály Hujter; Bettina Klinz; Gerhard J. Woeginger (Math. Methods Oper. Res., 1999)

Minimum-cost strong network orientation problems: Classification, complexity, and algorithms. - Rainer E. Burkard; Karin Feldbacher; Bettina Klinz; Gerhard J. Woeginger (Networks, 1999)

A note on the bottleneck graph partition problem. - Bettina Klinz; Gerhard J. Woeginger (Networks, 1999)

Bottleneck Capacity Expansion Problems with General Budget Constraints. - Rainer E. Burkard; Bettina Klinz; Jianzhong Zhang 001 (RAIRO Oper. Res., 2001)

Which matrices are immune against the transportation paradox? - Vladimir G. Deineko; Bettina Klinz; Gerhard J. Woeginger (Discret. Appl. Math., 2003)

Book Reviews. - Bettina Klinz (Math. Methods Oper. Res., 2003)

Minimum-cost dynamic flows: The series-parallel case. - Bettina Klinz; Gerhard J. Woeginger (Networks, 2004)

Faster algorithms for computing power indices in weighted voting games. - Bettina Klinz; Gerhard J. Woeginger (Math. Soc. Sci., 2005)

ILP Models for a Nurse Scheduling Problem. - Bettina Klinz; Ulrich Pferschy; Joachim Schauer (OR, 2006)

Four point conditions and exponential neighborhoods for symmetric TSP. - Vladimir G. Deineko; Bettina Klinz; Gerhard J. Woeginger (SODA, 2006)

Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem. - Eranda Çela; Bettina Klinz; Christophe Meyer (J. Comb. Optim., 2006)

Exact algorithms for the Hamiltonian cycle problem in planar graphs. - Vladimir G. Deineko; Bettina Klinz; Gerhard J. Woeginger (Oper. Res. Lett., 2006)

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

Polygons with inscribed circles and prescribed side lengths. - Vladimir G. Deineko; Bettina Klinz; Gerhard J. Woeginger (Appl. Math. Lett., 2009)

The complexity of computing the Muirhead-Dalton distance. - Vladimir G. Deineko; Bettina Klinz; Gerhard J. Woeginger (Math. Soc. Sci., 2009)

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

The Northwest corner rule revisited. - Bettina Klinz; Gerhard J. Woeginger (Discret. Appl. Math., 2011)

Uniqueness in quadratic and hyperbolic 0-1 programming problems. - Vladimir G. Deineko; Bettina Klinz; Gerhard J. Woeginger (Oper. Res. Lett., 2013)

Planar 3-dimensional assignment problems with Monge-like cost arrays. - Ante Custic; Bettina Klinz; Gerhard J. Woeginger (CoRR, 2014)

Geometric versions of the 3-dimensional assignment problem under general norms. - Ante Custic; Bettina Klinz; Gerhard J. Woeginger (CoRR, 2014)

Four-point conditions for the TSP: The complete complexity classification. - Vladimir G. Deineko; Bettina Klinz; Alexander Tiskin; Gerhard J. Woeginger (Discret. Optim., 2014)

Geometric versions of the three-dimensional assignment problem under general norms. - Ante Custic; Bettina Klinz; Gerhard J. Woeginger (Discret. Optim., 2015)

The constant objective value property for multidimensional assignment problems. - Ante Custic; Bettina Klinz (Discret. Optim., 2016)

Linearizable Special Cases of the Quadratic Shortest Path Problem. - Eranda Çela; Bettina Klinz; Stefan Lendl; James B. Orlin; Gerhard J. Woeginger; Lasse Wulf (WG, 2021)

The bipartite travelling salesman problem: A pyramidally solvable case. - Vladimir G. Deineko; Bettina Klinz; Gerhard J. Woeginger (Oper. Res. Lett., 2024)

A linear time algorithm for linearizing quadratic and higher-order shortest path problems. - Eranda Çela; Bettina Klinz; Stefan Lendl; Gerhard J. Woeginger; Lasse Wulf (Math. Program., 2025)

On the geometric k-colored crossing number of Kn. - Benedikt Hahn; Bettina Klinz; Birgit Vogtenhuber (CoRR, 2025)