Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=465
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Analytical aspects of tie breaking
Tobias Jacobs
Theoretical Computer Science
465
, 2012, pp. 1-9
Matching preclusion for balanced hypercubes
Huazhong Lü
,
Xianyue Li
,
Heping Zhang
Theoretical Computer Science
465
, 2012, pp. 10-20
Equitable colorings of planar graphs without short cycles
Keaitsuda Nakprasit
,
Kittikorn Nakprasit
Theoretical Computer Science
465
, 2012, pp. 21-27
Node-disjoint paths in a level block of generalized hierarchical completely connected networks
Toshinori Takabatake
,
Tomoki Nakamigawa
Theoretical Computer Science
465
, 2012, pp. 28-34
Linear time algorithms for two disjoint paths problems on directed acyclic graphs
Torsten Tholey
Theoretical Computer Science
465
, 2012, pp. 35-48
Branch less, cut more and minimize the number of late equal-length jobs on identical machines
Nodari Vakhania
Theoretical Computer Science
465
, 2012, pp. 49-60
An algorithm to construct independent spanning trees on parity cubes
Yan Wang
,
Jianxi Fan
,
Xiaohua Jia
,
He Huang
Theoretical Computer Science
465
, 2012, pp. 61-72
Corrigendum to ``On Brlek-Reutenauer conjecture''
L'. Balková
,
E. Pelantová
,
S̑. Starosta
Theoretical Computer Science
465
, 2012, pp. 73-74