|
51 |
Simon’s Congruence Pattern Matching
Kim, Sungmin. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022
|
|
|
|
52 |
Simple Order-Isomorphic Matching Index with Expected Compact Space
Kim, Sung-Hwan. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022
|
|
|
|
53 |
Subsequences with Gap Constraints: Complexity Bounds for Matching and Analysis Problems
Day, Joel. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022
|
|
|
|
54 |
Suffix Sorting via Matching Statistics
Lipták, Zsuzsanna. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022
|
|
|
|
55 |
Tight Bounds for Online Matching in Bounded-Degree Graphs with Vertex Capacities
Albers, Susanne. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022
|
|
|
56 |
Markovian Online Matching Algorithms on Large Bipartite Random Graphs
Enthalten in Methodology and computing in applied probability 9.9.2022: 1-31
|
|
|
|
57 |
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
|
|
|
|
58 |
An Approximation Algorithm for Maximum Stable Matching with Ties and Constraints
Yokoi, Yu. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
|
|
|
|
59 |
An Estimator for Matching Size in Low Arboricity Graphs with Two Applications
Jowhari, Hossein. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
|
|
|
|
60 |
An Improved Approximation Algorithm for the Matching Augmentation Problem
Cheriyan, Joseph. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
|
|
Administration
