Simultaneous embedding of planar graphs T Bläsius, SG Kobourov, I Rutter arXiv preprint arXiv:1204.5853, 2012 | 102 | 2012 |

Simultaneous PQ-ordering with applications to constrained embedding problems T Bläsius, I Rutter ACM Transactions on Algorithms (TALG) 12 (2), 1-46, 2015 | 80 | 2015 |

Efficient embedding of scale-free graphs in the hyperbolic plane T Bläsius, T Friedrich, A Krohmer, S Laue IEEE/ACM transactions on Networking 26 (2), 920-933, 2018 | 50 | 2018 |

Trussfab: Fabricating sturdy large-scale structures on desktop 3d printers R Kovacs, A Seufert, L Wall, HT Chen, F Meinel, W Müller, S You, ... Proceedings of the 2017 CHI Conference on Human Factors in Computing Systems …, 2017 | 46 | 2017 |

The parameterized complexity of dependency detection in relational databases T Bläsius, T Friedrich, M Schirneck 11th International Symposium on Parameterized and Exact Computation (IPEC 2016), 2017 | 39 | 2017 |

Optimal orthogonal graph drawing with convex bend costs T Bläsius, I Rutter, D Wagner ACM Transactions on Algorithms (TALG) 12 (3), 1-32, 2016 | 24 | 2016 |

Orthogonal graph drawing with flexibility constraints T Bläsius, M Krug, I Rutter, D Wagner Algorithmica 68 (4), 859-885, 2014 | 23 | 2014 |

Simultaneous embedding: Edge orderings, relative positions, cutvertices T Bläsius, A Karrer, I Rutter International Symposium on Graph Drawing, 220-231, 2013 | 23* | 2013 |

Using ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings T Biedl, T Bläsius, B Niedermann, M Nöllenburg, R Prutkin, I Rutter International Symposium on Graph Drawing, 460-471, 2013 | 23 | 2013 |

Orthogonal graph drawing with inflexible edges T Bläsius, S Lehmann, I Rutter Computational Geometry 55, 26-40, 2016 | 19 | 2016 |

Hyperbolic random graphs: Separators and treewidth T Bläsius, T Friedrich, A Krohmer 24th Annual European Symposium on Algorithms (ESA 2016), 2016 | 19 | 2016 |

Cliques in hyperbolic random graphs T Bläsius, T Friedrich, A Krohmer Algorithmica 80 (8), 2324-2344, 2018 | 18 | 2018 |

A new perspective on clustered planarity as a combinatorial embedding problem T Bläsius, I Rutter Theoretical Computer Science 609, 306-315, 2016 | 18 | 2016 |

Disconnectivity and relative positions in simultaneous embeddings T Bläsius, I Rutter International Symposium on Graph Drawing, 31-42, 2012 | 17 | 2012 |

Efficiently enumerating hitting sets of hypergraphs arising in data profiling T Bläsius, T Friedrich, J Lischeid, K Meeks, M Schirneck 2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and …, 2019 | 12 | 2019 |

Efficiently generating geometric inhomogeneous and hyperbolic random graphs T Bläsius, T Friedrich, M Katzmann, U Meyer, M Penschuck, C Weyand arXiv preprint arXiv:1905.06706, 2019 | 11 | 2019 |

Disconnectivity and relative positions in simultaneous embeddings T Bläsius, I Rutter Computational Geometry 48 (6), 459-478, 2015 | 10 | 2015 |

Complexity of higher-degree orthogonal graph embedding in the Kandinsky model T Bläsius, G Brückner, I Rutter European Symposium on Algorithms, 161-172, 2014 | 10 | 2014 |

Local and union boxicity T Bläsius, P Stumpf, T Ueckerdt Discrete Mathematics 341 (5), 1307-1315, 2018 | 9 | 2018 |

A new perspective on clustered planarity as a combinatorial embedding problem T Bläsius, I Rutter International Symposium on Graph Drawing, 440-451, 2014 | 8 | 2014 |