Harri Haanpää

According to our database, Harri Haanpää authored at least 15 papers between 2003 and 2014.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2014

Counting Hamiltonian cycles in bipartite graphs.

Harri Haanpää, Patric R. J. Östergård

Math. Comput., 2014

2010

Distributed algorithms for lifetime maximization in sensor networks via Min-Max spanning subgraphs.

Harri Haanpää, André Schumacher, Pekka Orponen

Wirel. Networks, 2010

On the power of lookahead in online lot-sizing.

Lauri Ahlroth, André Schumacher, Harri Haanpää

Oper. Res. Lett., 2010

2009

Distributed Sleep Scheduling in Wireless Sensor Networks via Fractional Domatic Partitioning.

André Schumacher, Harri Haanpää

Proceedings of the Stabilization, 2009

2008

Small P-Groups with Full-Rank Factorization.

Harri Haanpää, Patric R. J. Östergård, Sándor Szabó

Int. J. Algebra Comput., 2008

Distributed network utility maximization in wireless networks with a bounded number of paths.

André Schumacher, Harri Haanpää

Proceedings of the 3rd ACM Workshop on Performance Monitoring and Measurement of Heterogeneous Wireless and Wired Networks, 2008

Lifetime Maximization in Wireless Sensor Networks by Distributed Binary Search.

André Schumacher, Pekka Orponen, Thorn Thaler, Harri Haanpää

Proceedings of the Wireless Sensor Networks, 5th European Conference, 2008

2007

Distributed Computation of Maximum Lifetime Spanning Subgraphs in Sensor Networks.

Harri Haanpää, André Schumacher, Thorn Thaler, Pekka Orponen

Proceedings of the Mobile Ad-Hoc and Sensor Networks, Third International Conference, 2007

Balanced Multipath Source Routing.

Shreyas Prasad, André Schumacher, Harri Haanpää, Pekka Orponen

Proceedings of the Information Networking. Towards Ubiquitous Networking and Services, 2007

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

On the coexistence of conference matrices and near resolvable 2-(2<i>k</i>+1, <i>k</i>, <i>k</i>-1) designs.

Malcolm Greig, Harri Haanpää, Petteri Kaski

J. Comb. Theory, Ser. A, 2006

Load Balancing by Distributed Optimisation in Ad Hoc Networks.

André Schumacher, Harri Haanpää, Satu Elisa Schaeffer, Pekka Orponen

Proceedings of the Mobile Ad-hoc and Sensor Networks, Second International Conference, 2006

2005

The Near Resolvable 2-(13, 4, 3) Designs and Thirteen-Player Whist Tournaments.

Harri Haanpää, Petteri Kaski

Des. Codes Cryptogr., 2005

2004

Sets in Z _nwith distinct sums of pairs.

Harri Haanpää, Antti Huima, Patric R. J. Östergård

Discret. Appl. Math., 2004

2003

Classification of whist tournaments with up to 12 players.

Harri Haanpää, Patric R. J. Östergård

Discret. Appl. Math., 2003