PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Mutzel, Petra"

Author of the publication

copydeleteadd this publication to your clipboard
The Crossing Number of Single-Pair-Seq-Shellable Drawings of Complete Graphs.

, and . CoRR, (2018)

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.

Soraya Petrasevic University of Stuttgart

Dr. Petra Nylund University of Stuttgart

Petra Heim University of Stuttgart

 

Other publications of authors with the same name

Optimization in Leveled Graphs.. Encyclopedia of Optimization, Springer, (2009)Optimieren über alle kombinatorischen Einbettungen eines planaren Graphen., and . GI Jahrestagung, page 199-206. Springer, (1999)A branch-and-cut approach to physical mapping with end-probes., , , , and . RECOMB, page 84-92. ACM, (1997)Faster Kernels for Graphs with Continuous Attributes via Hashing., , , and . ICDM, page 1095-1100. IEEE Computer Society, (2016)The Fractional Prize-Collecting Steiner Tree Problem on Trees: Extended Abstract., , , , and . ESA, volume 2832 of Lecture Notes in Computer Science, page 691-702. Springer, (2003)Recognizing Cuneiform Signs Using Graph Based Methods., , , , and . COST@SDM, volume 88 of Proceedings of Machine Learning Research, page 31-44. PMLR, (2018)Parameterized Algorithms for Stochastic Steiner Tree Problems., , and . MEMICS, volume 7721 of Lecture Notes in Computer Science, page 143-154. Springer, (2012)The Crossing Number of Seq-Shellable Drawings of Complete Graphs., and . IWOCA, volume 10979 of Lecture Notes in Computer Science, page 273-284. Springer, (2018)An Experimental Comparison of Orthogonal Compaction Algorithms (Extended Abstract)., , and . Graph Drawing, volume 1984 of Lecture Notes in Computer Science, page 37-51. Springer, (2000)An Alternative Method to Crossing Minimization on Hierarchical Graphs.. Graph Drawing, volume 1190 of Lecture Notes in Computer Science, page 318-333. Springer, (1996)