Volume 349,
Number 1,
12 December 2005
Graph Colorings
- Jaroslav Nesetril, Gerhard J. Woeginger:
Graph colorings.
1
- Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy Spinrad:
On algorithms for (P5, gem)-free graphs.
2-21
- Hans L. Bodlaender, Fedor V. Fomin:
Equitable colorings of bounded treewidth graphs.
22-30
- Andrei A. Bulatov:
H-Coloring dichotomy revisited.
31-39
- Josep Díaz, Vishal Sanwalani, Maria J. Serna, Paul G. Spirakis:
The chromatic and clique numbers of random scaled sector graphs.
40-51
- Tomás Feder, Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti:
List matrix partitions of chordal graphs.
52-66
- Jirí Fiala, Daniël Paulusma:
A complete complexity classification of the role assignment problem.
67-81
- Alexandr V. Kostochka, Kittikorn Nakprasit:
On equitable Delta-coloring of graphs with low average degree.
82-91
- Anja Kohl, Jens Schreyer, Zsolt Tuza, Margit Voigt:
List version of L(d, s)-labelings.
92-98
- Daniel Král:
Group coloring is Pi2P-complete.
99-111
- Edita Mácajová, Martin Skoviera:
Fano colourings of cubic graphs and the Fulkerson Conjecture.
112-120
Volume 349,
Number 2,
14 December 2005
Advances in Computer Games
- H. Jaap van den Herik, Hiroyuki Iida:
Foreword.
121-122
- Ryan Hayward, Yngvi Björnsson, Michael Johanson, Morgan Kan, Nathan Po, Jack van Rijswijck:
Solving 7x7 Hex with domination, fill-in, and virtual connections.
123-139
- M. S. Bourzutschky, J. A. Tamplin, G. McC. Haworth:
Chess endgames: 6-man data and strategy.
140-157
- R. B. Andrist, G. McC. Haworth:
Deeper model endgame analysis.
158-167
- Erik C. D. van der Werf, H. Jaap van den Herik, Jos W. H. M. Uiterwijk:
Learning to score final positions in the game of Go.
168-183
- Katsuhiko Nakamura:
Static analysis based on formal models and incremental computation in Go programming.
184-201
- Dave Gomboc, Michael Buro, T. Anthony Marsland:
Tuning evaluation functions by maximizing concordance.
202-229
- Jens Lieberum:
An evaluation function for the game of amazons.
230-244
- H. H. L. M. Donkers, H. Jaap van den Herik, Jos W. H. M. Uiterwijk:
Selecting evaluation functions in Opponent-Model search.
245-267
- Aleksander Sadikov, Ivan Bratko, Igor Kononenko:
Bias and pathology in minimax search.
268-281
Volume 349,
Number 3,
16 December 2005
Contributions
- Alexander Okhotin:
Unresolved systems of language equations: Expressive power and decision problems.
283-308
- Robert E. L. Aldred, Mike D. Atkinson, Hans P. van Ditmarsch, Chris C. Handley, Derek A. Holton, D. J. McCaughan:
Permuting machines and priority queues.
309-317
- François Blanchard, Julien Cervelle, Enrico Formenti:
Some results about the chaotic behavior of cellular automata.
318-336
- Leah Epstein, Asaf Levin:
The chord version for SONET ADMs minimization.
337-346
- Henrik Björklund, Sergei G. Vorobyov:
Combinatorial structure and randomized subexponential algorithms for infinite games.
347-360
- Mark Cieliebak, Stephan Eidenbenz, Paolo Penna:
Partial Digest is hard to solve for erroneous input data.
361-381
- Edith Hemaspaandra, Holger Spakowski, Jörg Vogel:
The complexity of Kemeny elections.
382-391
- Chris Bourke, John M. Hitchcock, N. V. Vinodchandran:
Entropy rates and finite-state dimension.
392-406
- Bang Ye Wu:
An analysis of the LPT algorithm for the max-min and the min-ratio partition problems.
407-419
- Sergey Kitaev:
Segmental partially ordered generalized patterns.
420-428
- Wai-Fong Chuan, Hui-Ling Ho:
Locating factors of the infinite Fibonacci word.
429-442
- Martin Kutz:
Conway's Angel in three dimensions.
443-451
- Weigen Yan, Yeong-Nan Yeh, Fuji Zhang:
Graphical condensation of plane graphs: A combinatorial approach.
452-461
- Marc Demange, Tinaz Ekim, Dominique de Werra:
(p, k)-coloring problems in line graphs.
462-474
- Toshio Nakata:
On the expected time for Herman's probabilistic self-stabilizing algorithm.
475-483
Note
Copyright © Fri Mar 12 17:33:12 2010
by Michael Ley (ley@uni-trier.de)
