The following pages link to Andreas Gleißner (Q289915):
Displaying 22 items.
- Outer 1-planar graphs (Q289919) (← links)
- Ranking chain sum orders (Q290525) (← links)
- On the hardness of maximum rank aggregation problems (Q2018536) (← links)
- The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders (Q2392744) (← links)
- Upward planar graphs and their duals (Q2512656) (← links)
- Correction to: ``Outer 1-planar graphs'' (Q2665913) (← links)
- Optical Graph Recognition (Q2842205) (← links)
- COMPARING AND AGGREGATING PARTIAL ORDERS WITH KENDALL TAU DISTANCES (Q2846476) (← links)
- Characterizing Planarity by the Splittable Deque (Q2867640) (← links)
- Recognizing Outer 1-Planar Graphs in Linear Time (Q2867648) (← links)
- On Maximum Rank Aggregation Problems (Q2870013) (← links)
- Comparing and Aggregating Partial Orders with Kendall Tau Distances (Q2889903) (← links)
- The Nearest Neighbor Spearman Footrule Distance for Bucket, Interval, and Partial Orders (Q3004688) (← links)
- Plane Drawings of Queue and Deque Graphs (Q3073660) (← links)
- Characterizations of Deque and Queue Graphs (Q3104763) (← links)
- Classification of Planar Upward Embedding (Q3223973) (← links)
- Data Structures and their Planar Graph Layouts (Q4637665) (← links)
- On the Density of Maximal 1-Planar Graphs (Q4912214) (← links)
- Optical Graph Recognition (Q4912236) (← links)
- 1-Planarity of Graphs with a Rotation System (Q5176857) (← links)
- The Duals of Upward Planar Graphs on Cylinders (Q5200498) (← links)
- Grid sifting (Q5406265) (← links)
