|
71 |
Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time
Chen, Jianer. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
|
|
|
|
72 |
Streaming Pattern Matching (Invited Talk)
Starikovskaya, Tatiana. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
|
|
|
73 |
Implementing Weighted b-Matching Algorithms: Towards a Flexible Software Design
Enthalten in Preprint Reihe Mathematik 1998, 591
|
|
|
|
74 |
Algebraic Algorithms for Finding Patterns in Graphs (Invited Talk)
Husfeldt, Thore. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2020
|
|
|
|
75 |
Dynamic Matching Algorithms in Practice
Henzinger, Monika. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2020
|
|
|
|
76 |
Engineering Fast Almost Optimal Algorithms for Bipartite Graph Matching
Panagiotas, Ioannis. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2020
|
|
|
|
77 |
Fast and Linear-Time String Matching Algorithms Based on the Distances of q-Gram Occurrences
Kobayashi, Satoshi. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2020
|
|
|
|
78 |
Fine-Grained Complexity of Regular Expression Pattern Matching and Membership
Schepper, Philipp. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2020
|
|
|
|
79 |
Genomic Problems Involving Copy Number Profiles: Complexity and Algorithms
Lafond, Manuel. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2020
|
|
|
|
80 |
Geometric Pattern Matching Reduces to k-SUM
Aronov, Boris. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2020
|
|
Administration
