( en | de | ru )

 

Disambiguation of "Shermer, Thomas C."

Author of the publication

copydeleteadd this publication to your clipboard
A Complete Roundness Classification Procedure.

, , and . SCG, page 129-138. ACM, (1997)

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.

Thomas C C Knöbig

Thomas C C Gartenmann

Thomas C Wipfler

Thomas C Brachert

Thomas C Pfizenmaier

 

Other publications of authors with the same name

Nonadaptive broadcasting in trees., , , and . Networks, 57 (2): 157-168 (2011)Computing the k-Crossing Visibility Region of a Point in a Polygon., , , and . IWOCA, volume 11638 of Lecture Notes in Computer Science, page 10-21. Springer, (2019)Additive Spanners for Hypercubes., and . Parallel Process. Lett., (1991)On the Complements of Partial k-Trees., , and . ICALP, volume 1644 of Lecture Notes in Computer Science, page 382-391. Springer, (1999)The Chi-t-Coloring Problem., , and . STACS, volume 900 of Lecture Notes in Computer Science, page 409-420. Springer, (1995)Graph Folding: Extending Detail and Context Viewing into a Tool for Subgraph Comparisons., , , and . GD, volume 1027 of Lecture Notes in Computer Science, page 127-139. Springer, (1995)On Rectangle Visibility Graphs. III. External Visibility and Complexity.. CCCG, page 234-239. Carleton University Press, (1996)Bounds for Orthogonal 3-D Graph Drawing., , , and . J. Graph Algorithms Appl., 3 (4): 63-79 (1999)Point Visibility Graphs and O-Convex Cover., and . Int. J. Comput. Geom. Appl., 10 (1): 55-71 (2000)Finding Specified Sections of Arrangements: 2D Results., , , , , , , and . J. Math. Model. Algorithms, 1 (1): 3-16 (2002)