|
61 |
Subsequences with Gap Constraints: Complexity Bounds for Matching and Analysis Problems
Day, Joel. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022
|
|
|
|
62 |
Suffix Sorting via Matching Statistics
Lipták, Zsuzsanna. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022
|
|
|
|
63 |
Tight Bounds for Online Matching in Bounded-Degree Graphs with Vertex Capacities
Albers, Susanne. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022
|
|
|
64 |
Markovian Online Matching Algorithms on Large Bipartite Random Graphs
Enthalten in Methodology and computing in applied probability 9.9.2022: 1-31
|
|
|
|
65 |
From driving trajectories to driving paths: a survey on map-matching Algorithms
Enthalten in CCF transactions on pervasive computing and interaction 23.5.2022: 1-16
|
|
|
|
66 |
A review of "Bringing Order to Approximate Matching: Classification and Attacks on Similarity Digest Algorithms"
Martín-Pérez, Miguel. - Augsburg : Universität Augsburg, 2021
|
|
|
|
67 |
An Approximation Algorithm for Maximum Stable Matching with Ties and Constraints
Yokoi, Yu. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
|
|
|
|
68 |
An Estimator for Matching Size in Low Arboricity Graphs with Two Applications
Jowhari, Hossein. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
|
|
|
|
69 |
An Improved Approximation Algorithm for the Matching Augmentation Problem
Cheriyan, Joseph. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
|
|
|
|
70 |
Bringing order to approximate matching: classification and attacks on similarity digest algorithms
Martín-Pérez, Miguel. - Augsburg : Universität Augsburg, 2021
|
|
Administration
