No. Title Author Year
1 Experimental Comparison of PC-Trees and PQ-Trees Fink, Simon D. et al. 2021
2 Polygon-Universal Graphs Ophelders, Tim et al. 2021
3 Synchronized Planarity with Applications to Constrained Planarity Problems Bläsius, Thomas et al. 2021
4 Untangling Circular Drawings: Algorithms and Complexity Bhore, Sujoy et al. 2021
5 An SPQR-Tree-Like Embedding Representation for Level Planarity Brückner, Guido et al. 2020
6 Efficient Algorithms for Ortho-Radial Graph Drawing Niedermann, Benjamin et al. 2019
7 Geometric Crossing-Minimization - A Scalable Randomized Approach Radermacher, Marcel et al. 2019
8 Simultaneous Representation of Proper and Unit Interval Graphs Rutter, Ignaz et al. 2019
9 Approximation Algorithms for Facial Cycles in Planar Embeddings Da Lozzo, Giordano et al. 2018
10 Towards a Topology-Shape-Metrics Framework for Ortho-Radial Drawings Barth, Lukas et al. 2017
11 Linear-Time Recognition of Map Graphs with Outerplanar Witness Mnich, Matthias et al. 2016
12 Scalable Exact Visualization of Isocontours in Road Networks via Minimum-Link Paths Baum, Moritz et al. 2016
13 Online Dynamic Power Management with Hard Real-Time Guarantees Chen, Jian-Jia et al. 2014
14 On the Complexity of Partitioning Graphs for Arc-Flags Bauer, Reinhard et al. 2012
Current Page :
Number of result pages: 1
Number of documents: 14


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