Author of the publication

Computing Maximum C-Planar Subgraphs.

, , , , and . Graph Drawing, volume 5417 of Lecture Notes in Computer Science, page 114-120. Springer, (2008)

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.

 

Other publications of authors with the same name

A Closer Look at the Closest String and Closest Substring Problem., , and . ALENEX, page 13-24. SIAM, (2011)Obtaining optimal k-cardinality trees fast., , , and . ACM J. Exp. Algorithmics, (2009)Computing crossing numbers. Dortmund University, Germany, (2009)base-search.net (ftunivdortmund:oai:eldorado.tu-dortmund.de:2003/25955).Computing Crossing Numbers: Berechnen von Kreuzungszahlen.. Ausgezeichnete Informatikdissertationen, volume D-9 of LNI, GI, (2008)A Practical Method for the Minimum Genus of a Graph: Models and Experiments., , , and . SEA, volume 9685 of Lecture Notes in Computer Science, page 75-88. Springer, (2016)Approximating Multiobjective Shortest Path in Practice., and . ALENEX, page 120-133. SIAM, (2020)Obtaining Optimal k-Cardinality Trees Fast., , , and . ALENEX, page 27-36. SIAM, (2008)Exact Minimum Weight Spanners via Column Generation., , , and . CoRR, (2024)On the Bond Polytope., , and . CoRR, (2020)A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs, , and . Proc. 26th International Computing and Combinatorics Conference (COCOON'20), (2020)to appear.