- Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
- Algorithms for Minimizing Response Time in Broadcast Scheduling ?
- Dependent Rounding in Bipartite Graphs Rajiv Gandhi
- Domain Name Based Visualization of Web Histories in a Zoomable User Interface
- Improved Results for Data Migration and Open Shop Scheduling
- Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks
- Domain Name Based Visualization of Web Histories in a Zoomable User Interface
- Dependent Rounding and its Applications to Approximation Algorithms
- Improved Results for Data Migration and Open Shop Scheduling
- Approximation Algorithms for Data Broadcast in Wireless Networks Rajiv Gandhi # , YooAh Kim + , Seungjoon Lee # , Jiho Ryu , and PengJun Wan
- An Improved Approximation Algorithm For Vertex Cover with Hard Capacities
- Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks
- Algorithms for Minimizing Response Time in Broadcast Scheduling ?
- Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
- Dependent Rounding and its Applications to Approximation Algorithms
- Subcoloring and Hypocoloring Interval Graphs # Rajiv Gandhi 1 , Bradford Greening, Jr. 1 , Sriram Pemmaraju 2 , and Rajiv Raman 3
- Sub-coloring and Hypo-coloring Interval Graphs Rajiv Gandhi1, Bradford Greening, Jr.1, Sriram Pemmaraju2, and Rajiv Raman3
- An Improved Approximation Algorithm For Vertex Cover with Hard Capacities
- Combinatorial Algorithms for Data Migration to Minimize Average Completion Time #
- Approximation Algorithms for Channel Allocation Problems in Broadcast Networks
- Approximation algorithms for partial covering (Extended Abstract)
- Minimizing Broadcast Latency and Redundancy in Ad Hoc Rajiv Gandhi
- Minimizing Broadcast Latency and Redundancy in Ad Hoc Networks
- Minimizing Broadcast Latency and Redundancy in Ad Hoc Networks
- Approximation Algorithms for Data Broadcast in Wireless Networks Rajiv Gandhi, Yoo-Ah Kim, Seungjoon Lee, Jiho Ryu, and Peng-Jun Wan
- Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
- Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum
- Minimizing Broadcast Latency and Redundancy in Ad Hoc Rajiv Gandhi
- CS:50:198:213 Data Structures
- Project Geographic Information System Given: September 30, 2010 Due: November 11, 2010
- Distributed Algorithms for Connected Domination in Wireless Networks
- Improved Bounds for Scheduling Conflicting Jobs with Minsum Criteria
- Approximation Algorithms for Channel Allocation Problems in Broadcast Networks
- Distributed Algorithms for Connected Domination in Wireless Networks
- Improved Results for Data Migration and Open Shop Scheduling
- Improved Bounds for Scheduling Conflicting Jobs with Minsum Criteria
- Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum
- Dependent Rounding in Bipartite Graphs Rajiv Gandhi Samir Khuller y Srinivasan Parthasarathy z Aravind Srinivasan x
- Approximation Algorithms for Partial Covering Problems Rajiv Gandhi y Samir Khuller z Aravind Srinivasan x
- A Simple Min-Cut Algorithm MECHTHILD STOER
- CS:50:198:371 Design and Analysis of Algorithms Course Specifics
- CS:50:198:171 Mathematical Foundations of Computer Science
- CS:50:198:171 Mathematical Foundations of Computer Science
