The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Kari J. Nurmela: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Kari J. Nurmela
    Upper bounds for covering arrays by tabu search. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:138, n:1-2, pp:143-152 [Journal]
  2. Kari J. Nurmela, Patric R. J. Östergård
    Covering t-sets with (t+2)-sets. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:95, n:1-3, pp:425-437 [Journal]
  3. Kari J. Nurmela, Patric R. J. Östergård
    Packing up to 50 Equal Circles in a Square. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1997, v:18, n:1, pp:111-120 [Journal]
  4. Kari J. Nurmela, Patric R. J. Östergård
    More Optimal Packings of Equal Circles in a Square. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1999, v:22, n:3, pp:439-457 [Journal]
  5. Kari J. Nurmela, Markku K. Kaikkonen, Patric R. J. Östergård
    New constant weight codes from linear permutation groups. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:5, pp:1623-1630 [Journal]
  6. Ronald L. Graham, Boris D. Lubachevsky, Kari J. Nurmela, Patric R. J. Östergård
    Dense packings of congruent circles in a circle. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:181, n:1-3, pp:139-154 [Journal]

Search in 0.003secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002