Information Processing Letters

Paper

23 Jul 1982

Complexity of finding k-path-free dominating sets in graphs

View publication

Abstract

No abstract available.

Related

Invited paper

Software Services Engineering Manifesto – A Cross-Cutting Declaration

Demo paper

Automated Relational Data Explanation using External Semantic Knowledge

Talk

On the automation of de-novo molecular design and chemical synthesis planning: A case study on SARS-CoV-2

Paper

Effective generation of compressed stationary Gaussian fields

View all publications