Classification of whist tournaments with up to 12 players. - Harri Haanpää; Patric R. J. Östergård (Discret. Appl. Math., 2003)

Sets in Z nwith distinct sums of pairs. - Harri Haanpää; Antti Huima; Patric R. J. Östergård (Discret. Appl. Math., 2004)

The Near Resolvable 2-(13, 4, 3) Designs and Thirteen-Player Whist Tournaments. - Harri Haanpää; Petteri Kaski (Des. Codes Cryptogr., 2005)

Load Balancing by Distributed Optimisation in Ad Hoc Networks. - André Schumacher; Harri Haanpää; Satu Elisa Schaeffer; Pekka Orponen (MSN, 2006)

On the coexistence of conference matrices and near resolvable 2-(2k+1, k, k-1) designs. - Malcolm Greig; Harri Haanpää; Petteri Kaski (J. Comb. Theory A, 2006)

Hard Satisfiable Clause Sets for Benchmarking Equivalence Reasoning Techniques. - Harri Haanpää; Matti Järvisalo; Petteri Kaski; Ilkka Niemelä (J. Satisf. Boolean Model. Comput., 2006)

Balanced Multipath Source Routing. - Shreyas Prasad; André Schumacher; Harri Haanpää; Pekka Orponen (ICOIN, 2007)

Distributed Computation of Maximum Lifetime Spanning Subgraphs in Sensor Networks. - Harri Haanpää; André Schumacher; Thorn Thaler; Pekka Orponen (MSN, 2007)

Lifetime Maximization in Wireless Sensor Networks by Distributed Binary Search. - André Schumacher; Pekka Orponen; Thorn Thaler; Harri Haanpää (EWSN, 2008)

Distributed network utility maximization in wireless networks with a bounded number of paths. - André Schumacher; Harri Haanpää (PM2HW2N, 2008)

Small P-Groups with Full-Rank Factorization. - Harri Haanpää; Patric R. J. Östergård; Sándor Szabó (Int. J. Algebra Comput., 2008)

Distributed Sleep Scheduling in Wireless Sensor Networks via Fractional Domatic Partitioning. - André Schumacher; Harri Haanpää (SSS, 2009)

On the power of lookahead in online lot-sizing. - Lauri Ahlroth; André Schumacher; Harri Haanpää (Oper. Res. Lett., 2010)

Distributed algorithms for lifetime maximization in sensor networks via Min-Max spanning subgraphs. - Harri Haanpää; André Schumacher; Pekka Orponen (Wirel. Networks, 2010)

Counting Hamiltonian cycles in bipartite graphs. - Harri Haanpää; Patric R. J. Östergård (Math. Comput., 2014)