No. Title Author Year
1 Minimum Link Fencing Bhore, Sujoy et al. 2022
2 Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293) Ganian, Robert et al. 2021
3 Untangling Circular Drawings: Algorithms and Complexity Bhore, Sujoy et al. 2021
4 An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling Bhore, Sujoy et al. 2020
5 Extending Nearly Complete 1-Planar Drawings in Polynomial Time Eiben, Eduard et al. 2020
6 Extending Partial 1-Planar Drawings Eiben, Eduard et al. 2020
7 Layered Fan-Planar Graph Drawings Biedl, Therese et al. 2020
8 Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts Klute, Fabian et al. 2018
9 Scalable Set Visualizations (Dagstuhl Seminar 17332) Hu, Yifan et al. 2018
10 Empirical Evaluation for Graph Drawing (Dagstuhl Seminar 15052) Brandes, Ulrik et al. 2015
11 Towards Realistic Pedestrian Route Planning Andreev, Simeon et al. 2015
12 Drawing Graphs and Maps with Curves (Dagstuhl Seminar 13151) Kobourov, Stephen G. et al. 2013
Current Page :
Number of result pages: 1
Number of documents: 12

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI