Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Parameterized Complexity of Directed Steiner Tree on Sparse Graphs."

Mark Jones et al. (2017)

> Home

Details and statistics

DOI: 10.1137/15M103618X

access: closed

type: Journal Article

metadata version: 2022-12-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamdm/JonesLRSS17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamdm/JonesLRSS17
Mark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Ondrej Suchý:
Parameterized Complexity of Directed Steiner Tree on Sparse Graphs. SIAM J. Discret. Math. 31(2): 1294-1327 (2017)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.