A better heuristic for orthogonal graph drawings T Biedl, G Kant Computational Geometry 9 (3), 159-180, 1998 | 174 | 1998 |

A better heuristic for orthogonal graph drawings T Biedl, G Kant Algorithms—ESA'94: Second Annual European Symposium Utrecht, The …, 1994 | 125 | 1994 |

Locked and unlocked polygonal chains in three dimensions T Biedl, E Demaine, M Demaine, S Lazard, A Lubiw, J O'Rourke, ... Discrete & Computational Geometry 26, 269-281, 2001 | 101* | 2001 |

Tight bounds on maximal and maximum matchings T Biedl, ED Demaine, CA Duncan, R Fleischer, SG Kobourov Discrete Mathematics 285 (1-3), 7-15, 2004 | 99 | 2004 |

Efficient algorithms for Petersen's matching theorem TC Biedl, P Bose, ED Demaine, A Lubiw Journal of Algorithms 38 (1), 110-134, 2001 | 98 | 2001 |

Area-efficient static and incremental graph drawings TC Biedl, M Kaufmann Algorithms—ESA'97: 5th Annual European Symposium Graz, Austria, September …, 2005 | 97 | 2005 |

Unfolding some classes of orthogonal polyhedra TBEDM Demainez, A Lubiwzx, MOJOR Steve, RS Whitesidesyxyy | 85 | 1998 |

Computing cartograms with optimal complexity MJ Alam, T Biedl, S Felsner, M Kaufmann, SG Kobourov, T Ueckerdt Proceedings of the twenty-eighth annual symposium on Computational geometry …, 2012 | 82 | 2012 |

A note on reconfiguring tree linkages: Trees can lock T Biedl, E Demaine, M Demaine, S Lazard, A Lubiw, J O'Rourke, ... Discrete Applied Mathematics 117 (1-3), 293-297, 2002 | 67 | 2002 |

Curvature-constrained shortest paths in a convex polygon PK Agarwal, T Biedl, S Lazard, S Robbins, S Suri, S Whitesides SIAM Journal on Computing 31 (6), 1814-1851, 2002 | 66 | 2002 |

On triangulating planar graphs under the four-connectivity constraint T Biedl, G Kant, M Kaufmann Algorithmica 19, 427-446, 1997 | 61 | 1997 |

Balanced vertex-orderings of graphs T Biedl, T Chan, Y Ganjali, MT Hajiaghayi, DR Wood Discrete Applied Mathematics 148 (1), 27-48, 2005 | 55 | 2005 |

Drawing planar partitions II: HH-drawings T Biedl, M Kaufmann, P Mutzel WG 98, 124-136, 1998 | 52 | 1998 |

The three-phase method: A unified approach to orthogonal graph drawing TC Biedl, BP Madden, IG Tollis Graph Drawing: 5th International Symposium, GD'97 Rome, Italy, September 18 …, 1997 | 51 | 1997 |

On the complexity of crossings in permutations T Biedl, FJ Brandenburg, X Deng Discrete Mathematics 309 (7), 1813-1823, 2009 | 49 | 2009 |

The complexity of Clickomania TC Biedl, ED Demaine, ML Demaine, R Fleischer, L Jacobsen, JI Munro arXiv preprint cs/0107031, 2001 | 47 | 2001 |

Curvature-constrained shortest paths in a convex polygon PK Agarwal, T Biedl, S Lazard, S Robbins, S Suri, S Whitesides Proceedings of the fourteenth annual symposium on Computational geometry …, 1998 | 47 | 1998 |

Optimal arrangement of leaves in the tree representing hierarchical clustering of gene expression data T Biedl, B Brejová, ED Demaine, AM Hamel, T Vinar University of Waterloo, Canada, 2001 | 46 | 2001 |

On edge-intersection graphs of k-bend paths in grids M Stern, T Biedl Discrete Mathematics & Theoretical Computer Science 12, 2010 | 45 | 2010 |

New lower bounds for orthogonal graph drawings TC Biedl Graph Drawing: Symposium on Graph Drawing, GD'95 Passau, Germany, September …, 1996 | 45 | 1996 |