|
191 |
A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms
Enthalten in Algorithmica Bd. 36, Nr. 1, date:5.2003: 75-88
|
|
|
|
192 |
Maximum common subgraph isomorphism algorithms for the matching of chemical structures
Enthalten in Journal of computer aided molecular design Bd. 16, Nr. 7, date:7.2002: 521-533
|
|
|
|
193 |
Parallel Algorithms for Maximum Matching in Complements of Interval Graphs and Related Problems
Enthalten in Algorithmica Bd. 26, Nr. 2, date:2.2000: 263-289
|
|
|
|
194 |
Test driving three 1995 genetic algorithms: New test functions and geometric matching
Enthalten in Journal of heuristics Bd. 1, Nr. 1, date:9.1995: 77-104
|
|
|
|
195 |
Speeding up two string-matching algorithms
Enthalten in Algorithmica Bd. 12, Nr. 4-5, date:11.1994: 247-267
|
|
|
|
196 |
An investigation of phase-distribution moment-matching algorithms for use in queueing models
Enthalten in Queueing systems Bd. 8, Nr. 1, date:12.1991: 129-147
|
|
|
|
197 |
On the existence of fair matching algorithms
Enthalten in Theory and decision Bd. 26, Nr. 3, date:5.1989: 305-322
|
|
|
|
198 |
Tight bounds for minimax grid matching with applications to the average case analysis of algorithms
Enthalten in Combinatorica Bd. 9, Nr. 2, date:6.1989: 161-187
|
|
|
|
199 |
A probabilistic analysis of some greedy cardinality matching algorithms
Enthalten in Annals of operations research Bd. 1, Nr. 3, date:10.1984: 239-254
|
|
|
|
200 |
ADaM: augmenting existing approximate fast matching algorithms with efficient and exact range queries
Enthalten in BMC bioinformatics Bd. 15, 28.5.2014, Nr. 7, date:5.2014: 1-11
|
|
Administration
