Haiko Müller

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 Jitender S. Deogun

> Home > Persons > Haiko Müller

Publications

1999
[j19]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/dam/DeogunKKM99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/DeogunKKM99
Jitender S. Deogun, Ton Kloks, Dieter Kratsch, Haiko Müller:
On the Vertex Ranking Problem for Trapezoid, Circular-arc and Other Graphs. Discret. Appl. Math. 98(1-2): 39-63 (1999)
1998
[j12]
- view
  authority control:
- export record
  dblp key:
  - journals/siamdm/BodlaenderDJKKMT98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamdm/BodlaenderDJKKMT98
Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza:
Rankings of Graphs. SIAM J. Discret. Math. 11(1): 168-181 (1998)
1994
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/stacs/DeogunKKM94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stacs/DeogunKKM94
Jitender S. Deogun, Ton Kloks, Dieter Kratsch, Haiko Müller:
On Vertex Ranking for Permutations and Other Graphs. STACS 1994: 747-758
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/wg/BodlaenderDJKKMT94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wg/BodlaenderDJKKMT94
Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza:
Ranking of Graphs. WG 1994: 292-304

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.