Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009 | ||
---|---|---|

17 | EE | V. Siva Sankar, H. Narayanan, Sachin B. Patkar: Exploiting Hybrid Analysis in Solving Electrical Networks. VLSI Design 2009: 206-211 |

16 | EE | Vinay B. Y. Kumar, Siddharth Joshi, Sachin B. Patkar, H. Narayanan: FPGA Based High Performance Double-Precision Matrix Multiplication. VLSI Design 2009: 341-346 |

2003 | ||

15 | EE | Sachin B. Patkar, H. Narayanan: An Efficient Practical Heuristic For Good Ratio-Cut Partitioning. VLSI Design 2003: 64-69 |

14 | EE | Madhav P. Desai, H. Narayanan, Sachin B. Patkar: The realization of finite state machines by decomposition and the principal lattice of partitions of a submodular function. Discrete Applied Mathematics 131(2): 299-310 (2003) |

13 | EE | Sachin B. Patkar, H. Narayanan: Improving graph partitions using submodular functions. Discrete Applied Mathematics 131(2): 535-553 (2003) |

12 | EE | Sachin B. Patkar, H. Narayanan: Fast On-Line/Off-Line Algorithms for Optimal Reinforcement of a Network and its Connections with Principal Partition. J. Comb. Optim. 7(1): 45-68 (2003) |

2001 | ||

11 | EE | Satoru Fujishige, Sachin B. Patkar: Realization of set functions as cut functions of graphs and hypergraphs. Discrete Mathematics 226(1-3): 199-210 (2001) |

10 | EE | Sachin B. Patkar, H. Narayanan: A note on optimal covering augmentation for graphic polymatroids. Inf. Process. Lett. 79(6): 285-290 (2001) |

2000 | ||

9 | EE | Sachin B. Patkar, H. Narayanan: Fast On-Line/Off-Line Algorithms for Optimal Reinforcement of a Network and Its Connections with Principal Partition. FSTTCS 2000: 94-105 |

1999 | ||

8 | C. R. Venugopal, S. S. S. P. Rao, Sachin B. Patkar: Priority Scheduling in Parallel I/O Systems. PDPTA 1999: 2554-2560 | |

1997 | ||

7 | EE | Sachin B. Patkar, Shabbir H. Batterywala, M. Chandramouli, H. Narayanan: A New Partitioning Strategy Based on Supermodular Functions. VLSI Design 1997: 32-37 |

1996 | ||

6 | H. Narayanan, Subir Roy, Sachin B. Patkar: Approximation Algorithms for Min-k-Overlap Problems Using the Principal Lattice of Partitions Approach. J. Algorithms 21(2): 306-330 (1996) | |

1994 | ||

5 | H. Narayanan, Subir Roy, Sachin B. Patkar: Approximation Algorithms for Min-k-overlap Problems Using the Principal Lattice of Partitions Approach. MFCS 1994: 525-535 | |

4 | EE | Sachin B. Patkar, Brigitte Servatius, K. V. Subrahmanyam: Abstract and Generic Rigidity in the Plane. J. Comb. Theory, Ser. B 62(1): 107-113 (1994) |

1992 | ||

3 | Sachin B. Patkar, H. Narayanan: Fast Sequential and Randomised Parallel Algorithms for Rigidity and approximate Min k-cut. FSTTCS 1992: 265-278 | |

2 | Sachin B. Patkar, H. Narayanan: Principal Lattice of Partition of submodular functions on Graphs: Fast algorithms for Principal Partition and Generic Rigidity. ISAAC 1992: 41-50 | |

1991 | ||

1 | Sachin B. Patkar, H. Narayanan: A Fast Algorithm for the Principle Partition of a Graph. FSTTCS 1991: 288-306 |

1 | Shabbir H. Batterywala | [7] |

2 | M. Chandramouli | [7] |

3 | Madhav P. Desai | [14] |

4 | Satoru Fujishige | [11] |

5 | Siddharth Joshi | [16] |

6 | Vinay B. Y. Kumar | [16] |

7 | H. Narayanan | [1] [2] [3] [5] [6] [7] [9] [10] [12] [13] [14] [15] [16] [17] |

8 | S. S. S. P. Rao | [8] |

9 | Subir Roy | [5] [6] |

10 | V. Siva Sankar | [17] |

11 | Brigitte Servatius | [4] |

12 | K. V. Subrahmanyam | [4] |

13 | C. R. Venugopal | [8] |