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
Packing Even Directed Circuits Quarter-Integrally:
, In:
Proceedings of the 56th Annual ACM Symposium on Theory of Computing
,
Gorsky, Maximilian
;
Kawarabayashi, Ken-ichi
;
Kreutzer, Stephan
. - p. 692-703 , 2024
Link:
https://dl.acm.org/doi/10.1145/3618260.3649682
RT T1 <cTitle>Proceedings of the 56th Annual ACM Symposium on Theory of Computing</cTitle>: T1 <Title>Packing Even Directed Circuits Quarter-Integrally</Title> UL https://suche.suub.uni-bremen.de/peid=acm-3649682&Exemplar=1&LAN=DE A1 Gorsky, Maximilian A1 Kawarabayashi, Ken-ichi A1 Kreutzer, Stephan A1 Wiederrecht, Sebastian PB ACM YR 2024 K1 Directed Graphs K1 Erdős-Pósa property K1 Even Dicycles K1 Fixed Parameter Tractability K1 Graph Structure Theory K1 Matching Theory K1 Mathematics of computing K1 Graph algorithms K1 Matchings and factors K1 Graphs and surfaces K1 Combinatoric problems K1 Paths and connectivity problems K1 Graph theory K1 Combinatorics SP 692 OP 703 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/3618260.3649682 DO https://dl.acm.org/doi/10.1145/3618260.3649682 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
