Matthew J. Katz

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 Yoshio Okamoto

> Home > Persons > Matthew J. Katz

Publications

2020
[j68]
- view
  authority control:
- export record
  dblp key:
  - journals/comgeo/CarmiCKKORRSS20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/comgeo/CarmiCKKORRSS20
Paz Carmi, Man-Kwun Chiu, Matthew J. Katz, Matias Korman, Yoshio Okamoto, André van Renssen, Marcel Roeloffzen, Taichi Shiitada, Shakhar Smorodinsky:
Balanced line separators of unit disk graphs. Comput. Geom. 86 (2020)
2017
[c62]
- view
  authority control:
- export record
  dblp key:
  - conf/wads/CarmiCKKORRSS17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wads/CarmiCKKORRSS17
Paz Carmi, Man-Kwun Chiu, Matthew J. Katz, Matias Korman, Yoshio Okamoto, André van Renssen, Marcel Roeloffzen, Taichi Shiitada, Shakhar Smorodinsky:
Balanced Line Separators of Unit Disk Graphs. WADS 2017: 241-252
[i14]
- view
  - electronic edition @ arxiv.org (open access)
  - details & citations
- export record
  dblp key:
  - journals/corr/abs-1709-02579
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1709-02579
Paz Carmi, Man-Kwun Chiu, Matthew J. Katz, Matias Korman, Yoshio Okamoto, André van Renssen, Marcel Roeloffzen, Taichi Shiitada, Shakhar Smorodinsky:
Balanced Line Separators of Unit Disk Graphs. CoRR abs/1709.02579 (2017)

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.