search result

Cover von Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable

Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable

Year: 2023
Media group: LIPIcs
Cover von Untangling Circular Drawings

Untangling Circular Drawings

Algorithms and Complexity
Year: 2021
Media group: LIPIcs
Cover von Parameterized Complexity in Graph Drawing; 6
Search for this author
Year: 2021
Publisher: Wadern, LZI
Dagstuhl Reports
Count: 6
Media group: DAGSTUHL REPORT
Cover von Extending Nearly Complete 1-Planar Drawings in Polynomial Time

Extending Nearly Complete 1-Planar Drawings in Polynomial Time

Year: 2020
Media group: LIPIcs
Cover von Extending Partial 1-Planar Drawings

Extending Partial 1-Planar Drawings

Year: 2020
Media group: LIPIcs
Cover von Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity
Search for this author
Year: 2018
Publisher: Cornell University, arXiv.org
Media group: ARTICLE
Cover von Scalable Set Visualizations; 8
pp. 1-22
Search for this author
Year: 2018
Publisher: Wadern, LZI
Dagstuhl Reports
Count: 8
Media group: DAGSTUHL REPORT
Cover von Semantic Word Cloud Representations
Hardness and Approximation Algorithms : article in LNCS 8392 LATIN 2014 : pp. 514-525
Search for this author
Year: 2014
Publisher: Berlin, Springer
Series: Lecture notes in computer science : 8392; article
Media group: ARTICLE
Cover von Empirical Evaluation for Graph Drawing; 1
pp. 243-258
Search for this author
Year: 2015
Publisher: Wadern, LZI
Dagstuhl Reports
Count: 1
Media group: DAGSTUHL REPORT
Cover von Drawing Graphs and Maps with Curves; 4
pp. 34-68
Search for this author
Year: 2013
Publisher: Wadern, LZI
Dagstuhl Reports
Count: 4
Media group: DAGSTUHL REPORT
OPEN V 11.1.0.0