Search the dblp DataBase

Publications of Author

1. B. J. Lageweg, Jan Karel Lenstra, A. H. G. Rinnooy Kan
   Computer-Aided Complexity Classification of Combinatorial Problems. [Citation Graph (1, 0)][DBLP]
   Commun. ACM, 1982, v:25, n:11, pp:817-822 [Journal]
   
2. A. H. G. Rinnooy Kan
   Managing a multi-billion dollar IT Budget. [Citation Graph (0, 0)][DBLP]
   ICSM, 2003, pp:2-0 [Conf]
   
3. Igal Adiri, John L. Bruno, Esther Frostig, A. H. G. Rinnooy Kan
   Single Machine Flow-Time Scheduling With a Single Breakdown. [Citation Graph (0, 0)][DBLP]
   Acta Inf., 1989, v:26, n:7, pp:679-696 [Journal]
   
4. 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:878-881 [Journal]
   
5. A. H. G. Rinnooy Kan, Leen Stougie, Carlo Vercellis
   A Class of Generalized Greedy Algorithms for the Multi-Knapsack Problem. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1993, v:42, n:2, pp:279-290 [Journal]
   
6. 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:145-162 [Journal]
   
7. 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:189-203 [Journal]
   
8. 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:237-247 [Journal]
   
9. Eugene L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan
   Generating all Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1980, v:9, n:3, pp:558-565 [Journal]