Hard satisfiable clause sets for benchmarking equivalence reasoning techniques H Haanpää, M Järvisalo, P Kaski, I Niemelä Journal on Satisfiability, Boolean Modeling and Computation 2 (1-4), 27-46, 2006 | 48 | 2006 |
Sets in ℤn with distinct sums of pairs H Haanpää, A Huima, P Östergård Discrete Applied Mathematics 138 (1-2), 99-106, 2004 | 23 | 2004 |
Load balancing by distributed optimisation in ad hoc networks A Schumacher, H Haanpää, SE Schaeffer, P Orponen International Conference on Mobile Ad-Hoc and Sensor Networks, 873-884, 2006 | 13 | 2006 |
Minimum sum and difference covers of abelian groups. H Haanpää Journal of Integer Sequences [electronic only] 7 (2), haanpaa. pdf, 2004 | 13 | 2004 |
Counting Hamiltonian cycles in bipartite graphs H Haanpää, P Östergård Mathematics of Computation 83 (286), 979-995, 2014 | 10 | 2014 |
On the power of lookahead in online lot-sizing L Ahlroth, A Schumacher, H Haanpää Operations research letters 38 (6), 522-526, 2010 | 10 | 2010 |
Sets in Abelian groups with distinct sums of pairs H Haanpää, PRJ Östergård Journal of Number Theory 123 (1), 144-153, 2007 | 10 | 2007 |
The near resolvable 2-(13, 4, 3) designs and thirteen-player whist tournaments H Haanpää, P Kaski Designs, Codes and Cryptography 35, 271-285, 2005 | 10 | 2005 |
A lower bound for a ramsey number H Haanpää Congr. Numer 144, 189-191, 2000 | 10 | 2000 |
On the coexistence of conference matrices and near resolvable 2-(2k+ 1, k, k-1) designs M Greig, H Haanpää, P Kaski Journal of Combinatorial Theory, Series A 113 (4), 703-711, 2006 | 9 | 2006 |
Distributed algorithms for lifetime maximization in sensor networks via Min–Max spanning subgraphs H Haanpää, A Schumacher, P Orponen Wireless Networks 16, 875-887, 2010 | 8 | 2010 |
Balanced Multipath Source Routing S Prasad, A Schumacher, H Haanpää, P Orponen Information Networking. Towards Ubiquitous Networking and Services …, 2008 | 8 | 2008 |
Computational methods for Ramsey numbers H Haanpää | 8 | 2000 |
Lifetime maximization in wireless sensor networks by distributed binary search A Schumacher, P Orponen, T Thaler, H Haanpää European Conference on Wireless Sensor Networks, 237-252, 2008 | 7 | 2008 |
Distributed sleep scheduling in wireless sensor networks via fractional domatic partitioning A Schumacher, H Haanpää Symposium on Self-Stabilizing Systems, 640-654, 2009 | 6 | 2009 |
Distributed computation of maximum lifetime spanning subgraphs in sensor networks H Haanpää, A Schumacher, T Thaler, P Orponen International Conference on Mobile Ad-Hoc and Sensor Networks, 445-456, 2007 | 6 | 2007 |
Classification of whist tournaments with up to 12 players H Haanpää, PRJ Östergård Discrete applied mathematics 129 (2-3), 399-407, 2003 | 6 | 2003 |
Distributed network utility maximization in wireless networks with a bounded number of paths A Schumacher, H Haanpää Proceedings of the 3nd ACM workshop on Performance monitoring and …, 2008 | 3 | 2008 |
SAT benchmarks based on 3-regular graphs H Haanpää, M Järvisalo, P Kaski, I Niemelä SAT Competition 2005, 2005 | 3 | 2005 |
Classification of whist tournaments with up to twelve players H Haanpaa, P Ostergard preprint, 0 | 3 | |