Alina Ene

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 Nitish Korula

> Home > Persons > Alina Ene

Publications

2013
[i6]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1305-4308
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1305-4308
Alina Ene, Nitish Korula, Ali Vakilian:
Improved Approximation Algorithms for Connected Domatic Partitions and Related Problems. CoRR abs/1305.4308 (2013)
2011
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/soda/BateniCEHKM11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/BateniCEHKM11
MohammadHossein Bateni, Chandra Chekuri, Alina Ene, Mohammad Taghi Hajiaghayi, Nitish Korula, Dániel Marx:
Prize-collecting Steiner Problems on Planar Graphs. SODA 2011: 1028-1049
2010
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1006-4357
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1006-4357
Chandra Chekuri, Alina Ene, Nitish Korula:
Prize-Collecting Steiner Tree and Forest in Planar Graphs. CoRR abs/1006.4357 (2010)
2009
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/approx/ChekuriEK09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/approx/ChekuriEK09
Chandra Chekuri, Alina Ene, Nitish Korula:
Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs. APPROX-RANDOM 2009: 42-55

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.