The following pages link to Ondřej Suchý (Q378244):
Displaying 34 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)
- Waypoint routing on bounded treewidth graphs (Q2234792) (← links)
- On explaining integer vectors by few homogeneous segments (Q2256725) (← links)
- On structural parameterizations for the 2-club problem (Q2341718) (← links)
- A refined complexity analysis of degree anonymization in graphs (Q2347809) (← links)
- A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack (Q2400435) (← links)
- Extending the kernel for planar Steiner tree to the number of Steiner vertices (Q2408201) (← links)
- Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound (Q2453557) (← links)
- On Explaining Integer Vectors by Few Homogenous Segments (Q2842158) (← links)
- On the Parameterized Complexity of Computing Graph Bisections (Q2864292) (← links)
- An FPT algorithm for Tree Deletion Set (Q2865021) (← links)
- Effective and Efficient Data Reduction for the Subset Interconnection Design Problem (Q2872100) (← links)
- Solving Multicut Faster Than 2 n (Q2921452) (← links)
- Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzik Bound (Q2957517) (← links)
- Tree Deletion Set Has a Polynomial Kernel (but no OPT^O(1) Approximation) (Q2978504) (← links)
- The Parameterized Complexity of Local Search for TSP, More Refined (Q3104663) (← links)
- On Directed Steiner Trees with Multiple Roots (Q3181063) (← links)
- Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs (Q3402368) (← 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)
