|
161 |
Online Algorithms for Maximum Cardinality Matching with Edge Arrivals
Buchbinder, Niv. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2017
|
|
|
|
162 |
Parameterized Algorithms and Kernels for Rainbow Matching
Gupta, Sushmita. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2017
|
|
|
|
163 |
Structural Pattern Matching - Succinctly
Ganguly, Arnab. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2017
|
|
|
|
164 |
Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints
Kesselheim, Thomas. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2017
|
|
|
|
165 |
Symmetric Interdiction for Matching Problems
Haney, Samuel. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2017
|
|
|
|
166 |
The Sparse Awakens: Streaming Algorithms for Matching Size Estimation in Sparse Graphs
Cormode, Graham. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2017
|
|
|
167 |
A study and analysis on block matching algorithms for motion estimation in video coding
Enthalten in Cluster computing 9.12.2017: 1-8
|
|
|
|
168 |
A novel time series behavior matching algorithm for online conversion algorithms
Enthalten in Cluster computing 8.12.2017: 1-8
|
|
|
|
169 |
New algorithms for fixed-length approximate string matching and approximate circular string matching under the Hamming distance
Enthalten in The journal of supercomputing 20.11.2017: 1-20
|
|
|
|
170 |
Partial-Matching RMS Distance Under Translation: Combinatorics and Algorithms
Enthalten in Algorithmica 6.6.2017: 1-22
|
|
Administration
