A fast algorithm for the maximum clique problem PRJ Östergård Discrete Applied Mathematics 120 (1-3), 197-207, 2002 | 736 | 2002 |

Classification algorithms for codes and designs P Kaski, PRJ Östergård, RJ Patric Springer, 2006 | 277 | 2006 |

Dense packings of congruent circles in a circle RL Graham, BD Lubachevsky, KJ Nurmela, PRJ Östergård Discrete Mathematics 181 (1-3), 139-154, 1998 | 242 | 1998 |

A new algorithm for the maximum-weight clique problem PRJ Östergård Nordic Journal of Computing 8 (4), 424-436, 2001 | 218 | 2001 |

Packing up to 50 equal circles in a square KJ Nurmela, PRJ Östergård Discrete & Computational Geometry 18 (1), 111-120, 1997 | 133 | 1997 |

Cliquer user’s guide S Niskanen, PRJ Östergård Helsinki University of Technology, 2003 | 127 | 2003 |

The Steiner triple systems of order 19 P Kaski, P Östergård Mathematics of Computation 73 (248), 2075-2092, 2004 | 94 | 2004 |

Covering a square with up to 30 equal circles KJ Nurmela, PRJ Östergård | 94 | 2000 |

EXISTENCE OF -ANALOGS OF … M Braun, T Etzion, PRJ Östergård, A Vardy, A Wassermann Forum of Mathematics, Pi 4, 2016 | 92 | 2016 |

Bounds and constructions for ternary constant-composition codes M Svanstrom, PRJ Ostergard, GT Bogdanova IEEE Transactions on Information Theory 48 (1), 101-111, 2002 | 77 | 2002 |

Computational methods in design theory PB Gibbons The CRC handbook of combinatorial designs, 730-740, 1996 | 73 | 1996 |

The number of Latin squares of order 11 A Hulpke, P Kaski, P Östergård Mathematics of computation 80 (274), 1197-1219, 2011 | 69 | 2011 |

The Perfect Binary One-Error-Correcting Codes of Length: Part I—Classification PRJ Ostergard, O Pottonen IEEE transactions on information theory 55 (10), 4657-4660, 2009 | 67 | 2009 |

Error-correcting codes over an alphabet of four elements GT Bogdanova, AE Brouwer, SN Kapralov, PRJ Östergård Designs, Codes and Cryptography 23 (3), 333-342, 2001 | 66 | 2001 |

Bounds on mixed binary/ternary codes AE Brouwer, HO Hamalainen, PRJ Ostergard, NJA Sloane IEEE Transactions on information theory 44 (1), 140-161, 1998 | 64 | 1998 |

Cliquer User's Guide: Version 1.0 S Niskanen, PRJ Östergård Helsinki University of Technology, 2003 | 59 | 2003 |

Optimal binary one-error-correcting codes of length 10 have 72 codewords PRJ Ostergard, T Baicheva, E Kolev IEEE Transactions on Information Theory 45 (4), 1229-1231, 1999 | 55 | 1999 |

Steiner triple systems of order 19 and 21 with subsystems of order 7 P Kaski, PRJ Östergård, S Topalova, R Zlatarski Discrete Mathematics 308 (13), 2732-2741, 2008 | 49 | 2008 |

Classifying subspaces of Hamming spaces PRJ Östergård Designs, Codes and Cryptography 27 (3), 297-305, 2002 | 46 | 2002 |

Greedy and heuristic algorithms for codes and colorings T Etzion, PRJ Ostergard IEEE Transactions on Information Theory 44 (1), 382-388, 1998 | 46 | 1998 |