The following pages link to Ignaz Rutter (Q306262):
Displaying 50 items.
- Search-space size in contraction hierarchies (Q306264) (← links)
- Extending convex partial drawings of graphs (Q334920) (← links)
- Multi-sided boundary labeling (Q334944) (← links)
- The density maximization problem in graphs (Q386420) (← links)
- On \(d\)-regular schematization of embedded paths (Q390156) (← links)
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph (Q450560) (← links)
- Orthogonal graph drawing with flexibility constraints (Q476441) (← links)
- Extending partial representations of proper and unit interval graphs (Q524367) (← links)
- Computing large matchings in planar graphs with fixed minimum degree (Q553342) (← links)
- Orthogonal graph drawing with inflexible edges (Q679739) (← links)
- An algorithmic study of switch graphs (Q715049) (← links)
- Regular augmentation of planar graphs (Q747622) (← links)
- A new perspective on clustered planarity as a combinatorial embedding problem (Q897898) (← links)
- Linear-time recognition of map graphs with outerplanar witness (Q1662161) (← links)
- On the relationship between \(k\)-planar and \(k\)-quasi-planar graphs (Q1687902) (← links)
- Level planarity: transitivity vs. even crossings (Q1725729) (← links)
- Simultaneous embedding: edge orderings, relative positions, cutvertices (Q1751092) (← links)
- Gap-planar graphs (Q1786592) (← links)
- Hamiltonian orthogeodesic alternating paths (Q1932349) (← links)
- A Kuratowski-type theorem for planarity of partially embedded graphs (Q1940706) (← links)
- Simultaneous FPQ-ordering and hybrid planarity testing (Q2034412) (← links)
- Level-planarity: transitivity vs. even crossings (Q2094894) (← links)
- Simple algorithms for partial and simultaneous rectangular duals with given contact orientations (Q2136282) (← links)
- An SPQR-tree-like embedding representation for upward planarity (Q2206883) (← links)
- Beyond level planarity: cyclic, torus, and simultaneous level planarity (Q2283039) (← links)
- Reaching 3-connectivity via edge-edge additions (Q2301743) (← links)
- NodeTrix planarity testing with small clusters (Q2319629) (← links)
- Planarity of streamed graphs (Q2333805) (← links)
- Disconnectivity and relative positions in simultaneous embeddings (Q2349740) (← links)
- Online dynamic power management with hard real-time guarantees (Q2354765) (← links)
- Fork-forests in bi-colored complete bipartite graphs (Q2446314) (← links)
- Extending partial representations of rectangular duals with given contact orientations (Q2692733) (← links)
- Parameterized complexity of graph planarity with restricted cyclic orders (Q2698291) (← links)
- On the Complexity of Partitioning Graphs for Arc-Flags (Q2838234) (← links)
- Two-Sided Boundary Labeling with Adjacent Sides (Q2842182) (← links)
- Edge-weighted contact representations of planar graphs (Q2842200) (← links)
- Drawing Planar Graphs with a Prescribed Inner Face (Q2867668) (← links)
- Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings (Q2867684) (← links)
- Testing Mutual Duality of Planar Graphs (Q2872099) (← links)
- (Q2918963) (← links)
- Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model (Q2921402) (← links)
- Drawing Simultaneously Embedded Graphs with Few Bends (Q2936912) (← links)
- A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem (Q2936952) (← links)
- On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs (Q2936956) (← links)
- Column-Based Graph Layouts (Q2938757) (← links)
- Planar Embeddings with Small and Uniform Faces (Q2942666) (← links)
- Orthogonal Graph Drawing with Inflexible Edges (Q2947010) (← links)
- Intersection-Link Representations of Graphs (Q2959759) (← links)
- Pixel and Voxel Representations of Graphs (Q2959781) (← links)
- Beyond Level Planarity (Q2961540) (← links)
