Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Yann Vaxès

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 Karim Nouioua

> Home > Persons > Yann Vaxès

Publications

2017
[j26]
- view
  authority control:
- export record
  dblp key:
  - journals/networks/CatusseCNV17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/CatusseCNV17
Nicolas Catusse, Victor Chepoi, Karim Nouioua, Yann Vaxès:
Bidirected minimum Manhattan network problem. Networks 69(2): 167-178 (2017)
2012
[j20]
- view
  authority control:
- export record
  dblp key:
  - journals/algorithmica/CatusseCNV12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/CatusseCNV12
Nicolas Catusse, Victor Chepoi, Karim Nouioua, Yann Vaxès:
Minimum Manhattan Network Problem in Normed Planes with Polygonal Balls: A Factor 2.5 Approximation Algorithm. Algorithmica 63(1-2): 551-567 (2012)
2011
[i5]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1107-1359
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1107-1359
Nicolas Catusse, Victor Chepoi, Karim Nouioua, Yann Vaxès:
Bidirected minimum Manhattan network problem. CoRR abs/1107.1359 (2011)
2010
[j16]
- view
  authority control:
- export record
  dblp key:
  - journals/ijcga/ChepoiNTV10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijcga/ChepoiNTV10
Victor Chepoi, Karim Nouioua, Edouard Thiel, Yann Vaxès:
Pareto Envelopes in Simple Polygons. Int. J. Comput. Geom. Appl. 20(6): 707-721 (2010)
[i3]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/CatusseCNV10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/CatusseCNV10
Nicolas Catusse, Victor Chepoi, Karim Nouioua, Yann Vaxès:
Minimum Manhattan network problem in normed planes with polygonal balls: a factor 2.5 approximation algorithm. CoRR abs/1004.5517 (2010)
2008
[j14]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/ChepoiNV08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/ChepoiNV08
Victor Chepoi, Karim Nouioua, Yann Vaxès:
A rounding algorithm for approximating minimum Manhattan networks. Theor. Comput. Sci. 390(1): 56-69 (2008)
2006
[j11]
- view
  authority control:
- export record
  dblp key:
  - journals/algorithmica/ChepoiENV06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/ChepoiENV06
Victor Chepoi, Bertrand Estellon, Karim Nouioua, Yann Vaxès:
Mixed Covering of Trees and the Augmentation Problem with Odd Diameter Constraints. Algorithmica 45(2): 209-226 (2006)
2005
[j8]
- view
  authority control:
- export record
  dblp key:
  - journals/endm/ChepoiENV05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/endm/ChepoiENV05
Victor Chepoi, Bertrand Estellon, Karim Nouioua, Yann Vaxès:
Mixed covering of trees and the augmentation problem with odd diameter constraints. Electron. Notes Discret. Math. 22: 405-408 (2005)
[c5]
- view
  authority control:
- export record
  dblp key:
  - conf/approx/ChepoiNV05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/approx/ChepoiNV05
Victor Chepoi, Karim Nouioua, Yann Vaxès:
A Rounding Algorithm for Approximating Minimum Manhattan Networks. APPROX-RANDOM 2005: 40-51

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.