( en | de | ru )

 

Disambiguation of "Förster, Henry"

Author of the publication

copydeleteadd this publication to your clipboard
Drawing Graphs with Circular Arcs and Right-Angle Crossings

, , , and . Proc. 17th Scand. Symp. and Workshops on Algorithm Theory (SWAT'20), volume 162 of LIPIcs, page 21:1--14. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, (2020)
DOI: 10.4230/LIPIcs.SWAT.2020.21

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.

Michaela Karin Ingrid Henry

Madeleine Mary Henry

James Henry

David P Henry

Marie-Louise Henry

 

Other publications of authors with the same name

Drawing Shortest Paths in Geodetic Graphs., , , , , , and . J. Graph Algorithms Appl., 26 (3): 353-361 (2022)Bitonic st-Orderings for Upward Planar Graphs: Splits and Bends in the Variable Embedding Scenario., , , and . Algorithmica, 85 (9): 2667-2692 (September 2023)2-Layer k-Planar Graphs Density, Crossing Lemma, Relationships And Pathwidth., , , and . Comput. J., 67 (3): 1005-1016 (2024)Planar graphs of bounded degree have bounded queue number., , , , , , and . STOC, page 176-184. ACM, (2019)On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings., , and . Algorithmica, 81 (5): 2046-2071 (2019)Bitonic st-Orderings for Upward Planar Graphs: The Variable Embedding Setting., , , and . WG, volume 12301 of Lecture Notes in Computer Science, page 339-351. Springer, (2020)Geometric Thickness of Multigraphs is $R$-Complete., , , , , and . LATIN (1), volume 14578 of Lecture Notes in Computer Science, page 336-349. Springer, (2024)On the 2-Layer Window Width Minimization Problem., , , , , , and . SOFSEM, volume 13878 of Lecture Notes in Computer Science, page 209-221. Springer, (2023)Evaluating Animation Parameters for Morphing Edge Drawings., , , and . GD (1), volume 14465 of Lecture Notes in Computer Science, page 246-262. Springer, (2023)Geometric Thickness of Multigraphs is ∃R-complete., , , , , and . CoRR, (2023)