Bettina Klinz

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