3 problems

Let $G=(V,E)$ be the graph in an instance of M-EPVCB, and let $\Delta(G)$ denote its maximum degree. The degree-deficit hardness conjecture. M-EPVCB is W[1]-hard with respect to th…

Let $G=(X,Y,E)$ be the edge-weighted bipartite graph in an instance of M-EPVCB, and let $|X|$ and $|Y|$ denote the sizes of its two bipartition classes. The minimum-side hardness c…

Minimum oriented diameter conjecture.