Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Pim van 't Hof

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 Daniel Lokshtanov

> Home > Persons > Pim van 't Hof

Publications

2014
[j23]
- view
  authority control:
- export record
  dblp key:
  - journals/algorithmica/HeggernesHLLP14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/HeggernesHLLP14
Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul:
Contracting Graphs to Paths and Trees. Algorithmica 68(1): 109-132 (2014)
2013
[j14]
- view
  authority control:
- export record
  dblp key:
  - journals/siamdm/HeggernesHLP13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamdm/HeggernesHLP13
Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul:
Obtaining a Bipartite Graph by Contracting Few Edges. SIAM J. Discret. Math. 27(4): 2143-2156 (2013)
2012
[j6]
- view
  authority control:
- export record
  dblp key:
  - journals/siamdm/HeggernesHLN12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamdm/HeggernesHLN12
Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Jesper Nederlof:
Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time. SIAM J. Discret. Math. 26(3): 1008-1021 (2012)
2011
[c12]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/fsttcs/HeggernesHLP11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fsttcs/HeggernesHLP11
Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul:
Obtaining a Bipartite Graph by Contracting Few Edges. FSTTCS 2011: 217-228
[c10]
- view
  authority control:
- export record
  dblp key:
  - conf/iwpec/HeggernesHLLP11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iwpec/HeggernesHLLP11
Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul:
Contracting Graphs to Paths and Trees. IPEC 2011: 55-66
[i2]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1102-5441
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1102-5441
Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul:
Obtaining a Bipartite Graph by Contracting Few Edges. CoRR abs/1102.5441 (2011)
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1104-3677
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1104-3677
Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul:
Contracting Graphs to Paths and Trees. CoRR abs/1104.3677 (2011)
2010
[c6]
- view
  authority control:
- export record
  dblp key:
  - conf/wg/HeggernesHLN10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wg/HeggernesHLN10
Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Jesper Nederlof:
Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time. WG 2010: 75-87

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.