default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBettina Klinz
Person information
- affiliation: TU Graz, Austria
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j26]Vladimir G. Deineko, Bettina Klinz
, Gerhard J. Woeginger:
The bipartite travelling salesman problem: A pyramidally solvable case. Oper. Res. Lett. 55: 107130 (2024)- 2023
- [c9]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: 466-479 - [i4]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 abs/2303.00569 (2023) - 2021
- [c8]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: 245-256
2010 – 2019
- 2016
- [j25]Ante Custic, Bettina Klinz:
The constant objective value property for multidimensional assignment problems. Discret. Optim. 19: 23-35 (2016) - 2015
- [j24]Ante Custic, Bettina Klinz, Gerhard J. Woeginger:
Geometric versions of the three-dimensional assignment problem under general norms. Discret. Optim. 18: 38-55 (2015) - 2014
- [j23]Vladimir G. Deineko, Bettina Klinz, Alexander Tiskin, Gerhard J. Woeginger:
Four-point conditions for the TSP: The complete complexity classification. Discret. Optim. 14: 147-159 (2014) - [i3]Ante Custic, Bettina Klinz, Gerhard J. Woeginger:
Planar 3-dimensional assignment problems with Monge-like cost arrays. CoRR abs/1405.5210 (2014) - [i2]Ante Custic, Bettina Klinz, Gerhard J. Woeginger:
Geometric versions of the 3-dimensional assignment problem under general norms. CoRR abs/1409.0845 (2014) - 2013
- [j22]Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger:
Uniqueness in quadratic and hyperbolic 0-1 programming problems. Oper. Res. Lett. 41(6): 633-635 (2013) - [i1]Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger:
Uniqueness in quadratic and hyperbolic 0-1 programming problems. CoRR abs/1312.0903 (2013) - 2011
- [j21]Bettina Klinz, Gerhard J. Woeginger:
The Northwest corner rule revisited. Discret. Appl. Math. 159(12): 1284-1289 (2011) - 2010
- [j20]Elisabeth Gassner, Bettina Klinz:
A fast parametric assignment algorithm with applications in max-algebra. Networks 55(2): 61-77 (2010)
2000 – 2009
- 2009
- [j19]Elisabeth Gassner, Bettina Klinz:
The computational complexity of bilevel assignment problems. 4OR 7(4): 379-394 (2009) - [j18]Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger:
Polygons with inscribed circles and prescribed side lengths. Appl. Math. Lett. 22(5): 704-706 (2009) - [j17]Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger:
The complexity of computing the Muirhead-Dalton distance. Math. Soc. Sci. 57(2): 282-284 (2009) - 2006
- [j16]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) - [j15]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) - [c7]Bettina Klinz, Ulrich Pferschy, Joachim Schauer:
ILP Models for a Nurse Scheduling Problem. OR 2006: 319-324 - [c6]Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger:
Four point conditions and exponential neighborhoods for symmetric TSP. SODA 2006: 544-553 - 2005
- [j14]Bettina Klinz, Gerhard J. Woeginger:
Faster algorithms for computing power indices in weighted voting games. Math. Soc. Sci. 49(1): 111-116 (2005) - 2004
- [j13]Bettina Klinz, Gerhard J. Woeginger:
Minimum-cost dynamic flows: The series-parallel case. Networks 43(3): 153-162 (2004) - 2003
- [j12]Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger:
Which matrices are immune against the transportation paradox? Discret. Appl. Math. 130(3): 495-501 (2003) - [j11]Bettina Klinz:
Book Reviews. Math. Methods Oper. Res. 56(3): 539-540 (2003) - 2001
- [j10]Rainer E. Burkard, Bettina Klinz, Jianzhong Zhang:
Bottleneck Capacity Expansion Problems with General Budget Constraints. RAIRO Oper. Res. 35(1): 1-20 (2001)
1990 – 1999
- 1999
- [j9]Bettina Klinz, Gerhard J. Woeginger:
The Steiner Tree Problem in Kalmanson Matrices and in Circulant Matrices. J. Comb. Optim. 3(1): 51-58 (1999) - [j8]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): 9-16 (1999) - [j7]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) - [j6]Bettina Klinz, Gerhard J. Woeginger:
A note on the bottleneck graph partition problem. Networks 33(3): 189-191 (1999) - 1998
- [j5]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
- [j4]Rainer E. Burkard, Bettina Klinz, Rüdiger Rudolf:
Perspectives of Monge Properties in Optimization. Discret. Appl. Math. 70(2): 95-161 (1996) - [c5]Bettina Klinz, Gerhard J. Woeginger:
One, Two, Three, Many, or: Complexity Aspects of Dynamic Network Flows with Dedicated Arcs. WG 1996: 254-267 - 1995
- [j3]Bettina Klinz, Rüdiger Rudolf, Gerhard J. Woeginger:
Permuting Matrices to Avoid Forbidden Submatrices. Discret. Appl. Math. 60(1-3): 223-248 (1995) - [j2]Bettina Klinz, Rüdiger Rudolf, Gerhard J. Woeginger:
on the Recognition of Permuted Bottleneck Monge Matrices. Discret. Appl. Math. 63(1): 43-74 (1995) - [c4]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 - [c3]Bettina Klinz, Gerhard J. Woeginger:
Minimum Cost Dynamic Flows: The Series-Parallel Case. IPCO 1995: 329-343 - 1993
- [j1]Rainer E. Burkard, Karin Dlaska, Bettina Klinz:
The quickest flow problem. ZOR Methods Model. Oper. Res. 37(1): 31-58 (1993) - [c2]Rainer E. Burkard, Eranda Çela, Bettina Klinz:
On the Biquadratic Assignment Problem. Quadratic Assignment and Related Problems 1993: 117-146 - [c1]Bettina Klinz, Rüdiger Rudolf, Gerhard J. Woeginger:
On the Recognition of Permuted Bottleneck Monge Matrices. ESA 1993: 248-259
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
