Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Yuri Rabinovich

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 Feodor F. Dragan

> Home > Persons > Yuri Rabinovich

Publications

2012
[j16]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dcg/ChepoiDNRV12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dcg/ChepoiDNRV12
Victor Chepoi, Feodor F. Dragan, Ilan Newman, Yuri Rabinovich, Yann Vaxès:
Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs. Discret. Comput. Geom. 47(1): 187-214 (2012)
2010
[c17]
- view
  authority control:
- export record
  dblp key:
  - conf/approx/ChepoiDNRV10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/approx/ChepoiDNRV10
Victor Chepoi, Feodor F. Dragan, Ilan Newman, Yuri Rabinovich, Yann Vaxès:
Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs. APPROX-RANDOM 2010: 95-109
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1007-0489
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1007-0489
Victor Chepoi, Feodor F. Dragan, Ilan Newman, Yuri Rabinovich, Yann Vaxès:
Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs. CoRR abs/1007.0489 (2010)

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.