Adil I. Erzin

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 Gregory Melidi

> Home > Persons > Adil I. Erzin

Publications

2021
[j7]
- view
  authority control:
- export record
  dblp key:
  - journals/ol/ErzinMNP21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ol/ErzinMNP21
Adil I. Erzin, Gregory Melidi, Stepan Nazarenko, Roman V. Plotnikov:
Two-Bar Charts Packing Problem. Optim. Lett. 15(6): 1955-1971 (2021)
[i8]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2106-09919
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2106-09919
Adil I. Erzin, Gregory Melidi, Stepan Nazarenko, Roman V. Plotnikov:
Approximation Algorithms for Two-Bar Charts Packing Problem. CoRR abs/2106.09919 (2021)
2020
[i7]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2005-14195
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2005-14195
Adil I. Erzin, Gregory Melidi, Stepan Nazarenko, Roman V. Plotnikov:
Two-Bar Charts Packing Problem. CoRR abs/2005.14195 (2020)
[i6]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2006-10361
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2006-10361
Adil I. Erzin, Stepan Nazarenko, Gregory Melidi, Roman V. Plotnikov:
A 3/2-approximation for big two-bar charts packing. CoRR abs/2006.10361 (2020)

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.