Matthew Johnson 0002

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Jelle J. Oostveen

> Home > Persons > Matthew Johnson 0002

Publications

2024
[c33]
- view
  authority control:
- export record
  dblp key:
  - conf/iwoca/BodlaenderJMOPPSL24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iwoca/BodlaenderJMOPPSL24
Hans L. Bodlaender, Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem. IWOCA 2024: 206-217
2023
[i30]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2305-01613
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2305-01613
Hans L. Bodlaender, Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem. CoRR abs/2305.01613 (2023)
2022
[i26]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2211-12887
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2211-12887
Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Complexity Framework For Forbidden Subgraphs. CoRR abs/2211.12887 (2022)

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.