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?)
- An approximation algorithm for the total covering problem
- An efficient algorithm for mixed domination on generalized series-parallel graphs
- Fine-grained parameterized complexity analysis of graph coloring problems
- Finer tight bounds for coloring on clique-width
- Improved parameterized algorithms and kernels for mixed domination
- Intractability of clique-width parameterizations
- Known algorithms on graphs of bounded treewidth are probably optimal
- Mixed Dominating Set: a parameterized perspective
- On cliques in graphs
- On fixed-parameter tractability of the mixed domination problem for graphs with bounded tree-width
- On the algorithmic complexity of twelve covering and independence parameters of graphs
- On the complexity of Mixed Dominating Set
- On the mixed domination problem in graphs
- On total covering and matching of graphs
- On total covers of graphs
- On total matching numbers and total covering numbers of complementary graphs
- Optimal dynamic program for \(r\)-domination problems over tree decompositions
- Parameterized algorithms
- Parameterized orientable deletion
- Structural parameters, tight bounds, and approximation for \((k, r)\)-center
- Structurally parameterized \(d\)-scattered set
- The algorithmic complexity of mixed domination in graphs
- Tight approximation ratio for Minimum Maximal Matching
- Total matchings and total coverings of graphs
- Total matchings and total coverings of threshold 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)
