The following pages link to Steven Chaplick (Q299079):
Displaying 50 items.
- Edge intersection graphs of \(L\)-shaped paths in grids (Q299080) (← links)
- Threshold-coloring and unit-cube contact representation of planar graphs (Q344821) (← links)
- Max point-tolerance graphs (Q344833) (← links)
- Ferrers dimension of grid intersection graphs (Q344841) (← links)
- Grid intersection graphs and order dimension (Q722596) (← links)
- The partial visibility representation extension problem (Q724235) (← links)
- Generalized disk graphs (Q832849) (← links)
- Planar drawings with few slopes of Halin graphs and nested pseudotrees (Q832866) (← links)
- Combinatorial problems on \(H\)-graphs (Q1689915) (← links)
- On some graphs with a unique perfect matching (Q1799576) (← links)
- Simple algorithms for partial and simultaneous rectangular duals with given contact orientations (Q2136282) (← links)
- Edge-minimum saturated \(k\)-planar drawings (Q2151425) (← links)
- On independent set in \(B_1\)-EPG graphs (Q2174555) (← links)
- Stick graphs with length constraints (Q2206824) (← links)
- Bundled crossings revisited (Q2206831) (← links)
- On arrangements of orthogonal circles (Q2206852) (← links)
- Kernelization of graph Hamiltonicity: proper \(H\)-graphs (Q2285097) (← links)
- Intersection graphs of non-crossing paths (Q2301552) (← links)
- Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree (Q2348037) (← links)
- The complexity of drawing graphs on few lines and few planes (Q2405289) (← links)
- The vertex leafage of chordal graphs (Q2442202) (← links)
- Extending partial representations of rectangular duals with given contact orientations (Q2692733) (← links)
- A note on concurrent graph sharing games (Q2830435) (← links)
- Planar graphs as VPG-graphs (Q2842201) (← links)
- Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree (Q2842779) (← links)
- Threshold-Coloring and Unit-Cube Contact Representation of Graphs (Q2864287) (← links)
- Equilateral L-Contact Graphs (Q2864297) (← links)
- Extending Partial Representations of Circle Graphs (Q2867650) (← links)
- Contact Representations of Planar Graphs: Extending a Partial Representation is Hard (Q2945185) (← links)
- Drawing Graphs on Few Lines and Few Planes (Q2961513) (← links)
- Obstructing Visibilities with One Obstacle (Q2961523) (← links)
- Simultaneous Orthogonal Planarity (Q2961544) (← links)
- From Path Graphs to Directed Path Graphs (Q3057630) (← links)
- Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid (Q3104787) (← links)
- On the structure of (pan, even hole)‐free graphs (Q4604020) (← links)
- On Vertex- and Empty-Ply Proximity Drawings (Q4625098) (← links)
- Planar L-Drawings of Directed Graphs (Q4625136) (← links)
- Beyond Outerplanarity (Q4625142) (← links)
- Placing your Coins on a Shelf (Q4626296) (← links)
- Planar Graphs as VPG-Graphs (Q4912200) (← links)
- Kernelization of Graph Hamiltonicity: Proper $H$-Graphs (Q4986812) (← links)
- (Q5002791) (← links)
- (Q5009574) (← links)
- Planar L-Drawings of Bimodal Graphs (Q5014118) (← links)
- Planar L-Drawings of Bimodal Graphs (Q5050000) (← links)
- Morphing Contact Representations of Graphs (Q5088937) (← links)
- Drawing graphs on few lines and few planes (Q5132649) (← links)
- Placing your Coins on a Shelf (Q5136217) (← links)
- Bundled Crossings Revisited (Q5141645) (← links)
- Recognizing Stick Graphs with and without Length Constraints (Q5141646) (← links)
