Refreshing results…
Computing the Largest Bond and the Maximum Connected Cut of a Graph
Download from link.springer.comParameterized Orientable Deletion
UploadOn directed covering and domination problems
UploadSubgraph Isomorphism on Graph Classes that Exclude a Substructure
Download from doi.orgParameterized Complexity of Safe Set
Download from doi.orgParameterized Algorithms for Maximum Cut with Connectivity Constraints
Download from doi.orgOptimal Partition of a Tree with Social Distance
UploadReconfiguring Spanning and Induced Subgraphs
Download from arxiv.orgNew results on directed edge dominating set
Download from dmtcs.episciences.orgMissing publications? Search for publications with a matching author name.