|
81 |
Secretary Matching Meets Probing with Commitment
Borodin, Allan. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
|
|
|
|
82 |
Semi-Streaming Algorithms for Submodular Function Maximization Under b-Matching Constraint
Huang, Chien-Chung. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
|
|
|
|
83 |
Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time
Chen, Jianer. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
|
|
|
|
84 |
Streaming Pattern Matching (Invited Talk)
Starikovskaya, Tatiana. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
|
|
|
85 |
A non-sequential refinement approach to improve word embeddings using GPU-based string matching algorithms
Enthalten in Cluster computing 9.6.2021: 1-12
|
|
|
|
86 |
Implementing Weighted b-Matching Algorithms: Towards a Flexible Software Design
Enthalten in Preprint Reihe Mathematik 1998, 591
|
|
|
|
87 |
Algebraic Algorithms for Finding Patterns in Graphs (Invited Talk)
Husfeldt, Thore. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2020
|
|
|
|
88 |
Algorithms for Distribution Matching
Schulte, Patrick. - München : Universitätsbibliothek der TU München, 2020
|
|
|
89 |
Applied matching algorithms
Reischmann, Tobias. - Münster, 2020
|
|
|
|
90 |
Dynamic Matching Algorithms in Practice
Henzinger, Monika. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2020
|
|
Administration
