Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Jacob Holm

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 Mathias Bæk Tejs Knudsen

> Home > Persons > Jacob Holm

Publications

2020
[j6]
- view
  authority control:
- export record
  dblp key:
  - journals/dam/AbrahamsenAHKS20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/AbrahamsenAHKS20
Mikkel Abrahamsen, Stephen Alstrup, Jacob Holm, Mathias Bæk Tejs Knudsen, Morten Stöckel:
Near-optimal induced universal graphs for cycles and paths. Discret. Appl. Math. 282: 1-13 (2020)
2017
[c9]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/icalp/AbrahamsenAHKS17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/AbrahamsenAHKS17
Mikkel Abrahamsen, Stephen Alstrup, Jacob Holm, Mathias Bæk Tejs Knudsen, Morten Stöckel:
Near-Optimal Induced Universal Graphs for Bounded Degree Graphs. ICALP 2017: 128:1-128:14
2016
[i4]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/AbrahamsenAHKS16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/AbrahamsenAHKS16
Mikkel Abrahamsen, Stephen Alstrup, Jacob Holm, Mathias Bæk Tejs Knudsen, Morten Stöckel:
Near-Optimal Induced Universal Graphs for Bounded Degree Graphs. CoRR abs/1607.04911 (2016)

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.