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 Longest Subsequence-Repeated Subsequence Problem:
, In:
Combinatorial Optimization and Applications; Lecture Notes in Computer Science
,
Lafond, Manuel
;
Lai, Wenfeng
;
Liyanage, Adiesha
. - p. 446-458 , 2023
Link:
https://doi.org/10.1007/978-3-031-49611-0_32
RT T1 <cTitle>Combinatorial Optimization and Applications; Lecture Notes in Computer Science</cTitle>: T1 <Title>The Longest Subsequence-Repeated Subsequence Problem</Title> UL https://suche.suub.uni-bremen.de/peid=cr-10.1007_978-3-031-49611-0_32&Exemplar=1&LAN=DE A1 Lafond, Manuel A1 Lai, Wenfeng A1 Liyanage, Adiesha A1 Zhu, Binhai PB Springer Nature Switzerland YR 2023 SP 446 OP 458 LK http://dx.doi.org/https://doi.org/10.1007/978-3-031-49611-0_32 DO https://doi.org/10.1007/978-3-031-49611-0_32 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
