|
111 |
Subquadratic Algorithms for Succinct Stable Matching
Enthalten in Algorithmica 27.3.2019: 1-34
|
|
|
|
112 |
On Conceptually Simple Algorithms for Variants of Online Bipartite Matching
Enthalten in Theory of computing systems 23.3.2019: 1-38
|
|
|
|
113 |
Maximum Induced Matching Algorithms via Vertex Ordering Characterizations
Enthalten in Algorithmica 19.1.2019: 1-19
|
|
|
114 |
An Algorithm for the Maximum Weight Strongly Stable Matching Problem
Kunysz, Adam. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018
|
|
|
|
115 |
Approximate Minimum-Weight Matching with Outliers Under Translation
Agarwal, Pankaj K.. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018
|
|
|
|
116 |
Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments
Korenwein, Viatcheslav. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018
|
|
|
|
117 |
Deterministic Algorithms for Maximum Matching on General Graphs in the Semi-Streaming Model
Tirodkar, Sumedh. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018
|
|
|
|
118 |
Dictionary Matching in Elastic-Degenerate Texts with Applications in Searching VCF Files On-line
Pissis, Solon P.. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018
|
|
|
|
119 |
Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms
Arar, Moab. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018
|
|
|
|
120 |
Fast matching statistics in small space
Belazzougui, Djamal. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018
|
|
Administration
