52 citations · 107 across the 10 of their papers we have counts for
3 papers · 1 filter
ERGMs are Hard
Michael J. Bannister, William E. Devanny, David Eppstein
We investigate the computational complexity of the exponential random graph model (ERGM) commonly used in social network analysis. This model represents a probability distribution…
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…
Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth
Michael J. Bannister, David Eppstein
We investigate crossing minimization for 1-page and 2-page book drawings. We show that computing the 1-page crossing number is fixed-parameter tractable with respect to the number…