|
161 |
The Use of a Pruned Modular Decomposition for Maximum Matching Algorithms on Some Graph Classes
Ducoffe, Guillaume. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018
|
|
|
162 |
Evaluating the performance of map matching algorithms for navigation systems: an empirical study
Enthalten in Spatial information research 27.9.2018: 1-12
|
|
|
|
163 |
Online Algorithms for Maximum Cardinality Matching with Edge Arrivals
Enthalten in Algorithmica 27.8.2018: 1-19
|
|
|
|
164 |
Parameterized Algorithms and Kernels for Rainbow Matching
Enthalten in Algorithmica 10.8.2018: 1-15
|
|
|
|
165 |
Map-Matching Algorithms for Robot Self-Localization: A Comparison Between Perfect Match, Iterative Closest Point and Normal Distributions Transform
Enthalten in Journal of intelligent & robotic systems 23.1.2018: 1-14
|
|
|
|
166 |
A Family of Approximation Algorithms for the Maximum Duo-Preservation String Mapping Problem
Dudek, Bartlomiej. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2017
|
|
|
|
167 |
Algorithm Engineering for All-Pairs Suffix-Prefix Matching
Lim, Jihyuk. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2017
|
|
|
|
168 |
An Encoding for Order-Preserving Matching
Gagie, Travis. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2017
|
|
|
|
169 |
Byte-Aligned Pattern Matching in Encoded Genomic Sequences
Procházka, Petr. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2017
|
|
|
|
170 |
Improved Algorithm for Dynamic b-Matching
Bhattacharya, Sayan. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2017
|
|
Administration
