dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Heather Booth Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys1999
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHeather Booth, Rajeev Govindan, Michael A. Langston, Siddharthan Ramachandramurthi: Fast Algorithms forK4Immersion Testing. J. Algorithms 30(2): 344-378 (1999)
1994
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHeather Booth, Jeffery Westbrook: A Linear Algorithm for Analysis of Minimum Spanning and Shortest-Path Trees of Planar Graphs. Algorithmica 11(4): 341-352 (1994)
1993
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHeather Booth, Robert Endre Tarjan: Finding the Minimum-Cost Maximum Flow in a Series-Parallel Network. J. Algorithms 15(3): 416-446 (1993)
1989
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlok Aggarwal, Heather Booth, Joseph O'Rourke, Subhash Suri, Chee-Keng Yap: Finding Minimal Convex Nested Polygons Inf. Comput. 83(1): 98-110 (1989)
1985
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoseph O'Rourke, Subhash Suri, Heather Booth: Shortest Paths on Polyhedral Surfaces. STACS 1985: 243-254
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlok Aggarwal, Heather Booth, Joseph O'Rourke, Subhash Suri, Chee-Keng Yap: Finding minimal convex nested polygons. Symposium on Computational Geometry 1985: 296-304

Coauthor Index

1Alok Aggarwal [1] [3]
2Rajeev Govindan [6]
3Michael A. Langston [6]
4Joseph O'Rourke [1] [2] [3]
5Siddharthan Ramachandramurthi [6]
6Subhash Suri [1] [2] [3]
7Robert Endre Tarjan [4]
8Jeffery Westbrook [5]
9Chee-Keng Yap (Chee Yap) [1] [3]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page