18 citations · 33 across the 7 of their papers we have counts for
7 papers
Windows into Geometric Events: Data Structures for Time-Windowed Querying of Temporal Point Sets
Michael J. Bannister, William E. Devanny, Michael T. Goodrich +2
We study geometric data structures for sets of point-based temporal events, answering time-windowed queries, i.e., given a contiguous time interval we answer common geometric queri…
Force-Directed Graph Drawing Using Social Gravity and Scaling
Michael J. Bannister, David Eppstein, Michael T. Goodrich +1
Force-directed layout algorithms produce graph drawings by resolving a system of emulated physical forces. We present techniques for using social gravity as an additional force in…
Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon (Full)
David Eppstein, Michael T. Goodrich, Maarten Löffler +2
A classic experiment by Milgram shows that individuals can route messages along short paths in social networks, given only simple categorical information about recipients (such as…
Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon (Short)
David Eppstein, Michael T. Goodrich, Maarten Löffler +2
A classic experiment by Milgram shows that individuals can route messages along short paths in social networks, given only simple categorical information about recipients (such as…
Extended h-Index Parameterized Data Structures for Computing Dynamic Subgraph Statistics
David Eppstein, Michael T. Goodrich, Darren Strash +1
We present techniques for maintaining subgraph frequencies in a dynamic graph, using data structures that are parameterized in terms of h, the h-index of the graph. Our methods ext…
Counting Links and Knots in Complete Graphs
Loren Abrams, Blake Mellor, Lowell Trott
We investigate the minimal number of links and knots in complete partite graphs. We provide exact values or bounds on the minimal number of links for all complete partite graphs wi…