The following pages link to Katrin Casel (Q722538):
Displaying 28 items.
- Clustering with lower-bounded sizes. A general graph-theoretic framework (Q722539) (← links)
- Weak total resolvability in graphs (Q907841) (← links)
- The many facets of upper domination (Q1704853) (← links)
- On the complexity of the smallest grammar problem over fixed alphabets (Q2035481) (← links)
- On the complexity of solution extension of optimization problems (Q2072063) (← links)
- From symmetry to asymmetry: generalizing TSP approximations by parametrization (Q2140484) (← links)
- Zeros and approximations of holant polynomials on the complex plane (Q2169310) (← links)
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability (Q2181241) (← links)
- Complexity of independency and cliquy trees (Q2283099) (← links)
- Extension of some edge graph problems: standard and parameterized complexity (Q2291420) (← links)
- Extension of Vertex Cover and Independent Set in some classes of graphs (Q2294045) (← links)
- On the Complexity Landscape of the Domination Chain (Q2795935) (← links)
- Upper Domination: Complexity and Approximation (Q2819508) (← links)
- Algorithmic Aspects of Upper Domination: A Parameterised Perspective (Q2830063) (← links)
- A Fixed-Parameter Approach for Privacy-Protection with Global Recoding (Q3188830) (← links)
- On the Complexity of Grammar-Based Compression over Fixed Alphabets (Q4598264) (← links)
- (Q4636485) (← links)
- (Q5009486) (← links)
- (Q5091271) (← links)
- (Q5111244) (← links)
- Combinatorial properties and recognition of unit square visibility graphs (Q6045782) (← links)
- Extension of some edge graph problems: standard, parameterized and approximation complexity (Q6048430) (← links)
- (Q6075914) (← links)
- (Q6090902) (← links)
- From symmetry to asymmetry: generalizing TSP approximations by parametrization (Q6098151) (← links)
- (Q6126249) (← links)
- Fine-Grained Complexity of Regular Path Queries (Q6137832) (← links)
- Shortest distances as enumeration problem (Q6184314) (← links)
