|
111 |
Simplified and Space-Optimal Semi-Streaming (2+epsilon)-Approximate Matching Ghaffari, Mohsen. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2019
|
|
|
112 |
String Matching: Communication, Circuits, and Learning Golovnev, Alexander. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2019
|
|
|
113 |
Towards a Unified Theory of Sparsification for Matching Problems Assadi, Sepehr. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2019
|
|
|
114 |
When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time Assadi, Sepehr. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2019
|
|
|
115 |
A comparison of machine learning algorithms and covariate balance measures for propensity score matching and weighting Enthalten in Biometrical journal Bd. 61, 2019, Nr. 4: 1049-1072. 24 S.
|
|
|
116 |
Subquadratic Algorithms for Succinct Stable Matching Enthalten in Algorithmica 27.3.2019: 1-34
|
|
|
117 |
On Conceptually Simple Algorithms for Variants of Online Bipartite Matching Enthalten in Theory of computing systems 23.3.2019: 1-38
|
|
|
118 |
Maximum Induced Matching Algorithms via Vertex Ordering Characterizations Enthalten in Algorithmica 19.1.2019: 1-19
|
|
|
119 |
An Algorithm for the Maximum Weight Strongly Stable Matching Problem Kunysz, Adam. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018
|
|
|
120 |
Approximate Minimum-Weight Matching with Outliers Under Translation Agarwal, Pankaj K.. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018
|
|