Volgen
Patric Östergård
Patric Östergård
Onbekend partnerschap
Geverifieerd e-mailadres voor aalto.fi
Titel
Geciteerd door
Geciteerd door
Jaar
A fast algorithm for the maximum clique problem
PRJ Östergård
Discrete Applied Mathematics 120 (1-3), 197-207, 2002
8272002
Classification algorithms for codes and designs
P Kaski, PRJ Östergård
Springer, 2006
3122006
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
2941998
A new algorithm for the maximum-weight clique problem
PRJ Östergård
Nordic Journal of Computing 8 (4), 424-436, 2001
2492001
Cliquer user’s guide
S Niskanen, PRJ Östergård
version 1.0. Technical report 48, 2003, 2003
1432003
Packing up to 50 equal circles in a square
KJ Nurmela, PRJ Östergård
Discrete & Computational Geometry 18, 111-120, 1997
1431997
Existence of-analogs of Steiner systems
M Braun, T Etzion, PRJ Östergård, A Vardy, A Wassermann
Forum of Mathematics, Pi 4, e7, 2016
1272016
Covering a square with up to 30 equal circles
KJ Nurmela, PRJ Östergård
1122000
The Steiner triple systems of order 19
P Kaski, P Östergård
Mathematics of Computation 73 (248), 2075-2092, 2004
1062004
Computational methods in design theory
PB Gibbons
Handbook of Combinatorial Designs, 781-808, 2006
832006
Bounds on mixed binary/ternary codes
AE Brouwer, HO Hamalainen, PRJ Ostergard, NJA Sloane
IEEE Transactions on Information Theory 44 (1), 140-161, 1998
811998
Bounds and constructions for ternary constant-composition codes
M Svanstrom, PRJ Ostergard, GT Bogdanova
IEEE Transactions on Information Theory 48 (1), 101-111, 2002
802002
The number of Latin squares of order 11
A Hulpke, P Kaski, P Östergård
Mathematics of computation 80 (274), 1197-1219, 2011
772011
Error-correcting codes over an alphabet of four elements
GT Bogdanova, AE Brouwer, SN Kapralov, PRJ Östergård
Designs, Codes and Cryptography 23, 333-342, 2001
762001
Cliquer user's guide, version 1.0
S Niskanen, P Östergård
732003
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
722009
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
601999
Computing the domination number of grid graphs.
S Alanko, S Crevals, A Isopoussu, P Östergård, V Pettersson
The Electronic Journal of Combinatorics [electronic only] 18 (1), Research …, 2011
582011
Greedy and heuristic algorithms for codes and colorings
T Etzion, PRJ Ostergard
IEEE Transactions on Information Theory 44 (1), 382-388, 1998
541998
LCL problems on grids
S Brandt, J Hirvonen, JH Korhonen, T Lempiäinen, PRJ Östergård, ...
Proceedings of the ACM Symposium on Principles of Distributed Computing, 101-110, 2017
532017
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20