The following pages link to Stefan Felsner (Q170482):
Displaying 50 items.
- Intersection graphs of L-shapes and segments in the plane (Q277615) (← links)
- Max point-tolerance graphs (Q344833) (← links)
- Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve (Q364848) (← links)
- Bend-optimal orthogonal graph drawing in the general position model (Q390165) (← links)
- Straight line triangle representations (Q517440) (← links)
- Distributive lattices, polyhedra, and generalized flows (Q607363) (← links)
- Cubic time recognition of cocircuit graphs of uniform oriented matroids (Q607364) (← links)
- Coding and counting arrangements of pseudolines (Q644821) (← links)
- On the order dimension of outerplanar maps (Q651434) (← links)
- Trapezoid graphs and generalizations, geometry and algorithms (Q678864) (← links)
- Grid intersection graphs and order dimension (Q722596) (← links)
- Planar bus graphs (Q724233) (← links)
- On-line chain partitions of orders: a survey (Q766153) (← links)
- Hamiltonicity and colorings of arrangement graphs (Q860408) (← links)
- Convex drawings of 3-connected plane graphs (Q879963) (← links)
- Covering partial cubes with zones (Q888589) (← links)
- A 3/2-approximation algorithm for the jump number of interval orders (Q921022) (← links)
- Orthogonal surfaces and their CP-orders (Q925257) (← links)
- Schnyder woods and orthogonal surfaces (Q946686) (← links)
- Adjacency posets of planar graphs (Q966048) (← links)
- On the number of planar orientations with prescribed degrees (Q1010800) (← links)
- The maximum number of edges in a graph of bounded dimension, with applications to ring theory (Q1301725) (← links)
- Finite three-dimensional partial orders which are not sphere orders (Q1301732) (← links)
- Interval reductions and extensions of orders: Bijections to chains in lattices (Q1304911) (← links)
- Orthogonal structures in directed graphs (Q1325244) (← links)
- Constructing colorings for diagrams (Q1329806) (← links)
- 3-interval irreducible partially ordered sets (Q1338127) (← links)
- On the fractional dimension of partially ordered sets (Q1344614) (← links)
- (Q1380816) (redirect page) (← links)
- On the number of arrangements of pseudolines (Q1380817) (← links)
- On-line chain partitions of orders (Q1392205) (← links)
- Geodesic embeddings and planar graphs (Q1425168) (← links)
- A class of point-sets with few \(k\)-sets (Q1577490) (← links)
- Dimension, graph and hypergraph coloring (Q1590179) (← links)
- On the complexity of partial order properties (Q1590180) (← links)
- The skeleton of a reduced word and a correspondence of Edelman and Green (Q1596198) (← links)
- Equiangular polygon contact representations (Q1627169) (← links)
- On the maximum crossing number (Q1642684) (← links)
- Intersection graphs of rays and grounded segments (Q1687911) (← links)
- Table cartogram (Q1699289) (← links)
- Ham-sandwich cuts for abstract order types (Q1702128) (← links)
- Recognition algorithms for orders of small width and graphs of small Dilworth number (Q1771253) (← links)
- Triangles in Euclidean arrangements (Q1807616) (← links)
- Lattice structures from planar graphs (Q1883624) (← links)
- Colorings of diagrams of interval orders and \(\alpha\)-sequences of sets (Q1898340) (← links)
- Balancing pairs and the cross product conjecture (Q1908931) (← links)
- On-line dimension for posets excluding two long incomparable chains (Q1943697) (← links)
- On-line chain partitions of up-growing semi-orders (Q1943698) (← links)
- A theorem on higher Bruhat orders (Q1961856) (← links)
- Semi-order dimension two is a comparability invariant (Q1970929) (← links)
