20. FSTTCS 2000:
New Delhi, India
Sachin B. Patkar
, H. Narayanan
: Fast On-Line/Off-Line Algorithms for Optimal Reinforcement of a Network and Its Connections with Principal Partition.
: On Approximability of the Independent/Connected Edge Dominating Set Problems.
: The Bounded Weak Monadic Quantifier Alternation Hierarchy of Equational Graphs Is Infinite.
: A General Framework for Types in Graph Rewriting.
: Strong Normalization of Second Order Symmetric lambda-Calculus.