|
171 |
Near optimal algorithms for online weighted bipartite matching in adversary model
Enthalten in Journal of combinatorial optimization 1.12.2016: 1-17
|
|
|
|
172 |
Solving cross-matching puzzles using intelligent genetic algorithms
Enthalten in Artificial intelligence review 19.10.2016: 1-15
|
|
|
173 |
Improved Bounds in Stochastic Matching and Optimization
Baveja, Alok. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2015
|
|
|
|
174 |
Pattern Matching with Variables: Fast Algorithms and New Hardness Results
Fernau, Henning. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2015
|
|
|
|
175 |
Automated evaluation of approximate matching algorithms on real data
Breitinger, Frank. - Augsburg : Universität Augsburg, 2014
|
|
|
|
176 |
Evaluating detection error trade-offs for bytewise approximate matching algorithms
Breitinger, Frank. - Augsburg : Universität Augsburg, 2014
|
|
|
|
177 |
Hardness of Submodular Cost Allocation: Lattice Matching and a Simplex Coloring Conjecture
Ene, Alina. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2014
|
|
|
|
178 |
Improved Streaming Algorithms for Weighted Matching, via Unweighted Matching
Crouch, Michael. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2014
|
|
|
|
179 |
Faster Deterministic Algorithms for r-Dimensional Matching Using Representative Sets
Goyal, Prachi. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2013
|
|
|
|
180 |
Developments in matching and scaling algorithms
Enthalten in Proceedings in applied mathematics and mechanics Bd. 7, 2008, Nr. 1: 1010801-1010802. 2 S.
|
|
Administration
