Author of the publication

Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem.

, , and . IWOCA, volume 9843 of Lecture Notes in Computer Science, page 334-346. Springer, (2016)

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

Methods of Matrix Multiplication: An Overview of Several Methods and their Implementation. CoRR, (2011)A fast search algorithm for 〈m, m, m〉 Triple Product Property triples and an application for 5×5 matrix multiplication., , , and . Groups Complexity Cryptology, 7 (1): 31-46 (2015)Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem., , and . IWOCA, volume 9843 of Lecture Notes in Computer Science, page 334-346. Springer, (2016)Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments., , and . SEA, volume 103 of LIPIcs, page 22:1-22:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Minimum Genus and Maximum Planar Subgraph: Exact Algorithms and General Limits of Approximation Algorithms. University of Osnabrück, Germany, (2017)base-search.net (ftunivosnabrueck:oai:osnadocs.ub.uni-osnabrueck.de:urn:nbn:de:gbv:700-2017082416212).Search and test algorithms for triple product property triples., and . Groups Complexity Cryptology, 4 (1): 111-133 (2012)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)