Pages that link to "Item:Q5710806"
From MaRDI portal
The following pages link to Graph-Theoretic Concepts in Computer Science (Q5710806):
Displaying 49 items.
- Assigning channels via the meet-in-the-middle approach (Q289931) (← links)
- Parameterized complexity dichotomy for \textsc{Steiner Multicut} (Q295637) (← links)
- Exact algorithms for dominating set (Q411862) (← links)
- Lower bounds on kernelization (Q456702) (← links)
- Exact exponential algorithms to find tropical connected sets of minimum size (Q527400) (← links)
- An exact algorithm for connected red-blue dominating set (Q635737) (← links)
- Fixed-parameter approximations for \(k\)-center problems in low highway dimension graphs (Q666662) (← links)
- Dynamic parameterized problems (Q722546) (← links)
- The complexity ecology of parameters: An illustration using bounded max leaf number (Q733736) (← links)
- An improved exact algorithm for the domatic number problem (Q845906) (← links)
- Solving connected dominating set faster than \(2^n\) (Q958203) (← links)
- Finding a dominating set on bipartite graphs (Q963425) (← links)
- Efficiency in exponential time for domination-type problems (Q1003475) (← links)
- On two techniques of combining branching and treewidth (Q1022343) (← links)
- Vertex and edge covers with clustering properties: Complexity and algorithms (Q1026225) (← links)
- A randomized algorithm for determining dominating sets in graphs of maximum degree five (Q1034633) (← links)
- Pathwidth of cubic graphs and exact algorithms (Q1045933) (← links)
- Algorithms for dominating clique problems (Q1758169) (← links)
- Exact exponential-time algorithms for finding bicliques (Q1944039) (← links)
- Exact algorithms for edge domination (Q1945174) (← links)
- Refined parameterizations for computing colored cuts in edge-colored graphs (Q2082563) (← links)
- Parameterized complexity of graph burning (Q2161013) (← links)
- Analyzing the reachability problem in choice networks (Q2170221) (← links)
- Inclusion/exclusion meets measure and conquer (Q2249747) (← links)
- The graph motif problem parameterized by the structure of the input graph (Q2403795) (← links)
- Solving Capacitated Dominating Set by using covering by subsets and maximum matching (Q2442208) (← links)
- Exact algorithms for problems related to the densest \(k\)-set problem (Q2448865) (← links)
- Computing the differential of a graph: hardness, approximability and exact algorithms (Q2448922) (← links)
- An exact algorithm for the minimum dominating clique problem (Q2456374) (← links)
- Improved bottleneck domination algorithms (Q2499580) (← links)
- Complexity of the exact domatic number problem and of the exact conveyor flow shop problem (Q2509032) (← links)
- A Faster Algorithm for Dominating Set Analyzed by the Potential Method (Q2891336) (← links)
- Exponential time algorithms for the minimum dominating set problem on some graph classes (Q2930282) (← links)
- Exact Exponential Algorithms to Find a Tropical Connected Set of Minimum Size (Q2946015) (← links)
- Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching (Q3057615) (← links)
- (Q4257107) (← links)
- (Q5090495) (← links)
- Fine-Grained Reductions and Quantum Speedups for Dynamic Programming. (Q5091156) (← links)
- On the Complexity of Bounded Context Switching. (Q5111714) (← links)
- Improved bounds for online dominating sets of trees (Q5136272) (← links)
- Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets (Q5505641) (← links)
- Automata, Languages and Programming (Q5716773) (← links)
- Parameterized complexity of conflict-free set cover (Q5918356) (← links)
- Fine-grained complexity of safety verification (Q5919003) (← links)
- Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation (Q5925677) (← links)
- Finding large degree-anonymous subgraphs is hard (Q5964077) (← links)
- Parameterized Complexity of Graph Burning (Q6089668) (← links)
- Exponential time algorithms for the \textsc{minimum dominating set} problem on some graph classes (Q6486931) (← links)
- Domination and Cut Problems on Chordal Graphs with Bounded Leafage (Q6492086) (← links)
