SIAM Journal on Computing, 0097-5397

Journal

1 - 4 out of 4Page size: 10

Publications

  1. 2020
  2. Accepted/In press

    Algorithms for #BIS-hard problems on expander graphs

    Matthew Jenssen, Will Perkins, 28 May 2020, (Accepted/In press) In: SIAM Journal on Computing.

    Research output: Contribution to journal › Article › peer-review

  3. Published

    Tight bounds for planar strongly connected Steiner subgraph with fixed number of terminals (and extensions)

    Rajesh Chitnis, 25 Mar 2020, In: SIAM Journal on Computing. 49, 2, p. 318–364 47 p.

    Research output: Contribution to journal › Article › peer-review

  4. 2018
  5. Published

    On the Complexity of Random Satisfiability Problems with Planted Solutions

    Will Perkins, 12 Jul 2018, In: SIAM Journal on Computing. 47, 4, p. 1294–1338 45 p.

    Research output: Contribution to journal › Article › peer-review

  6. 2016
  7. Published

    Designing FPT algorithms for cut problems using randomized contractions

    Rajesh Chitnis, 6 Jul 2016, In: SIAM Journal on Computing. 45, 4, p. 1171-1229 59 p.

    Research output: Contribution to journal › Article › peer-review