@incollection{Gottlob-Grohe-Musliu-Samer-Scarcello/05,
AUTHOR = {Gottlob, Georg and Grohe, Martin and Musliu, Nysret and Samer, Marko and Scarcello, Francesco},
TITLE = {Hypertree decompositions: Structure, algorithms, and applications},
BOOKTITLE = {Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2005 (Metz, France, June 23-25, 2005)},
SERIES = {LNCS},
VOLUME = {3787},
PAGES = {1-15},
YEAR = {2005},
EDITOR = {Kratsch, Dieter},
URL = {http://dx.doi.org/10.1007/11604686_1},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Bouvel-Grebinski-Kucherov/05,
AUTHOR = {Bouvel, Mathilde and Grebinski, Vladimir and Kucherov, Gregory},
TITLE = {Combinatorial search on graphs motivated by bioinformatics applications: A brief survey},
BOOKTITLE = {Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2005 (Metz, France, June 23-25, 2005)},
SERIES = {LNCS},
VOLUME = {3787},
PAGES = {16-27},
YEAR = {2005},
EDITOR = {Kratsch, Dieter},
URL = {http://dx.doi.org/10.1007/11604686_2},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Aggarwal-Mehta-Deogun/05,
AUTHOR = {Aggarwal, Divesh and Mehta, Shashank K. and Deogun, Jitender S.},
TITLE = {Domination search on graphs with low dominating-target-number},
BOOKTITLE = {Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2005 (Metz, France, June 23-25, 2005)},
SERIES = {LNCS},
VOLUME = {3787},
PAGES = {28-37},
YEAR = {2005},
EDITOR = {Kratsch, Dieter},
URL = {http://dx.doi.org/10.1007/11604686_3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Crespelle-Paul/05,
AUTHOR = {Crespelle, Christophe and Paul, Christophe},
TITLE = {Fully dynamic algorithm for recognition and modular decomposition of permutation graphs},
BOOKTITLE = {Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2005 (Metz, France, June 23-25, 2005)},
SERIES = {LNCS},
VOLUME = {3787},
PAGES = {38-48},
YEAR = {2005},
EDITOR = {Kratsch, Dieter},
URL = {http://dx.doi.org/10.1007/11604686_4},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Oum/05a,
AUTHOR = {Oum, Sang-il},
TITLE = {Approximating rank-width and clique-width quickly},
BOOKTITLE = {Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2005 (Metz, France, June 23-25, 2005)},
SERIES = {LNCS},
VOLUME = {3787},
PAGES = {49-58},
YEAR = {2005},
EDITOR = {Kratsch, Dieter},
URL = {http://dx.doi.org/10.1007/11604686_5},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Gimenez-Hlineny-Noy/05,
AUTHOR = {Gim{\'e}nez, Omer and Hlin{\v{e}}n{\'y}, Petr and Noy, Marc},
TITLE = {Computing the Tutte polynomial on graphs of bounded clique-width},
BOOKTITLE = {Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2005 (Metz, France, June 23-25, 2005)},
SERIES = {LNCS},
VOLUME = {3787},
PAGES = {59-68},
YEAR = {2005},
EDITOR = {Kratsch, Dieter},
KEYWORDS = {Tutte polynomial, cographs, clique-width, subexponential algorithm, $U$-polynomial},
URL = {http://dx.doi.org/10.1007/11604686_6},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Gurski-Wanke/05,
AUTHOR = {Gurski, Frank and Wanke, Egon},
TITLE = {Minimizing NLC-width is $NP$-complete},
BOOKTITLE = {Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2005 (Metz, France, June 23-25, 2005)},
SERIES = {LNCS},
VOLUME = {3787},
PAGES = {69-80},
YEAR = {2005},
EDITOR = {Kratsch, Dieter},
URL = {http://dx.doi.org/10.1007/11604686_7},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Havet-Sereni/05,
AUTHOR = {Havet, Fr{\'e}d{\'e}ric and Sereni, Jean-S{\'e}bastien},
TITLE = {Channel assignment and improper choosability of graphs},
BOOKTITLE = {Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2005 (Metz, France, June 23-25, 2005)},
SERIES = {LNCS},
VOLUME = {3787},
PAGES = {81-90},
YEAR = {2005},
EDITOR = {Kratsch, Dieter},
URL = {http://dx.doi.org/10.1007/11604686_8},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Meister/05,
AUTHOR = {Meister, Daniel},
TITLE = {Computing treewidth and minimum fill-in for permutation graphs in linear time},
BOOKTITLE = {Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2005 (Metz, France, June 23-25, 2005)},
SERIES = {LNCS},
VOLUME = {3787},
PAGES = {91-102},
YEAR = {2005},
EDITOR = {Kratsch, Dieter},
URL = {http://dx.doi.org/10.1007/11604686_9},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Liedloff-Kloks-Liu-Peng/05,
AUTHOR = {Liedloff, Mathieu and Kloks, Ton and Liu, Jiping and Peng, Sheng-Lung},
TITLE = {Roman domination over some graph classes},
BOOKTITLE = {Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2005 (Metz, France, June 23-25, 2005)},
SERIES = {LNCS},
VOLUME = {3787},
PAGES = {103-114},
YEAR = {2005},
EDITOR = {Kratsch, Dieter},
URL = {http://dx.doi.org/10.1007/11604686_10},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Fiala-Paulusma-Telle/05a,
AUTHOR = {Fiala, Ji{\v{r}}{\'{i}} and Paulusma, Dani{\"e}l and Telle, Jan Arne},
TITLE = {Algorithms for comparability of matrices in partial orders imposed by graph homomorphisms},
BOOKTITLE = {Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2005 (Metz, France, June 23-25, 2005)},
SERIES = {LNCS},
VOLUME = {3787},
PAGES = {115-126},
YEAR = {2005},
EDITOR = {Kratsch, Dieter},
URL = {http://dx.doi.org/10.1007/11604686_11},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Beerliova-Eberhard-Erlebach-Hall-Hoffmann-Mihalak-Ram/05,
AUTHOR = {Beerliova, Zuzana and Eberhard, Felix and Erlebach, Thomas and Hall, Alexander and Hoffmann, Michael and Mihal'{\'a}k, Mat{\'u}{\v{s}} and Ram, L. Shankar},
TITLE = {Network discovery and verification},
BOOKTITLE = {Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2005 (Metz, France, June 23-25, 2005)},
SERIES = {LNCS},
VOLUME = {3787},
PAGES = {127-138},
YEAR = {2005},
EDITOR = {Kratsch, Dieter},
URL = {http://dx.doi.org/10.1007/11604686_12},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Gioan/05,
AUTHOR = {Gioan, Emeric},
TITLE = {Complete graph drawings up to triangle mutations},
BOOKTITLE = {Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2005 (Metz, France, June 23-25, 2005)},
SERIES = {LNCS},
VOLUME = {3787},
PAGES = {139-150},
YEAR = {2005},
EDITOR = {Kratsch, Dieter},
KEYWORDS = {graph drawing, logical structure, triangle switch, mutation, pseudoline arrangement, oriented matroid, spatial graph visualization},
URL = {http://dx.doi.org/10.1007/11604686_13},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Corneil-Dragan-Kohler-Yan/05,
AUTHOR = {Corneil, Derek G. and Dragan, Feodor F. and K{\"o}hler, Ekkehard and Yan, Chenyu},
TITLE = {Collective tree 1-spanners for interval graphs},
BOOKTITLE = {Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2005 (Metz, France, June 23-25, 2005)},
SERIES = {LNCS},
VOLUME = {3787},
PAGES = {151-162},
YEAR = {2005},
EDITOR = {Kratsch, Dieter},
URL = {http://dx.doi.org/10.1007/11604686_14},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Le-Mosca-Muller/05,
AUTHOR = {Le, Van Bang and Mosca, Raffaele and M{\"u}ller, Haiko},
TITLE = {On stable cutsets in claw-free graphs and planar graphs},
BOOKTITLE = {Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2005 (Metz, France, June 23-25, 2005)},
SERIES = {LNCS},
VOLUME = {3787},
PAGES = {163-174},
YEAR = {2005},
EDITOR = {Kratsch, Dieter},
URL = {http://dx.doi.org/10.1007/11604686_15},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Bose-Dujmovic-Wood/05,
AUTHOR = {Bose, Prosenjit and Dujmovi{\'c}, Vida and Wood, David R.},
TITLE = {Induced subgraphs of bounded degree and bounded treewidth},
BOOKTITLE = {Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2005 (Metz, France, June 23-25, 2005)},
SERIES = {LNCS},
VOLUME = {3787},
PAGES = {175-186},
YEAR = {2005},
EDITOR = {Kratsch, Dieter},
URL = {http://dx.doi.org/10.1007/11604686_16},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Heggernes-Lokshtanov/05,
AUTHOR = {Heggernes, Pinar and Lokshtanov, Daniel},
TITLE = {Optimal broadcast domination of arbitrary graphs in polynomial time},
BOOKTITLE = {Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2005 (Metz, France, June 23-25, 2005)},
SERIES = {LNCS},
VOLUME = {3787},
PAGES = {187-198},
YEAR = {2005},
EDITOR = {Kratsch, Dieter},
URL = {http://dx.doi.org/10.1007/11604686_17},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Berry-Krueger-Simonet/05,
AUTHOR = {Berry, Anne and Krueger, Richard and Simonet, Genevieve},
TITLE = {Ultimate generalizations of LexBFS and LEX M},
BOOKTITLE = {Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2005 (Metz, France, June 23-25, 2005)},
SERIES = {LNCS},
VOLUME = {3787},
PAGES = {199-213},
YEAR = {2005},
EDITOR = {Kratsch, Dieter},
URL = {http://dx.doi.org/10.1007/11604686_18},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Nikolopoulos-Palios/05,
AUTHOR = {Nikolopoulos, Stavros D. and Palios, Leonidas},
TITLE = {Adding an edge in a cograph},
BOOKTITLE = {Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2005 (Metz, France, June 23-25, 2005)},
SERIES = {LNCS},
VOLUME = {3787},
PAGES = {214-226},
YEAR = {2005},
EDITOR = {Kratsch, Dieter},
KEYWORDS = {perfect graphs, cographs, cotrees, connected components, co-connected components, optimization problems},
URL = {http://dx.doi.org/10.1007/11604686_19},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Gatto-Jacob-Peeters-Schobel/05,
AUTHOR = {Gatto, Michael and Jacob, Riko and Peeters, Leon and Sch{\"o}bel, Anita},
TITLE = {The computational complexity of delay management},
BOOKTITLE = {Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2005 (Metz, France, June 23-25, 2005)},
SERIES = {LNCS},
VOLUME = {3787},
PAGES = {227-238},
YEAR = {2005},
EDITOR = {Kratsch, Dieter},
URL = {http://dx.doi.org/10.1007/11604686_20},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Goncalves-Montassier/05,
AUTHOR = {Gon{\c{c}}alves, Daniel and Montassier, Micka{\"e}l},
TITLE = {Acyclic choosability of graphs with small maximum degree},
BOOKTITLE = {Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2005 (Metz, France, June 23-25, 2005)},
SERIES = {LNCS},
VOLUME = {3787},
PAGES = {239-248},
YEAR = {2005},
EDITOR = {Kratsch, Dieter},
URL = {http://dx.doi.org/10.1007/11604686_21},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Nakano-Uno/05,
AUTHOR = {Nakano, Shin-ichi and Uno, Takeaki},
TITLE = {Generating colored trees},
BOOKTITLE = {Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2005 (Metz, France, June 23-25, 2005)},
SERIES = {LNCS},
VOLUME = {3787},
PAGES = {249-260},
YEAR = {2005},
EDITOR = {Kratsch, Dieter},
URL = {http://dx.doi.org/10.1007/11604686_22},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Korach-Razgon/05,
AUTHOR = {Korach, Ephraim and Razgon, Margarita},
TITLE = {Optimal hypergraph tree-realization},
BOOKTITLE = {Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2005 (Metz, France, June 23-25, 2005)},
SERIES = {LNCS},
VOLUME = {3787},
PAGES = {261-270},
YEAR = {2005},
EDITOR = {Kratsch, Dieter},
URL = {http://dx.doi.org/10.1007/11604686_23},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Blin-Fertin-Hermelin-Vialette/05,
AUTHOR = {Blin, Guillaume and Fertin, Guillaume and Hermelin, Danny and Vialette, St{\'e}phane},
TITLE = {Fixed-parameter algorithms for protein similarity search under mRNA structure constraints},
BOOKTITLE = {Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2005 (Metz, France, June 23-25, 2005)},
SERIES = {LNCS},
VOLUME = {3787},
PAGES = {271-282},
YEAR = {2005},
EDITOR = {Kratsch, Dieter},
URL = {http://dx.doi.org/10.1007/11604686_24},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Damaschke/05,
AUTHOR = {Damaschke, Peter},
TITLE = {On the fixed-parameter enumerability of cluster editing},
BOOKTITLE = {Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2005 (Metz, France, June 23-25, 2005)},
SERIES = {LNCS},
VOLUME = {3787},
PAGES = {283-294},
YEAR = {2005},
EDITOR = {Kratsch, Dieter},
URL = {http://dx.doi.org/10.1007/11604686_25},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Bodirsky-Kral/05,
AUTHOR = {Bodirsky, Manuel and Kr{\'a}l', Daniel},
TITLE = {Locally consistent constraint satisfaction problems with binary constraints},
BOOKTITLE = {Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2005 (Metz, France, June 23-25, 2005)},
SERIES = {LNCS},
VOLUME = {3787},
PAGES = {295-306},
YEAR = {2005},
EDITOR = {Kratsch, Dieter},
URL = {http://dx.doi.org/10.1007/11604686_26},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Elsasser-Sauerwald/05,
AUTHOR = {Els{\"a}sser, Robert and Sauerwald, Thomas},
TITLE = {On randomized broadcasting in star graphs},
BOOKTITLE = {Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2005 (Metz, France, June 23-25, 2005)},
SERIES = {LNCS},
VOLUME = {3787},
PAGES = {307-318},
YEAR = {2005},
EDITOR = {Kratsch, Dieter},
URL = {http://dx.doi.org/10.1007/11604686_27},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Tholey/05,
AUTHOR = {Tholey, Torsten},
TITLE = {Finding disjoint paths on directed acyclic graphs},
BOOKTITLE = {Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2005 (Metz, France, June 23-25, 2005)},
SERIES = {LNCS},
VOLUME = {3787},
PAGES = {319-330},
YEAR = {2005},
EDITOR = {Kratsch, Dieter},
URL = {http://dx.doi.org/10.1007/11604686_28},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Angel-Bampis-Gourves/05a,
AUTHOR = {Angel, Eric and Bampis, Evripidis and Gourv{\`e}s, Laurent},
TITLE = {Approximation algorithms for the bi-criteria weighted MAX-CUT problem},
BOOKTITLE = {Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2005 (Metz, France, June 23-25, 2005)},
SERIES = {LNCS},
VOLUME = {3787},
PAGES = {331-340},
YEAR = {2005},
EDITOR = {Kratsch, Dieter},
URL = {http://dx.doi.org/10.1007/11604686_29},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Kako-Ono-Hirata-Halldorsson/05,
AUTHOR = {Kako, Akihisa and Ono, Takao and Hirata, Tomio and Halld{\'o}rsson, Magn{\'u}s M.},
TITLE = {Approximation algorithms for the weighted independent set problem},
BOOKTITLE = {Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2005 (Metz, France, June 23-25, 2005)},
SERIES = {LNCS},
VOLUME = {3787},
PAGES = {341-350},
YEAR = {2005},
EDITOR = {Kratsch, Dieter},
URL = {http://dx.doi.org/10.1007/11604686_30},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{van_Leeuwen/05,
AUTHOR = {van Leeuwen, Erik Jan},
TITLE = {Approximation algorithms for unit disk graphs},
BOOKTITLE = {Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2005 (Metz, France, June 23-25, 2005)},
SERIES = {LNCS},
VOLUME = {3787},
PAGES = {351-361},
YEAR = {2005},
EDITOR = {Kratsch, Dieter},
URL = {http://dx.doi.org/10.1007/11604686_31},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Berthome-Lebresne-Nguyen/05,
AUTHOR = {Berthom{\'e}, Pascal and Lebresne, Sylvain and Nguy{\^e}n, Kim},
TITLE = {Computation of chromatic polynomials using triangulations and clique trees},
BOOKTITLE = {Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2005 (Metz, France, June 23-25, 2005)},
SERIES = {LNCS},
VOLUME = {3787},
PAGES = {362-373},
YEAR = {2005},
EDITOR = {Kratsch, Dieter},
KEYWORDS = {chromatic polynomial, chordal graphs, minimal triangulation, clique tree},
URL = {http://dx.doi.org/10.1007/11604686_32},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Fomin-Mazoit-Todinca/05,
AUTHOR = {Fomin, Fedor and Mazoit, Fr{\'e}d{\'e}ric and Todinca, Ioan},
TITLE = {Computing branchwidth via efficient triangulations and blocks},
BOOKTITLE = {Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2005 (Metz, France, June 23-25, 2005)},
SERIES = {LNCS},
VOLUME = {3787},
PAGES = {374-384},
YEAR = {2005},
EDITOR = {Kratsch, Dieter},
URL = {http://dx.doi.org/10.1007/11604686_33},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Kneis-Molle-Richter-Rossmanith/05a,
AUTHOR = {Kneis, Joachim and M{\"o}lle, Daniel and Richter, Stefan and Rossmanith, Peter},
TITLE = {Algorithms based on the treewidth of sparse graphs},
BOOKTITLE = {Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2005 (Metz, France, June 23-25, 2005)},
SERIES = {LNCS},
VOLUME = {3787},
PAGES = {385-396},
YEAR = {2005},
EDITOR = {Kratsch, Dieter},
URL = {http://dx.doi.org/10.1007/11604686_34},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Dom-Guo-Huffner-Niedermeier/05,
AUTHOR = {Dom, Michael and Guo, Jiong and H{\"u}ffner, Falk and Niedermeier, Rolf},
TITLE = {Extending the tractability border for closest leaf powers},
BOOKTITLE = {Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2005 (Metz, France, June 23-25, 2005)},
SERIES = {LNCS},
VOLUME = {3787},
PAGES = {397-408},
YEAR = {2005},
EDITOR = {Kratsch, Dieter},
URL = {http://dx.doi.org/10.1007/11604686_35},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Giesen-Mitsche/05,
AUTHOR = {Giesen, Joachim and Mitsche, Dieter},
TITLE = {Bounding the misclassification error in spectral partitioning in the planted partition model},
BOOKTITLE = {Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2005 (Metz, France, June 23-25, 2005)},
SERIES = {LNCS},
VOLUME = {3787},
PAGES = {409-420},
YEAR = {2005},
EDITOR = {Kratsch, Dieter},
URL = {http://dx.doi.org/10.1007/11604686_36},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{McConnell-de_Montgolfier/05,
AUTHOR = {McConnell, Ross M. and de Montgolfier, Fabien},
TITLE = {Algebraic operations on $PQ$ trees and modular decomposition trees},
BOOKTITLE = {Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2005 (Metz, France, June 23-25, 2005)},
SERIES = {LNCS},
VOLUME = {3787},
PAGES = {421-432},
YEAR = {2005},
EDITOR = {Kratsch, Dieter},
URL = {http://dx.doi.org/10.1007/11604686_37},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Okamoto-Uno-Uehara/05,
AUTHOR = {Okamoto, Yoshio and Uno, Takeaki and Uehara, Ryuhei},
TITLE = {Linear-time counting algorithms for independent sets in chordal graphs},
BOOKTITLE = {Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2005 (Metz, France, June 23-25, 2005)},
SERIES = {LNCS},
VOLUME = {3787},
PAGES = {433-444},
YEAR = {2005},
EDITOR = {Kratsch, Dieter},
KEYWORDS = {chordal graph, counting, enumeration, independent set, $NP$-completeness, $\#P$-completeness, polynomial time algorithm},
URL = {http://dx.doi.org/10.1007/11604686_38},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Berry-Sigayret-Spinrad/05,
AUTHOR = {Berry, Anne and Sigayret, Alain and Spinrad, Jeremy},
TITLE = {Faster dynamic algorithms for chordal graphs, and an application to phylogeny},
BOOKTITLE = {Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2005 (Metz, France, June 23-25, 2005)},
SERIES = {LNCS},
VOLUME = {3787},
PAGES = {445-455},
YEAR = {2005},
EDITOR = {Kratsch, Dieter},
URL = {http://dx.doi.org/10.1007/11604686_39},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}
@incollection{Nikolopoulos-Palios/05a,
AUTHOR = {Nikolopoulos, Stavros D. and Palios, Leonidas},
TITLE = {Recognizing HHDS-free graphs},
BOOKTITLE = {Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2005 (Metz, France, June 23-25, 2005)},
SERIES = {LNCS},
VOLUME = {3787},
PAGES = {456-467},
YEAR = {2005},
EDITOR = {Kratsch, Dieter},
KEYWORDS = {HHD-free graphs, HHDS-free graphs, sun, homogeneously orderable graphs, perfectly orderable graphs, recognition},
URL = {http://dx.doi.org/10.1007/11604686_40},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York},
}