Andreas Gleißner

According to our database, Andreas Gleißner authored at least 21 papers between 2010 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

Correction to: Outer 1-Planar Graphs.

Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber

Algorithmica, 2021

2018

Data Structures and their Planar Graph Layouts.

Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Wolfgang Brunner, Andreas Gleißner

J. Graph Algorithms Appl., 2018

2016

Ranking chain sum orders.

Franz J. Brandenburg, Andreas Gleißner

Theor. Comput. Sci., 2016

Outer 1-Planar Graphs.

Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber

Algorithmica, 2016

2015

Upward planar graphs and their duals.

Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer

Theor. Comput. Sci., 2015

1-Planarity of Graphs with a Rotation System.

Christopher Auer, Franz J. Brandenburg, Andreas Gleißner, Josef Reislhuber

J. Graph Algorithms Appl., 2015

On the hardness of maximum rank aggregation problems.

Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Andreas Hofmeier

J. Discrete Algorithms, 2015

2013

Optical Graph Recognition.

Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Josef Reislhuber

J. Graph 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

Comparing and Aggregating Partial Orders with Kendall tau Distances.

Franz-Josef Brandenburg, Andreas Gleißner, Andreas Hofmeier

Discret. Math. Algorithms Appl., 2013

On Maximum Rank Aggregation Problems.

Christian Bachmaier, Franz-Josef Brandenburg, Andreas Gleißner, Andreas Hofmeier

Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

Characterizing Planarity by the Splittable Deque.

Christopher Auer, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer

Proceedings of the Graph Drawing - 21st International Symposium, 2013

Recognizing Outer 1-Planar Graphs in Linear Time.

Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber

Proceedings of the Graph Drawing - 21st International Symposium, 2013

2012

Grid sifting: Leveling and crossing reduction.

Christian Bachmaier, Wolfgang Brunner, Andreas Gleißner

ACM J. Exp. Algorithmics, 2012

The Duals of Upward Planar Graphs on Cylinders.

Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Andreas Gleißner, Kathrin Hanauer

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

On the Density of Maximal 1-Planar Graphs.

Franz-Josef Brandenburg, David Eppstein, Andreas Gleißner, Michael T. Goodrich, Kathrin Hanauer, Josef Reislhuber

Proceedings of the Graph Drawing - 20th International Symposium, 2012

Testing Planarity by Switching Trains.

Christopher Auer, Andreas Gleißner, Kathrin Hanauer, Sebastian Vetter

Proceedings of the Graph Drawing - 20th International Symposium, 2012

On Sparse Maximal 2-Planar Graphs.

Christopher Auer, Franz-Josef Brandenburg, Andreas Gleißner, Kathrin Hanauer

Proceedings of the Graph Drawing - 20th International Symposium, 2012

2011

Characterizations of Deque and Queue Graphs.

Christopher Auer, Andreas Gleißner

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

Classification of Planar Upward Embedding.

Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Andreas Gleißner

Proceedings of the Graph Drawing - 19th International Symposium, 2011

2010

Plane Drawings of Queue and Deque Graphs.

Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Andreas Gleißner

Proceedings of the Graph Drawing - 18th International Symposium, 2010