pith. sign in

30 Dániel Marx

URL:https: //doi · 2004 · DOI 10.1016/j.comnet.2004.08.012

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
open at publisher browse 1 citing papers

fields

cs.DS 1

years

2026 1

verdicts

UNVERDICTED 1

representative citing papers

On the Parameterized Complexity of Min-Sum-Radii

cs.DS · 2026-05-21 · unverdicted · novelty 7.0

MSR is W[1]-hard parameterized by k+Delta on weighted bipartite graphs and by vertex cover number plus k, but FPT parameterized by treewidth plus Delta on weighted graphs.

citing papers explorer

Showing 1 of 1 citing paper.

  • On the Parameterized Complexity of Min-Sum-Radii cs.DS · 2026-05-21 · unverdicted · none · ref 19

    MSR is W[1]-hard parameterized by k+Delta on weighted bipartite graphs and by vertex cover number plus k, but FPT parameterized by treewidth plus Delta on weighted graphs.