| Polynomial time algorithm for k-vertex-edge dominating problem in interval graphs | Journal of Combinatorial Optimization |
- Science: Mathematics: Instruments and machines: Electronic computers. Computer science
- Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
- Science: Mathematics
- Technology: Engineering (General). Civil engineering (General)
- Science: Mathematics
| 1 | 2023 |
| Double vertex-edge domination in graphs: complexity and algorithms | Journal of Applied Mathematics and Computing |
- Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
- Science: Mathematics
| 2 | 2021 |
| Vertex-edge domination in graphs | Aequationes mathematicae |
- Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
- Science: Mathematics
| 14 | 2019 |
| Bounds on the vertex–edge domination number of a tree | Comptes Rendus. Mathématique |
- Science: Mathematics
- Science: Mathematics
| 20 | 2014 |
| Hardness results and approximation algorithms of k-tuple domination in graphs | Information Processing Letters |
- Technology: Technology (General): Industrial engineering. Management engineering: Information technology
- Technology: Electrical engineering. Electronics. Nuclear engineering: Telecommunication
- Science: Science (General): Cybernetics: Information theory
- Science: Mathematics: Instruments and machines: Electronic computers. Computer science
| 36 | 2004 |