The following pages link to V. Leoni (Q324742):
Displaying 29 items.
- NP-completeness of the \(\{k \}\)-packing function problem in graphs (Q324745) (← links)
- Complexity of \(k\)-tuple total and total \(\{k\}\)-dominations for some subclasses of bipartite graphs (Q1653049) (← links)
- Improved algorithms for \(k\)-domination and total \(k\)-domination in proper interval graphs (Q1661898) (← links)
- A characterization of edge-perfect graphs and the complexity of recognizing some combinatorial optimization games (Q1941537) (← links)
- The multiple domination and limited packing problems in graphs (Q1944215) (← links)
- Labelled packing functions in graphs (Q2011027) (← links)
- Tuple domination on graphs with the consecutive-zeros property (Q2132374) (← links)
- New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs (Q2330102) (← links)
- Generalized limited packings of some graphs with a limited number of \(P_4\)-partners (Q2344754) (← links)
- On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs (Q2345849) (← links)
- Limited packing and multiple domination problems: polynomial time reductions (Q2448892) (← links)
- Characterizations of postman sets (Q2483397) (← links)
- Note on: N. E. Aguilera, M. S. Escalante, G. L. Nasini, ``The disjunctive procedure and blocker duality'' (Q2565860) (← links)
- Towards a Polynomial Equivalence Between $$\{k\}$$ -Packing Functions and k-Limited Packings in Graphs (Q2835672) (← links)
- Polynomial reductions between the Limited Packing and Tuple Domination problems in graphs (Q2840710) (← links)
- The computational complexity of the Edge-Perfect Graph and the Totally Balanced Packing Game recognition problems (Q2883612) (← links)
- The k-limited packing and k-tuple domination problems in strongly chordal, P4-tidy and split graphs (Q2883613) (← links)
- On the complexity of the {<i>k</i>}-packing function problem (Q2968508) (← links)
- On the complexity of the labeled domination problem in graphs (Q2968509) (← links)
- On the computational complexity of combinatorial flexibility problems (Q3066977) (← links)
- (Q3143963) (← links)
- $$\{k\}$$-Packing Functions of Graphs (Q3195342) (← links)
- Combinatorial flexibility problems and their computational complexity (Q3503571) (← links)
- On the influence of resequencing on the regularity of service (Q4779407) (← links)
- (Q5476491) (← links)
- (Q5708478) (← links)
- New complexity results on Roman {2}-domination (Q6050641) (← links)
- \(k\)-tuple and \(k\)-tuple total dominations on web graphs (Q6496787) (← links)
- On the proper interval completion problem within some chordal subclasses (Q6635117) (← links)
