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
lower bounds for the parameterized complexity of minimum fi..:
, In:
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms
,
Bliznets, Ivan
;
Cygan, Marek
;
Komosa, Paweł
.. - p. 1132-1151 , 2016
Link:
https://dl.acm.org/doi/10.5555/2884435.2884514
RT T1 <cTitle>Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms</cTitle>: T1 <Title>lower bounds for the parameterized complexity of minimum fill-in and other completion problems</Title> UL https://suche.suub.uni-bremen.de/peid=acm-2884514&Exemplar=1&LAN=DE A1 Bliznets, Ivan A1 Cygan, Marek A1 Komosa, Paweł A1 Mach, Lukáš A1 Pilipczuk, Michał PB Society for Industrial and Applied Mathematics YR 2016 K1 Theory of computation K1 Design and analysis of algorithms K1 Mathematics of computing K1 Discrete mathematics K1 Graph theory K1 Computing methodologies K1 Symbolic and algebraic manipulation K1 Symbolic and algebraic algorithms K1 Graph algorithms SP 1132 OP 1151 LK http://dx.doi.org/https://dl.acm.org/doi/10.5555/2884435.2884514 DO https://dl.acm.org/doi/10.5555/2884435.2884514 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
