|
131 |
Sherali-Adams Integrality Gaps Matching the Log-Density Threshold
Chlamtác, Eden. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018
|
|
|
|
132 |
Stable-Matching Voronoi Diagrams: Combinatorial Complexity and Algorithms
Barequet, Gill. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018
|
|
|
|
133 |
The b-Matching Problem in Distance-Hereditary Graphs and Beyond
Ducoffe, Guillaume. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018
|
|
|
|
134 |
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
|
|
|
135 |
Evaluating the performance of map matching algorithms for navigation systems: an empirical study
Enthalten in Spatial information research 27.9.2018: 1-12
|
|
|
|
136 |
Online Algorithms for Maximum Cardinality Matching with Edge Arrivals
Enthalten in Algorithmica 27.8.2018: 1-19
|
|
|
|
137 |
Parameterized Algorithms and Kernels for Rainbow Matching
Enthalten in Algorithmica 10.8.2018: 1-15
|
|
|
|
138 |
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
|
|
|
|
139 |
A Family of Approximation Algorithms for the Maximum Duo-Preservation String Mapping Problem
Dudek, Bartlomiej. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2017
|
|
|
|
140 |
Algorithm Engineering for All-Pairs Suffix-Prefix Matching
Lim, Jihyuk. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2017
|
|
Administration
