|
131 |
Towards a Unified Theory of Sparsification for Matching Problems
Assadi, Sepehr. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2019
|
|
|
|
132 |
When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time
Assadi, Sepehr. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2019
|
|
|
133 |
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.
|
|
|
|
134 |
Subquadratic Algorithms for Succinct Stable Matching
Enthalten in Algorithmica 27.3.2019: 1-34
|
|
|
|
135 |
On Conceptually Simple Algorithms for Variants of Online Bipartite Matching
Enthalten in Theory of computing systems 23.3.2019: 1-38
|
|
|
|
136 |
Maximum Induced Matching Algorithms via Vertex Ordering Characterizations
Enthalten in Algorithmica 19.1.2019: 1-19
|
|
|
|
137 |
An Algorithm for the Maximum Weight Strongly Stable Matching Problem
Kunysz, Adam. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018
|
|
|
|
138 |
Analysis of Algorithms for Graph Pattern Matching Problems
Shaw, Dilip Kumar. - Saarbrücken : LAP LAMBERT Academic Publishing, 2018, 1. Auflage
|
|
|
|
139 |
Approximate Minimum-Weight Matching with Outliers Under Translation
Agarwal, Pankaj K.. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018
|
|
|
|
140 |
Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments
Korenwein, Viatcheslav. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018
|
|
Administration
