4 papers
Deterministic Single Exponential Time Algorithms for Co-Path Packing and Co-Path Set Parameterized by Treewidth
Yuxi Liu, Kangyi Tian, Mingyu Xiao
The \textsc{Co-Path Packing} (resp., \textsc{Co-Path Set}) problem asks whether a given graph can be edited to a collection of induced paths by deleting at most vertices (resp.…
Linear Kernels for -Exact Component Order Connectivity
Yuxi Liu, Mingyu Xiao
The \textsc{-Exact Component Order Connectivity} problem asks whether, given an input graph and an integer , there exists a vertex subset of size at mos…
Abundance of Bergman metrics with constant positive holomorphic sectional curvature
Shreedhar Bhat, Soumya Ganguly, Achinta Kumar Nandi +1
An outstanding open question, which has attracted renewed attention following the pioneering work of Huang--Li--Treuer, is whether, for a given positive integer , there exists a…
Deduction, Constrained Zero Forcing, and Constrained Searching
Andrea Burgess, Danny Dyer, Kerry Ojakian +3
Deduction is a recently introduced graph searching process in which searchers clear the vertex set of a graph with one move each, with each searcher's movement determined by which…