|
221 |
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
|
|
|
|
222 |
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
|
|
|
223 |
Fast Longest Prefix Matching
Waldvogel, Marcel. - Aachen : Shaker, 2000
|
|
|
|
224 |
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
|
|
|
|
225 |
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
|
|
|
|
226 |
Speeding up two string-matching algorithms
Enthalten in Algorithmica Bd. 12, Nr. 4-5, date:11.1994: 247-267
|
|
|
|
227 |
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
|
|
|
|
228 |
On the existence of fair matching algorithms
Enthalten in Theory and decision Bd. 26, Nr. 3, date:5.1989: 305-322
|
|
|
|
229 |
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
|
|
|
|
230 |
Programming in Networks and Graphs
Derigs, Ulrich. - New York, NY : Springer New York, 1988
|
|
Administration
