The following pages link to (Q5874491):
Displaying 8 items.
- A lower bound for weak Schur numbers with a deterministic algorithm (Q1757462) (← links)
- Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds (Q2093577) (← links)
- Algorithmic aspects of Suslin's proof of Serre's conjecture (Q2366722) (← links)
- (Q3424894) (← links)
- A Weakening of the Odd Hadwiger's Conjecture (Q3608337) (← links)
- (Q5258259) (← links)
- An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Černy Conjecture (Q5756675) (← links)
- Parameterized inapproximability of independent set in \(H\)-free graphs (Q5925689) (← links)
