Samir Khuller

Q: What Schools Are Affiliated With Samir Khuller

Samir Khuller is affiliated with the following schools: University of Maryland, College Park, Northwestern University, Cornell University

Samir Khuller's AcademicInfluence.com Rankings

Samir Khuller

Computer Science

#7570

World Rank

#7970

Historical Rank

Database

#4618

World Rank

#4797

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Samir Khuller's Degrees

PhD Computer Science Stanford University
Masters Computer Science Stanford University

Similar Degrees You Can Earn

Why Is Samir Khuller Influential?

(Suggest an Edit or Addition)

(See a Problem?)

Samir Khuller's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Approximation Algorithms for Connected Dominating Sets (1996) (1088)
The Budgeted Maximum Coverage Problem (1999) (894)
Greedy strikes back: improved facility location algorithms (1998) (670)
A clustering scheme for hierarchical control in multi-hop wireless networks (2001) (649)
Landmarks in Graphs (1996) (648)
Construction of an efficient overlay multicast infrastructure for real-time applications (2003) (435)
Algorithms for facility location problems with outliers (2001) (404)
Approximation Algorithms for Connected Dominating Sets (1998) (392)
Achieving anonymity via clustering (2006) (389)
On Finding Dense Subgraphs (2009) (264)
Dependent rounding and its applications to approximation algorithms (2006) (261)
Approximation algorithms for partial covering problems (2001) (230)
Balancing minimum spanning trees and shortest-path trees (1995) (227)
Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets (1998) (221)
Biconnectivity approximations and graph carvings (1992) (193)
The Capacitated K-Center Problem (2000) (179)
Open problems (1997) (176)
Balancing Minimum Spanning and Shortest Path Trees (1993) (176)
Improved approximation algorithms for uniform connectivity problems (1995) (165)
On-Line Algorithms for Weighted Bipartite Matching and Stable Marriages (1991) (160)
Approximation algorithms for finding highly connected subgraphs (1996) (148)
Approximation Algorithms for Graph Augmentation (1992) (132)
On directed Steiner trees (2002) (131)
Relay Placement for Higher Order Connectivity in Wireless Sensor Networks (2006) (127)
To fill or not to fill: The gas station problem (2007) (112)
The complexity of finding most vital arcs and nodes (1995) (107)
Dense Subgraphs with Restrictions and Applications to Gene Annotation Graphs (2010) (105)
Fault tolerant K-center problems (1997) (99)
Approximating the minimum equivalent digraph (1994) (93)
Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem (1998) (90)
Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity (2008) (88)
Algorithms for data migration with cloning (2003) (83)
Low-Degree Spanning Trees of Small Weight (1996) (82)
SWORD: workload-aware data placement and replica selection for cloud data management systems (2014) (80)
On the cost of essentially fair clusterings (2018) (76)
Biconnectivity approximations and graph carvings (1994) (75)
OMNI: An efficient overlay multicast infrastructure for real-time applications (2006) (73)
Capacitated vertex covering (2003) (73)
A Simple Randomized Sieve Algorithm for the Closest-Pair Problem (1995) (73)
LP Rounding for k-Centers with Non-uniform Hard Capacities (2012) (72)
An improved approximation algorithm for vertex cover with hard capacities (2003) (72)
Approximation algorithms for data placement on parallel disks (2000) (68)
A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Covers (1994) (67)
Localization in graphs (1994) (66)
Energy efficient scheduling via partial shutdown (2009) (61)
Algorithms for capacitated vehicle routing (1998) (60)
Algorithms column: the vertex cover problem (2002) (59)
A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees (1996) (58)
Dependent rounding in bipartite graphs (2002) (58)
A coordinated data collection approach: design, evaluation, and comparison (2004) (55)
z-Approximations (2001) (54)
A Clustering Scheme for Hierarchical Control in Wireless Networks (2001) (53)
The Lattice Structure of Flow in Planar Graphs (1993) (52)
Efficient parallel algorithms for testing connectivity and finding disjoint s-t paths in graphs (1989) (52)
Data Placement and Replica Selection for Improving Co-location in Distributed Environments (2013) (51)
Link Prediction for Annotation Graphs Using Graph Summarization (2011) (50)
Algorithms for Minimizing Response Time in Broadcast Scheduling (2002) (47)
Achieving anonymity via clustering (2010) (47)
Four colors suffice! (2005) (47)
On Computing Compression Trees for Data Collection in Wireless Sensor Networks (2010) (46)
Computing most probable worlds of action probabilistic logic programs: scalable estimation for 1030,000 worlds (2007) (45)
On Independent Spanning Trees (1992) (44)
On local search and placement of meters in networks (2000) (44)
Minimizing Communication Cost in Distributed Multi-query Processing (2009) (42)
On Strongly Connected Digraphs with Bounded Cycle Length (1996) (42)
Analyzing the Optimal Neighborhood: Algorithms for Budgeted and Partial Connected Dominating Set Problems (2013) (41)
Approximating the Minimal Sensor Selection for Supervisory Control (2004) (41)
Broadcast scheduling: Algorithms and complexity (2008) (41)
Algorithms for non-uniform size data placement on parallel disks (2003) (40)
Integrated topology control and routing in wireless optical mesh networks (2007) (39)
The General Steiner Tree-Star problem (2002) (35)
On a Triangle Counting Problem (1990) (35)
Capacitated vertex covering with applications (2002) (34)
LP rounding and combinatorial algorithms for minimizing active and busy time (2014) (33)
Graph and network algorithms (1996) (32)
Relay placement for fault tolerance in wireless networks in higher dimensions (2011) (32)
Large-scale data collection: a coordinated approach (2003) (31)
A Clustering Scheme for Hierarchical Routing in Wireless Networks (2000) (30)
On broadcasting in heterogenous networks (2004) (30)
Query Planning in the Presence of Overlapping Sources (2006) (30)
Energy Efficient Monitoring in Sensor Networks (2008) (29)
An Illustrated Fern Flora of the West Himalaya (Volume II) (2000) (29)
Broadcasting in Heterogeneous Networks (2007) (29)
Efficient minimum cost matching using quadrangle inequality (1992) (29)
On generalized gossiping and broadcasting (2006) (28)
Geometric knapsack problems (1991) (28)
Assignment Problem (2008) (28)
A uniform framework for approximating weighted connectivity problems (1999) (28)
A Model for Minimizing Active Processor Time (2012) (27)
Algorithms for Minimizing Response Time in Broadcast Scheduling (2003) (26)
The vertex cover problem (2002) (25)
Brief Announcement: Improved Approximation Algorithms for Scheduling Co-Flows (2016) (25)
Optimal Batch Schedules for Parallel Machines (2013) (24)
Designing Multi-Commodity Flow Trees (1993) (24)
Finding Most Probable Worlds of Probabilistic Logic Programs (2007) (23)
Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality (1995) (23)
A Pairwise Fair and Community-preserving Approach to k-Center Clustering (2020) (22)
Bistro: a framework for building scalable wide-area Upload applications (2000) (22)
Set Cover Revisited: Hypergraph Cover with Hard Capacities (2012) (22)
A robust maximum completion time measure for scheduling (2006) (22)
To send or not to send: Reducing the cost of data transmission (2013) (22)
Online allocation of display advertisements subject to advanced sales contracts (2009) (21)
Processor efficient parallel algorithms for the two disjoint paths problem, and for finding a Kuratowski homeomorph (1989) (21)
On Scheduling Coflows (2020) (20)
The load‐distance balancing problem (2012) (20)
Generalized machine activation problems (2011) (20)
Facility Location with Dynamic Distance Functions (1998) (19)
Flow in planar graphs with vertex capacities (1990) (19)
Fast Reconfiguration of Data Placement in Parallel Disks (2006) (17)
The full degree spanning tree problem (1999) (17)
Near Optimal Coflow Scheduling in Networks (2019) (17)
Min-Max Correlation Clustering via MultiCut (2019) (17)
Planar Graph Coloring is not Self-Reducible, Assuming P != NP (1991) (15)
Data Migration on Parallel Disks (2004) (15)
Select and Permute: An Improved Online Framework for Scheduling to Minimize Weighted Completion Time (2017) (15)
Applied algorithms and data structures series (2010) (14)
Improved Algorithms for Data Migration (2006) (14)
A Model for Minimizing Active Processor Time (2014) (14)
A Secure and Scalable Wide-Area Upload Service (2001) (14)
An Optimal Incremental Algorithm for Minimizing Lateness with Rejection (2008) (14)
Graph Connectivity (2008) (14)
Broadcasting on Networks of Workstations (2005) (14)
On Degree Constrained Shortest Paths (2005) (13)
Efficient and Resilient Backbones for Multihop Wireless Networks (2008) (13)
An Algorithm for Multi-Attribute Diverse Matching (2019) (13)
The loading time scheduling problem (1995) (13)
Saving on cooling: the thermal scheduling problem (2012) (12)
Basic Graph Algorithms (2010) (12)
New Models and Algorithms for Throughput Maximization in Broadcast Scheduling - (Extended Abstract) (2010) (11)
On-line Algorithms for Weighted Matching and Stable Marriages (1990) (11)
Topology Control and Routing over Wireless Optical Backbone Networks (2004) (11)
Resolving spatial inconsistencies in chromosome conformation measurements (2013) (11)
Brief Announcement: A Greedy 2 Approximation for the Active Time Problem (2018) (10)
Algorithms for the Thermal Scheduling Problem (2013) (10)
On Computing Graph Closures (1989) (10)
Optimal collective dichotomous choice under partial order constraints (2001) (10)
Data migration on parallel disks: Algorithms and evaluation (2006) (9)
Busy Time Scheduling on a Bounded Number of Machines (Extended Abstract) (2017) (9)
Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems (2020) (8)
Centers of sets of pixels (2000) (8)
The full‐degree spanning tree problem (2000) (8)
Bistro: a scalable and secure data transfer service for digital government applications (2003) (8)
An O(|V|2) algorithm for single connectedness (1999) (8)
Equivalence of two linear programming relaxations for broadcast scheduling (2004) (7)
Extending Planar Graph Algorithms to K_3,3-Free Graphs (1990) (7)
The Capacitated K-Center Problem (Extended Abstract) (1996) (7)
Addendum to "An O(|V|2) algorithm for single connectedness" (2000) (6)
Parallel Algorithms for $K_{5}$-minor Free Graphs (1988) (6)
Design and analysis of algorithms: course notes (1993) (6)
Greedy Methods (2007) (6)
Facility Location with Dynamic Distance Function (Extended Abstract) (1998) (5)
The landscape of receptor-mediated precision cancer combination therapy via a single-cell perspective (2020) (5)
Multi-transversals for Triangles and the Tuza's Conjecture (2020) (5)
Connected facility location problems (1997) (5)
Constant Factor Approximation Algorithm for Uniform Hard Capacitated Knapsack Median Problem (2018) (5)
Low degree spanning trees of small weight (1994) (5)
On Computing Compression Trees for Data Collection in Sensor Networks (2009) (5)
On a Graph-theoretic Approach to Scheduling Large-scale Data Transfers (2002) (5)
A performance study of Bistro, a scalable upload architecture (2002) (5)
Bases for Polynomial Invariants of Conjugates of Permutation Groups (1999) (5)
Scheduling Distributed Clusters of Parallel Machines : Primal-Dual and LP-based Approximation Algorithms (2016) (4)
On Scheduling Coflows - (Extended Abstract) (2017) (4)
On the tradeoff between playback delay and buffer space in streaming (2009) (4)
Graphbots: Mobility in Discrete Spaces (1995) (4)
Localizing an object with finger probes (1995) (4)
Revisiting Connected Dominating Sets: An Optimal Local Algorithm? (2018) (4)
A Performance Study of a Large-scale Data Collection Problem (2002) (4)
Algorithms column: An overview of the recent progress on matrix multiplication by Virginia Vassilevska Williams (2012) (4)
New Approximation Results for Resource Replication Problems (2012) (4)
Primal-dual algorithms for combinatorial optimization problems (2007) (4)
On Correcting Inputs: Inverse Optimization for Online Structured Prediction (2015) (4)
Open problems: 3 (1989) (4)
Efficient Robust Parallel Computations (Extended Abstract) (1990) (3)
Problems column (2007) (3)
Performance tradeoffs in structured peer to peer streaming (2012) (3)
Algorithms column (2001) (3)
Advanced Combinatorial Algorithms (2010) (3)
Improved Approximation Algorithms for Data Migration (2012) (3)
Facility location with red-blue demands (2014) (3)
Maintaining directed reachability with few edges (1993) (3)
A Min-Edge Cost Flow Framework for Capacitated Covering Problems (2013) (3)
On Generalized Gossiping and Broadcasting (Extended Abstract) (2003) (3)
LP rounding and combinatorial algorithms for minimizing active and busy time (2017) (3)
Graphbots: cooperative motion planning in discrete spaces (1998) (3)
Revisiting Connected Dominating Sets: An Almost Optimal Local Information Algorithm (2019) (3)
Approximation algorithms for channel allocation problems in broadcast networks (2003) (3)
Scheduling ML training on unreliable spot instances (2021) (2)
Extending Planar Graph Algorithms to K 3, 3-free Graphs (1988) (2)
Optimal enclosure problems (1990) (2)
INDUCED CHROMOSOMAL ABERRATIONS IN DIPLOID AND COLCHITETRAPLOID PHLOX DRUMMONDII (1998) (2)
Coloring Algorithms for K_5-Minor Free Graphs (1990) (2)
Efficient Parallel Algorithms for Testing Connectivity and Finding Disjoint s-t Paths in Graphs (Extended Summary) (1989) (2)
Resolving Spatial Inconsistencies in Chromosome Conformation Data (2012) (2)
Approximation Schemes for Broadcasting in Heterogenous Networks (2004) (2)
Ring graphs in VR: exploring a new and novel method for node placement and link visibility in VR-based graph analysis (2018) (2)
On the Parallel Complexity of Digraph Reachability (1994) (2)
An improved approximation algorithm for vertex cover with hard capacities (extended abstract) (2003) (2)
Problems column (2005) (2)
Minimizing Uncertainty through Sensor Placement with Angle Constraints (2016) (2)
LP Randomized Rounding for Maximum Coverage Problem and Minimum Set Cover with Threshold Problem (2005) (2)
Ju n 20 19 Min-Max Correlation Clustering via MultiCut ⋆ (2019) (1)
Algorithms for Data Migration Algorithms for Data Migration (1)
Approximation algorithms for partial covering problems extended abstract (2001) (1)
Problems column (2006) (1)
Scalable and Secure Data Collection Using Bistro (2002) (1)
Approximation algorithms for combinatorial optimization : Third International Workshop, APPROX 2000, Saarbrücken, Germany, September 5-8, 2000 : proceedings (2000) (1)
Approximation algorithms for scheduling problems (1998) (1)
Resolving spatial inconsistencies in chromosome conformation measurements (2013) (1)
Algorithms Column: Approximating metrics by tree metrics (2004) (1)
The Loading Time Scheduling Problem 1 (1995) (1)
Broadcast scheduling (2003) (1)
Special Issue on papers from the 2019 Workshop on Models and Algorithms for Planning and Scheduling Problems (2022) (0)
New Approximation Results for Resource Replication Problems (2015) (0)
Correlated Stochastic Knapsack with a Submodular Objective (2022) (0)
6 Basic Graph Algorithms (1998) (0)
Assigning Papers to Reviewers (2012) (0)
Kuhn meets Rosenblatt : Combinatorial Algorithms for Online Structured Prediction (2013) (0)
Flow in Planar Graphs: A Survey of Results (1991) (0)
Algorithms for Calculating Statistical Properties of Moving Points (2009) (0)
On Diverse Bipartite b-Matching (2020) (0)
Guest Editors’ Introduction (2003) (0)
Flow in Planar Graphs with Vertex Capacities 1 (0)
Relay Placement Approximation Algorithms for k-Connectivity in Wireless Sensor Networks (2006) (0)
Open Problems 14 (1996) (0)
SWORD: workload-aware data placement and replica selection for cloud data management systems (2014) (0)
Improved Approximation Algorithms for Data Migration (2011) (0)
Special Issue in Honor of Rajeev Motwani (1962-2009): Guest Editors' Foreword (2012) (0)
Abstract CC01-01: The landscape of precision cancer combination therapy: A single-cell perspective (2021) (0)
Open Problems: 11 (1995) (0)
Session details: Session 3B (2003) (0)
Parallel Algorithms for the Subgraph Homeomorphism Problem (1989) (0)
D ec 2 00 9 Energy Efficient Scheduling via Partial Shutdown (2021) (0)
Vertex connectivity in poly-logarithmic max-flows (2021) (0)
ALGORITHMS FOR CAPACITATED VEHICLEROUTING (0)
The Book Review Column (1999) (0)
Revisiting Connected Dominating Sets: An Almost Optimal Local Information Algorithm (2019) (0)
Open Problems: 13 (1996) (0)
Approximation algorithms for partial covering problems ( Submission to ICALP 2001 , Track A ) (2001) (0)
Open problems (1990) (0)
Discrete Algorithms Meet Machine Learning (NII Shonan Meeting 2013-6) (2013) (0)
Localizing an object with nger probes (2006) (0)
The Loading Time Scheduling Problem (Extended Abstract). (1995) (0)
Efficient Parallel Algorithms for Disjoint Paths and Connectivity (1990) (0)
Book review: Selected Papers on Computer Science by Donald E. Knuth (1998) (0)
Open problems: 16 (1998) (0)
Balancing Flow Time and Energy Consumption (2022) (0)
Approximation algorithms for facility location problems (1999) (0)
Algorithms for Optimal Diverse Matching (2019) (0)
Constant factor Approximation Algorithm for 1 Uniform Hard Capacitated Knapsack Median (2018) (0)
Abstract 2688: The landscape of precision cancer combination therapy: a single-cell perspective (2021) (0)
Open Problems Presented at SCG'98 (1999) (0)
LP-based approximation for uniform capacitated facility location problem (2022) (0)
Individual Preference Stability for Clustering (2022) (0)
Scheduling Distributed Clusters of Parallel Machines : Primal-Dual and LP-based Approximation Algorithms (2017) (0)
Session details: Session 11B (2003) (0)
Algorithmic Problems in Data Management (0)
An Algorithmic Approach to Address Course Enrollment Challenges (2023) (0)

This paper list is powered by the following services:

What Schools Are Affiliated With Samir Khuller?

Samir Khuller is affiliated with the following schools:

Samir Khuller's Academic­Influence.com Rankings