( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Simplifying Non-Simple Fan-Planar Drawings.

, , , и . J. Graph Algorithms Appl., 27 (2): 147-172 (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.

Felix Oliver Schröder

Werner Felix

Josef Felixberger

Sascha Felix

Christine Felix

 

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

Simplifying Non-simple Fan-Planar Drawings., , , и . GD, том 12868 из Lecture Notes in Computer Science, стр. 57-71. Springer, (2021)On the Edge-Vertex Ratio of Maximal Thrackles., , , , и . GD, том 11904 из Lecture Notes in Computer Science, стр. 482-495. Springer, (2019)Improved bounds for centered colorings., , , и . SODA, стр. 2212-2226. SIAM, (2020)Coloring Drawings of Graphs., , и . Electron. J. Comb., (2022)Simplifying Non-Simple Fan-Planar Drawings., , , и . J. Graph Algorithms Appl., 27 (2): 147-172 (2023)Characterization of Matrices with Bounded Graver Bases and Depth Parameters and Applications to Integer Programming., , , , и . ICALP, том 229 из LIPIcs, стр. 29:1-29:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Finding hardness reductions automatically using SAT solvers., , и . CoRR, (2024)Topological Drawings Meet Classical Theorems from Convex Geometry., , , , и . GD, том 12590 из Lecture Notes in Computer Science, стр. 281-294. Springer, (2020)On the Complexity of Digraph Colourings and Vertex Arboricity., , и . Discret. Math. Theor. Comput. Sci., (2020)The Density Formula: One Lemma to Bound Them All., , , , , и . CoRR, (2023)