@incollection{Corneil/04,
AUTHOR = {Corneil, Derek G.},
TITLE = {Lexicographic breadth first search --- A survey},
BOOKTITLE = {Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2004 (Bad Honnef, Germany, June 21-23, 2004)},
SERIES = {LNCS},
VOLUME = {3353},
PAGES = {1-19},
YEAR = {2004},
EDITOR = {Hromkovi{\v{c}}, Juraj and Nagl, Manfred and Westfechtel, Bernhard},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
TYPE = {inproceedings},
}
@incollection{Wattenhofer/04,
AUTHOR = {Wattenhofer, Roger},
TITLE = {Wireless networking: Graph theory unplugged},
BOOKTITLE = {Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2004 (Bad Honnef, Germany, June 21-23, 2004)},
SERIES = {LNCS},
VOLUME = {3353},
PAGES = {20-32},
YEAR = {2004},
EDITOR = {Hromkovi{\v{c}}, Juraj and Nagl, Manfred and Westfechtel, Bernhard},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
TYPE = {inproceedings},
}
@incollection{Nakano-Uno/04a,
AUTHOR = {Nakano, Shin-ichi and Uno, Takeaki},
TITLE = {Constant time generation of trees with specified diameter},
BOOKTITLE = {Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2004 (Bad Honnef, Germany, June 21-23, 2004)},
SERIES = {LNCS},
VOLUME = {3353},
PAGES = {33-45},
YEAR = {2004},
EDITOR = {Hromkovi{\v{c}}, Juraj and Nagl, Manfred and Westfechtel, Bernhard},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
TYPE = {inproceedings},
}
@incollection{Cornelsen-di_Stefano/04,
AUTHOR = {Cornelsen, Sabine and di Stefano, Gabriele},
TITLE = {Treelike comparability graphs: Characterization, recognition, and applications},
BOOKTITLE = {Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2004 (Bad Honnef, Germany, June 21-23, 2004)},
SERIES = {LNCS},
VOLUME = {3353},
PAGES = {46-57},
YEAR = {2004},
EDITOR = {Hromkovi{\v{c}}, Juraj and Nagl, Manfred and Westfechtel, Bernhard},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
TYPE = {inproceedings},
}
@incollection{Fiala-Golovach-Kratochvl/04,
AUTHOR = {Fiala, Ji{\v{r}}{\'{\i}} and Golovach, Petr A. and Kratochv{\'{\i}}l, Jan},
TITLE = {Elegant distance constrained labelings of trees},
BOOKTITLE = {Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2004 (Bad Honnef, Germany, June 21-23, 2004)},
SERIES = {LNCS},
VOLUME = {3353},
PAGES = {58-67},
YEAR = {2004},
EDITOR = {Hromkovi{\v{c}}, Juraj and Nagl, Manfred and Westfechtel, Bernhard},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
TYPE = {inproceedings},
}
@incollection{Dragan-Yan-Corneil/04,
AUTHOR = {Dragan, Feodor and Yan, Chenyu and Corneil, Derek G.},
TITLE = {Collective tree spanners and routing in AT-free related graphs},
BOOKTITLE = {Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2004 (Bad Honnef, Germany, June 21-23, 2004)},
SERIES = {LNCS},
VOLUME = {3353},
PAGES = {68-80},
YEAR = {2004},
EDITOR = {Hromkovi{\v{c}}, Juraj and Nagl, Manfred and Westfechtel, Bernhard},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
TYPE = {inproceedings},
}
@incollection{Bodlaender-Koster/04,
AUTHOR = {Bodlaender, Hans L. and Koster, Arie M.C.A.},
TITLE = {On the maximum cardinality search lower bound for treewidth},
BOOKTITLE = {Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2004 (Bad Honnef, Germany, June 21-23, 2004)},
SERIES = {LNCS},
VOLUME = {3353},
PAGES = {81-92},
YEAR = {2004},
EDITOR = {Hromkovi{\v{c}}, Juraj and Nagl, Manfred and Westfechtel, Bernhard},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
TYPE = {inproceedings},
}
@incollection{Crespelle-Paul/04,
AUTHOR = {Crespelle, Christophe and Paul, Christophe},
TITLE = {Fully-dynamic recognition algorithm and certificate for directed cographs},
BOOKTITLE = {Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2004 (Bad Honnef, Germany, June 21-23, 2004)},
SERIES = {LNCS},
VOLUME = {3353},
PAGES = {93-104},
YEAR = {2004},
EDITOR = {Hromkovi{\v{c}}, Juraj and Nagl, Manfred and Westfechtel, Bernhard},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
TYPE = {inproceedings},
}
@incollection{Nikolopoulos-Palios/04b,
AUTHOR = {Nikolopoulos, Stavros D. and Palios, Leonidas},
TITLE = {Recognizing HHD-free and Welsh-Powell opposition graphs},
BOOKTITLE = {Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2004 (Bad Honnef, Germany, June 21-23, 2004)},
SERIES = {LNCS},
VOLUME = {3353},
PAGES = {105-116},
YEAR = {2004},
EDITOR = {Hromkovi{\v{c}}, Juraj and Nagl, Manfred and Westfechtel, Bernhard},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
TYPE = {inproceedings},
}
@incollection{Fouquet-Habib-de_Montgolfier-Vanherpe/04,
AUTHOR = {Fouquet, Jean-Luc and Habib, Michel and de Montgolfier, Fabien and Vanherpe, Jean-Marie},
TITLE = {Bimodular decomposition of bipartite graphs},
BOOKTITLE = {Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2004 (Bad Honnef, Germany, June 21-23, 2004)},
SERIES = {LNCS},
VOLUME = {3353},
PAGES = {117-128},
YEAR = {2004},
EDITOR = {Hromkovi{\v{c}}, Juraj and Nagl, Manfred and Westfechtel, Bernhard},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
TYPE = {inproceedings},
}
@incollection{Rao/04,
AUTHOR = {Rao, Michae{\"e}l},
TITLE = {Coloring a graph using split decomposition},
BOOKTITLE = {Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2004 (Bad Honnef, Germany, June 21-23, 2004)},
SERIES = {LNCS},
VOLUME = {3353},
PAGES = {129-141},
YEAR = {2004},
EDITOR = {Hromkovi{\v{c}}, Juraj and Nagl, Manfred and Westfechtel, Bernhard},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
TYPE = {inproceedings},
}
@incollection{Grandoni-Italiano/04,
AUTHOR = {Grandoni, Fabrizio and Italiano, Giuseppe F.},
TITLE = {Decremental clique problem},
BOOKTITLE = {Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2004 (Bad Honnef, Germany, June 21-23, 2004)},
SERIES = {LNCS},
VOLUME = {3353},
PAGES = {142-153},
YEAR = {2004},
EDITOR = {Hromkovi{\v{c}}, Juraj and Nagl, Manfred and Westfechtel, Bernhard},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
TYPE = {inproceedings},
}
@incollection{Sawitzki/04,
AUTHOR = {Sawitzki, Daniel},
TITLE = {A symbolic approach to the all-pairs shortest-paths problem},
BOOKTITLE = {Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2004 (Bad Honnef, Germany, June 21-23, 2004)},
SERIES = {LNCS},
VOLUME = {3353},
PAGES = {154-167},
YEAR = {2004},
EDITOR = {Hromkovi{\v{c}}, Juraj and Nagl, Manfred and Westfechtel, Bernhard},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
TYPE = {inproceedings},
}
@incollection{Moreno-Matamala/04,
AUTHOR = {Moreno, Eduardo and Matamala, Mart{\'{\i}}n},
TITLE = {Minimal de Bruijn sequence in a language with forbidden substrings},
BOOKTITLE = {Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2004 (Bad Honnef, Germany, June 21-23, 2004)},
SERIES = {LNCS},
VOLUME = {3353},
PAGES = {168-176},
YEAR = {2004},
EDITOR = {Hromkovi{\v{c}}, Juraj and Nagl, Manfred and Westfechtel, Bernhard},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
TYPE = {inproceedings},
}
@incollection{Baader/04,
AUTHOR = {Baader, Franz},
TITLE = {A graph-theoretic generalization of the least common subsumer and the most specific concept in the description logic $\varepsilon L$},
BOOKTITLE = {Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2004 (Bad Honnef, Germany, June 21-23, 2004)},
SERIES = {LNCS},
VOLUME = {3353},
PAGES = {177-188},
YEAR = {2004},
EDITOR = {Hromkovi{\v{c}}, Juraj and Nagl, Manfred and Westfechtel, Bernhard},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
TYPE = {inproceedings},
}
@incollection{Broersma-Paulusma-Smit-Vlaardingerbroek-Woeginger/04,
AUTHOR = {Broersma, Hajo J. and Paulusma, Daniel and Smit, Gerard J.M. and Vlaardingerbroek, Frank and Woeginger, Gerhard J.},
TITLE = {The computational complexity of the minimum weight processor assignment problem},
BOOKTITLE = {Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2004 (Bad Honnef, Germany, June 21-23, 2004)},
SERIES = {LNCS},
VOLUME = {3353},
PAGES = {189-200},
YEAR = {2004},
EDITOR = {Hromkovi{\v{c}}, Juraj and Nagl, Manfred and Westfechtel, Bernhard},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
TYPE = {inproceedings},
}
@incollection{Apollonio-Caramia-Italiano/04,
AUTHOR = {Apollonio, Nicola and Caramia, Massimiliano and Italiano, Giuseppe F.},
TITLE = {A stochastic location problem with applications to tele-diagnostic},
BOOKTITLE = {Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2004 (Bad Honnef, Germany, June 21-23, 2004)},
SERIES = {LNCS},
VOLUME = {3353},
PAGES = {201-213},
YEAR = {2004},
EDITOR = {Hromkovi{\v{c}}, Juraj and Nagl, Manfred and Westfechtel, Bernhard},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
TYPE = {inproceedings},
}
@incollection{Nieberg-Hurink-Kern/04,
AUTHOR = {Nieberg, Tim and Hurink, Johann and Kern, Walter},
TITLE = {A robust PTAS for maximum weight independent sets in unit disk graphs},
BOOKTITLE = {Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2004 (Bad Honnef, Germany, June 21-23, 2004)},
SERIES = {LNCS},
VOLUME = {3353},
PAGES = {214-221},
YEAR = {2004},
EDITOR = {Hromkovi{\v{c}}, Juraj and Nagl, Manfred and Westfechtel, Bernhard},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
TYPE = {inproceedings},
}
@incollection{Goldengorin-Sierksma-Turkensteen/04,
AUTHOR = {Goldengorin, Boris and Sierksma, Gerard and Turkensteen, Marcel},
TITLE = {Tolerance based algorithms for the ATSP},
BOOKTITLE = {Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2004 (Bad Honnef, Germany, June 21-23, 2004)},
SERIES = {LNCS},
VOLUME = {3353},
PAGES = {222-234},
YEAR = {2004},
EDITOR = {Hromkovi{\v{c}}, Juraj and Nagl, Manfred and Westfechtel, Bernhard},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
TYPE = {inproceedings},
}
@incollection{Fellows-Heggernes-Rosamond-Sloper-Teller/04,
AUTHOR = {Fellows, Mike and Heggernes, Pinar and Rosamond, Franes and Sloper, Christian and Teller, Jan Arne},
TITLE = {Finding $k$ disjoint triangles in an arbitrary graph},
BOOKTITLE = {Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2004 (Bad Honnef, Germany, June 21-23, 2004)},
SERIES = {LNCS},
VOLUME = {3353},
PAGES = {235-244},
YEAR = {2004},
EDITOR = {Hromkovi{\v{c}}, Juraj and Nagl, Manfred and Westfechtel, Bernhard},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
TYPE = {inproceedings},
}
@incollection{Fomin-Kratsch-Woeginger/04,
AUTHOR = {Fomin, Fedor V. and Kratsch, Dieter and Woeginger, Gerhard J.},
TITLE = {Exact (exponential) algorihtms for the dominating set problem},
BOOKTITLE = {Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2004 (Bad Honnef, Germany, June 21-23, 2004)},
SERIES = {LNCS},
VOLUME = {3353},
PAGES = {245-256},
YEAR = {2004},
EDITOR = {Hromkovi{\v{c}}, Juraj and Nagl, Manfred and Westfechtel, Bernhard},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
TYPE = {inproceedings},
}
@incollection{Chor-Fellows-Juedes/04,
AUTHOR = {Chor, Benny and Fellows, Mike and Juedes, David},
TITLE = {Linear kernels in linear time, or how to save $k$ colors in $O(n^2)$ steps},
BOOKTITLE = {Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2004 (Bad Honnef, Germany, June 21-23, 2004)},
SERIES = {LNCS},
VOLUME = {3353},
PAGES = {257-269},
YEAR = {2004},
EDITOR = {Hromkovi{\v{c}}, Juraj and Nagl, Manfred and Westfechtel, Bernhard},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
TYPE = {inproceedings},
}
@incollection{Bonichon-Gavoille-Hanusse-Poulalhon-Schaeffer/04,
AUTHOR = {Bonichon, Nicolas and Gavoille, Cyril and Hanusse, Nicolas and Poulalhon, Dominique and Schaeffer, Gilles},
TITLE = {Planar graphs, via well-orderly maps and trees},
BOOKTITLE = {Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2004 (Bad Honnef, Germany, June 21-23, 2004)},
SERIES = {LNCS},
VOLUME = {3353},
PAGES = {270-284},
YEAR = {2004},
EDITOR = {Hromkovi{\v{c}}, Juraj and Nagl, Manfred and Westfechtel, Bernhard},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
TYPE = {inproceedings},
}
@incollection{Brimkov-Barneva-Klette-Straight/04,
AUTHOR = {Brimkov, Valentin E. and Barneva, Reneta P. and Klette, Reinhard and Straight, Joseph},
TITLE = {Efficient computation of the Lov{\'a}sz theta function for a class of circulant graphs},
BOOKTITLE = {Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2004 (Bad Honnef, Germany, June 21-23, 2004)},
SERIES = {LNCS},
VOLUME = {3353},
PAGES = {285-295},
YEAR = {2004},
EDITOR = {Hromkovi{\v{c}}, Juraj and Nagl, Manfred and Westfechtel, Bernhard},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
TYPE = {inproceedings},
}
@incollection{Golin-Leung/04,
AUTHOR = {Golin, Mordecai J. and Leung, Yiu Cho},
TITLE = {Unhooking circulant graphs: A combinatorial method for counting spanning trees and other parameters},
BOOKTITLE = {Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2004 (Bad Honnef, Germany, June 21-23, 2004)},
SERIES = {LNCS},
VOLUME = {3353},
PAGES = {296-307},
YEAR = {2004},
EDITOR = {Hromkovi{\v{c}}, Juraj and Nagl, Manfred and Westfechtel, Bernhard},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
TYPE = {inproceedings},
}
@incollection{Chen-Tsukiji/04,
AUTHOR = {Chen, Zhi-Zhong and Tsukiji, Tatsuie},
TITLE = {Computing bounded-degree phylogenetic roots of disconnected graphs},
BOOKTITLE = {Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2004 (Bad Honnef, Germany, June 21-23, 2004)},
SERIES = {LNCS},
VOLUME = {3353},
PAGES = {308-319},
YEAR = {2004},
EDITOR = {Hromkovi{\v{c}}, Juraj and Nagl, Manfred and Westfechtel, Bernhard},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
TYPE = {inproceedings},
}
@incollection{Rahman-Miura-Nishizeki/04,
AUTHOR = {Rahman, Md. Saidur and Miura, Kazuyuki and Nishizeki, Takao},
TITLE = {Octagonal drawings of plane graphs with prescribed face areas},
BOOKTITLE = {Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2004 (Bad Honnef, Germany, June 21-23, 2004)},
SERIES = {LNCS},
VOLUME = {3353},
PAGES = {320-331},
YEAR = {2004},
EDITOR = {Hromkovi{\v{c}}, Juraj and Nagl, Manfred and Westfechtel, Bernhard},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
TYPE = {inproceedings},
}
@incollection{Baur-Brandes/04,
AUTHOR = {Baur, Michael and Brandes, Ulrik},
TITLE = {Crossing reduction in circular layouts},
BOOKTITLE = {Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2004 (Bad Honnef, Germany, June 21-23, 2004)},
SERIES = {LNCS},
VOLUME = {3353},
PAGES = {332-343},
YEAR = {2004},
EDITOR = {Hromkovi{\v{c}}, Juraj and Nagl, Manfred and Westfechtel, Bernhard},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
TYPE = {inproceedings},
}
@incollection{Costa_Dourado-Protti-Szwarcfiter/04,
AUTHOR = {Costa Dourado, Mitre and Protti, F{\'a}bio and Szwarcfiter, Jayme Luiz},
TITLE = {Characterization and recognition of generalized clique-Helly graphs},
BOOKTITLE = {Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2004 (Bad Honnef, Germany, June 21-23, 2004)},
SERIES = {LNCS},
VOLUME = {3353},
PAGES = {344-354},
YEAR = {2004},
EDITOR = {Hromkovi{\v{c}}, Juraj and Nagl, Manfred and Westfechtel, Bernhard},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
TYPE = {inproceedings},
}
@incollection{Conforti-Galluccio-Proietti/04,
AUTHOR = {Conforti, Michele and Galluccio, Anna and Proietti, Guido},
TITLE = {Edge-connectivity augmentation and network matrices},
BOOKTITLE = {Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2004 (Bad Honnef, Germany, June 21-23, 2004)},
SERIES = {LNCS},
VOLUME = {3353},
PAGES = {355-364},
YEAR = {2004},
EDITOR = {Hromkovi{\v{c}}, Juraj and Nagl, Manfred and Westfechtel, Bernhard},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
TYPE = {inproceedings},
}
@incollection{Ito-Zhou-Nishizeki/04,
AUTHOR = {Ito, Takehiro and Zhou, Xiao and Nishizeki, Takao},
TITLE = {Partitioning a weighted graph to connected subgraphs of almost uniform size},
BOOKTITLE = {Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2004 (Bad Honnef, Germany, June 21-23, 2004)},
SERIES = {LNCS},
VOLUME = {3353},
PAGES = {365-376},
YEAR = {2004},
EDITOR = {Hromkovi{\v{c}}, Juraj and Nagl, Manfred and Westfechtel, Bernhard},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
TYPE = {inproceedings},
}
@incollection{de_Werra-Demange-Monnot-Paschos/04,
AUTHOR = {de Werra, Dominique and Demange, Marc and Monnot, Jerome and Paschos, Vangelis Th.},
TITLE = {The hypocoloring problem: Complexity and approximability results when the chromatic number is small},
BOOKTITLE = {Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2004 (Bad Honnef, Germany, June 21-23, 2004)},
SERIES = {LNCS},
VOLUME = {3353},
PAGES = {377-388},
YEAR = {2004},
EDITOR = {Hromkovi{\v{c}}, Juraj and Nagl, Manfred and Westfechtel, Bernhard},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
TYPE = {inproceedings},
}
@incollection{Bietenhader-Okamoto/04,
AUTHOR = {Bietenhader, Thomas and Okamoto, Yoshio},
TITLE = {Core stability of minimum coloring games},
BOOKTITLE = {Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2004 (Bad Honnef, Germany, June 21-23, 2004)},
SERIES = {LNCS},
VOLUME = {3353},
PAGES = {389-401},
YEAR = {2004},
EDITOR = {Hromkovi{\v{c}}, Juraj and Nagl, Manfred and Westfechtel, Bernhard},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
TYPE = {inproceedings},
}