I agree that this site is using cookies. You can find further informations
here
.
X
Login
Merkliste (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
zur Desktop-Version
Toggle navigation
Merkliste
1 Ergebnisse
1
The Maximum Binary Tree Problem:
Chandrasekaran, Karthekeyan
;
Grigorescu, Elena
;
Istrate, Gabriel
...
Is Part Of LIPIcs, Volume 173, 28th Annual European Symposium on Algorithms (ESA 2020). , 2020
Link:
https://doi.org/10.4230/LIPIcs.ESA.2020.30
RT Journal T1
The Maximum Binary Tree Problem
UL https://suche.suub.uni-bremen.de/peid=base-ftdagstuhl:oai:drops-oai.dagstuhl.de:12896&Exemplar=1&LAN=DE A1 Chandrasekaran, Karthekeyan A1 Grigorescu, Elena A1 Istrate, Gabriel A1 Kulkarni, Shubhang A1 Lin, Young-San A1 Zhu, Minshen PB Schloss Dagstuhl – Leibniz-Zentrum für Informatik YR 2020 K1 maximum binary tree K1 heapability K1 inapproximability K1 fixed-parameter tractability JF Is Part Of LIPIcs, Volume 173, 28th Annual European Symposium on Algorithms (ESA 2020) LK http://dx.doi.org/https://doi.org/10.4230/LIPIcs.ESA.2020.30 DO https://doi.org/10.4230/LIPIcs.ESA.2020.30 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)