The following pages link to Tom C. van der Zanden (Q1628691):
Displaying 23 items.
- On exploring always-connected temporal graphs of small pathwidth (Q1628692) (← links)
- Complexity of the maximum \(k\)-path vertex cover problem (Q1641128) (← links)
- On the exact complexity of polyomino packing (Q2196557) (← links)
- On the maximum weight minimal separator (Q2333804) (← links)
- PSPACE-Completeness of Bloxorz and of Games with 2-Buttons (Q2947039) (← links)
- On the Maximum Weight Minimal Separator (Q2988830) (← links)
- On the Exact Complexity of Polyomino Packing (Q3305727) (← links)
- A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs (Q3387760) (← links)
- Subexponential Time Algorithms for Embedding H-Minor Free Graphs (Q4598141) (← links)
- Games, Puzzles and Treewidth (Q5042461) (← links)
- Computing treewidth on the GPU (Q5111889) (← links)
- A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs (Q5230321) (← links)
- Improved Lower Bounds for Graph Embedding Problems (Q5283358) (← links)
- On the Exact Complexity of Hamiltonian Cycle and q-Colouring in Disk Graphs (Q5283382) (← links)
- Parameterized Complexity of Graph Constraint Logic (Q5363782) (← links)
- How Does Object Fatness Impact the Complexity of Packing in d Dimensions (Q5875599) (← links)
- Stable divisorial gonality is in NP (Q5918307) (← links)
- Stable divisorial gonality is in NP (Q5918977) (← links)
- Subgraph isomorphism on graph classes that exclude a substructure (Q5919029) (← links)
- Subgraph isomorphism on graph classes that exclude a substructure (Q5919398) (← links)
- (Q6065436) (← links)
- On the complexity of nurse rostering problems (Q6556163) (← links)
- Minimum separator reconfiguration (Q6615312) (← links)
