( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Constrained Planarity in Practice - Engineering the Synchronized Planarity Algorithm.

, и . CoRR, (2023)

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.

Simon Fink

Simon D Neitzel

Martin Fink

Bewertung potentieller Kultivierungsalternativen zur Herstellung von Saccaromyces boulardi für probiotische Lebensmitteladditive. Uni Bonn, (2009)

D Böttger

D Bartels

 

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

Constrained Planarity in Practice - Engineering the Synchronized Planarity Algorithm., и . CoRR, (2023)Parameterized Complexity of Simultaneous Planarity., , и . GD (2), том 14466 из Lecture Notes in Computer Science, стр. 82-96. Springer, (2023)Experimental Comparison of PC-Trees and PQ-Trees., , и . ACM J. Exp. Algorithmics, (декабря 2023)The Parameterized Complexity Of Extending Stack Layouts., , , и . GD, том 320 из LIPIcs, стр. 12:1-12:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Maintaining Triconnected Components Under Node Expansion., и . CIAC, том 13898 из Lecture Notes in Computer Science, стр. 202-216. Springer, (2023)Synchronized Planarity with Applications to Constrained Planarity Problems., , и . CoRR, (2020)Synchronized Planarity with Applications to Constrained Planarity Problems., , и . ESA, том 204 из LIPIcs, стр. 19:1-19:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Experimental Comparison of PC-Trees and PQ-Trees., , и . ESA, том 204 из LIPIcs, стр. 43:1-43:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Level Planarity Is More Difficult Than We Thought., , , и . CoRR, (2024)Level Planarity Is More Difficult Than We Thought (Poster Abstract)., , , и . GD, том 320 из LIPIcs, стр. 50:1-50:3. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)