( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Locked and Unlocked Polygonal Chains in 3D

, , , , , , , , , , и . CoRR, (1998)

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.

Andreas Biedler

Susanne Biedlingmaier

Erika Biedlingmeier

Therese Wolgast

Versuche zur Verbesserung der Embryonengewinnungsrate durch den Einsatz uterusmotilitätsfördernder Medikamente an einer kommerziellen Embryotransferstation für Rinder. TierH Hannover, (2009)

Therese Stäcker

 

Другие публикации лиц с тем же именем

Drawing Planar Partitions I: LL-Drawings and LH-Drawings.. SCG, стр. 287-296. ACM, (1998)The Three-Phase Method: A Unified Approach to Orthogonal Graph Drawing., , и . GD, том 1353 из Lecture Notes in Computer Science, стр. 391-402. Springer, (1997)Orthogonal 3-D Graph Drawing., , , и . GD, том 1353 из Lecture Notes in Computer Science, стр. 76-86. Springer, (1997)Rectangle of Influence Drawings of Graphs without Filled 3-Cycles., , и . GD, том 1731 из Lecture Notes in Computer Science, стр. 359-368. Springer, (1999)New Lower Bounds for Orthogonal Graph Drawings.. GD, том 1027 из Lecture Notes in Computer Science, стр. 28-39. Springer, (1995)Optimal Orthogonal Drawings of Triconnected Plane Graphs.. SWAT, том 1097 из Lecture Notes in Computer Science, стр. 333-344. Springer, (1996)Reconstructing Polygons from Scanner Data., , и . ISAAC, том 5878 из Lecture Notes in Computer Science, стр. 862-871. Springer, (2009)Bounded-Degree Independent Sets in Planar Graphs., и . ISAAC, том 2518 из Lecture Notes in Computer Science, стр. 416-427. Springer, (2002)Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections., , и . FSTTCS, том 4855 из Lecture Notes in Computer Science, стр. 400-411. Springer, (2007)Bounds for Orthogonal 3-D Graph Drawing., , , и . J. Graph Algorithms Appl., 3 (4): 63-79 (1999)