Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

William S. Evans

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 Tim Ophelders

> Home > Persons > William S. Evans

Publications

2023
[j38]
- view
  - electronic edition @ cgt-journal.org
  - no references & citations available
- export record
  dblp key:
  - journals/cgt/BuchinEFKLO023
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cgt/BuchinEFKLO023
Kevin Buchin, William S. Evans, Fabrizio Frati, Irina Kostitsyna, Maarten Löffler, Tim Ophelders, Alexander Wolff:
Morphing Planar Graph Drawings Through 3D. Comput. Geom. Topol. 2(1): 5:1-5:18 (2023)
[c51]
- view
  authority control:
- export record
  dblp key:
  - conf/sofsem/BuchinEFKLOW23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sofsem/BuchinEFKLOW23
Kevin Buchin, William S. Evans, Fabrizio Frati, Irina Kostitsyna, Maarten Löffler, Tim Ophelders, Alexander Wolff:
Morphing Planar Graph Drawings Through 3D. SOFSEM 2023: 80-95
2022
[i18]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2210-05384
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2210-05384
Kevin Buchin, William S. Evans, Fabrizio Frati, Irina Kostitsyna, Maarten Löffler, Tim Ophelders, Alexander Wolff:
Morphing Planar Graph Drawings Through 3D. CoRR abs/2210.05384 (2022)

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.