Mathematics in Computer Science
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
Table of contents
- 1
-
ForewordMiller, Mirka / Wada, Koichi et al. | 2009
- 3
-
Partitioning Bispanning Graphs into Spanning TreesBaumgart, Matthias et al. | 2009
- 17
-
Finding Range Minima in the Middle: Approximations and ApplicationsFischer, Johannes / Heun, Volker et al. | 2009
- 31
-
Loose Cover of GraphsFujita, Satoshi et al. | 2009
- 39
-
On Partitional Labelings of GraphsIchishima, Rikio / Oshima, Akito et al. | 2009
- 47
-
An Improved Version of Cuckoo Hashing: Average Case Analysis of Construction Cost and Search OperationsKutzelnigg, Reinhard et al. | 2009
- 61
-
k-Phase Oscillator Synchronization for Graph ColoringLee, Sof Anthony et al. | 2009
- 73
-
Preemptive Scheduling of Equal-Length Jobs in Polynomial TimeMertzios, George B. / Unger, Walter et al. | 2009
- 85
-
An Optimal Algorithm for the k-Fixed-Endpoint Path Cover on Proper Interval GraphsMertzios, George B. / Unger, Walter et al. | 2009
- 97
-
On Conditional Covering ProblemSivan, Balasubramanian / Harini, S. / Pandu Rangan, C. et al. | 2009
- 109
-
On the Pagenumber of the Cube-Connected CyclesTanaka, Yuuki / Shibata, Yukio et al. | 2009
- 119
-
New Results on EX GraphsTang, Jianmin / Lin, Yuqing / Miller, Mirka et al. | 2009