|
181 |
New Algorithms, Better Bounds, and a Novel Model for Online Stochastic Matching
Brubach, Brian. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2016
|
|
|
|
182 |
On the Complexity of Matching Cut in Graphs of Fixed Diameter
Le, Hoang-Oanh. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2016
|
|
|
|
183 |
On the Power of Advice and Randomization for Online Bipartite Matching
Dürr, Christoph. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2016
|
|
|
|
184 |
Pattern Matching and Consensus Problems on Weighted Sequences and Profiles
Kociumaka, Tomasz. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2016
|
|
|
|
185 |
Planar Matching in Streams Revisited
McGregor, Andrew. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2016
|
|
|
|
186 |
Sampling-Based Bottleneck Pathfinding with Applications to Fréchet Matching
Solovey, Kiril. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2016
|
|
|
|
187 |
Stable Matching with Evolving Preferences
Kanade, Varun. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2016
|
|
|
|
188 |
Streaming Pattern Matching with d Wildcards
Golan, Shay. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2016
|
|
|
189 |
Near optimal algorithms for online weighted bipartite matching in adversary model
Enthalten in Journal of combinatorial optimization 1.12.2016: 1-17
|
|
|
|
190 |
Solving cross-matching puzzles using intelligent genetic algorithms
Enthalten in Artificial intelligence review 19.10.2016: 1-15
|
|
Administration
