Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"On the Complexity of the (Approximate) Nearest Colored Node Problem."

Maximilian Probst (2018)

> Home

Details and statistics

DOI: 10.4230/LIPICS.ESA.2018.68

access: open

type: Conference or Workshop Paper

metadata version: 2020-10-25

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/esa/Probst18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/esa/Probst18
Maximilian Probst:
On the Complexity of the (Approximate) Nearest Colored Node Problem. ESA 2018: 68:1-68:14

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.