Graphs in Combinatorica.
Here is more about Combinatorica.
101 G McLean Hall, Department of Computer Science,
The University of Iowa, Iowa City, IA 52242-1419
319 353 2956 (voice), 319 335 3624 (fax)
1:30pm-2:30pm Mondays, 10:30am-11:30am Wednesdays, 2pm-3pm Fridays and by appointment.
Broadly speaking, my research area is theoretical computer
science. More specifically, my research interests are in
distributed algorithms, randomization, approximation algorithms and combinatorial
optimization, and combinatorics and graph theory.
I am part of the Algorithms Research Group at Iowa.
Recently, I have become interested in models and algorithms for social networks
and am part of the Computational Epidemiology Group at Iowa.
See my dblp page for a longer list of publications.
- Improving risk prediction of Clostridium Difficile Infection using temporal event-pairs
with Mauricio Monsalve and Philip M. Polgreen.
IEEE International Conference on Healthcare Informatics 2015 (ICHI 2015), Oct 2015.
- Toward Optimal Bounds in the Congested Clique: Graph Connectivity and MST
with James W. Hegeman, Gopal Pandurangan, Vivek B. Sardeshmukh and Michele Scquizzato.
Thirty-fourth Annual ACM SIGACT-SIGOPS Symposium on Principles of
Distributed Computing (PODC 2015), July 2015.
- Sub-logarithmic distributed algorithms for metric facility location
with James W. Hegeman.
Distributed Computing, April 2015.
- Do Peer Effects Improve Hand Hygiene Adherence among Healthcare Workers?
with Mauricio N. Monsalve, Geb W. Thomas, Ted Herman, Alberto M. Segre, and Philip M. Polgreen.
Infection Control and Hospital Epidemiology, Vol. 35, No. 10, Oct 2014, 1277–1285.
- Near-Constant-Time Distributed Algorithms on a Congested Clique
with James W. Hegeman and Vivek B. Sardeshmukh,
28th International Symposium on Distributed Computing (DISC 2014).
Full paper at arxiv.
- Lessons from the Congested Clique Applied to MapReduce
with James Hegeman,
21th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2014).
Full paper at arxiv.
- Brief Announcement: Super-Fast t-Ruling Sets
with Tushar Bisht and Kishore Kothapalli,
Thirty-third Annual ACM SIGACT-SIGOPS Symposium on Principles of
Distributed Computing (PODC 2014).
- Healthcare Worker Contact Networks and the Prevention of Hospital-Acquired Infections
with Donald E. Curtis, Christopher S. Hlady, Gaurav Kanade,
Philip M. Polgreen, and Alberto M. Segre.
PLOS One, Dec 2013.
Interactions in an Intensive Care Unit: Experiences Pre-Processing Sensor Network Data
with Mauricio Monsalve and Philip M. Polgreen,
4th Annual Wireless Health Conference, 2013, Nov 2013.
James Hegeman, Vivek Sardeshmukh,
- Former Students:
Mauricio Monsalve (2015, U of Iowa),
Andrew Berns (2012, U of Wisconsin La Crosse),
Donald Curtis (2011, Google),
Saurav Pandit (2010, Intent Media NYC),
Imran Pirwani (2008, Apple Inc),
Kevin Lillis (2008, St.Ambrose University),
Rajiv Raman (2007, IIIT Delhi).
Current Teaching (spring 2016): Design and Analysis of Algorithms (for graduate students).
Here you can find course pages of classes I have taught since 2001.
Other Recent Activities:
Back to the departmental homepage.