Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

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 Nick Brettell

> Home > Persons > Matthew Johnson 0002

Publications

2022
[j52]
- view
  authority control:
- export record
  dblp key:
  - journals/jcss/BrettellJP22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcss/BrettellJP22
Nick Brettell, Matthew Johnson, Daniël Paulusma:
Computing Weighted Subset Odd Cycle Transversals in H-free graphs. J. Comput. Syst. Sci. 128: 71-85 (2022)
[j51]
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/BrettellJPP22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/BrettellJPP22
Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma:
Computing subset transversals in H-free graphs. Theor. Comput. Sci. 902: 76-92 (2022)
2021
[j47]
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/BodlaenderBJPPL21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/BodlaenderBJPPL21
Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen:
Steiner trees for hereditary graph classes: A treewidth perspective. Theor. Comput. Sci. 867: 30-39 (2021)
[c29]
- view
  authority control:
- export record
  dblp key:
  - conf/wads/BrettellJP21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wads/BrettellJP21
Nick Brettell, Matthew Johnson, Daniël Paulusma:
Computing Weighted Subset Transversals in H-Free Graphs. WADS 2021: 229-242
2020
[c28]
- view
  authority control:
- export record
  dblp key:
  - conf/latin/BodlaenderB0PPL20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/latin/BodlaenderB0PPL20
Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen:
Steiner Trees for Hereditary Graph Classes. LATIN 2020: 613-624
[c27]
- view
  authority control:
- export record
  dblp key:
  - conf/wg/BrettellJPP20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wg/BrettellJPP20
Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma:
Computing Subset Transversals in H-Free Graphs. WG 2020: 187-199
[i25]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2004-07492
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2004-07492
Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen:
Steiner Trees for Hereditary Graph Classes: a Treewidth Perspective. CoRR abs/2004.07492 (2020)
[i24]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2005-13938
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2005-13938
Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma:
Computing Subset Transversals in H-Free Graphs. CoRR abs/2005.13938 (2020)
[i23]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2007-14514
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2007-14514
Nick Brettell, Matthew Johnson, Daniël Paulusma:
Computing Weighted Subset Transversals in H-Free Graphs. CoRR abs/2007.14514 (2020)

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.