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
Complexity of the (Connected) Cluster Vertex Deletion Probl..:
Le, Hoang-Oanh
;
Le, Van Bang
Theory of Computing Systems. 68 (2024) 2 - p. 250-270 , 2024
Link:
https://doi.org/10.1007/s00224-024-10161-3
RT Journal T1
Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs
UL https://suche.suub.uni-bremen.de/peid=cr-10.1007_s00224-024-10161-3&Exemplar=1&LAN=DE A1 Le, Hoang-Oanh A1 Le, Van Bang PB Springer Science and Business Media LLC YR 2024 SN 1432-4350 SN 1433-0490 JF Theory of Computing Systems VO 68 IS 2 SP 250 OP 270 LK http://dx.doi.org/https://doi.org/10.1007/s00224-024-10161-3 DO https://doi.org/10.1007/s00224-024-10161-3 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)