The following pages link to Franz-Josef Brandenburg (Q1838046):
Displaying 50 items.
- (Q289914) (redirect page) (← links)
- Outer 1-planar graphs (Q289919) (← links)
- Recognizing and drawing IC-planar graphs (Q290513) (← links)
- Ranking chain sum orders (Q290525) (← links)
- Upward planar drawings on the standing and the rolling cylinders (Q390362) (← links)
- Shortest path and maximum flow problems in networks with additive losses and gains (Q620954) (← links)
- On the complexity of crossings in permutations (Q1011761) (← links)
- A note on: `Deque automata and a subfamily of context-sensitive languages which contains all semilinear bounded languages' (by K. Ayers) (Q1097706) (← links)
- Representations of language families by homomorphic equality operations and generalized equality sets (Q1099633) (← links)
- On the intersection of stacks and queues (Q1123639) (← links)
- Multiple equality sets and Post machines (Q1148696) (← links)
- The ancestor width of grammars and languages (Q1274983) (← links)
- On fan-crossing and fan-crossing free graphs (Q1653045) (← links)
- On the relationship between \(k\)-planar and \(k\)-quasi-planar graphs (Q1687902) (← links)
- Recognizing optimal 1-planar graphs in linear time (Q1702117) (← links)
- \(\mathsf{T}\)-shape visibility representations of 1-planar graphs (Q1702255) (← links)
- Characterizing and recognizing 4-map graphs (Q1741846) (← links)
- Finite graph automata for linear and boundary graph languages (Q1770387) (← links)
- Uniformly growing k-th power-free homomorphisms (Q1838047) (← links)
- On the hardness of maximum rank aggregation problems (Q2018536) (← links)
- On fan-crossing graphs (Q2202017) (← links)
- Characterizing 5-map graphs by 2-fan-crossing graphs (Q2274073) (← links)
- The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders (Q2392744) (← links)
- \(\mathsf{NIC}\)-planar graphs (Q2410219) (← links)
- Upward planar graphs and their duals (Q2512656) (← links)
- Fan-crossing free graphs and their relationship to other beyond-planar graphs (Q2663047) (← 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)
- Rolling Upward Planarity Testing of Strongly Connected Graphs (Q2864288) (← links)
- Tight Upper Bounds for Minimum Feedback Arc Sets of Regular Graphs (Q2864310) (← links)
- Global k-Level Crossing Reduction (Q2865048) (← links)
- Characterizing Planarity by the Splittable Deque (Q2867640) (← links)
- Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs (Q2867646) (← 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)
- 1-Visibility Representations of 1-Planar Graphs (Q2921090) (← links)
- The Nearest Neighbor Spearman Footrule Distance for Bucket, Interval, and Partial Orders (Q3004688) (← links)
- (Q3043763) (← links)
- (Q3043792) (← links)
- Plane Drawings of Queue and Deque Graphs (Q3073660) (← links)
- Drawing Recurrent Hierarchies (Q3143735) (← links)
- Classification of Planar Upward Embedding (Q3223973) (← links)
- The Open Graph Archive: A Community-Driven Effort (Q3223978) (← links)
- (Q3321473) (← links)
- (Q3343456) (← links)
- Computing and Drawing Isomorphic Subgraphs (Q3378496) (← links)
- Radial Level Planarity Testing and Embedding in Linear Time (Q3378508) (← links)
- A Global k-Level Crossing Reduction Algorithm (Q3404430) (← links)
