| 2008 |
|---|
| 16 | EE | Shashidhar Gandham,
Milind Dawande,
Ravi Prakash:
Link scheduling in wireless sensor networks: Distributed edge-coloring revisited.
J. Parallel Distrib. Comput. 68(8): 1122-1134 (2008) |
| 2007 |
|---|
| 15 | EE | Subodha Kumar,
Milind Dawande,
Vijay S. Mookerjee:
Optimal Scheduling and Placement of Internet Banner Advertisements.
IEEE Trans. Knowl. Data Eng. 19(11): 1571-1584 (2007) |
| 2005 |
|---|
| 14 | EE | Shashidhar Gandham,
Milind Dawande,
Ravi Prakash:
Link scheduling in sensor networks: distributed edge coloring revisited.
INFOCOM 2005: 2492-2501 |
| 13 | EE | H. Neil Geismar,
Milind Dawande,
Chelliah Sriskandarajah:
Approximation algorithms for k.
European Journal of Operational Research 162(2): 291-309 (2005) |
| 12 | EE | Milind Dawande,
Subodha Kumar,
Chelliah Sriskandarajah:
Scheduling Web Advertisements: A Note on the Minspace Problem.
J. Scheduling 8(1): 97-106 (2005) |
| 11 | EE | Milind Dawande,
H. Neil Geismar,
Suresh P. Sethi,
Chelliah Sriskandarajah:
Sequencing and Scheduling in Robotic Cells: Recent Developments.
J. Scheduling 8(5): 387-426 (2005) |
| 2004 |
|---|
| 10 | EE | H. Neil Geismar,
Milind Dawande,
Chelliah Sriskandarajah:
Robotic Cells with Parallel Machines: Throughput Maximization in Constant Travel-Time Cells.
J. Scheduling 7(5): 375-395 (2004) |
| 2003 |
|---|
| 9 | EE | Milind Dawande:
A notion of cross-perfect bipartite graphs.
Inf. Process. Lett. 88(4): 143-147 (2003) |
| 8 | | Milind Dawande,
Subodha Kumar,
Chelliah Sriskandarajah:
Performance Bounds of Algorithms for Scheduling Advertisements on a Web Page.
J. Scheduling 6(4): 373-394 (2003) |
| 2001 |
|---|
| 7 | EE | Milind Dawande:
A Notion of Cross-Perfect Bipartite Graphs.
COCOON 2001: 409-413 |
| 6 | EE | Milind Dawande,
Subodha Kumar,
Chelliah Sriskandarajah:
Scheduling Advertisements on a Web Page: New and Improved Approximation Algorithms.
Electronic Notes in Discrete Mathematics 7: 134-137 (2001) |
| 5 | EE | Milind Dawande,
Jayant Kalagnanam,
Jay Sethuraman:
Variable Sized Bin Packing With Color Constraints.
Electronic Notes in Discrete Mathematics 7: 154-157 (2001) |
| 4 | EE | Milind Dawande,
Pinar Keskinocak,
Jayashankar M. Swaminathan,
Sridhar Tayur:
On Bipartite and Multipartite Clique Problems.
J. Algorithms 41(2): 388-403 (2001) |
| 2000 |
|---|
| 3 | | Milind Dawande,
Jayant Kalagnanam,
Pinar Keskinocak,
F. Sibel Salman,
R. Ravi:
Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions.
J. Comb. Optim. 4(2): 171-186 (2000) |
| 1998 |
|---|
| 2 | EE | Gérard Cornuéjols,
Milind Dawande:
A Class of Hard Small 0-1 Programs.
IPCO 1998: 284-293 |
| 1995 |
|---|
| 1 | | Sebastián Ceria,
Gérard Cornuéjols,
Milind Dawande:
Combining and Strengthening Gomory Cuts.
IPCO 1995: 438-451 |
