@incollection{Cittadini-Di_Battista-Rimondini/08,
AUTHOR = {Cittadini, Luca and Di Battista, Giuseppe and Rimondini, Massimo},
TITLE = {(Un)-stable routing in the Internet: A survey from the algorithmic perspective},
BOOKTITLE = {Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2008 (Durham, UK, June 30 - July 2, 2008)},
SERIES = {LNCS},
VOLUME = {5344},
PAGES = {1-13},
YEAR = {2008},
EDITOR = {Broersma, Hajo and Erlebach, Thomas and Friedetzky, Tom and Paulusma, Daniel},
URL = {http://dx.doi.org/10.1007/978-3-540-92248-3_1},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Gasieniec-Radzik/08,
AUTHOR = {G{\c{a}}sieniec, Leszek and Radzik, Tomasz},
TITLE = {Memory efficient anonymous graph exploration},
BOOKTITLE = {Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2008 (Durham, UK, June 30 - July 2, 2008)},
SERIES = {LNCS},
VOLUME = {5344},
PAGES = {14-29},
YEAR = {2008},
EDITOR = {Broersma, Hajo and Erlebach, Thomas and Friedetzky, Tom and Paulusma, Daniel},
URL = {http://dx.doi.org/10.1007/978-3-540-92248-3_2},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Grohe/08,
AUTHOR = {Grohe, Martin},
TITLE = {Algorithmic meta theorems},
BOOKTITLE = {Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2008 (Durham, UK, June 30 - July 2, 2008)},
SERIES = {LNCS},
VOLUME = {5344},
PAGES = {30-30},
YEAR = {2008},
EDITOR = {Broersma, Hajo and Erlebach, Thomas and Friedetzky, Tom and Paulusma, Daniel},
URL = {http://dx.doi.org/10.1007/978-3-540-92248-3_3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Averbouch-Godlin-Makowsky/08,
AUTHOR = {Averbouch, Ilia and Godlin, Benny and Makowsky, Johann A.},
TITLE = {A most general edge elimination polynomial},
BOOKTITLE = {Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2008 (Durham, UK, June 30 - July 2, 2008)},
SERIES = {LNCS},
VOLUME = {5344},
PAGES = {31-42},
YEAR = {2008},
EDITOR = {Broersma, Hajo and Erlebach, Thomas and Friedetzky, Tom and Paulusma, Daniel},
URL = {http://dx.doi.org/10.1007/978-3-540-92248-3_4},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Bilo-Forlizzi-Proietti/08,
AUTHOR = {Bil{\`o}, Davide and Forlizzi, Luca and Proietti, Guido},
TITLE = {Approximating the metric TSP in linear time},
BOOKTITLE = {Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2008 (Durham, UK, June 30 - July 2, 2008)},
SERIES = {LNCS},
VOLUME = {5344},
PAGES = {43-54},
YEAR = {2008},
EDITOR = {Broersma, Hajo and Erlebach, Thomas and Friedetzky, Tom and Paulusma, Daniel},
URL = {http://dx.doi.org/10.1007/978-3-540-92248-3_5},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Bodlaender-Grigoriev-Grigorieva-Hendriks/08,
AUTHOR = {Bodlaender, Hans L. and Grigoriev, Alexander and Grigorieva, Nadejda V. and Hendriks, Albert},
TITLE = {The valve location problem in simple network topologies},
BOOKTITLE = {Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2008 (Durham, UK, June 30 - July 2, 2008)},
SERIES = {LNCS},
VOLUME = {5344},
PAGES = {55-65},
YEAR = {2008},
EDITOR = {Broersma, Hajo and Erlebach, Thomas and Friedetzky, Tom and Paulusma, Daniel},
URL = {http://dx.doi.org/10.1007/978-3-540-92248-3_6},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Bonsma-Zickfeld/08,
AUTHOR = {Bonsma, Paul and Zickfeld, Florian},
TITLE = {A 3/2-approximation algorithm for finding spanning trees with many leaves in cubic graphs},
BOOKTITLE = {Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2008 (Durham, UK, June 30 - July 2, 2008)},
SERIES = {LNCS},
VOLUME = {5344},
PAGES = {66-77},
YEAR = {2008},
EDITOR = {Broersma, Hajo and Erlebach, Thomas and Friedetzky, Tom and Paulusma, Daniel},
URL = {http://dx.doi.org/10.1007/978-3-540-92248-3_7},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Chen-Kanj-Meng-Xia-Zhang/08,
AUTHOR = {Chen, Jianer and Kanj, Iyad A. and Meng, Jie and Xia, Ge and Zhang, Fenghui},
TITLE = {On the pseudo-achromatic number problem},
BOOKTITLE = {Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2008 (Durham, UK, June 30 - July 2, 2008)},
SERIES = {LNCS},
VOLUME = {5344},
PAGES = {78-89},
YEAR = {2008},
EDITOR = {Broersma, Hajo and Erlebach, Thomas and Friedetzky, Tom and Paulusma, Daniel},
URL = {http://dx.doi.org/10.1007/978-3-540-92248-3_8},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Crescenzi-Di_Ianni-Greco-Rossi-Vocca/08,
AUTHOR = {Crescenzi, Pilu and Di Ianni, Miriam and Greco, Federico and Rossi, Gianluca and Vocca, Paola},
TITLE = {Making role assignment feasible: A polynomial-time algorithm for computing ecological colorings},
BOOKTITLE = {Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2008 (Durham, UK, June 30 - July 2, 2008)},
SERIES = {LNCS},
VOLUME = {5344},
PAGES = {90-100},
YEAR = {2008},
EDITOR = {Broersma, Hajo and Erlebach, Thomas and Friedetzky, Tom and Paulusma, Daniel},
URL = {http://dx.doi.org/10.1007/978-3-540-92248-3_9},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Cygan-Pilipczuk/08,
AUTHOR = {Cygan, Marek and Pilipczuk, Marcin},
TITLE = {Faster exact bandwidth},
BOOKTITLE = {Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2008 (Durham, UK, June 30 - July 2, 2008)},
SERIES = {LNCS},
VOLUME = {5344},
PAGES = {101-109},
YEAR = {2008},
EDITOR = {Broersma, Hajo and Erlebach, Thomas and Friedetzky, Tom and Paulusma, Daniel},
URL = {http://dx.doi.org/10.1007/978-3-540-92248-3_10},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Dragan-Corneil-Kohler-Xiang/08,
AUTHOR = {Dragan, Feodor F. and Corneil, Derek G. and K{\"o}hler, Ekkehard and Xiang, Yang},
TITLE = {Additive spanners for circle graphs and polygonal graphs},
BOOKTITLE = {Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2008 (Durham, UK, June 30 - July 2, 2008)},
SERIES = {LNCS},
VOLUME = {5344},
PAGES = {110-121},
YEAR = {2008},
EDITOR = {Broersma, Hajo and Erlebach, Thomas and Friedetzky, Tom and Paulusma, Daniel},
URL = {http://dx.doi.org/10.1007/978-3-540-92248-3_11},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Estrella-Balderrama-Frati-Kobourov/08,
AUTHOR = {Estrella-Balderrama, Alejandro and Frati, Fabrizio and Kobourov, Stephen G.},
TITLE = {Upward straight-line embeddings of directed graphs into point sets},
BOOKTITLE = {Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2008 (Durham, UK, June 30 - July 2, 2008)},
SERIES = {LNCS},
VOLUME = {5344},
PAGES = {122-133},
YEAR = {2008},
EDITOR = {Broersma, Hajo and Erlebach, Thomas and Friedetzky, Tom and Paulusma, Daniel},
URL = {http://dx.doi.org/10.1007/978-3-540-92248-3_12},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Fiala-Golovach/08,
AUTHOR = {Fiala, Ji{\v{r}}{\'{i}} and Golovach, Petr A.},
TITLE = {Complexity of the packing coloring problem for trees},
BOOKTITLE = {Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2008 (Durham, UK, June 30 - July 2, 2008)},
SERIES = {LNCS},
VOLUME = {5344},
PAGES = {134-145},
YEAR = {2008},
EDITOR = {Broersma, Hajo and Erlebach, Thomas and Friedetzky, Tom and Paulusma, Daniel},
URL = {http://dx.doi.org/10.1007/978-3-540-92248-3_13},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Fowler-Junger-Kobourov-Schulz/08,
AUTHOR = {Fowler, J. Joseph and J{\"u}nger, Michael and Kobourov, Stephen and Schulz, Michael},
TITLE = {Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges},
BOOKTITLE = {Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2008 (Durham, UK, June 30 - July 2, 2008)},
SERIES = {LNCS},
VOLUME = {5344},
PAGES = {146-158},
YEAR = {2008},
EDITOR = {Broersma, Hajo and Erlebach, Thomas and Friedetzky, Tom and Paulusma, Daniel},
URL = {http://dx.doi.org/10.1007/978-3-540-92248-3_14},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Frati/08a,
AUTHOR = {Frati, Fabrizio},
TITLE = {A lower bound on the area requirements of series-parallel graphs},
BOOKTITLE = {Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2008 (Durham, UK, June 30 - July 2, 2008)},
SERIES = {LNCS},
VOLUME = {5344},
PAGES = {159-170},
YEAR = {2008},
EDITOR = {Broersma, Hajo and Erlebach, Thomas and Friedetzky, Tom and Paulusma, Daniel},
URL = {http://dx.doi.org/10.1007/978-3-540-92248-3_15},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Gaspers-Kratsch-Liedloff/08,
AUTHOR = {Gaspers, Serge and Kratsch, Dieter and Liedloff, Mathieu},
TITLE = {On independent sets and bicliques in graphs},
BOOKTITLE = {Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2008 (Durham, UK, June 30 - July 2, 2008)},
SERIES = {LNCS},
VOLUME = {5344},
PAGES = {171-182},
YEAR = {2008},
EDITOR = {Broersma, Hajo and Erlebach, Thomas and Friedetzky, Tom and Paulusma, Daniel},
URL = {http://dx.doi.org/10.1007/978-3-540-92248-3_16},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Godlin-Kotek-Makowsky/08,
AUTHOR = {Godlin, Benny and Kotek, Tomer and Makowsky, Johann A.},
TITLE = {Evaluations of graph polynomials},
BOOKTITLE = {Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2008 (Durham, UK, June 30 - July 2, 2008)},
SERIES = {LNCS},
VOLUME = {5344},
PAGES = {183-194},
YEAR = {2008},
EDITOR = {Broersma, Hajo and Erlebach, Thomas and Friedetzky, Tom and Paulusma, Daniel},
URL = {http://dx.doi.org/10.1007/978-3-540-92248-3_17},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Golovach-Villanger/08,
AUTHOR = {Golovach, Petr A. and Villanger, Yngve},
TITLE = {Parameterized complexity for domination problems on degenerate graphs},
BOOKTITLE = {Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2008 (Durham, UK, June 30 - July 2, 2008)},
SERIES = {LNCS},
VOLUME = {5344},
PAGES = {195-205},
YEAR = {2008},
EDITOR = {Broersma, Hajo and Erlebach, Thomas and Friedetzky, Tom and Paulusma, Daniel},
URL = {http://dx.doi.org/10.1007/978-3-540-92248-3_18},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Gutin-Johnstone-Reddington-Scott-Yeo/08,
AUTHOR = {Gutin, Gregory and Johnstone, Adrian and Reddington, Joseph and Scott, Elizabeth and Yeo, Anders},
TITLE = {An algorithm for finding input-output constrained convex sets in an acyclic digraph},
BOOKTITLE = {Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2008 (Durham, UK, June 30 - July 2, 2008)},
SERIES = {LNCS},
VOLUME = {5344},
PAGES = {206-217},
YEAR = {2008},
EDITOR = {Broersma, Hajo and Erlebach, Thomas and Friedetzky, Tom and Paulusma, Daniel},
URL = {http://dx.doi.org/10.1007/978-3-540-92248-3_19},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Heggernes-Lokshtanov-Mihai-Papadopoulos/08,
AUTHOR = {Heggernes, Pinar and Lokshtanov, Daniel and Mihai, Rodica and Papadopoulos, Charis},
TITLE = {Cutwidth of split graphs, threshold graphs, and proper interval graphs},
BOOKTITLE = {Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2008 (Durham, UK, June 30 - July 2, 2008)},
SERIES = {LNCS},
VOLUME = {5344},
PAGES = {218-229},
YEAR = {2008},
EDITOR = {Broersma, Hajo and Erlebach, Thomas and Friedetzky, Tom and Paulusma, Daniel},
URL = {http://dx.doi.org/10.1007/978-3-540-92248-3_20},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Jelinek/08,
AUTHOR = {Jel{\'{i}}nek, V{\'{i}}t},
TITLE = {The rank-width of the square grid},
BOOKTITLE = {Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2008 (Durham, UK, June 30 - July 2, 2008)},
SERIES = {LNCS},
VOLUME = {5344},
PAGES = {230-239},
YEAR = {2008},
EDITOR = {Broersma, Hajo and Erlebach, Thomas and Friedetzky, Tom and Paulusma, Daniel},
URL = {http://dx.doi.org/10.1007/978-3-540-92248-3_21},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Kneis-Langer-Rossmanith/08,
AUTHOR = {Kneis, Joachim and Langer, Alexander and Rossmanith, Peter},
TITLE = {Improved upper bounds for partial vertex cover},
BOOKTITLE = {Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2008 (Durham, UK, June 30 - July 2, 2008)},
SERIES = {LNCS},
VOLUME = {5344},
PAGES = {240-251},
YEAR = {2008},
EDITOR = {Broersma, Hajo and Erlebach, Thomas and Friedetzky, Tom and Paulusma, Daniel},
URL = {http://dx.doi.org/10.1007/978-3-540-92248-3_22},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Koiran-Meer/08,
AUTHOR = {Koiran, Pascal and Meer, Klaus},
TITLE = {On the expressive power of CNF formulas of bounded tree- and clique-width},
BOOKTITLE = {Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2008 (Durham, UK, June 30 - July 2, 2008)},
SERIES = {LNCS},
VOLUME = {5344},
PAGES = {252-263},
YEAR = {2008},
EDITOR = {Broersma, Hajo and Erlebach, Thomas and Friedetzky, Tom and Paulusma, Daniel},
URL = {http://dx.doi.org/10.1007/978-3-540-92248-3_23},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Koutsonas-Thilikos/08,
AUTHOR = {Koutsonas, Athanassios and Thilikos, Dimitrios M.},
TITLE = {Planar feedback vertex set and face cover: Combinatorial bounds and subexponential algorithms},
BOOKTITLE = {Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2008 (Durham, UK, June 30 - July 2, 2008)},
SERIES = {LNCS},
VOLUME = {5344},
PAGES = {264-274},
YEAR = {2008},
EDITOR = {Broersma, Hajo and Erlebach, Thomas and Friedetzky, Tom and Paulusma, Daniel},
URL = {http://dx.doi.org/10.1007/978-3-540-92248-3_24},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Cohen-Golumbic-Lipshteyn-Stern/08,
AUTHOR = {Cohen, Elad and Golumbic, Martin Charles and Lipshteyn, Marina and Stern, Michal},
TITLE = {What is between chordal and weakly chordal graphs?},
BOOKTITLE = {Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2008 (Durham, UK, June 30 - July 2, 2008)},
SERIES = {LNCS},
VOLUME = {5344},
PAGES = {275-286},
YEAR = {2008},
EDITOR = {Broersma, Hajo and Erlebach, Thomas and Friedetzky, Tom and Paulusma, Daniel},
URL = {http://dx.doi.org/10.1007/978-3-540-92248-3_25},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Marx-Schlotter/08,
AUTHOR = {Marx, D{\'a}niel and Schlotter, Ildik{\'o}},
TITLE = {Parameterized graph cleaning problems},
BOOKTITLE = {Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2008 (Durham, UK, June 30 - July 2, 2008)},
SERIES = {LNCS},
VOLUME = {5344},
PAGES = {287-299},
YEAR = {2008},
EDITOR = {Broersma, Hajo and Erlebach, Thomas and Friedetzky, Tom and Paulusma, Daniel},
URL = {http://dx.doi.org/10.1007/978-3-540-92248-3_26},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Munoz-Sau/08,
AUTHOR = {Mu{\~n}oz, Xavier and Sau, Ignasi},
TITLE = {Traffic grooming in unidirectional WDM rings with bounded degree request graph},
BOOKTITLE = {Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2008 (Durham, UK, June 30 - July 2, 2008)},
SERIES = {LNCS},
VOLUME = {5344},
PAGES = {300-311},
YEAR = {2008},
EDITOR = {Broersma, Hajo and Erlebach, Thomas and Friedetzky, Tom and Paulusma, Daniel},
URL = {http://dx.doi.org/10.1007/978-3-540-92248-3_27},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Nisse-Suchan/08,
AUTHOR = {Nisse, Nicolas and Suchan, Karol},
TITLE = {Fast robber in planar graphs},
BOOKTITLE = {Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2008 (Durham, UK, June 30 - July 2, 2008)},
SERIES = {LNCS},
VOLUME = {5344},
PAGES = {312-323},
YEAR = {2008},
EDITOR = {Broersma, Hajo and Erlebach, Thomas and Friedetzky, Tom and Paulusma, Daniel},
URL = {http://dx.doi.org/10.1007/978-3-540-92248-3_28},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Nussbaum/08,
AUTHOR = {Nussbaum, Yahav},
TITLE = {From a circular-arc model to a proper circular-arc model},
BOOKTITLE = {Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2008 (Durham, UK, June 30 - July 2, 2008)},
SERIES = {LNCS},
VOLUME = {5344},
PAGES = {324-335},
YEAR = {2008},
EDITOR = {Broersma, Hajo and Erlebach, Thomas and Friedetzky, Tom and Paulusma, Daniel},
URL = {http://dx.doi.org/10.1007/978-3-540-92248-3_29},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Kreutzer-Ordyniak/08,
AUTHOR = {Kreutzer, Stephan and Ordyniak, Sebastian},
TITLE = {Digraph decompositions and monotonicity in digraph searching},
BOOKTITLE = {Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2008 (Durham, UK, June 30 - July 2, 2008)},
SERIES = {LNCS},
VOLUME = {5344},
PAGES = {336-347},
YEAR = {2008},
EDITOR = {Broersma, Hajo and Erlebach, Thomas and Friedetzky, Tom and Paulusma, Daniel},
URL = {http://dx.doi.org/10.1007/978-3-540-92248-3_30},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Richerby-Thilikos/08,
AUTHOR = {Richerby, David and Thilikos, Dimitrios M.},
TITLE = {Searching for a visible, lazy fugitive},
BOOKTITLE = {Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2008 (Durham, UK, June 30 - July 2, 2008)},
SERIES = {LNCS},
VOLUME = {5344},
PAGES = {348-359},
YEAR = {2008},
EDITOR = {Broersma, Hajo and Erlebach, Thomas and Friedetzky, Tom and Paulusma, Daniel},
URL = {http://dx.doi.org/10.1007/978-3-540-92248-3_31},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Tazari-Muller-Hannemann/08,
AUTHOR = {Tazari, Siamak and M{\"u}ller-Hannemann, Matthias},
TITLE = {A faster shortest-paths algorithm for minor-closed graph classes},
BOOKTITLE = {Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2008 (Durham, UK, June 30 - July 2, 2008)},
SERIES = {LNCS},
VOLUME = {5344},
PAGES = {360-371},
YEAR = {2008},
EDITOR = {Broersma, Hajo and Erlebach, Thomas and Friedetzky, Tom and Paulusma, Daniel},
URL = {http://dx.doi.org/10.1007/978-3-540-92248-3_32},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Wiese-Kranakis/08,
AUTHOR = {Wiese, Andreas and Kranakis, Evangelos},
TITLE = {Local construction and coloring of spanners of location aware unit disk graphs},
BOOKTITLE = {Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2008 (Durham, UK, June 30 - July 2, 2008)},
SERIES = {LNCS},
VOLUME = {5344},
PAGES = {372-383},
YEAR = {2008},
EDITOR = {Broersma, Hajo and Erlebach, Thomas and Friedetzky, Tom and Paulusma, Daniel},
URL = {http://dx.doi.org/10.1007/978-3-540-92248-3_33},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}