TCS / Research / Publications / Petteri Kaski
Helsinki University of Technology, 
     Laboratory for Theoretical Computer Science

Publications by Petteri Kaski

2008

25Petteri 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.
Info
See www.tcs.hut.fi ...

2006

24Malcolm 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.
Info
See dx.doi.org ...
23Petteri 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.
Info
See users.tkk.fi ...
22Harri 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.
Info
See jsat.ewi.tudelft.nl ...

2005

21Petteri 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.
Info
See lib.tkk.fi ...
20Harri 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.
Info
See dx.doi.org ...
19Patrik 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.
Info
See dx.doi.org ...
18Petteri Kaski and Patric R. J. Östergård. One-factorizations of regular graphs of order 12. Electronic Journal of Combinatorics, 12:R2, 2005.
Info
See www.combinatorics.org ...
17Patrik 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.
Info
See dx.doi.org ...
16Petteri Kaski. Isomorph-free exhaustive generation of designs with prescribed groups of automorphisms. SIAM Journal on Discrete Mathematics, 19(3):664–690, 2005.
Info
See dx.doi.org ...
15Petteri 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.
Info
See www.tcs.hut.fi ...

2004

14Malcolm 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).
Info
13Petteri Kaski and Patric R. J. Östergård. Enumeration of balanced ternary designs. Discrete Applied Mathematics, 138(1–2):133–141, 2004.
Info
See dx.doi.org ...
12Petteri Kaski and Patric R. J. Östergård. Miscellaneous classification results for 2-designs. Discrete Mathematics, 280(1–3):65–75, 2004.
Info
See dx.doi.org ...
11Petteri Kaski. Packing Steiner trees with identical terminal sets. Information Processing Letters, 91(1):1–5, 2004.
Info
See dx.doi.org ...
10Petteri Kaski and Patric R. J. Östergård. The Steiner triple systems of order 19. Mathematics of Computation, 73:2075–2092, 2004.
Info
See www.ams.org ...
9Emil 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.
Info
See dx.doi.org ...
8Petteri 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.
Info
See dx.doi.org ...

2003

7Petteri 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.
NOTE: Reprint of Licentiate's thesis; see URL below.
Info
See www.tcs.hut.fi ...
6Patrik 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.
Info
See doi.acm.org ...
5Petteri 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.
Info

2002

4Petteri 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.
Info
3Patric 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.
Info
See dx.doi.org ...

2001

2Petteri Kaski. Isomorph-free exhaustive generation of combinatorial designs. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, September 2001.
Info
1Petteri Kaski and Patric R. J. Östergård. There exists no (15,5,4) RBIBD. Journal of Combinatorial Designs, 9(5):357–362, 2001.
Info
See dx.doi.org ...

[TCS main] [Contact Info] [Personnel] [Research] [Publications] [Software] [Studies] [News Archive] [Links]
Latest update: 19 January 2010.