27 citations · 66 across the 11 of their papers we have counts for
11 papers
On the Chromatic Number of some generalized Kneser Graphs
Jozefien D'haeseleer, Klaus Metsch, Daniel Werner
We determine the chromatic number of the Kneser graph qΓ_{7,{3,4}} of flags of vectorial type {3, 4} of a rank 7 vector space over the finite field GF(q) for large q and describe t…
On the chromatic number of two generalized Kneser graphs
Jozefien D'haeseleer, Klaus Metsch, Daniel Werner
We determine the chromatic number of some graphs of flags in buildings of type , namely of the Kneser graphs of flags of type in the vector spaces for $q\g…
Maximal co-cliques in the Kneser graph on plane-solid flags in
Klaus Metsch, Daniel Werner
For we determine the independence number of the Kneser graph on plane-solid flags in . More precisely we describe all maximal independent sets of size at…
Fixed Parameter Complexity and Approximability of Norm Maximization
Christian Knauer, Stefan König, Daniel Werner
The problem of maximizing the -th power of a -norm over a halfspace-presented polytope in is a convex maximization problem which plays a fundamental role in computatio…
A Lower Bound for Shallow Partitions
Wolfgang Mulzer, Daniel Werner
Let P be a planar n-point set. A k-partition of P is a subdivision of P into n/k parts of roughly equal size and a sequence of triangles such that each part is contained in a trian…
Erdős-Szekeres and Testing Weak epsilon-Nets are NP-hard in 3 dimensions - and what now?
Christian Knauer, Daniel Werner
We consider the computational versions of the Erd\H os-Szekeres theorem and related problems in 3 dimensions. We show that, in constrast to the planar case, no polynomial time algo…