Pages that link to "Item:Q383833"
From MaRDI portal
The following pages link to Fundamentals of parameterized complexity (Q383833):
Displaying 40 items.
- On computing large temporal (unilateral) connected components (Q6564621) (← links)
- Temporal reachability minimization: delaying vs. deleting (Q6564622) (← links)
- Scheduling with cardinality dependent unavailability periods (Q6565385) (← links)
- The bus rapid transit investment problem (Q6568452) (← links)
- Parameterized algorithms for fixed-order book drawing with few crossings per edge (Q6569894) (← links)
- Strong backdoors for default logic (Q6570091) (← links)
- On layered area-proportional rectangle contact representations (Q6575391) (← links)
- The parameterized complexity of finding minimum bounded chains (Q6577440) (← links)
- Conflict-free coloring: graphs of bounded clique-width and intersection graphs (Q6582374) (← links)
- Slim tree-cut width (Q6586668) (← links)
- Polynomial Turing compressions for some graph problems parameterized by modular-width (Q6591463) (← links)
- How I got to like graph polynomials (Q6593617) (← links)
- Exactly hittable interval graphs (Q6599815) (← links)
- Faster parameterized algorithms for modification problems to minor-closed classes (Q6601299) (← links)
- Twin-treewidth: a single-exponential logic-based approach (Q6606218) (← links)
- Search-space reduction via essential vertices (Q6606914) (← links)
- Strong backdoors for default logic (Q6610193) (← links)
- The parameterized complexity of welfare guarantees in Schelling segregation (Q6614026) (← links)
- \(b\)-coloring parameterized by clique-width (Q6614620) (← links)
- Parameterized problems complete for nondeterministic FPT time and logarithmic space (Q6614886) (← links)
- On critical node problems with vulnerable vertices (Q6616219) (← links)
- Fixed-parameter algorithms for computing RAC drawings of graphs (Q6618251) (← links)
- Parameterized complexity of weighted team definability (Q6620025) (← links)
- Parameterized inapproximability of the minimum distance problem over all fields and the shortest vector problem in all \(\ell_{p}\) norms (Q6621748) (← links)
- Algorithmic meta-theorems for combinatorial reconfiguration revisited (Q6623591) (← links)
- Cluster editing for multi-layer and temporal graphs (Q6635696) (← links)
- Tight double exponential lower bounds (Q6636075) (← links)
- Counting on rainbow \(k\)-connections (Q6636091) (← links)
- Fixed-parameter algorithms for computing bend-restricted RAC drawings of graphs (Q6636993) (← links)
- Modification problems toward proper (Helly) circular-arc graphs (Q6647753) (← links)
- Structural parameterizations of vertex integrity (Q6652467) (← links)
- Parameterized results on acyclic matchings with implications for related problems (Q6655671) (← links)
- Quasi-kernels in split graphs (Q6657231) (← links)
- Complexity of maker-breaker games on edge sets of graphs (Q6657252) (← links)
- More on the complexity of defensive domination in graphs (Q6657275) (← links)
- On layered area-proportional rectangle contact representations (Q6658314) (← links)
- On the computational complexity of the strong geodetic recognition problem (Q6658857) (← links)
- The complexity of optimizing atomic congestion (Q6665726) (← links)
- Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion (Q6670351) (← links)
- Maximum locally irregular induced subgraphs via minimum irregulators (Q6671395) (← links)