The following pages link to Daniel Werner (Q359745):
Displaying 12 items.
- Fixed-parameter tractability and lower bounds for stabbing problems (Q359746) (← links)
- Hardness of discrepancy computation and \(\varepsilon\)-net verification in high dimension (Q413466) (← links)
- On the smallest non-trivial tight sets in Hermitian polar spaces \(H(d, q^2)\), \(d\) even (Q1732765) (← links)
- Maximal cocliques in the Kneser graph on plane-solid flags in \(\mathrm{PG}(6,q)\) (Q2040375) (← links)
- On the chromatic number of two generalized Kneser graphs (Q2066011) (← links)
- Fixed-parameter complexity and approximability of norm maximization (Q2340407) (← links)
- A proof of the Oja depth conjecture in the plane (Q2450202) (← links)
- On the Computational Complexity of Erdős-Szekeres and Related Problems in ℝ3 (Q2849344) (← links)
- (Q3113727) (← links)
- Approximating Tverberg points in linear time for any fixed dimension (Q5891192) (← links)
- Approximating Tverberg points in linear time for any fixed dimension (Q5891421) (← links)
- On the chromatic number of some generalized Kneser graphs (Q6187005) (← links)
