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
Vertex deletion parameterized by elimination distance and e..:
, In:
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
,
Jansen, Bart M. P.
;
de Kroon, Jari J. H.
;
Włodarczyk, Michał
- p. 1757-1769 , 2021
Link:
https://dl.acm.org/doi/10.1145/3406325.3451068
RT T1 <cTitle>Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing</cTitle>: T1 <Title>Vertex deletion parameterized by elimination distance and even less</Title> UL https://suche.suub.uni-bremen.de/peid=acm-3451068&Exemplar=1&LAN=DE A1 Jansen, Bart M. P. A1 de Kroon, Jari J. H. A1 Włodarczyk, Michał PB ACM YR 2021 K1 elimination distance K1 parameterized complexity K1 treewidth K1 vertex-deletion problems K1 Theory of computation K1 Design and analysis of algorithms K1 Graph algorithms analysis K1 Mathematics of computing K1 Discrete mathematics K1 Graph theory K1 Graph algorithms K1 Parameterized complexity and exact algorithms K1 Fixed parameter tractability SP 1757 OP 1769 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/3406325.3451068 DO https://dl.acm.org/doi/10.1145/3406325.3451068 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
