|
141 |
On the Decision Tree Complexity of String Matching
He, Xiaoyu. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018
|
|
|
|
142 |
Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm
Ficker, Annette M. C.. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018
|
|
|
|
143 |
Planar Maximum Matching: Towards a Parallel Algorithm
Datta, Samir. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018
|
|
|
|
144 |
Sherali-Adams Integrality Gaps Matching the Log-Density Threshold
Chlamtác, Eden. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018
|
|
|
|
145 |
Stable-Matching Voronoi Diagrams: Combinatorial Complexity and Algorithms
Barequet, Gill. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018
|
|
|
|
146 |
The b-Matching Problem in Distance-Hereditary Graphs and Beyond
Ducoffe, Guillaume. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018
|
|
|
|
147 |
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
|
|
|
148 |
Evaluating the performance of map matching algorithms for navigation systems: an empirical study
Enthalten in Spatial information research 27.9.2018: 1-12
|
|
|
|
149 |
Online Algorithms for Maximum Cardinality Matching with Edge Arrivals
Enthalten in Algorithmica 27.8.2018: 1-19
|
|
|
|
150 |
Parameterized Algorithms and Kernels for Rainbow Matching
Enthalten in Algorithmica 10.8.2018: 1-15
|
|
Administration
