Siddharthan Ramachandramurthi

According to our database, Siddharthan Ramachandramurthi authored at least 7 papers between 1991 and 2001.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2001

A weak immersion relation on graphs and its applications.

Rajeev Govindan, Siddharthan Ramachandramurthi

Discret. Math., 2001

1999

Fast Algorithms forK4Immersion Testing.

Heather Booth, Rajeev Govindan, Michael A. Langston, Siddharthan Ramachandramurthi

J. Algorithms, 1999

1997

The Structure and Number of Obstructions to Treewidth.

Siddharthan Ramachandramurthi

SIAM J. Discret. Math., 1997

1994

A Lower Bound for Treewidth and Its Consequences.

Siddharthan Ramachandramurthi

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1994

1993

A Practical Approach to Layout Optimization.

Rajeev Govindan, Michael A. Langston, Siddharthan Ramachandramurthi

Proceedings of the Sixth International Conference on VLSI Design, 1993

1992

Cutwidth approximation in linear time.

Heather Booth, Rajeev Govindan, Michael A. Langston, Siddharthan Ramachandramurthi

Proceedings of the Second Great Lakes Symposium on VLSI, 1992

1991

Dense layouts for series-parallel circuits.

Michael A. Langston, Siddharthan Ramachandramurthi

Proceedings of the First Great Lakes Symposium on VLSI, 1991