The following pages link to Jan Kratochvíl (Q175587):
Displayed 50 items.
- List covering of regular multigraphs (Q2169958) (← links)
- Pursuing a fast robber on a graph (Q2268876) (← links)
- Cops, a fast robber and defensive domination on interval graphs (Q2328864) (← links)
- Extending partial representations of subclasses of chordal graphs (Q2344737) (← links)
- Extending partial representations of interval graphs (Q2408095) (← links)
- Parameterized complexity of distance labeling and uniform channel assignment problems (Q2413966) (← links)
- Determining the \(L(2,1)\)-span in polynomial space (Q2446848) (← links)
- On the computational complexity of partial covers of theta graphs (Q2482109) (← links)
- Coloring mixed hypertrees (Q2489959) (← links)
- Planar graph coloring avoiding monochromatic subgraphs: Trees and paths make it difficult (Q2498403) (← links)
- Bounded stub resolution for some maximal 1-planar graphs (Q2636565) (← links)
- (Q2766689) (← links)
- Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems (Q2817849) (← links)
- On the Hardness of Switching to a Small Number of Edges (Q2817858) (← links)
- Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width (Q2912734) (← links)
- Extending Partial Representations of Function Graphs and Permutation Graphs (Q2912884) (← links)
- Computational Complexity of Covering Three-Vertex Multigraphs (Q2922636) (← links)
- Drawing Simultaneously Embedded Graphs with Few Bends (Q2936912) (← links)
- Planar Embeddings with Small and Uniform Faces (Q2942666) (← links)
- Contact Representations of Planar Graphs: Extending a Partial Representation is Hard (Q2945185) (← links)
- Completion of the Mixed Unit Interval Graphs Hierarchy (Q2948474) (← links)
- 2-Layer Fan-Planarity: From Caterpillar to Stegosaurus (Q2959764) (← links)
- Simultaneous Orthogonal Planarity (Q2961544) (← links)
- Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus (Q2971387) (← links)
- On the Computational Complexity of Degenerate Unit Distance Representations of Graphs (Q3000515) (← links)
- Fast Exact Algorithm for L(2,1)-Labeling of Graphs (Q3010388) (← links)
- (Q3035339) (← links)
- (Q3046488) (← links)
- On the complexity of reconstructing H-free graphs from their Star Systems (Q3174240) (← links)
- (Q3309881) (← links)
- (Q3348944) (← links)
- Noncrossing Subgraphs in Topological Layouts (Q3357538) (← links)
- (Q3358652) (← links)
- Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs (Q3402368) (← links)
- (Q3439665) (← links)
- Cops and Robbers on String Graphs (Q3459875) (← links)
- (Q3474685) (← links)
- (Q3495221) (← links)
- Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs (Q3499734) (← links)
- Distance Constrained Labelings of Trees (Q3502639) (← links)
- Generalized Domination in Degenerate Graphs: A Complete Dichotomy of Computational Complexity (Q3502644) (← links)
- Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs (Q3508549) (← links)
- Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract) (Q3521928) (← links)
- Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy (Q3522938) (← links)
- Exact Algorithms for L(2,1)-Labeling of Graphs (Q3525597) (← links)
- On Switching to H-Free Graphs (Q3540412) (← links)
- Faithful Representations of Graphs by Islands in the Extended Grid (Q3557016) (← links)
- The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree (Q3557887) (← links)
- Max-tolerance graphs as intersection graphs (Q3581555) (← links)
- Branch and Recharge: Exact Algorithms for Generalized Domination (Q3603553) (← links)