
Search the dblp DataBase
A. H. G. Rinnooy Kan:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 B. J. Lageweg, Jan Karel Lenstra, A. H. G. Rinnooy Kan
ComputerAided Complexity Classification of Combinatorial Problems. [Citation Graph (1, 0)][DBLP] Commun. ACM, 1982, v:25, n:11, pp:817822 [Journal]
 A. H. G. Rinnooy Kan
Managing a multibillion dollar IT Budget. [Citation Graph (0, 0)][DBLP] ICSM, 2003, pp:20 [Conf]
 Igal Adiri, John L. Bruno, Esther Frostig, A. H. G. Rinnooy Kan
Single Machine FlowTime Scheduling With a Single Breakdown. [Citation Graph (0, 0)][DBLP] Acta Inf., 1989, v:26, n:7, pp:679696 [Journal]
 J. T. Postmus, A. H. G. Rinnooy Kan, G. T. Timmer
An Efficient Dynamic Selection Method. [Citation Graph (0, 0)][DBLP] Commun. ACM, 1983, v:26, n:11, pp:878881 [Journal]
 A. H. G. Rinnooy Kan, Leen Stougie, Carlo Vercellis
A Class of Generalized Greedy Algorithms for the MultiKnapsack Problem. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1993, v:42, n:2, pp:279290 [Journal]
 Antoon W. J. Kolen, A. H. G. Rinnooy Kan, C. P. M. van Hoesel, Albert P. M. Wagelmans
Sensitivity Analysis of List Scheduling Heuristics. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1994, v:55, n:2, pp:145162 [Journal]
 János Csirik, J. B. G. Frenk, Gábor Galambos, A. H. G. Rinnooy Kan
Probabilistic Analysis of Algorithms for Dual Bin Packing Problems. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1991, v:12, n:2, pp:189203 [Journal]
 M. Meanti, A. H. G. Rinnooy Kan, Leen Stougie, Carlo Vercellis
A Probabilistic Analysis of the Multiknapsack Value Function. [Citation Graph (0, 0)][DBLP] Math. Program., 1990, v:46, n:, pp:237247 [Journal]
 Eugene L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan
Generating all Maximal Independent Sets: NPHardness and PolynomialTime Algorithms. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1980, v:9, n:3, pp:558565 [Journal]
Search in 0.012secs, Finished in 0.013secs
