Plane Drawings of Queue and Deque Graphs. - Christopher Auer; Christian Bachmaier; Franz-Josef Brandenburg; Wolfgang Brunner; Andreas Gleißner (GD, 2010)

Classification of Planar Upward Embedding. - Christopher Auer; Christian Bachmaier; Franz-Josef Brandenburg; Andreas Gleißner (GD, 2011)

Characterizations of Deque and Queue Graphs. - Christopher Auer; Andreas Gleißner (WG, 2011)

On Sparse Maximal 2-Planar Graphs. - Christopher Auer; Franz-Josef Brandenburg; Andreas Gleißner; Kathrin Hanauer (GD, 2012)

Testing Planarity by Switching Trains. - Christopher Auer; Andreas Gleißner; Kathrin Hanauer; Sebastian Vetter (GD, 2012)

On the Density of Maximal 1-Planar Graphs. - Franz-Josef Brandenburg; David Eppstein; Andreas Gleißner; Michael T. Goodrich; Kathrin Hanauer; Josef Reislhuber (GD, 2012)

The Duals of Upward Planar Graphs on Cylinders. - Christopher Auer; Christian Bachmaier; Franz-Josef Brandenburg; Andreas Gleißner; Kathrin Hanauer (WG, 2012)

Grid sifting: Leveling and crossing reduction. - Christian Bachmaier; Wolfgang Brunner; Andreas Gleißner (ACM J. Exp. Algorithmics, 2012)

Recognizing Outer 1-Planar Graphs in Linear Time. - Christopher Auer; Christian Bachmaier; Franz J. Brandenburg; Andreas Gleißner; Kathrin Hanauer; Daniel Neuwirth; Josef Reislhuber (GD, 2013)

Characterizing Planarity by the Splittable Deque. - Christopher Auer; Franz J. Brandenburg; Andreas Gleißner; Kathrin Hanauer (GD, 2013)

On Maximum Rank Aggregation Problems. - Christian Bachmaier; Franz-Josef Brandenburg; Andreas Gleißner; Andreas Hofmeier (IWOCA, 2013)

Comparing and Aggregating Partial Orders with Kendall tau Distances. - Franz-Josef Brandenburg; Andreas Gleißner; Andreas Hofmeier (Discret. Math. Algorithms Appl., 2013)

The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders. - Franz-Josef Brandenburg; Andreas Gleißner; Andreas Hofmeier (J. Comb. Optim., 2013)

Optical Graph Recognition. - Christopher Auer; Christian Bachmaier; Franz J. Brandenburg; Andreas Gleißner; Josef Reislhuber (J. Graph Algorithms Appl., 2013)

On the hardness of maximum rank aggregation problems. - Christian Bachmaier; Franz J. Brandenburg; Andreas Gleißner; Andreas Hofmeier (J. Discrete Algorithms, 2015)

1-Planarity of Graphs with a Rotation System. - Christopher Auer; Franz J. Brandenburg; Andreas Gleißner; Josef Reislhuber (J. Graph Algorithms Appl., 2015)

Upward planar graphs and their duals. - Christopher Auer; Christian Bachmaier; Franz J. Brandenburg; Andreas Gleißner; Kathrin Hanauer (Theor. Comput. Sci., 2015)

Outer 1-Planar Graphs. - Christopher Auer; Christian Bachmaier; Franz J. Brandenburg; Andreas Gleißner; Kathrin Hanauer; Daniel Neuwirth; Josef Reislhuber (Algorithmica, 2016)

Ranking chain sum orders. - Franz J. Brandenburg; Andreas Gleißner (Theor. Comput. Sci., 2016)

Data Structures and their Planar Graph Layouts. - Christopher Auer; Christian Bachmaier; Franz J. Brandenburg; Wolfgang Brunner; Andreas Gleißner (J. Graph Algorithms Appl., 2018)

Correction to: Outer 1-Planar Graphs. - Christopher Auer; Christian Bachmaier; Franz J. Brandenburg; Andreas Gleißner; Kathrin Hanauer; Daniel Neuwirth; Josef Reislhuber (Algorithmica, 2021)