( en | de | ru )

 

Disambiguation of "Vogtenhuber, Birgit"

Author of the publication

copydeleteadd this publication to your clipboard
Perfect Matchings with Crossings.

, , , , , , , and . Algorithmica, 86 (3): 697-716 (March 2024)

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.

Birgit Pfost

Etablierung des humanen Harnblasenkarzinoms im orthotopen Mausmodell zur Bewertung der intravesikalen Radioimmuntherapie mit einem Wismuth-213-(_1hn2_1hn1_1hn3Bi)-markierten monoklonalen Anti-EGFR-Antikörper. Uni München, (2009)

Birgit Wieneke

Neue Ansätze zum Verständnis des Wirkmechanismus von Schwindreduzierern in zementären Systemen. TU München, (2009)

Birgit Kampschulte

Untersuchung der Nebennierenrindenfunktion bei Frühgeborenen eines Gestationsalters unter 30 Schwangerschaftswochen. Uni Gießen, (2009)

Birgit Hickstein

Magnetic beads for bioseparation processes - synthesis and application properties. TU Clausthal-Zellerfeld, (2009)

Birgit Häge

Das Kurfürstentum Pfalz und sein Umgang mit Mennoniten, Juden und anderen religiösen Minderheiten. Uni Mainz, (2005)
 

Other publications of authors with the same name

Lombardi Drawings of Knots and Links, , , , , and . Journal of Computational Geometry, 10 (1): 444--476 (2019)Geodesic Order Types., , , and . CoRR, (2017)Linear transformation distance for bichromatic matchings., , , , and . CoRR, (2013)The dual diameter of triangulations., , , , , and . Comput. Geom., (2018)Plane Graphs with Parity Constraints., , , , , , and . WADS, volume 5664 of Lecture Notes in Computer Science, page 13-24. Springer, (2009)Lower Bounds for the Number of Small Convex k-Holes., , , , , and . CCCG, page 247-252. (2012)On the number of plane graphs., , , , , and . SODA, page 504-513. ACM Press, (2006)Linear transformation distance for bichromatic matchings., , , , and . SoCG, page 154. ACM, (2014)Twisted Ways to Find Plane Structures in Simple Drawings of Complete Graphs., , , , and . Discret. Comput. Geom., 71 (1): 40-66 (January 2024)Towards Crossing-Free Hamiltonian Cycles in Simple Drawings of Complete Graphs., , and . Comput. Geom. Topol., 3 (2): 5:1-5:30 (2024)