
DSpace at IIT Bombay >
Browsing by Author NARAYANAN, H
Showing results 19 to 38 of 46
Issue Date  Title  Author(s)  2003  Improving graph partitions using submodular functions  PATKAR, SB; NARAYANAN, H 
2002  Mathematical methods in VLSI  ATRE, MV; SUBRAMANIAN, S; NARAYANAN, H 
2004  Mathematical programming and resistor transformer diode networks  NARAYANAN, H 
1978  MAXIMUM POWER TRANSFER THEOREM  NARAYANAN, H 
1991  A new approach to the problem of PLA partitioning using the theory of the principal lattice of partitions of a submodular function  ROY, SUBIR; NARAYANAN, H 
1997  A new partitioning strategy based on supermodular functions  PATKAR, SACHIN; BATTERYWALA, SH; CHANDRAMOULI, M; NARAYANAN, H 
2001  A note on optimal covering augmentation for graphic polymatroids  PATKAR, SB; NARAYANAN, H 
2003  A note on the minimization of symmetric and general submodular functions  NARAYANAN, H 
2002  On duality of behavioural systems  PILLAI, HK; NARAYANAN, H 
2005  On set functions that can be extended to convex functionals  NARAYANAN, H 
1990  ON THE MINIMUM HYBRID RANK OF A GRAPH RELATIVE TO A PARTITION OF ITS EDGES AND ITS APPLICATION TO ELECTRICAL NETWORK ANALYSIS  NARAYANAN, H 
2014  On the notion of generalized minor in topological network theory and matroids  THEJA, S; NARAYANAN, H 
2000  Orthogonal partitioning and gated clock architecture for low power realization of FSMs  SHELAR, RUPESH S; NARAYANAN, H; DESAI, MP 
2007  Parallelization of DC analysis through multiport decomposition  TRIVEDI, GAURAV; DESAI, MP; NARAYANAN, H 
2008  Polyhedrally tight set functions and discrete convexity  FUJISHIGE, S; NARAYANAN, H 
1991  THE PRINCIPAL LATTICE OF PARTITIONS OF A SUBMODULAR FUNCTION  NARAYANAN, H 
1992  PRINCIPAL LATTICE OF PARTITIONS OF SUBMODULAR FUNCTIONS ON GRAPHS  FAST ALGORITHMS FOR PRINCIPAL PARTITION AND GENERIC RIGIDITY  PATKAR, S; NARAYANAN, H 
1992  Principal lattice of partitions of submodular functions on graphs  fast algorithms for principal partition and generic rigidity  PATKAR, S; NARAYANAN, H 
1994  RANDOMIZED PARALLEL ALGORITHMS FOR MATROID UNION AND INTERSECTION, WITH APPLICATIONS TO ARBORESENCES AND EDGEDISJOINT SPANNINGTREES  NARAYANAN, H; SARAN, H; VAZIRANI, VV 
2003  The realization of finite state machines by decomposition and the principal lattice of partitions of a submodular function  DESAI, MP; NARAYANAN, H; PATKAR, SB 
Showing results 19 to 38 of 46
