The following pages link to Ján Katrenič (Q650940):
Displaying 11 items.
- (Q602678) (redirect page) (← links)
- Finding monotone paths in edge-ordered graphs (Q602679) (← links)
- On computing the minimum 3-path vertex cover and dissociation number of graphs (Q650941) (← links)
- A faster FPT algorithm for 3-path vertex cover (Q903365) (← links)
- Improved approximation bounds for the minimum rainbow subgraph problem (Q1944047) (← links)
- A note on approximating the \(b\)-chromatic number (Q1949121) (← links)
- Minimum \(k\)-path vertex cover (Q2275922) (← links)
- On computing an optimal semi-matching (Q2408093) (← links)
- On the vertex \(k\)-path cover (Q2446837) (← links)
- Maximum semi-matching problem in bipartite graphs (Q2857031) (← links)
- On Computing an Optimal Semi-matching (Q3104781) (← links)
