Christopher Homan

activity

19992008

most citedA parent-centered radial layout algorithm for interactive graph visualization and animation

9 citations · 9 across the 4 of their papers we have counts for

collaborators

Showing 2008Show all

2 papers · 1 filter

cs.CC2008

Dichotomy Results for Fixed Point Counting in Boolean Dynamical Systems

Christopher M. Homan, Sven Kosub

We present dichotomy theorems regarding the computational complexity of counting fixed points in boolean (discrete) dynamical systems, i.e., finite discrete dynamical systems over…

cs.GT2008

A $O (lo g m)$ , deterministic, polynomial-time computable approximation of Lewis Carroll's scoring rule

Jason Covey, Christopher Homan

We provide deterministic, polynomial-time computable voting rules that approximate Dodgson's and (the ``minimization version'' of) Young's scoring rules to within a logarithmic fac…

Dichotomy Results for Fixed Point Counting in Boolean Dynamical Systems

A O(logm), deterministic, polynomial-time computable approximation of Lewis Carroll's scoring rule

A $O (lo g m)$ , deterministic, polynomial-time computable approximation of Lewis Carroll's scoring rule