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=349
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On algorithms for
(P_5,gem)
-free graphs
Hans L. Bodlaender
,
Andreas Brandstädt
,
Dieter Kratsch
,
Michaël Rao
,
Jeremy Spinrad
Theoretical Computer Science
349
(1), 2005, pp. 2-21
Equitable colorings of bounded treewidth graphs
Hans L. Bodlaender
,
Fedor V. Fomin
Theoretical Computer Science
349
(1), 2005, pp. 22-30
H
-coloring dichotomy revisited
Andrei A. Bulatov
Theoretical Computer Science
349
(1), 2005, pp. 31-39
The chromatic and clique numbers of random scaled sector graphs
Josep Díaz
,
Vishal Sanwalani
,
Maria Serna
,
Paul G. Spirakis
Theoretical Computer Science
349
(1), 2005, pp. 40-51
List matrix partitions of chordal graphs
Tomás Feder
,
Pavol Hell
,
Sulamita Klein
,
Loana Tito Nogueira
,
Fábio Protti
Theoretical Computer Science
349
(1), 2005, pp. 52-66
A complete complexity classification of the role assignment problem
Jiȓí Fiala
,
Daniel Paulusma
Theoretical Computer Science
349
(1), 2005, pp. 67-81
On equitable
\Delta
-coloring of graphs with low average degree
A.V. Kostochka
,
K. Nakprasit
Theoretical Computer Science
349
(1), 2005, pp. 82-91
List version of
L(d,s)
-labelings
Anja Kohl
,
Jens Schreyer
,
Zsolt Tuza
,
Margit Voigt
Theoretical Computer Science
349
(1), 2005, pp. 92-98
Group coloring is
\Pi^P_2
-complete
Daniel Král'
Theoretical Computer Science
349
(1), 2005, pp. 99-111
Fano colourings of cubic graphs and the Fulkerson conjecture
Edita Mác̑ajová
,
Martin S̑koviera
Theoretical Computer Science
349
(1), 2005, pp. 112-120
Solving
7 \times 7
Hex with domination, fill-in, and virtual connections
Ryan Hayward
,
Yngvi Björnsson
,
Michael Johanson
,
Morgan Kan
,
Nathan Po
,
Jack van Rijswijck
Theoretical Computer Science
349
(2), 2005, pp. 123-139
Chess endgames: 6-man data and strategy
M.S. Bourzutschky
,
J.A. Tamplin
,
G.McC. Haworth
Theoretical Computer Science
349
(2), 2005, pp. 140-157
Deeper model endgame analysis
R.B. Andrist
,
G.McC. Haworth
Theoretical Computer Science
349
(2), 2005, pp. 158-167
Learning to score final positions in the game of Go
Erik C.D. van der Werf
,
H. Jaap van den Herik
,
Jos W.H.M. Uiterwijk
Theoretical Computer Science
349
(2), 2005, pp. 168-183
Static analysis based on formal models and incremental computation in Go programming
Katsuhiko Nakamura
Theoretical Computer Science
349
(2), 2005, pp. 184-201
Tuning evaluation functions by maximizing concordance
D. Gomboc
,
M. Buro
,
T.A. Marsland
Theoretical Computer Science
349
(2), 2005, pp. 202-229
An evaluation function for the game of Amazons
Jens Lieberum
Theoretical Computer Science
349
(2), 2005, pp. 230-244
Selecting evaluation functions in Opponent-Model search
H.H.L.M. Donkers
,
H.J. van den Herik
,
J.W.H.M. Uiterwijk
Theoretical Computer Science
349
(2), 2005, pp. 245-267
Bias and pathology in minimax search
A. Sadikov
,
I. Bratko
,
I. Kononenko
Theoretical Computer Science
349
(2), 2005, pp. 268-281
Unresolved systems of language equations: Expressive power and decision problems
Alexander Okhotin
Theoretical Computer Science
349
(3), 2005, pp. 283-308
Permuting machines and priority queues
R.E.L. Aldred
,
M.D. Atkinson
,
H.P. van Ditmarsch
,
C.C. Handley
,
D.A. Holton
,
D.J. McCaughan
Theoretical Computer Science
349
(3), 2005, pp. 309-317
Some results about the chaotic behavior of cellular automata
F. Blanchard
,
J. Cervelle
,
E. Formenti
Theoretical Computer Science
349
(3), 2005, pp. 318-336
The chord version for SONET ADMs minimization
Leah Epstein
,
Asaf Levin
Theoretical Computer Science
349
(3), 2005, pp. 337-346
Combinatorial structure and randomized subexponential algorithms for infinite games
Henrik Björklund
,
Sergei Vorobyov
Theoretical Computer Science
349
(3), 2005, pp. 347-360
Partial Digest is hard to solve for erroneous input data
Mark Cieliebak
,
Stephan Eidenbenz
,
Paolo Penna
Theoretical Computer Science
349
(3), 2005, pp. 361-381
Seiten 1
2
>