Gabriel Istrate

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 Karthekeyan Chandrasekaran

> Home > Persons > Gabriel Istrate

Publications

2021
[j27]
- view
  authority control:
- export record
  dblp key:
  - journals/algorithmica/ChandrasekaranG21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/ChandrasekaranG21
Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu:
The Maximum Binary Tree Problem. Algorithmica 83(8): 2427-2468 (2021)
[i34]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2110-00495
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2110-00495
Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu:
Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree. CoRR abs/2110.00495 (2021)
2020
[c24]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/esa/ChandrasekaranG20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/esa/ChandrasekaranG20
Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu:
The Maximum Binary Tree Problem. ESA 2020: 30:1-30:22
[c23]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/iwpec/ChandrasekaranG20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iwpec/ChandrasekaranG20
Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu:
Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree. IPEC 2020: 7:1-7:16
2019
[i30]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1909-07915
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1909-07915
Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu:
The Maximum Binary Tree Problem. CoRR abs/1909.07915 (2019)

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.