( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Planar L-Drawings of Directed Graphs

, , , , , , , и . Computing in Geometry and Topology, 2 (1): 7:1--7:15 (2023)
DOI: 10.57717/cgt.v2i1.43

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.

Markus Chimani

Maria Kandyba-Chimani

Markus Markus

Markus Kurscheidt

Ökonomische Analyse von Sportgroßveranstaltungen: ein integrierter Evaluierungs- und Management-Ansatz am Beispiel von Fußball-Weltmeisterschaften. Uni Paderborn, (2007)

Markus Ugele

Synthese verschiedener Naturstoffe mit vicinalen Stereozentren. Uni Tübingen, (2009)
 

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

Planarisation and Crossing Minimisation.. Encyclopedia of Algorithms, (2016)A Closer Look at the Closest String and Closest Substring Problem., , и . ALENEX, стр. 13-24. SIAM, (2011)A Practical Method for the Minimum Genus of a Graph: Models and Experiments., , , и . SEA, том 9685 из Lecture Notes in Computer Science, стр. 75-88. Springer, (2016)How not to characterize planar-emulable graphs., , , и . Adv. Appl. Math., 50 (1): 46-68 (2013)Properties of Large 2-Crossing-Critical Graphs., , , , , , и . CoRR, (2021)Computing Crossing Numbers: Berechnen von Kreuzungszahlen.. Ausgezeichnete Informatikdissertationen, том D-9 из LNI, GI, (2008)Computing crossing numbers. Dortmund University, Germany, (2009)base-search.net (ftunivdortmund:oai:eldorado.tu-dortmund.de:2003/25955).Crossing Number for Graphs With Bounded Pathwidth., , , и . CoRR, (2016)Obtaining optimal k-cardinality trees fast., , , и . ACM J. Exp. Algorithmics, (2009)Obtaining Optimal k-Cardinality Trees Fast., , , и . ALENEX, стр. 27-36. SIAM, (2008)