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
Solving Connectivity Problems Parameterized by Treewidth in..:
Cygan, Marek
;
Nederlof, Jesper
;
Pilipczuk, Marcin
...
ACM Transactions on Algorithms (TALG). 18 (2022) 2 - p. 1-31 , 2022
Link:
https://dl.acm.org/doi/10.1145/3506707
RT Journal T1
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
UL https://suche.suub.uni-bremen.de/peid=acm-3506707&Exemplar=1&LAN=DE A1 Cygan, Marek A1 Nederlof, Jesper A1 Pilipczuk, Marcin A1 Pilipczuk, Michał A1 Van Rooij, Johan M. M. A1 Wojtaszczyk, Jakub Onufry PB ACM YR 2022 SN 1549-6325 SN 1549-6333 K1 Treewidth K1 connectivity problems K1 feedback vertex set K1 steiner tree K1 hamilton path/cycle K1 Isolation Lemma K1 Theory of computation K1 Graph algorithms analysis K1 Parameterized complexity and exact algorithms K1 Algorithm design techniques K1 Mathematics of computing K1 Paths and connectivity problems K1 Graph algorithms JF ACM Transactions on Algorithms (TALG) VO 18 IS 2 SP 1 OP 31 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/3506707 DO https://dl.acm.org/doi/10.1145/3506707 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)