The following pages link to Ondřej Suchý (Q378244):
Displaying 17 items.
- The parameterized complexity of local search for TSP, more refined (Q378245) (← links)
- Parameterized complexity of generalized domination problems (Q415279) (← links)
- On the parameterized complexity of computing balanced partitions in graphs (Q493645) (← links)
- Fixed-parameter algorithms for DAG partitioning (Q507587) (← links)
- A parameterized complexity view on collapsing \(k\)-cores (Q825978) (← links)
- The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs (Q1756342) (← links)
- Feedback vertex set on graphs of low clique-width (Q1933648) (← links)
- A tight lower bound for planar Steiner orientation (Q1999967) (← links)
- Polynomial kernels for tracking shortest paths (Q2094386) (← links)
- (Q4634388) (← links)
- (Q5009469) (← links)
- Complexity of the Steiner Network Problem with Respect to the Number of Terminals (Q5090473) (← links)
- Cluster Editing in Multi-Layer and Temporal Graphs. (Q5091014) (← links)
- (Q5092393) (← links)
- A Multivariate Complexity Analysis of Lobbying in Multiple Referenda (Q5494853) (← links)
- Hedonic diversity games: a complexity picture with more than two colors (Q6067039) (← links)
- Maximizing Social Welfare in Score-Based Social Distance Games (Q6199615) (← links)
