← Publications
Older publications
Publications from before 2017.
2016
2015
-
A constant-factor approximation for multi-covering with disks
-
Approximation Schemes for Partitioning: Convex Decomposition and Surface Approximation
-
Improving Risk Prediction of Clostridium Difficile Infection Using Temporal Event-Pairs
-
Lessons from the Congested Clique applied to MapReduce
-
On the Approximability of Orthogonal Order Preserving Layout Adjustment
-
Sub-logarithmic distributed algorithms for metric facility location
-
Toward Optimal Bounds in the Congested Clique: Graph Connectivity and MST
2014
-
Brief announcement: Super-fast t-ruling sets
-
Distributed LiDAR data processing in a high-memory cloud-computing environment
-
Do Peer Effects Improve Hand Hygiene Adherence among Healthcare Workers?
-
Guarding terrains via local search
-
Lessons from the Congested Clique Applied to MapReduce
-
Near-Constant-Time Distributed Algorithms on a Congested Clique
2013
-
A constant-factor approximation for multi-covering with disks
-
A Super-Fast Distributed Algorithm for Bipartite Metric Facility Location
-
Building self-stabilizing overlay networks with the transitive closure framework
-
Diverse near neighbor problem
-
Healthcare Worker Contact Networks and the Prevention of Hospital-Acquired Infections
-
Interactions in an intensive care unit: experiences pre-processing sensor network data
-
On the Analysis of a Label Propagation Algorithm for Community Detection
-
The Explanatory Power of Relations and an Application to an Economic Network
2012
-
A Near-Linear Algorithm for Projective Clustering Integer Points
-
Efficient Subspace Approximation Algorithms
-
On Clustering to Minimize the Sum of Radii
-
On the Sensitivity of Shape Fitting Problems
-
Super-Fast 3-Ruling Sets
-
Super-Fast Distributed Algorithms for Metric Facility Location
-
The planar k-means problem is NP-hard
2011
-
Building Self-stabilizing Overlay Networks with the Transitive Closure Framework
-
Can we identify ‘bellwether’ states with respect to syphilis incidence?
-
Distributed graph coloring in a few rounds
-
Improved Approximations for Guarding 1.5-Dimensional Terrains
-
Max-coloring and online coloring with bandwidths on interval graphs
-
Maximum Weight Digital Regions Decomposable into Digital Star-Shaped Regions
-
On Isolating Points Using Disks
-
Optimally Decomposing Coverings with Translates of a Convex Polygon
-
Topology Construction for Rural Wireless Mesh Networks - A Geometric Approach
2010
-
Algorithms for Dominating Set in Disk Graphs: Breaking the logn Barrier
-
An agent-based stochastic ruler approach for a stochastic knapsack problem with sequential competition
-
Brief announcement: a framework for building self-stabilizing overlay networks
-
Budgeted Maximum Coverage with Overlapping Costs: Monitoring the Emerging Infections Network
-
Modeling and estimating the spatial distribution of healthcare workers
-
On Metric Clustering to Minimize the Sum of Radii
-
Prioritizing Healthcare Worker Vaccinations on the Basis of Social Network Analysis
-
Rapid randomized pruning for fast greedy distributed algorithms
-
Stabilizing pipelines for streaming applications
-
Sub-coloring and hypo-coloring interval graphs
-
Sub-coloring and Hypo-coloring Interval Graphs
-
Terrain Guarding is NP-Hard
-
Weighted geometric set cover via quasi-uniform sampling
2009
-
An Approximation Scheme for Terrain Guarding
-
Approximation Algorithms for Domatic Partitions of Unit Disk Graphs
-
Brief announcement: optimal self-stabilizing multi-token ring: a randomized solution
-
Dissecting Self-* Properties
-
Epsilon nets and union complexity
-
Fault-Containment in Weakly-Stabilizing Systems
-
Return of the primal-dual: distributed metric facility location
-
The Planar k-Means Problem is NP-Hard
-
Wireless applications for hospital epidemiology
2008
-
An experimental study of different approaches to solve the market equilibrium problem
-
Finding Facilities Fast
-
On Clustering to Minimize the Sum of Radii
-
On Metric Clustering to Minimize the Sum of Radii
-
On the Efficiency of a Local Iterative Algorithm to Compute Delaunay Realizations
-
Practical Methods for Shape Fitting and Kinetic Data Structures using Coresets
-
Some perfect matchings and perfect half-integral matchings in NC
-
The Randomized Coloring Procedure with Symmetry-Breaking
2007
-
Approximating the Radii of Point Sets
-
Efficient Subspace Approximation Algorithms
-
Extending Polynomial Time Computability to Markets with Demand Correspondences
-
Fault-containing self-stabilizing distributed protocols
-
Good Quality Virtual Realization of Unit Ball Graphs
-
Improved Approximation Algorithms for Geometric Set Cover
-
Probabilistic Fault-Containment
-
Sampling-based dimension reduction for subspace approximation
-
Temporal Partition in Sensor Networks
-
Topology Control and Geographic Routing in Realistic Wireless Networks
2006
-
Computing Equilibrium Prices in Exchange Economies with Tax Distortions
-
Distributed Spanner Construction in Doubling Metric Spaces
-
Energy conservation via domatic partitions
-
Equilibria for economies with production: constant-returns technologies and production planning constraints
-
Introduction to the Non-rigid Image Registration Evaluation Project (NIREP)
-
Leontief economies encode nonzero sum two-player games
-
Local approximation schemes for topology control
-
Topology Control with Limited Geometric Information
2005
-
Approximating interval coloring and max-coloring in chordal graphs
-
Approximation Algorithms for the Max-coloring Problem
-
Computing Equilibrium Prices: Does Theory Meet Practice?
-
Improved approximation algorithms for geometric set cover
-
Market Equilibrium for CES Exchange Economies: Existence, Multiplicity, and Computation
-
Market equilibrium via the excess demand function
-
No Coreset, No Cry: II
-
Robust Topology Control Protocols
2004
-
A near-linear constant-factor approximation for euclidean bipartite matching?
-
Approximating extent measures of points
-
Approximating Interval Coloring and Max-Coloring in Chordal Graphs
-
Computing Optimal Diameter-Bounded Polygon Partitions
-
Efficient Computation of Equilibrium Prices for Markets with Leontief Utilities
-
High-Dimensional Shape Fitting in Linear Time
-
Practical methods for shape fitting and kinetic data structures using core sets
-
The computation of market equilibria