default search action
Daniel J. Harvey
Person information
Other persons with a similar name
SPARQL queries
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c11]Daniel J. Harvey, Jesper Jansson, Mikolaj Marciniak, Yukihiro Murakami:
Resolving Unresolved Resolved and Unresolved Triplets Consistency Problems. IWOCA 2024: 193-205 - 2023
- [j15]Rutger Campbell, Marc Distel, J. Pascal Gollin, Daniel J. Harvey, Kevin Hendrey, Robert Hickingbotham, Bojan Mohar, David R. Wood:
Graphs of Linear Growth have Bounded Treewidth. Electron. J. Comb. 30(3) (2023) - [j14]Daniel J. Harvey, Michael S. Payne:
Intersecting longest paths in chordal graphs. Discret. Math. 346(4): 113284 (2023) - [c10]Christopher Hampson, Daniel J. Harvey, Costas S. Iliopoulos, Jesper Jansson, Zara Lim, Wing-Kin Sung:
MUL-Tree Pruning for Consistency and Compatibility. CPM 2023: 14:1-14:18 - 2020
- [j13]Daniel J. Harvey, Gordon F. Royle:
Chromatic roots at 2 and the Beraha number B10. J. Graph Theory 95(3): 445-456 (2020)
2010 – 2019
- 2018
- [j12]Daniel J. Harvey, David R. Wood:
The treewidth of line graphs. J. Comb. Theory B 132: 157-179 (2018) - 2017
- [j11]Daniel J. Harvey:
A Cycle of Maximum Order in a Graph of High Minimum Degree has a Chord. Electron. J. Comb. 24(4): 4 (2017) - [j10]Daniel J. Harvey, David R. Wood:
Parameters Tied to Treewidth. J. Graph Theory 84(4): 364-385 (2017) - 2016
- [j9]Daniel J. Harvey, David R. Wood:
Average Degree Conditions Forcing a Minor. Electron. J. Comb. 23(1): 1 (2016) - 2015
- [j8]Daniel J. Harvey, David R. Wood:
Treewidth of the Line Graph of a Complete Graph. J. Graph Theory 79(1): 48-54 (2015) - [j7]Daniel J. Harvey, David R. Wood:
Cycles of Given Size in a Dense Graph. SIAM J. Discret. Math. 29(4): 2336-2349 (2015) - 2014
- [j6]Daniel J. Harvey, David R. Wood:
Treewidth of the Kneser Graph and the Erdős-Ko-Rado Theorem. Electron. J. Comb. 21(1): 1 (2014) - 2013
- [j5]Vida Dujmovic, Daniel J. Harvey, Gwenaël Joret, Bruce A. Reed, David R. Wood:
A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph. SIAM J. Discret. Math. 27(4): 1770-1774 (2013) - 2012
- [i1]Vida Dujmovic, Daniel J. Harvey, Gwenaël Joret, Bruce A. Reed, David R. Wood:
A linear-time algorithm for finding a complete graph minor in a dense graph. CoRR abs/1202.2624 (2012)
2000 – 2009
- 2006
- [j4]Daniel J. Harvey, Sajal K. Das, Rupak Biswas:
Design and Performance of a Heterogeneous Grid Partitioner. Algorithmica 45(3): 509-530 (2006) - 2003
- [c9]Daniel J. Harvey, Sajal K. Das, Rupak Biswas:
Designing an Efficient Partitioning Algorithm for Grid Environments with Application to N-body Problems. ICCSA (2) 2003: 279-289 - [c8]Daniel J. Harvey, Sajal K. Das, Rupak Biswas:
Performance of a Heterogeneous Grid Partitioner for N-body Applications. ICPP 2003: 399-406 - 2002
- [j3]Sajal K. Das, Daniel J. Harvey, Rupak Biswas:
MinEX: a latency-tolerant dynamic partitioner for grid computing applications. Future Gener. Comput. Syst. 18(4): 477-489 (2002) - [j2]Sajal K. Das, Daniel J. Harvey, Rupak Biswas:
Adaptive Load-Balancing Algorithms Using Symmetric Broadcast Networks. J. Parallel Distributed Comput. 62(6): 1042-1068 (2002) - 2001
- [j1]Sajal K. Das, Daniel J. Harvey, Rupak Biswas:
Parallel Processing of Adaptive Meshes with Load Balancing. IEEE Trans. Parallel Distributed Syst. 12(12): 1269-1280 (2001) - [c7]Sajal K. Das, Daniel J. Harvey, Rupak Biswas:
Latency Hiding in Dynamic Partitioning and Load Balancing of Grid Computing Applications. CCGRID 2001: 347-354 - [c6]Sajal K. Das, Daniel J. Harvey, Rupak Biswas:
A Latency-Tolerant Partitioner for Distributed Computing on the Information Power Grid. IPDPS 2001: 75
1990 – 1999
- 1999
- [c5]Rupak Biswas, Leonid Oliker, Sajal K. Das, Daniel J. Harvey:
Portable Parallel Programming for the Dynamic Load Balancing of Unstructured Grid Applications. IPPS/SPDP 1999: 338-342 - 1998
- [c4]Sajal K. Das, Daniel J. Harvey, Rupak Biswas:
Parallel Processing of Adaptive Meshes with Load Balancing. ICPP 1998: 502-509 - [c3]Sajal K. Das, Daniel J. Harvey, Rupak Biswas:
Dynamic Load Balancing for Adaptive Meshes Using Symmetric Broadcast Networks. International Conference on Supercomputing 1998: 417-424 - 1997
- [c2]Sajal K. Das, Daniel J. Harvey, Rupak Biswas:
Design of Novel Load-Balancing Algorithms with Implementations on an IBM SP1. Euro-Par 1997: 937-944 - [c1]Sajal K. Das, Daniel J. Harvey, Rupak Biswas:
Adaptive load-balancing algorithms using symmetric broadcast networks: performance study on an IBM SP2. ICPP 1997: 360-369
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-08-05 21:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint