The following pages link to Dániel Marx (Q300459):
Displaying 50 items.
- Chordal editing is fixed-parameter tractable (Q300460) (← links)
- (Q345091) (redirect page) (← links)
- Rooted grid minors (Q345092) (← links)
- Enumerating homomorphisms (Q414933) (← links)
- Stable assignment with couples: parameterized complexity and local search (Q456691) (← links)
- On the parameterized complexity of finding separators with non-hereditary properties (Q494799) (← links)
- List H-coloring a graph by removing few vertices (Q527415) (← links)
- Tractable structures for constraint satisfaction with truth tables (Q537902) (← links)
- Complexity of clique coloring and related problems (Q551168) (← links)
- Multi-budgeted directed cuts (Q786027) (← links)
- Parameterized complexity of constraint satisfaction problems (Q814421) (← links)
- Parameterized graph separation problems (Q820151) (← links)
- Parameterized coloring problems on chordal graphs (Q820152) (← links)
- The complexity of chromatic strength and chromatic edge strength (Q853645) (← links)
- Searching the \(k\)-change neighborhood for TSP is W[1]-hard (Q924881) (← links)
- Complexity of unique list colorability (Q935144) (← links)
- Parameterized graph cleaning problems (Q967382) (← links)
- Chordal deletion is fixed-parameter tractable (Q973007) (← links)
- Constant ratio fixed-parameter approximation of the edge multicut problem (Q990949) (← links)
- The complexity of nonrepetitive coloring (Q1003751) (← links)
- Complexity results for minimum sum edge coloring (Q1028432) (← links)
- List edge multicoloring in graphs with few cycles (Q1029053) (← links)
- A parameterized view on matroid optimization problems (Q1035682) (← links)
- Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs (Q1725633) (← links)
- Eulerian disjoint paths problem in grid graphs is NP-complete (Q1887070) (← links)
- Bin packing with fixed number of bins revisited (Q1936245) (← links)
- Completely inapproximable monotone and antimonotone parameterized problems (Q1936258) (← links)
- Cleaning interval graphs (Q1939654) (← links)
- Clustering with local restrictions (Q1951587) (← links)
- Parameterized complexity and local search approaches for the stable marriage problem with ties (Q1959726) (← links)
- Finding and counting permutations via CSPs (Q2041985) (← links)
- Incompressibility of \(H\)-free edge modification problems: towards a dichotomy (Q2071824) (← links)
- The parameterized hardness of the \(k\)-center problem in transportation networks (Q2182096) (← links)
- Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms (Q2272595) (← links)
- Routing with congestion in acyclic digraphs (Q2274522) (← links)
- Packing cycles through prescribed vertices (Q2275896) (← links)
- Hitting forbidden subgraphs in graphs of bounded treewidth (Q2407089) (← links)
- Obtaining a planar graph by vertex deletion (Q2429328) (← links)
- Parameterized complexity of Eulerian deletion problems (Q2441593) (← links)
- A faster FPT algorithm for bipartite contraction (Q2445333) (← links)
- A short proof of the NP-completeness of minimum sum interval coloring (Q2488233) (← links)
- Precoloring extension on unit interval graphs (Q2492199) (← links)
- Minimum sum multicoloring on the edges of trees (Q2503344) (← links)
- On tree width, bramble size, and expansion (Q2519023) (← links)
- Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable (Q2843251) (← links)
- Solving Planar k -Terminal Cut in $O(n^{c \sqrt{k}})$ Time (Q2843281) (← links)
- A Tight Lower Bound for Planar Multiway Cut with Fixed Number of Terminals (Q2843292) (← links)
- Fixed-Parameter Tractability of Directed Multiway Cut Parameterized by the Size of the Cutset (Q2862207) (← links)
- Size Bounds and Query Plans for Relational Joins (Q2862210) (← links)
- Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth (Q2875147) (← links)
