Karin Oberlechner

According to our database, Karin Oberlechner authored at least 2 papers between 2009 and 2011.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2011

A Branch-and-Cut-and-Price Algorithm for a Fingerprint-Template Compression Application.

Andreas M. Chwatal, Corinna Thöni, Karin Oberlechner, Günther R. Raidl

Proceedings of the Federated Conference on Computer Science and Information Systems, 2011

2009

Solving a <i>k</i>-Node Minimum Label Spanning Arborescence Problem to Compress Fingerprint Templates.

Andreas M. Chwatal, Günther R. Raidl, Karin Oberlechner

J. Math. Model. Algorithms, 2009