Daniel J. Harvey

28 papers A 2B 5C 1Journal 16Unranked 3
YearRankTypeTitle / Venue / Authors
2024 C conf
Resolving Unresolved Resolved and Unresolved Triplets Consistency Problems.
IWOCA
Daniel J. Harvey, Jesper Jansson, Mikolaj Marciniak, Yukihiro Murakami
2023 J jnl
Graphs of Linear Growth have Bounded Treewidth.
Electron. J. Comb.
Rutger Campbell, Marc Distel, Jochen Pascal Gollin, Daniel J. Harvey, Kevin Hendrey, Robert Hickingbotham, Bojan Mohar, David R. Wood
2023 J jnl
Intersecting longest paths in chordal graphs.
Discret. Math.
Daniel J. Harvey, Michael S. Payne
2023 B conf
MUL-Tree Pruning for Consistency and Compatibility.
CPM
Christopher Hampson, Daniel J. Harvey, Costas S. Iliopoulos, Jesper Jansson, Zara Lim, Wing-Kin Sung
2020 J jnl
Chromatic roots at 2 and the Beraha number B
J. Graph Theory
Daniel J. Harvey, Gordon F. Royle
2018 J jnl
The treewidth of line graphs.
J. Comb. Theory B
Daniel J. Harvey, David R. Wood
2017 J jnl
A Cycle of Maximum Order in a Graph of High Minimum Degree has a Chord.
Electron. J. Comb.
Daniel J. Harvey
2017 J jnl
Parameters Tied to Treewidth.
J. Graph Theory
Daniel J. Harvey, David R. Wood
2016 J jnl
Average Degree Conditions Forcing a Minor.
Electron. J. Comb.
Daniel J. Harvey, David R. Wood
2015 J jnl
Cycles of Given Size in a Dense Graph.
SIAM J. Discret. Math.
Daniel J. Harvey, David R. Wood
2015 J jnl
Treewidth of the Line Graph of a Complete Graph.
J. Graph Theory
Daniel J. Harvey, David R. Wood
2014 — —
On Treewidth and Graph Minors.
Daniel J. Harvey
2014 J jnl
Treewidth of the Kneser Graph and the Erdős-Ko-Rado Theorem.
Electron. J. Comb.
Daniel J. Harvey, David R. Wood
2013 J jnl
A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph.
SIAM J. Discret. Math.
Vida Dujmovic, Daniel J. Harvey, Gwenaël Joret, Bruce A. Reed, David R. Wood
2012 J jnl
A linear-time algorithm for finding a complete graph minor in a dense graph
CoRR
Vida Dujmovic, Daniel J. Harvey, Gwenaël Joret, Bruce A. Reed, David R. Wood
2006 J jnl
Design and Performance of a Heterogeneous Grid Partitioner.
Algorithmica
Daniel J. Harvey, Sajal K. Das, Rupak Biswas
2003 — conf
Designing an Efficient Partitioning Algorithm for Grid Environments with Application to N-body Problems.
ICCSA (2)
Daniel J. Harvey, Sajal K. Das, Rupak Biswas
2003 B conf
Performance of a Heterogeneous Grid Partitioner for N-body Applications.
ICPP
Daniel J. Harvey, Sajal K. Das, Rupak Biswas
2002 J jnl
Adaptive Load-Balancing Algorithms Using Symmetric Broadcast Networks.
J. Parallel Distributed Comput.
Sajal K. Das, Daniel J. Harvey, Rupak Biswas
2002 J jnl
MinEX: a latency-tolerant dynamic partitioner for grid computing applications.
Future Gener. Comput. Syst.
Sajal K. Das, Daniel J. Harvey, Rupak Biswas
2001 A conf
A Latency-Tolerant Partitioner for Distributed Computing on the Information Power Grid.
IPDPS
Sajal K. Das, Daniel J. Harvey, Rupak Biswas
2001 B conf
Latency Hiding in Dynamic Partitioning and Load Balancing of Grid Computing Applications.
CCGRID
Sajal K. Das, Daniel J. Harvey, Rupak Biswas
2001 J jnl
Parallel Processing of Adaptive Meshes with Load Balancing.
IEEE Trans. Parallel Distributed Syst.
Sajal K. Das, Daniel J. Harvey, Rupak Biswas
1999 — conf
Portable Parallel Programming for the Dynamic Load Balancing of Unstructured Grid Applications.
IPPS/SPDP
Rupak Biswas, Leonid Oliker, Sajal K. Das, Daniel J. Harvey
1998 A conf
Dynamic Load Balancing for Adaptive Meshes Using Symmetric Broadcast Networks.
International Conference on Supercomputing
Sajal K. Das, Daniel J. Harvey, Rupak Biswas
1998 B conf
Parallel Processing of Adaptive Meshes with Load Balancing.
ICPP
Sajal K. Das, Daniel J. Harvey, Rupak Biswas
1997 B conf
Adaptive load-balancing algorithms using symmetric broadcast networks: performance study on an IBM SP2.
ICPP
Sajal K. Das, Daniel J. Harvey, Rupak Biswas
1997 — conf
Design of Novel Load-Balancing Algorithms with Implementations on an IBM SP1.
Euro-Par
Sajal K. Das, Daniel J. Harvey, Rupak Biswas