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 Disjoint Paths for Dispatching in Railways:
Flier, Holger
;
Mihalák, Matúš
;
Schöbel, Anita
..
info:eu-repo/semantics/altIdentifier/doi/10.4230/OASIcs.ATMOS.2010.61. , 2010
Link:
https://hdl.handle.net/20.500.11850/26275
RT Journal T1
Vertex Disjoint Paths for Dispatching in Railways
UL https://suche.suub.uni-bremen.de/peid=base-ftethz:oai:www.research-collection.ethz.ch:20.500.11850_26275&Exemplar=1&LAN=DE A1 Flier, Holger A1 Mihalák, Matúš A1 Schöbel, Anita A1 Widmayer, Peter A1 Zych, Anna PB Schloss Dagstuhl - Leibniz-Zentrum für Informatik YR 2010 K1 algorithms K1 approximation K1 complexity K1 graph theory K1 railways K1 routing K1 transportation JF info:eu-repo/semantics/altIdentifier/doi/10.4230/OASIcs.ATMOS.2010.61 LK http://dx.doi.org/https://hdl.handle.net/20.500.11850/26275 DO https://hdl.handle.net/20.500.11850/26275 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)