scientific article; zbMATH DE number 7764100
From MaRDI portal
Publication:6089653
DOI10.4230/lipics.ipec.2020.9MaRDI QIDQ6089653
Vangelis Th. Paschos, Michael Lampis, Louis Dublois
Publication date: 13 November 2023
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx) Parameterized complexity, tractability and kernelization (68Q27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The algorithmic complexity of mixed domination in graphs
- On total covers of graphs
- On total matching numbers and total covering numbers of complementary graphs
- On total covering and matching of graphs
- On the algorithmic complexity of twelve covering and independence parameters of graphs
- Total matchings and total coverings of threshold graphs
- Structurally parameterized \(d\)-Scattered Set
- Mixed Dominating Set: a parameterized perspective
- On the mixed domination problem in graphs
- Tight approximation ratio for Minimum Maximal Matching
- Improved parameterized algorithms and kernels for mixed domination
- On the complexity of Mixed Dominating Set
- Structural parameters, tight bounds, and approximation for \((k, r)\)-center
- Intractability of Clique-Width Parameterizations
- An approximation algorithm for the total covering problem
- Total matchings and total coverings of graphs
- Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal
- Optimal dynamic program for r-domination problems over tree decompositions
- An efficient algorithm for Mixed domination on Generalized Series-Parallel Graphs
- Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems
- Parameterized Algorithms
- On cliques in graphs
This page was built for publication:
