( en | de | ru )

 

Disambiguation of "Biedl, Therese C."

Author of the publication

copydeleteadd this publication to your clipboard
The Three-Phase Method: A Unified Approach to Orthogonal Graph Drawing.

, , and . GD, volume 1353 of Lecture Notes in Computer Science, page 391-402. Springer, (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.

Susanne Biedlingmaier

Andreas Biedler

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 Mennemeyer

 

Other publications of authors with the same name

Balanced vertex-orderings of graphs., , , , and . Discret. Appl. Math., 148 (1): 27-48 (2005)Balanced k-colorings., , , , , , and . Discret. Math., 254 (1-3): 19-32 (2002)Angles and Lengths in Reconfigurations of Polygons and Polyhedra., , and . MFCS, volume 3153 of Lecture Notes in Computer Science, page 748-759. Springer, (2004)Morphing polyhedra with parallel faces: Counterexamples., , and . Comput. Geom., 42 (5): 395-402 (2009)Three Approaches to 3D-Orthogonal Box-Drawings.. GD, volume 1547 of Lecture Notes in Computer Science, page 30-43. Springer, (1998)Orthogonal Drawings with Few Layers., , , and . GD, volume 2265 of Lecture Notes in Computer Science, page 297-311. Springer, (2001)When can a net fold to a polyhedron., , and . CCCG, (1999)Cross-Stitching Using Little Thread., , and . CCCG, page 199-202. (2005)Bounded-Degree Independent Sets in Planar Graphs., and . ISAAC, volume 2518 of Lecture Notes in Computer Science, page 416-427. Springer, (2002)Bounds for Orthogonal 3-D Graph Drawing., , , and . J. Graph Algorithms Appl., 3 (4): 63-79 (1999)