The following pages link to (Q4263467):
Displaying 50 items.
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter (Q372970) (← links)
- Editing graphs to satisfy degree constraints: a parameterized approach (Q414866) (← links)
- Multicut in trees viewed through the eyes of vertex cover (Q440014) (← links)
- Book review of: Rolf Niedermeier, Invitation to fixed-parameter algorithms (Q458454) (← links)
- Guarantees and limits of preprocessing in constraint satisfaction and reasoning (Q460604) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- An exact algorithm for connected red-blue dominating set (Q635737) (← links)
- Is computational complexity a barrier to manipulation? (Q656822) (← links)
- On the induced matching problem (Q657915) (← links)
- Parameterized enumeration, transversals, and imperfect phylogeny reconstruction (Q820146) (← links)
- Moving policies in cyclic assembly line scheduling (Q820155) (← links)
- Looking at the stars (Q820158) (← links)
- Refined memorization for vertex cover (Q835007) (← links)
- A top-down approach to search-trees: Improved algorithmics for 3-hitting set (Q848640) (← links)
- An efficient fixed-parameter algorithm for 3-hitting set (Q876698) (← links)
- Meta-kernelization with structural parameters (Q896025) (← links)
- Data reductions and combinatorial bounds for improved approximation algorithms (Q899583) (← links)
- A problem reduction based approach to discrete optimization algorithm design (Q975314) (← links)
- On the pseudo-achromatic number problem (Q1006054) (← links)
- On parameterized exponential time complexity (Q1029333) (← links)
- An exact algorithm for subgraph homeomorphism (Q1044032) (← links)
- Identification of function distinguishable languages. (Q1401186) (← links)
- A general method to speed up fixed-parameter-tractable algorithms (Q1607033) (← links)
- Solving large FPT problems on coarse-grained parallel machines (Q1877701) (← links)
- A fixed-parameter algorithm for minimum quartet inconsistency (Q1877704) (← links)
- On the existence of subexponential parameterized algorithms (Q1877709) (← links)
- Improved exact algorithms for MAX-SAT (Q1878397) (← links)
- Small vertex cover makes Petri net coverability and boundedness easier (Q1949744) (← links)
- Dynamic kernels for hitting sets and set packing (Q2093581) (← links)
- Parallel machine scheduling with minimum number of tardy jobs: approximation and exponential algorithms (Q2242051) (← links)
- Backdoors to planning (Q2321271) (← links)
- Backdoors to tractable answer set programming (Q2341833) (← links)
- A complete parameterized complexity analysis of bounded planning (Q2353405) (← links)
- Possible winner problems on partial tournaments: a parameterized study (Q2359793) (← links)
- A fixed-parameter tractable algorithm for matrix domination (Q2390264) (← links)
- A multivariate framework for weighted FPT algorithms (Q2402359) (← links)
- Additive stabilizers for unstable graphs (Q2419360) (← links)
- The modular decomposition of countable graphs. Definition and construction in monadic second-order logic (Q2481975) (← links)
- Sources of complexity in subset choice (Q2483826) (← links)
- Kernels in planar digraphs (Q2485283) (← links)
- A parametric analysis of the state-explosion problem in model checking (Q2495399) (← links)
- A refined search tree technique for dominating set on planar graphs (Q2575830) (← links)
- Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)
- Parametrized complexity: New developments and research frontiers (Q2776269) (← links)
- Parameterized complexity: the main ideas and connections to practical computing (Q2841253) (← links)
- The Birth and Early Years of Parameterized Complexity (Q2908529) (← links)
- The Impact of Parameterized Complexity to Interdisciplinary Problem Solving (Q2908532) (← links)
- Maximum Minimal Vertex Cover Parameterized by Vertex Cover (Q2946427) (← links)
- Surfing with Rod (Q2973715) (← links)
