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
[2]
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND YEAR=2007
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The increase of the instability of networks due to quasi-static link capacities
Dimitrios Koukopoulos
,
Marios Mavronicolas
,
Paul Spirakis
Theoretical Computer Science
381
(1-3), 2007, pp. 44-56
Optimal routing in double loop networks
Domingo Gómez
,
Jaime Gutierrez
,
Álvar Ibeas
Theoretical Computer Science
381
(1-3), 2007, pp. 68-85
Enumeration and random generation of accessible automata
Frédérique Bassino
,
Cyril Nicaud
Theoretical Computer Science
381
(1-3), 2007, pp. 86-104
Pushdown dimension
David Doty
,
Jared Nichols
Theoretical Computer Science
381
(1-3), 2007, pp. 105-123
Some approximation algorithms for the clique partition problem in weighted interval graphs
Mingxia Chen
,
Jianbo Li
,
Jianping Li
,
Weidong Li
,
Lusheng Wang
Theoretical Computer Science
381
(1-3), 2007, pp. 124-133
Block LU factors of generalized companion matrix pencils
A. Amiraslani
,
D.A. Aruliah
,
R.M. Corless
Theoretical Computer Science
381
(1-3), 2007, pp. 134-147
Jordan curves with polynomial inverse moduli of continuity
Ker-I Ko
,
Fuxiang Yu
Theoretical Computer Science
381
(1-3), 2007, pp. 148-161
Efficient algorithms for generalized Stable Marriage and Roommates problems
Tamás Fleiner
,
Robert W. Irving
,
David F. Manlove
Theoretical Computer Science
381
(1-3), 2007, pp. 162-176
Every real number greater than 1 is a critical exponent
Dalia Krieger
,
Jeffrey Shallit
Theoretical Computer Science
381
(1-3), 2007, pp. 177-182
Communication tree problems
Carme Àlvarez
,
Rafel Cases
,
Josep Díaz
,
Jordi Petit
,
Maria Serna
Theoretical Computer Science
381
(1-3), 2007, pp. 197-217
On the spanning connectivity and spanning laceability of hypercube-like networks
Cheng-Kuan Lin
,
Jimmy J.M. Tan
,
D. Frank Hsu
,
Lih-Hsing Hsu
Theoretical Computer Science
381
(1-3), 2007, pp. 218-229
Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan
Cheng He
,
Yixun Lin
,
Jinjiang Yuan
Theoretical Computer Science
381
(1-3), 2007, pp. 234-240
NP
-completeness results for some problems on subclasses of bipartite and chordal graphs
Katerina Asdre
,
Stavros D. Nikolopoulos
Theoretical Computer Science
381
(1-3), 2007, pp. 248-259
The induced matching and chain subgraph cover problems for convex bipartite graphs
Andreas Brandstädt
,
Elaine M. Eschen
,
R. Sritharan
Theoretical Computer Science
381
(1-3), 2007, pp. 260-265
On a zeta function associated with automata and codes
Sylvain Lavallée
,
Christophe Reutenauer
Theoretical Computer Science
381
(1-3), 2007, pp. 266-273
On the separability of sparse context-free languages and of bounded rational relations
Christian Choffrut
,
Flavio D'Alessandro
,
Stefano Varricchio
Theoretical Computer Science
381
(1-3), 2007, pp. 274-279
An adversarial queueing model for online server routing
Vincenzo Bonifaci
Theoretical Computer Science
381
(1-3), 2007, pp. 280-287
Approximating the selected-internal Steiner tree
Sun-Yuan Hsieh
,
Shih-Cheng Yang
Theoretical Computer Science
381
(1-3), 2007, pp. 288-291
On the cover time and mixing time of random geometric graphs
Chen Avin
,
Gunes Ercal
Theoretical Computer Science
380
(1-2), 2007, pp. 2-22
A tight linear bound on the synchronization delay of bijective automata
Eugen Czeizler
,
Jarkko Kari
Theoretical Computer Science
380
(1-2), 2007, pp. 23-36
Faster algorithms for finding lowest common ancestors in directed acyclic graphs
Artur Czumaj
,
Miroslaw Kowaluk
,
Andrzej Lingas
Theoretical Computer Science
380
(1-2), 2007, pp. 37-46
Balanced allocation and dictionaries with tightly packed constant size bins
Martin Dietzfelbinger
,
Christoph Weidling
Theoretical Computer Science
380
(1-2), 2007, pp. 47-68
Weighted automata and weighted logics
Manfred Droste
,
Paul Gastin
Theoretical Computer Science
380
(1-2), 2007, pp. 69-86
A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
Martin Gairing
,
Burkhard Monien
,
Andreas Woclaw
Theoretical Computer Science
380
(1-2), 2007, pp. 87-99
Comparing the size of NFAs with and without
\epsilon
-transitions
Juraj Hromkovic̑
,
Georg Schnitger
Theoretical Computer Science
380
(1-2), 2007, pp. 100-114
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>