2009 |
19 | EE | Vladimir G. Deineko,
Bettina Klinz,
Gerhard J. Woeginger:
Polygons with inscribed circles and prescribed side lengths.
Appl. Math. Lett. 22(5): 704-706 (2009) |
18 | EE | Vladimir G. Deineko,
Bettina Klinz,
Gerhard J. Woeginger:
The complexity of computing the Muirhead-Dalton distance.
Mathematical Social Sciences 57(2): 282-284 (2009) |
2006 |
17 | EE | Bettina Klinz,
Ulrich Pferschy,
Joachim Schauer:
ILP Models for a Nurse Scheduling Problem.
OR 2006: 319-324 |
16 | EE | Vladimir G. Deineko,
Bettina Klinz,
Gerhard J. Woeginger:
Four point conditions and exponential neighborhoods for symmetric TSP.
SODA 2006: 544-553 |
15 | EE | Eranda Çela,
Bettina Klinz,
Christophe Meyer:
Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem.
J. Comb. Optim. 12(3): 187-215 (2006) |
14 | EE | Vladimir G. Deineko,
Bettina Klinz,
Gerhard J. Woeginger:
Exact algorithms for the Hamiltonian cycle problem in planar graphs.
Oper. Res. Lett. 34(3): 269-274 (2006) |
2004 |
13 | EE | Bettina Klinz,
Gerhard J. Woeginger:
Minimum-cost dynamic flows: The series-parallel case.
Networks 43(3): 153-162 (2004) |
2003 |
12 | EE | Vladimir G. Deineko,
Bettina Klinz,
Gerhard J. Woeginger:
Which matrices are immune against the transportation paradox?
Discrete Applied Mathematics 130(3): 495-501 (2003) |
1999 |
11 | | Bettina Klinz,
Gerhard J. Woeginger:
The Steiner Tree Problem in Kalmanson Matrices and in Circulant Matrices.
J. Comb. Optim. 3(1): 51-58 (1999) |
10 | EE | Rainer E. Burkard,
Karin Feldbacher,
Bettina Klinz,
Gerhard J. Woeginger:
Minimum-cost strong network orientation problems: Classification, complexity, and algorithms.
Networks 33(1): 57-70 (1999) |
9 | EE | Bettina Klinz,
Gerhard J. Woeginger:
A note on the bottleneck graph partition problem.
Networks 33(3): 189-191 (1999) |
1998 |
8 | EE | 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): 119-127 (1998) |
1996 |
7 | | Bettina Klinz,
Gerhard J. Woeginger:
One, Two, Three, Many, or: Complexity Aspects of Dynamic Network Flows with Dedicated Arcs.
WG 1996: 254-267 |
6 | EE | Rainer E. Burkard,
Bettina Klinz,
Rüdiger Rudolf:
Perspectives of Monge Properties in Optimization.
Discrete Applied Mathematics 70(2): 95-161 (1996) |
1995 |
5 | | Bettina Klinz,
Gerhard J. Woeginger:
A New Efficiently Solvable Special Case of the Three-Dimensional Axial Bottleneck Assignment Problem.
Combinatorics and Computer Science 1995: 150-162 |
4 | | Bettina Klinz,
Gerhard J. Woeginger:
Minimum Cost Dynamic Flows: The Series-Parallel Case.
IPCO 1995: 329-343 |
3 | EE | Bettina Klinz,
Rüdiger Rudolf,
Gerhard J. Woeginger:
Permuting Matrices to Avoid Forbidden Submatrices.
Discrete Applied Mathematics 60(1-3): 223-248 (1995) |
2 | EE | Bettina Klinz,
Rüdiger Rudolf,
Gerhard J. Woeginger:
on the Recognition of Permuted Bottleneck Monge Matrices.
Discrete Applied Mathematics 63(1): 43-74 (1995) |
1993 |
1 | | Bettina Klinz,
Rüdiger Rudolf,
Gerhard J. Woeginger:
On the Recognition of Permuted Bottleneck Monge Matrices.
ESA 1993: 248-259 |