min independent dominating set
Fast Algorithms for min independent dominating set
10
The max quasi-independent set problem
16
Efficient approximation of MIN SET COVER by moderately exponential algorithms
19
The Max Quasi-Independent Set Problem
21
The identifying code, the locating-dominating, the open locating-dominating and the locating total-dominating problems under some graph operations
13
Extension of Vertex Cover and Independent Set in Some Classes of Graphs
21
Polyhedra Associated with Open Locating-Dominating and Locating Total-Dominating Sets in Graphs
14
Interrogation 10 min
2
Exact Algorithms for Dominating Clique Problems
13
A relation between the approximated versions of minimum set covering, minimum vertex covering and maximum independent set
12
Improved FPT algorithms for weighted independent set in bull-free graphs
15
On the Maximum Independent Set Problem in Subclasses of Subcubic Graphs
13
A priori optimization for the probabilistic maximum independent set problem
26
A Hölderian backtracking method for min-max and min-min problems
20
Dominating sets reconfiguration under token sliding
18
Dominating the Erdos-Moser theorem in reverse mathematics
37
A method for eternally dominating strong grids
12
Enumerating Minimal Dominating Sets in Triangle-Free Graphs
13
Regulatory Features Underlying Pollination-Dependent and -Independent Tomato Fruit Set Revealed by Transcript and Primary Metabolite Profiling
26
The duality between the anti-exchange closure operators and the path independent choice operators on a finite set,
27