default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHarri Haanpää
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j9]Harri Haanpää, Patric R. J. Östergård:
Counting Hamiltonian cycles in bipartite graphs. Math. Comput. 83(286): 979-995 (2014)- 2010
- [j8]Lauri Ahlroth, André Schumacher, Harri Haanpää:
On the power of lookahead in online lot-sizing. Oper. Res. Lett. 38(6): 522-526 (2010) - [j7]Harri Haanpää, André Schumacher, Pekka Orponen
:
Distributed algorithms for lifetime maximization in sensor networks via Min-Max spanning subgraphs. Wirel. Networks 16(3): 875-887 (2010)
2000 – 2009
- 2009
- [c6]André Schumacher, Harri Haanpää:
Distributed Sleep Scheduling in Wireless Sensor Networks via Fractional Domatic Partitioning. SSS 2009: 640-654 - 2008
- [j6]Harri Haanpää, Patric R. J. Östergård, Sándor Szabó:
Small P-Groups with Full-Rank Factorization. Int. J. Algebra Comput. 18(6): 1019-1034 (2008) - [c5]André Schumacher, Pekka Orponen, Thorn Thaler, Harri Haanpää:
Lifetime Maximization in Wireless Sensor Networks by Distributed Binary Search. EWSN 2008: 237-252 - [c4]André Schumacher, Harri Haanpää:
Distributed network utility maximization in wireless networks with a bounded number of paths. PM2HW2N 2008: 96-103 - 2007
- [c3]Shreyas Prasad, André Schumacher, Harri Haanpää, Pekka Orponen:
Balanced Multipath Source Routing. ICOIN 2007: 315-324 - [c2]Harri Haanpää, André Schumacher, Thorn Thaler, Pekka Orponen:
Distributed Computation of Maximum Lifetime Spanning Subgraphs in Sensor Networks. MSN 2007: 445-456 - 2006
- [j5]Malcolm Greig, Harri Haanpää, Petteri Kaski:
On the coexistence of conference matrices and near resolvable 2-(2k+1, k, k-1) designs. J. Comb. Theory A 113(4): 703-711 (2006) - [j4]Harri Haanpää, Matti Järvisalo, Petteri Kaski, Ilkka Niemelä:
Hard Satisfiable Clause Sets for Benchmarking Equivalence Reasoning Techniques. J. Satisf. Boolean Model. Comput. 2(1-4): 27-46 (2006) - [c1]André Schumacher, Harri Haanpää, Satu Elisa Schaeffer, Pekka Orponen:
Load Balancing by Distributed Optimisation in Ad Hoc Networks. MSN 2006: 873-884 - 2005
- [j3]Harri Haanpää, Petteri Kaski:
The Near Resolvable 2-(13, 4, 3) Designs and Thirteen-Player Whist Tournaments. Des. Codes Cryptogr. 35(3): 271-285 (2005) - 2004
- [j2]Harri Haanpää, Antti Huima, Patric R. J. Östergård:
Sets in Z nwith distinct sums of pairs. Discret. Appl. Math. 138(1-2): 99-106 (2004) - 2003
- [j1]Harri Haanpää, Patric R. J. Östergård:
Classification of whist tournaments with up to 12 players. Discret. Appl. Math. 129(2-3): 399-407 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
