C Ras

Identifiers

• name variant C Ras 0.50 · backfill

Papers (1)

1. The $2$-connected bottleneck Steiner network problem is NP-hard in any $\ell_p$ plane math.CO · 2019 · author #2

Mentions

No mention provenance yet.

Frequent Coauthors

• D Thomas 1 shared papers
• G Xu 1 shared papers
• M Brazil 1 shared papers