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
Improved Bounds for Bipartite Matching on Surfaces:
Datta, Samir
;
Gopalan, Arjun
;
Kulkarni, Raghav
.
hal-00678185. , 2012
Link:
https://hal.archives-ouvertes.fr/hal-00678185
RT Journal T1
Improved Bounds for Bipartite Matching on Surfaces
UL https://suche.suub.uni-bremen.de/peid=base-ftccsdartic:oai:HAL:hal-00678185v1&Exemplar=1&LAN=DE A1 Datta, Samir A1 Gopalan, Arjun A1 Kulkarni, Raghav A1 Tewari, Raghunath PB HAL CCSD; LIPIcs YR 2012 K1 Perfect Matching K1 Graphs on Surfaces K1 Space Complexity K1 NC K1 UL K1 [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC] K1 [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS] JF hal-00678185 LK http://dx.doi.org/https://hal.archives-ouvertes.fr/hal-00678185 DO https://hal.archives-ouvertes.fr/hal-00678185 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)