Publications
Subtree isomorphism is in random NC.
Discrete Applied Mathematics. 29(1), 35-62.
(1990). Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems.
Journal of the Association for Computing Machinery. 19(2), 248-264.
(1972). Topology-Free Querying of Protein Interaction Networks.
Journal of Computational Biology. 17(3), 237-252.
(2010). Torque: Topology-Free Querying of Protein Interaction Networks.
Nucleic Acids Research. 37, 106-108.
(2009). Torque: Topology-Free Querying of Protein Interaction Networks.
Journal of Computational Biology. 17(3), 237-252.
(2010). Towards Optimally Multiplexed Applications of Universal Arrays.
Journal of Computational Biology. 11, 477-493.
(2004). Transitive Compaction in Parallel via Branchings.
Journal of Algorithms. 12(1), 110-125.
(1991). Two Special Cases of the Assignment Problem.
Discrete Mathematics (Netherlands). 13(2), 129-142.
(1975). When is the assignment bound tight for the asymmetric traveling-salesman problem?.
SIAM Journal on Computing. 24(3), 484-493.
(1995).
(2004).
(1980).
(2010).
(1999).
The Complexity of Testing Whether a Graph is a Superconcentrator.
13(4-5), 164-167.
(1981).
(2000).
(2011).
(1997).
(2011).
(1991).
(2004).
(2010). Global wire routing in two-dimensional arrays.
2(1), 113-129.
(1987).
(2002).
(2010).
(1998).