The following pages link to Tomáš Vyskočil (Q354441):
Displayed 17 items.
- The planar slope number of planar partial 3-trees of bounded degree (Q354442) (← links)
- Segment representation of a subclass of co-planar graphs (Q418892) (← links)
- Extending partial representations of proper and unit interval graphs (Q524367) (← links)
- MSOL restricted contractibility to planar graphs (Q527397) (← links)
- (Q2003329) (redirect page) (← links)
- Embedding equality constraints of optimization problems into a quantum annealer (Q2003330) (← links)
- Extending partial representations of interval graphs (Q2408095) (← links)
- Logspace Reduction of Directed Reachability for Bounded Genus Graphs to the Planar Case (Q2947545) (← links)
- Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs (Q3402368) (← 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)
- Clustered Planarity: Clusters with Few Outgoing Edges (Q3611843) (← links)
- Irreversible 2-conversion set in graphs of bounded degree (Q4560206) (← links)
- MSOL Restricted Contractibility to Planar Graphs (Q4899253) (← links)
- Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill (Q5200514) (← links)
- The Moser-Tardos Resample algorithm: Where is the limit? (an experimental inquiry) (Q5232578) (← links)
- Clustered Planarity: Small Clusters in Eulerian Graphs (Q5452233) (← links)