scientific article; zbMATH DE number 7764100
From MaRDI portal
Publication:6089653
DOI10.4230/LIPICS.IPEC.2020.9MaRDI QIDQ6089653FDOQ6089653
Authors: Louis Dublois, Michael Lampis, Vangelis Th. Paschos 
Publication date: 13 November 2023
Title of this publication is not available (Why is that?)
Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx) Parameterized complexity, tractability and kernelization (68Q27)
Cites Work
- Title not available (Why is that?)
- Parameterized algorithms
- On cliques in graphs
- On the mixed domination problem in graphs
- Intractability of clique-width parameterizations
- The algorithmic complexity of mixed domination in graphs
- On total matching numbers and total covering numbers of complementary graphs
- On the algorithmic complexity of twelve covering and independence parameters of graphs
- Total matchings and total coverings of graphs
- Improved parameterized algorithms and kernels for mixed domination
- On total covers of graphs
- An approximation algorithm for the total covering problem
- Known algorithms on graphs of bounded treewidth are probably optimal
- Fine-grained parameterized complexity analysis of graph coloring problems
- Optimal dynamic program for \(r\)-domination problems over tree decompositions
- On total covering and matching of graphs
- Tight approximation ratio for Minimum Maximal Matching
- Total matchings and total coverings of threshold graphs
- Structurally parameterized \(d\)-scattered set
- Mixed Dominating Set: a parameterized perspective
- Title not available (Why is that?)
- Title not available (Why is that?)
- Structural parameters, tight bounds, and approximation for \((k, r)\)-center
- On the complexity of Mixed Dominating Set
- On fixed-parameter tractability of the mixed domination problem for graphs with bounded tree-width
- An efficient algorithm for Mixed domination on Generalized Series-Parallel Graphs
Cited In (2)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6089653)
