The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Bettina Klinz: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Bettina Klinz, Gerhard J. Woeginger
    A New Efficiently Solvable Special Case of the Three-Dimensional Axial Bottleneck Assignment Problem. [Citation Graph (0, 0)][DBLP]
    Combinatorics and Computer Science, 1995, pp:150-162 [Conf]
  2. Bettina Klinz, Rüdiger Rudolf, Gerhard J. Woeginger
    On the Recognition of Permuted Bottleneck Monge Matrices. [Citation Graph (0, 0)][DBLP]
    ESA, 1993, pp:248-259 [Conf]
  3. Bettina Klinz, Gerhard J. Woeginger
    Minimum Cost Dynamic Flows: The Series-Parallel Case. [Citation Graph (0, 0)][DBLP]
    IPCO, 1995, pp:329-343 [Conf]
  4. Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger
    Four point conditions and exponential neighborhoods for symmetric TSP. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:544-553 [Conf]
  5. Bettina Klinz, Gerhard J. Woeginger
    One, Two, Three, Many, or: Complexity Aspects of Dynamic Network Flows with Dedicated Arcs. [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:254-267 [Conf]
  6. Rainer E. Burkard, Bettina Klinz, Rüdiger Rudolf
    Perspectives of Monge Properties in Optimization. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:70, n:2, pp:95-161 [Journal]
  7. Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger
    Which matrices are immune against the transportation paradox? [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:130, n:3, pp:495-501 [Journal]
  8. Bettina Klinz, Rüdiger Rudolf, Gerhard J. Woeginger
    Permuting Matrices to Avoid Forbidden Submatrices. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:60, n:1-3, pp:223-248 [Journal]
  9. Bettina Klinz, Rüdiger Rudolf, Gerhard J. Woeginger
    on the Recognition of Permuted Bottleneck Monge Matrices. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:63, n:1, pp:43-74 [Journal]
  10. Bettina Klinz, Gerhard J. Woeginger
    The Steiner Tree Problem in Kalmanson Matrices and in Circulant Matrices. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1999, v:3, n:1, pp:51-58 [Journal]
  11. Eranda Çela, Bettina Klinz, Christophe Meyer
    Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2006, v:12, n:3, pp:187-215 [Journal]
  12. Rainer E. Burkard, Karin Feldbacher, Bettina Klinz, Gerhard J. Woeginger
    Minimum-cost strong network orientation problems: Classification, complexity, and algorithms. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:33, n:1, pp:57-70 [Journal]
  13. Bettina Klinz, Gerhard J. Woeginger
    Minimum-cost dynamic flows: The series-parallel case. [Citation Graph (0, 0)][DBLP]
    Networks, 2004, v:43, n:3, pp:153-162 [Journal]
  14. Bettina Klinz, Gerhard J. Woeginger
    A note on the bottleneck graph partition problem. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:33, n:3, pp:189-191 [Journal]
  15. Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger
    Exact algorithms for the Hamiltonian cycle problem in planar graphs. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2006, v:34, n:3, pp:269-274 [Journal]
  16. Bettina Klinz, Gerhard J. Woeginger
    One, two, three, many, or: complexity aspects of dynamic network flows with dedicated arcs. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1998, v:22, n:4-5, pp:119-127 [Journal]

  17. ILP Models for a Nurse Scheduling Problem. [Citation Graph (, )][DBLP]


  18. The computational complexity of bilevel assignment problems. [Citation Graph (, )][DBLP]


  19. Polygons with inscribed circles and prescribed side lengths. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002