( en | de | ru )

 

Disambiguation of "Goodrich, Michael T."

Author of the publication

copydeleteadd this publication to your clipboard
Linear-time algorithms for geometric graphs with sublinearly many crossings.

, , and . SODA, page 150-159. SIAM, (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Michael R T Macnair

T Neumann

T Attin

T Weber

T Hohlfeld

 

Other publications of authors with the same name

The Online House Numbering Problem: Min-Max Online List Labeling., , , and . ESA, volume 87 of LIPIcs, page 33:1-33:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Minimum-Width Drawings of Phylogenetic Trees., , , and . COCOA, volume 11949 of Lecture Notes in Computer Science, page 39-55. Springer, (2019)Diamonds are Forever in the Blockchain: Geometric Polyhedral Point-Set Pattern Matching., , , , , and . CoRR, (2022)Tiered Vectors: Efficient Dynamic Arrays for Rank-Based Sequences., and . WADS, volume 1663 of Lecture Notes in Computer Science, page 205-216. Springer, (1999)Improved Combinatorial Group Testing for Real-World Problem Sizes., , and . WADS, volume 3608 of Lecture Notes in Computer Science, page 86-98. Springer, (2005)Balanced Aspect Ratio Trees Revisited., and . WADS, volume 3608 of Lecture Notes in Computer Science, page 73-85. Springer, (2005)Offset-Polygon Annulus Placement Problems., , , and . WADS, volume 1272 of Lecture Notes in Computer Science, page 378-391. Springer, (1997)Authenticated Data Structures for Graph and Geometric Searching., , , and . CT-RSA, volume 2612 of Lecture Notes in Computer Science, page 295-313. Springer, (2003)Efficient Plane Sweeping in Parallel., and . SCG, page 216-225. ACM, (1986)Dynamic Ray Shooting and Shortest Paths Via Balanced Geodesic Triangulations., and . SCG, page 318-327. ACM, (1993)