The k-node-connected subgraph problem: Facets and Branch-and-Cut | IEEE Conference Publication | IEEE Xplore