Gerd Wechsung

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 André Große

> Home > Persons > Gerd Wechsung

Publications

2006
[j27]
- view
  authority control:
- export record
  dblp key:
  - journals/ipl/GrosseRW06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/GrosseRW06
André Große, Jörg Rothe, Gerd Wechsung:
On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P. Inf. Process. Lett. 99(6): 215-221 (2006)
2002
[j24]
- view
  authority control:
- export record
  dblp key:
  - journals/mst/GrosseRW02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/GrosseRW02
André Große, Jörg Rothe, Gerd Wechsung:
Computing Complete Graph Isomorphisms and Hamiltonian Cycles from Partial Ones. Theory Comput. Syst. 35(1): 81-93 (2002)
2001
[c20]
- view
  authority control:
- export record
  dblp key:
  - conf/ictcs/GrosseRW01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ictcs/GrosseRW01
André Große, Jörg Rothe, Gerd Wechsung:
Relating Partial and Complete Solutions and the Complexity of Computing Smallest Solutions. ICTCS 2001: 339-356
[i7]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/cs-CC-0106041
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/cs-CC-0106041
André Große, Jörg Rothe, Gerd Wechsung:
Computing Complete Graph Isomorphisms and Hamiltonian Cycles from Partial Ones. CoRR cs.CC/0106041 (2001)
[i6]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/cs-CC-0106045
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/cs-CC-0106045
André Große, Jörg Rothe, Gerd Wechsung:
A Note on the Complexity of Computing the Smallest Four-Coloring of Planar Graphs. CoRR cs.CC/0106045 (2001)

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.