The following pages link to Tomáš Masařík (Q1641148):
Displaying 4 items.
- Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity (Q1687933) (← links)
- Single-conflict colorings of degenerate graphs (Q6504830) (← links)
- Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic (Q6506944) (← links)
- Minimizing an Uncrossed Collection of Drawings (Q6510600) (← links)
