2008 |
25 | Petteri Kaski, Patric R. J. Östergård, Svetlana Topalova, and Rosen Zlatarski. Steiner triple systems of order 19 and 21 with subsystems of order 7. Discrete Mathematics, 308(13):2732–2741, 2008. |
|
2006 |
24 | Malcolm Greig, Harri Haanpää, and Petteri Kaski. On the coexistence of conference matrices and near resolvable 2-(2k+1, k, k-1) designs. Journal of Combinatorial Theory, Series A, 113(4):703–711, 2006. |
|
23 | Petteri Kaski and Patric R. J. Östergård. Classification Algorithms for Codes and Designs. Number 15 in Algorithms and Computation in Mathematics. Springer-Verlag, Berlin Heidelberg, 2006. |
|
22 | Harri Haanpää, Matti Järvisalo, Petteri Kaski, and Ilkka Niemelä. Hard satisfiable clause sets for benchmarking equivalence reasoning techniques. Journal on Satisfiability, Boolean Modeling and Computation, 2:27–46, 2006. |
|
2005 |
21 | Petteri Kaski. Algorithms for classification of combinatorial objects. Research Report A94, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, June 2005. Doctoral dissertation. |
|
20 | Harri Haanpää and Petteri Kaski. The near resolvable 2-(13,4,3) designs and thirteen-player whist tournaments. Designs, Codes and Cryptography, 35(3):271–285, 2005. |
|
19 | Patrik Floréen, Petteri Kaski, Jukka Kohonen, and Pekka Orponen. Lifetime maximization for multicasting in energy-constrained wireless networks. IEEE Journal on Selected Areas in Communications, 23(1):117–126, 2005. |
|
18 | Petteri Kaski and Patric R. J. Östergård. One-factorizations of regular graphs of order 12. Electronic Journal of Combinatorics, 12:R2, 2005. |
|
17 | Patrik Floréen, Petteri Kaski, Jukka Kohonen, and Pekka Orponen. Exact and approximate balanced data gathering in energy-constrained sensor networks. Theoretical Computer Science, 344(1):30–46, 2005. |
|
16 | Petteri Kaski. Isomorph-free exhaustive generation of designs with prescribed groups of automorphisms. SIAM Journal on Discrete Mathematics, 19(3):664–690, 2005. |
|
15 | Petteri Kaski. Nonexistence of perfect Steiner triple systems of orders 19 and 21. Bayreuther Mathematische Schriften, 74:130–135, 2005. Proceedings of ALCOMA05, April 3–10, Thurnau, Germany. |
|
2004 |
14 | Malcolm Greig, Harri Haanpää, and Petteri Kaski. On the existence of conference matrices and near resolvable 2-(2k+1,k,k-1) designs. In Lars Døvling Andersen and Olav Geil, editors, Proceedings of the 8th Nordic Combinatorial Conference, pages 65–69, Aalborg, Denmark, October 2004. Department of Mathematical Sciences, Aalborg University. Extended summary (unrefereed). |
|
13 | Petteri Kaski and Patric R. J. Östergård. Enumeration of balanced ternary designs. Discrete Applied Mathematics, 138(1–2):133–141, 2004. |
|
12 | Petteri Kaski and Patric R. J. Östergård. Miscellaneous classification results for 2-designs. Discrete Mathematics, 280(1–3):65–75, 2004. |
|
11 | Petteri Kaski. Packing Steiner trees with identical terminal sets. Information Processing Letters, 91(1):1–5, 2004. |
|
10 | Petteri Kaski and Patric R. J. Östergård. The Steiner triple systems of order 19. Mathematics of Computation, 73:2075–2092, 2004. |
|
9 | Emil Falck, Patrik Floréen, Petteri Kaski, Jukka Kohonen, and Pekka Orponen. Balanced data gathering in energy-constrained sensor networks. In Sotiris Nikoletseas and José D. P. Rolim, editors, Algorithmic Aspects of Wireless Sensor Networks (First International Workshop, ALGOSENSORS 2004, Turku, Finland, July 16, 2004), volume 3121 of Lecture Notes in Computer Science, pages 59–70, Berlin Heidelberg, 2004. Springer-Verlag. |
|
8 | Petteri Kaski and Patric R. J. Östergård. There exist nonisomorphic STS(19) with equivalent point codes. Journal of Combinatorial Designs, 12(6):443–448, 2004. |
|
2003 |
7 | Petteri Kaski. A census of Steiner triple systems and some related combinatorial objects. Research Report A78, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, June 2003. |
|
6 | Patrik Floréen, Petteri Kaski, Jukka Kohonen, and Pekka Orponen. Multicast time maximization in energy constrained wireless networks. In Andrea Richa and Jennifer Welch, editors, Proceedings of the 2003 Joint Workshop on Foundations of Mobile Computing (DIALM-POMC'03, San Diego CA, September 2003), pages 50–58, New York NY, 2003. Association for Computing Machinery. |
|
5 | Petteri Kaski, Luis B. Morales, Patric R. J. Östergård, David A. Rosenblueth, and Carlos Velarde. Classification of resolvable 2-(14,7,12) and 3-(14,7,5) designs. Journal of Combinatorial Mathematics and Combinatorial Computing, 47:65–74, 2003. |
|
2002 |
4 | Petteri Kaski. A Census of Steiner Triple Systems and Some Related Combinatorial Objects. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, December 2002. |
|
3 | Patric R. J. Östergård and Petteri Kaski. Enumeration of 2-(9,3,lambda) designs and their resolutions. Designs, Codes and Cryptography, 27:131–137, 2002. |
|
2001 |
2 | Petteri Kaski. Isomorph-free exhaustive generation of combinatorial designs. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, September 2001. |
|
1 | Petteri Kaski and Patric R. J. Östergård. There exists no (15,5,4) RBIBD. Journal of Combinatorial Designs, 9(5):357–362, 2001. |
|