( en | de | ru )

 

Disambiguation of "Klesen, Felix"

Author of the publication

copydeleteadd this publication to your clipboard
Constrained and Ordered Level Planarity Parameterized by the Number of Levels

, , , , , and . Proc. 40th Annu. Sympos. Comput. Geom. (SoCG'24), volume of LIPIcs, page . Schloss Dagstuhl&nobsp;��� Leibniz-Zentrum für Informatik, (2024)

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.

Christof Klesen

Christian Klesen

Sabine Klesen

Werner Felix

Sascha Felix

 

Other publications of authors with the same name

Flusserkennung in Luftbildaufnahmen. (2017)Algorithms for Automated Floor Planning. (2020)Visualizing Geophylogenies - Internal and External Labeling with Phylogenetic Tree Constraints., , , , and . GIScience, volume 277 of LIPIcs, page 5:1-5:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Visualizing Multispecies Coalescent Trees: Drawing Gene Trees Inside Species Trees., , , and . CoRR, (2022)Coloring and Recognizing Directed Interval Graphs., , , , , and . CoRR, (2023)Coloring and Recognizing Mixed Interval Graphs, , , , , and . Proc. 34th International Symposium on Algorithms and Computation (ISAAC'23), page 36:1--36:14. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, (2023)Morphing Graph Drawings in the Presence of Point Obstacles., , , , , , and . CoRR, (2023)Universal Lower Bounds on the Segment Number of Some Classes of Planar Graphs, , , , , , and . Proc. 38th Europ. Workshop Comput. Geom. (EuroCG'22), page 53:1--6. (2022)Wüpstream: efficient enumeration of upstream features (GIS cup), , , , , and . Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, SIGSPATIAL 2018, Seattle, WA, USA, November 06-09, 2018, page 626--629. ACM, (2018)Algorithms for Floor Planning with Proximity Requirements., , and . CAAD Futures, volume 1465 of Communications in Computer and Information Science, page 151-171. Springer, (2021)