2012 |
|
70 | Fedor V. Fomin and Petteri Kaski, editors. Algorithm Theory – SWAT 2012, 13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4–6, 2012. Proceedings, volume 7357 of Lecture Notes in Computer Science, Berlin, 2012. Springer. |
|
|
69 | Matti Järvisalo, Petteri Kaski, Mikko Koivisto, and Janne H. Korhonen. Finding efficient circuits for ensemble computation. In Alessandro Cimatti and Roberto Sebastiani, editors, Proceedings of the Fifteenth International Conference on Theory and Applications of Satisfiability Testing (Trento, 17–20 June, 2012), volume 7317 of Lecture Notes in Computer Science, pages 369–382. Springer, 2012. |
|
|
68 | Petteri Kaski, Mikko Koivisto, and Jesper Nederlof. Homomorphic hashing for sparse coefficient extraction. In Dimitrios M. Thilikos and Gerhard J. Woeginger, editors, Proceedings of the Seventh International Symposium on Parameterized and Exact Computation (IPEC 2012, Ljubljana, Slovenia, 12–14 September, 2012), volume 7535 of Lecture Notes in Computer Science, pages 147–158, Berlin, 2012. Springer. |
|
|
67 | Petteri Kaski, Mikko Koivisto, and Janne H. Korhonen. Fast monotone summation over disjoint sets. In Dimitrios M. Thilikos and Gerhard J. Woeginger, editors, Proceedings of the Seventh International Symposium on Parameterized and Exact Computation (IPEC 2012, Ljubljana, Slovenia, 12–14 September, 2012), volume 7535 of Lecture Notes in Computer Science, pages 159–170, Berlin, 2012. Springer. |
|
|
66 | Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto, Jesper Nederlof, and Pekka Parviainen. Fast zeta transforms for lattices with few irreducibles. In Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (Kyoto, 17–19 January, 2012), pages 1436–1444, Philadelphia, PA, 2012. SIAM. |
|
|
65 | Petteri Kaski, Mahdad Khatirinejad, and Patric R. J. Östergård. Steiner triple systems satisfying the 4-vertex condition. Designs, Codes and Cryptography, 62(3):323–330, 2012. |
|
|
64 | Andreas Björklund, Thore Husfeldt, Petteri Kaski, and Mikko Koivisto. The travelling salesman problem in bounded degree graphs. ACM Transactions on Algorithms, 8(2):Article No. 18, 2012. |
|
2011 |
|
63 | Tommi Junttila and Petteri Kaski. Conflict propagation and component recursion for canonical labeling. In Alberto Marchetti-Spaccamela and Michael Segal, editors, Proceedings of the 1st International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems (TAPAS 2011, Rome, 18–20 April 2011), number 6595/2011 in Lecture Notes in Computer Science, pages 151–162, Berlin, 2011. Springer. |
|
|
62 | Niko Vuokko and Petteri Kaski. Significance of patterns in time series collections. In Proceedings of the Eleventh SIAM International Conference on Data Mining (Mesa, AZ, 28–30 April, 2011), pages 676–686, Philadelphia, PA, 2011. SIAM. |
|
|
61 | Esa Junttila and Petteri Kaski. Segmented nestedness in binary data. In Proceedings of the Eleventh SIAM International Conference on Data Mining (Mesa, AZ, 28–30 April, 2011), pages 235–246, Philadelphia, PA, 2011. SIAM. |
|
|
60 | Charles J. Colbourn, Petteri Kaski, Patric R. J. Östergård, David A. Pike, and Olli Pottonen. Nearly Kirkman triple systems of order 19 and Hanani triple systems of order 19. Discrete Mathematics, 311(10–11):827–834, 2011. |
|
|
59 | Petteri Kaski, Veli Mäkinen, and Patric R. J. Östergård. The cycle switching graph of the Steiner triple systems of order 19 is connected. Graphs and Combinatorics, 27:539–546, 2011. |
|
|
58 | Alexander Hulpke, Petteri Kaski, and Patric R. J. Östergård. The number of Latin squares of order 11. Mathematics of Computation, 80:1197–1219, 2011. |
|
|
57 | Andreas Björklund, Thore Husfeldt, Petteri Kaski, and Mikko Koivisto. Covering and packing in linear space. Information Processing Letters, 111(21–22):1033–1036, 2011. |
|
|
56 | Patrik Floréen, Marja Hassinen, Joel Kaasinen, Petteri Kaski, Topi Musto, and Jukka Suomela. Local approximability of max-min and min-max linear programs. Theory of Computing Systems, 49(4):672–697, 2011. |
|
2010 |
|
55 | Niko Vuokko and Petteri Kaski. Testing the significance of patterns in data with cluster structure. In Proceedings of the 10th IEEE Conference on Data Mining (ICDM 2010, Sydney, December 14–17, 2010), 2010. |
|
|
54 | Andreas Björklund, Thore Husfeldt, Petteri Kaski, and Mikko Koivisto. Covering and packing in linear space. In Samson Ambramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, and Paul G. Spirakis, editors, Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6–10, 2010, Proceedings, Part I, number 6198 in Lecture Notes in Computer Science, pages 727–737, Berlin, 2010. Springer. |
|
|
53 | Tommi Junttila and Petteri Kaski. Exact cover via satisfiability: an empirical study. In David Cohen, editor, Proceedings of 16th International Conference on Principles and Practice of Constraint Programming (CP 2010, St. Andrews, Scotland, September 6–10), number 6308 in Lecture Notes in Computer Science, pages 297–304. Springer, 2010. |
|
|
52 | Patrik Floréen, Marja Hassinen, Joel Kaasinen, Petteri Kaski, Topi Musto, and Jukka Suomela. Local approximability of max-min and min-max linear programs. Theory of Computing Systems, 2010. |
|
|
51 | Charles J. Colbourn, Anthony D. Forbes, Mike J. Grannell, Terry S. Griggs, Petteri Kaski, Patric R. J. Östergård, David A. Pike, and Olli Pottonen. Properties of the Steiner triple systems of order 19. Electronic Journal of Combinatorics, 17(1):#R98, 30pp, 2010. |
|
|
50 | Timo Vesala, Samuli Launiainen, Pasi Kolari, Jukka Pumpanen, Sanna Sevanto, Pertti Hari, Eero Nikinmaa, Petteri Kaski, Heikki Mannila, Esko Ukkonen, Shilong Piao, and Philippe Ciais. Autumn warming and carbon balance of a boreal Scots pine forest in Southern Finland. Biogeosciences, 7:163–176, 2010. |
|
|
49 | Andreas Björklund, Thore Husfeldt, Petteri Kaski, and Mikko Koivisto. Evaluation of permanents in rings and semirings. Information Processing Letters, 110:867–870, 2010. |
|
|
48 | Patrik Floréen, Petteri Kaski, Valentin Polishchuk, and Jukka Suomela. Almost stable matchings by truncating the Gale–Shapley algorithm. Algorithmica, 58(1):102–118, 2010. |
|
|
47 | Andreas Björklund, Thore Husfeldt, Petteri Kaski, and Mikko Koivisto. Trimmed Moebius inversion and graphs of bounded degree. Theory of Computing Systems, 47:637–654, 2010. |
|
2009 |
|
46 | Andreas Björklund, Thore Husfeldt, Petteri Kaski, and Mikko Koivisto. Counting paths and packings in halves. In Amos Fiat and Peter Sanders, editors, Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7–9, 2009, Proceedings, number 5757 in Lecture Notes in Computer Science, pages 578–586, Berlin, 2009. Springer. |
|
|
45 | Patrik Floréen, Joel Kaasinen, Petteri Kaski, and Jukka Suomela. An optimal local approximation algorithm for max-min linear programs. In Friedhelm Meyer auf der Heide and Michael A. Bender, editors, Proceedings of the 21st ACM Symposium on Parallelism in Algorithms and Architectures (Calgary, August 11–13, 2009), pages 260–269, New York, 2009. ACM. |
|
|
44 | Petteri Kaski, Patric R. J. Östergård, Olli Pottonen, and Lasse Kiviluoto. A catalogue of the Steiner triple systems of order 19. Bulletin of the Institute of Combinatorics and Its Applications, 57:35–41, 2009. |
|
|
43 | Petteri Kaski and Patric R. J. Östergård. There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations of  . Journal of Combinatorial Designs, 17(2):147–159, 2009. |
|
|
42 | Petteri Kaski and Patric R. J. Östergård. Classification of resolvable balanced incomplete block designs—the unitals on 28 points. Mathematica Slovaca, 59(2):121–136, 2009. |
|
2008 |
|
41 | 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. |
|
|
40 | Andreas Björklund, Thore Husfeldt, Petteri Kaski, and Mikko Koivisto. Computing the tutte polynomial in vertex-exponential time. In Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2008, October 25–28, Philadelphia, PA), pages 677–686, Los Alamitos, CA, 2008. IEEE Computer Society. |
|
|
39 | Mikko Alava, John Ardelius, Erik Aurell, Petteri Kaski, Supriya Krishnamurthy, Pekka Orponen, and Sakari Seitz. Circumspect descent prevails in solving random constraint satisfaction problems. Proceedings of the National Academy of Sciences of the United States of America, 105(40):15253–15257, 2008. |
|
|
38 | Patrik Floréen, Marja Hassinen, Petteri Kaski, and Jukka Suomela. Tight local approximation results for max-min linear programs. In Algorithmic Aspects of Wireless Sensor Networks, Fourth International Workshop, ALGOSENSORS 2008, Reykjavik, Iceland, July 2008. Revised Selected Papers, number 5389 in Lecture Notes in Computer Science, pages 2–17. Springer, 2008. |
|
|
37 | Petteri Kaski, Aleksi Penttinen, and Jukka Suomela. Coordinating concurrent transmissions: a constant-factor approximation of maximum-weight independent set in local conflict graphs. Ad Hoc & Sensor Wireless Networks: An International Journal, 6:239–263, 2008. |
|
|
36 | Andreas Björklund, Thore Husfeldt, Petteri Kaski, and Mikko Koivisto. The travelling salesman problem in bounded degree graphs. In Luca Aceto, Ivan Damgård, Leslie Ann Goldberg, Magnús M. Halldø'rsson, Anna Ingólfsdóttir, and Igor Walukiewicz, editors, Automata, Languages and Programming (35th International Colloquium, ICALP 2008, Reykjavık, Iceland, July 7–11, 2008), Part I, volume 5125, pages 198–209. Springer, 2008. |
|
|
35 | Patrik Floréen, Petteri Kaski, Topi Musto, and Jukka Suomela. Approximating max-min linear programs with local algorithms. In IEEE International Parallel and Distributed Processing Symposium (Miami, April 14—18, 2008), page 10 pp. IEEE, 2008. |
|
|
34 | Andreas Björklund, Thore Husfeldt, Petteri Kaski, and Mikko Koivisto. Trimmed Moebius inversion and graphs of bounded degree. In Susanne Albers and Pascal Weil, editors, Proceedings of the 25th Annual Symposium on Theoretical Aspects of Computer Science (Bordeaux, February 21–23, 2008), pages 85–96. IBFI Schloss Dagstuhl, Wadern, Germany, 2008. |
|
|
33 | Patrik Floréen, Petteri Kaski, Topi Musto, and Jukka Suomela. Local approximation algorithms for scheduling problems in sensor networks. In Mirosław Kutyłowski, Jacek Cichoń, and Przemysław Kubiak, editors, Algorithmic Aspects of Wireless Sensor Networks (Third International Workshop, ALGOSENSORS 2007, Wrocław, Poland, July 14, 2007), number 4837 in Lecture Notes in Computer Science, pages 99–113. Springer, 2008. |
|
|
32 | 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. |
|
|
31 | Petteri Kaski and Patric R. J. Östergård. There are exactly five biplanes with  . Journal of Combinatorial Designs, 16(2):117–127, 2008. |
|
|
30 | Yeow Meng Chee and Petteri Kaski. An enumeration of graphical designs. Journal of Combinatorial Designs, 16(1):70–85, 2008. |
|
2007 |
|
29 | Petteri Kaski, Aleksi Penttinen, and Jukka Suomela. Coordinating concurrent transmissions: a constant-factor approximation of maximum-weight independent set in local conflict graphs. In Evangelos Kranakis and Jaroslav Opatrny, editors, Ad-Hoc, Mobile, and Wireless Networks (6th International Conference, ADHOC-NOW 2007, Morelia, Mexico, September 24–26, 2007), number 4686 in Lecture Notes in Computer Science, pages 74–86. Springer, 2007. |
|
|
28 | Patrik Floréen, Petteri Kaski, and Jukka Suomela. A distributed approximation scheme for sleep scheduling in sensor networks. In Proceedings of the 4th Annual IEEE Communications Society Conference on Sensor, Mesh, and Ad Hoc Communications and Networks (San Diego, CA, June 18—21, 2007), pages 152–161. IEEE, 2007. |
|
|
27 | Andreas Björklund, Thore Husfeldt, Petteri Kaski, and Mikko Koivisto. Fourier meets möbius: fast subset convolution. In Proceedings of the 39th Annual ACM Symposium on Theory of Computing (San Diego, CA, June 11—13, 2007), pages 67–74. ACM, 2007. |
|
|
26 | Tommi Junttila and Petteri Kaski. Engineering an efficient canonical labeling tool for large and sparse graphs. In David Applegate, Gerth S. Brodal, Daniel Panario, and Robert Sedgewick, editors, Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments and the Fourth Workshop on Analytic Algorithms and Combinatorics (New Orleans, January 6, 2007), pages 135–149. SIAM, 2007. |
|
|
25 | Petteri Kaski and Patric R. J. Östergård. There exists no symmetric configuration with 33 points and line size 6. Australasian Journal of Combinatorics, 38:273–277, 2007. |
|
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. |
|
