|
101 |
Online Minimum Cost Matching with Recourse on the Line
Megow, Nicole. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2020
|
|
|
|
102 |
Parameterized Algorithms for Matrix Completion with Radius Constraints
Koana, Tomohiro. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2020
|
|
|
|
103 |
Permutation Strikes Back: The Power of Recourse in Online Metric Matching
Gupta, Varun. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2020
|
|
|
|
104 |
The Complexity of the Approximate Multiple Pattern Matching Problem for Random Strings
Bassino, Frédérique. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2020
|
|
|
105 |
An ensemble of fingerprint matching algorithms based on cylinder codes and mtriplets for latent fingerprint identification
Enthalten in Pattern analysis and applications 6.10.2020: 1-12
|
|
|
|
106 |
Local Search Algorithms for the Maximum Carpool Matching Problem
Enthalten in Algorithmica 20.5.2020: 1-18
|
|
|
|
107 |
Online Stochastic Matching: New Algorithms and Bounds
Enthalten in Algorithmica 27.4.2020: 1-47
|
|
|
|
108 |
A comparison of matching algorithms for kidney exchange programs addressing waiting time
Enthalten in Central European journal of operations research 23.3.2020: 1-14
|
|
|
|
109 |
VLSI Architecture of Block Matching Algorithms for Motion Estimation in High Efficiency Video Coding
Enthalten in Wireless personal communications 22.1.2020: 1-16
|
|
|
|
110 |
Approximate String Matching
Pockrandt, Christopher Maximilian. - Berlin : Freie Universität Berlin, 2019
|
|
Administration
