@incollection{Achlioptas/10,
AUTHOR = {Achlioptas, Dimitris},
TITLE = {Algorithmic barriers from phase transitions in graphs},
BOOKTITLE = {Proceedings of the 36th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2010 (Zar{\'o}s, Crete, Greece, June 28-30, 2010)},
SERIES = {LNCS},
VOLUME = {6410},
PAGES = {1-1},
YEAR = {2010},
EDITOR = {Thilikos, Dimitrios M.},
URL = {http://springerlink.metapress.com/content/p5803h8522l5n866/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Demaine/10,
AUTHOR = {Demaine, Erik D.},
TITLE = {Algorithmic graph minors and bidimensionality},
BOOKTITLE = {Proceedings of the 36th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2010 (Zar{\'o}s, Crete, Greece, June 28-30, 2010)},
SERIES = {LNCS},
VOLUME = {6410},
PAGES = {2-2},
YEAR = {2010},
EDITOR = {Thilikos, Dimitrios M.},
URL = {http://springerlink.metapress.com/content/0403t136v25135t6/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Otachi-Bodlaender-Leeuwen/10,
AUTHOR = {Otachi, Yota and Bodlaender, Hans L. and Leeuwen, Erik Jan van},
TITLE = {Complexity results for the spanning tree congestion problem},
BOOKTITLE = {Proceedings of the 36th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2010 (Zar{\'o}s, Crete, Greece, June 28-30, 2010)},
SERIES = {LNCS},
VOLUME = {6410},
PAGES = {3-14},
YEAR = {2010},
EDITOR = {Thilikos, Dimitrios M.},
URL = {http://springerlink.metapress.com/content/0171089521783608/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Kaminski/10,
AUTHOR = {Kami{\'n}ski, Marcin},
TITLE = {Max-cut {\'e}and containment relations in graphs},
BOOKTITLE = {Proceedings of the 36th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2010 (Zar{\'o}s, Crete, Greece, June 28-30, 2010)},
SERIES = {LNCS},
VOLUME = {6410},
PAGES = {15-26},
YEAR = {2010},
EDITOR = {Thilikos, Dimitrios M.},
URL = {http://springerlink.metapress.com/content/a587qr42m1833312/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Ioannidou-Nikolopoulos/10,
AUTHOR = {Ioannidou, Kyriaki and Nikolopoulos, Stavros D.},
TITLE = {The longest path problem is polynomial on cocomparability graphs},
BOOKTITLE = {Proceedings of the 36th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2010 (Zar{\'o}s, Crete, Greece, June 28-30, 2010)},
SERIES = {LNCS},
VOLUME = {6410},
PAGES = {27-38},
YEAR = {2010},
EDITOR = {Thilikos, Dimitrios M.},
URL = {http://springerlink.metapress.com/content/34h0420431310612/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Golovach-Kratsch-Couturier/10,
AUTHOR = {Golovach, Petr A. and Kratsch, Dieter and Couturier, Jean-Francois},
TITLE = {Colorings with few colors: Counting, enumeration and combinatorial bounds},
BOOKTITLE = {Proceedings of the 36th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2010 (Zar{\'o}s, Crete, Greece, June 28-30, 2010)},
SERIES = {LNCS},
VOLUME = {6410},
PAGES = {39-50},
YEAR = {2010},
EDITOR = {Thilikos, Dimitrios M.},
URL = {http://springerlink.metapress.com/content/k518hm46627l3534/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Fleiner/10a,
AUTHOR = {Fleiner, Tam{\'a}s},
TITLE = {On stable matchings and flows},
BOOKTITLE = {Proceedings of the 36th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2010 (Zar{\'o}s, Crete, Greece, June 28-30, 2010)},
SERIES = {LNCS},
VOLUME = {6410},
PAGES = {51-62},
YEAR = {2010},
EDITOR = {Thilikos, Dimitrios M.},
URL = {http://springerlink.metapress.com/content/u8044t630153g8w9/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Broersma-Golovach-Paulusma-Song/10,
AUTHOR = {Broersma, Hajo and Golovach, Petr A. and Paulusma, Dani{\"e}l and Song, Jian},
TITLE = {Narrowing down the gap on the complexity of coloring $P_k$-free graphs},
BOOKTITLE = {Proceedings of the 36th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2010 (Zar{\'o}s, Crete, Greece, June 28-30, 2010)},
SERIES = {LNCS},
VOLUME = {6410},
PAGES = {63-74},
YEAR = {2010},
EDITOR = {Thilikos, Dimitrios M.},
URL = {http://springerlink.metapress.com/content/l42245j2j354nl91/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Heggernes-Hof-Lokshtanov-Nederlof/10,
AUTHOR = {Heggernes, Pinar and Hof, Pim van {\'a}t and Lokshtanov, Daniel and Nederlof, Jesper},
TITLE = {Computing the cutwidth of bipartite permutation graphs in linear time},
BOOKTITLE = {Proceedings of the 36th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2010 (Zar{\'o}s, Crete, Greece, June 28-30, 2010)},
SERIES = {LNCS},
VOLUME = {6410},
PAGES = {75-87},
YEAR = {2010},
EDITOR = {Thilikos, Dimitrios M.},
URL = {http://springerlink.metapress.com/content/57021x0223716447/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Liedloff-Todinca-Villanger/10,
AUTHOR = {Liedloff, Mathieu and Todinca, Ioan and Villanger, Yngve},
TITLE = {Solving capacitated dominating set by using covering by subsets and maximum matching},
BOOKTITLE = {Proceedings of the 36th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2010 (Zar{\'o}s, Crete, Greece, June 28-30, 2010)},
SERIES = {LNCS},
VOLUME = {6410},
PAGES = {88-99},
YEAR = {2010},
EDITOR = {Thilikos, Dimitrios M.},
URL = {http://springerlink.metapress.com/content/p36k648p16422751/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Dorn-Moser-Niedermeier-Weller/10,
AUTHOR = {Dorn, Frederic and Moser, Hannes and Niedermeier, Rolf and Weller, Mathias},
TITLE = {Efficient algorithms for eulerian extension},
BOOKTITLE = {Proceedings of the 36th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2010 (Zar{\'o}s, Crete, Greece, June 28-30, 2010)},
SERIES = {LNCS},
VOLUME = {6410},
PAGES = {100-111},
YEAR = {2010},
EDITOR = {Thilikos, Dimitrios M.},
URL = {http://springerlink.metapress.com/content/d8g3777577467468/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Xia-Zhang/10a,
AUTHOR = {Xia, Ge and Zhang, Yong},
TITLE = {On the small cycle transversal of planar graphs},
BOOKTITLE = {Proceedings of the 36th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2010 (Zar{\'o}s, Crete, Greece, June 28-30, 2010)},
SERIES = {LNCS},
VOLUME = {6410},
PAGES = {112-122},
YEAR = {2010},
EDITOR = {Thilikos, Dimitrios M.},
URL = {http://springerlink.metapress.com/content/66635x233n335u22/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Fellows-Giannopoulos-Knauer-Paul-Rosamond-al/10,
AUTHOR = {Fellows, Mike and Giannopoulos, Panos and Knauer, Christian and Paul, Christophe and Rosamond, Frances and al., et},
TITLE = {Milling a graph with turn costs: A parameterized complexity perspective},
BOOKTITLE = {Proceedings of the 36th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2010 (Zar{\'o}s, Crete, Greece, June 28-30, 2010)},
SERIES = {LNCS},
VOLUME = {6410},
PAGES = {123-134},
YEAR = {2010},
EDITOR = {Thilikos, Dimitrios M.},
URL = {http://springerlink.metapress.com/content/e1872m80l5847t7j/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Arikushi-Fulek-Keszegh-Moric-Toth/10,
AUTHOR = {Arikushi, Karin and Fulek, Radoslav and Keszegh, Bal{\'a}azs and Mori{\'c}, Filip and T{\'o}th, Csaba D.},
TITLE = {Graphs that admit right angle crossing drawings},
BOOKTITLE = {Proceedings of the 36th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2010 (Zar{\'o}s, Crete, Greece, June 28-30, 2010)},
SERIES = {LNCS},
VOLUME = {6410},
PAGES = {135-146},
YEAR = {2010},
EDITOR = {Thilikos, Dimitrios M.},
URL = {http://springerlink.metapress.com/content/70rk775902243650/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Cygan-Pilipczuk-Pilipczuk-Wojtaszczyk/10,
AUTHOR = {Cygan, Marek and Pilipczuk, Marcin and Pilipczuk, Micha{\l} and Wojtaszczyk, Jakub Onufry},
TITLE = {Kernelization hardness of connectivity problems in $d$-degenerate graphs},
BOOKTITLE = {Proceedings of the 36th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2010 (Zar{\'o}s, Crete, Greece, June 28-30, 2010)},
SERIES = {LNCS},
VOLUME = {6410},
PAGES = {147-158},
YEAR = {2010},
EDITOR = {Thilikos, Dimitrios M.},
URL = {http://springerlink.metapress.com/content/hln271q12kgp4m22/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Adler-Bui-Xuan-Rabinovich-Renault-Telle-al/10,
AUTHOR = {Adler, Isolde and Bui-Xuan, Binh-Minh and Rabinovich, Yuri and Renault, Gabriel and Telle, Jan Arne and al., et},
TITLE = {On the boolean-width of a graph: Structure and applications},
BOOKTITLE = {Proceedings of the 36th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2010 (Zar{\'o}s, Crete, Greece, June 28-30, 2010)},
SERIES = {LNCS},
VOLUME = {6410},
PAGES = {159-170},
YEAR = {2010},
EDITOR = {Thilikos, Dimitrios M.},
URL = {http://springerlink.metapress.com/content/2380344414217667/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Heggernes-Lokshtanov-Nederlof-Paul-Telle/10,
AUTHOR = {Heggernes, Pinar and Lokshtanov, Daniel and Nederlof, Jesper and Paul, Christophe and Telle, Jan Arne},
TITLE = {Generalized graph clustering: Recognizing ($p$,$q$)-cluster graphs},
BOOKTITLE = {Proceedings of the 36th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2010 (Zar{\'o}s, Crete, Greece, June 28-30, 2010)},
SERIES = {LNCS},
VOLUME = {6410},
PAGES = {171-183},
YEAR = {2010},
EDITOR = {Thilikos, Dimitrios M.},
URL = {http://springerlink.metapress.com/content/d01lnu4t40g90164/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Dabrowski-Lozin-Raman-Ries/10,
AUTHOR = {Dabrowski, Konrad and Lozin, Vadim and Raman, Rajiv and Ries, Bernard},
TITLE = {Colouring vertices of triangle-free graphs},
BOOKTITLE = {Proceedings of the 36th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2010 (Zar{\'o}s, Crete, Greece, June 28-30, 2010)},
SERIES = {LNCS},
VOLUME = {6410},
PAGES = {184-195},
YEAR = {2010},
EDITOR = {Thilikos, Dimitrios M.},
URL = {http://springerlink.metapress.com/content/wm115223661442g0/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Philip-Raman-Villanger/10,
AUTHOR = {Philip, Geevarghese and Raman, Venkatesh and Villanger, Yngve},
TITLE = {A quartic kernel for pathwidth-one vertex deletion},
BOOKTITLE = {Proceedings of the 36th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2010 (Zar{\'o}s, Crete, Greece, June 28-30, 2010)},
SERIES = {LNCS},
VOLUME = {6410},
PAGES = {196-207},
YEAR = {2010},
EDITOR = {Thilikos, Dimitrios M.},
URL = {http://springerlink.metapress.com/content/a675490567000012/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Chalopin-Flocchini-Mans-Santoro/10,
AUTHOR = {Chalopin, J{\'e}r{\'e}mie and Flocchini, Paola and Mans, Bernard and Santoro, Nicola},
TITLE = {Network exploration by silent and oblivious robots},
BOOKTITLE = {Proceedings of the 36th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2010 (Zar{\'o}s, Crete, Greece, June 28-30, 2010)},
SERIES = {LNCS},
VOLUME = {6410},
PAGES = {208-219},
YEAR = {2010},
EDITOR = {Thilikos, Dimitrios M.},
URL = {http://springerlink.metapress.com/content/3261653138g48469/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Berger-Muller-Hannemann/10,
AUTHOR = {Berger, Annabell and M{\"u}ller-Hannemann, Matthias},
TITLE = {Uniform sampling of digraphs with a fixed degree sequence},
BOOKTITLE = {Proceedings of the 36th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2010 (Zar{\'o}s, Crete, Greece, June 28-30, 2010)},
SERIES = {LNCS},
VOLUME = {6410},
PAGES = {220-231},
YEAR = {2010},
EDITOR = {Thilikos, Dimitrios M.},
URL = {http://springerlink.metapress.com/content/1tl520rx15650008/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Bevern-Komusiewicz-Moser-Niedermeier/10,
AUTHOR = {Bevern, Ren{\'e} van and Komusiewicz, Christian and Moser, Hannes and Niedermeier, Rolf},
TITLE = {Measuring indifference: Unit interval vertex deletion},
BOOKTITLE = {Proceedings of the 36th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2010 (Zar{\'o}s, Crete, Greece, June 28-30, 2010)},
SERIES = {LNCS},
VOLUME = {6410},
PAGES = {232-243},
YEAR = {2010},
EDITOR = {Thilikos, Dimitrios M.},
URL = {http://springerlink.metapress.com/content/071681k73268522h/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Marx-Schlotter/10a,
AUTHOR = {Marx, D{\'a}niel and Schlotter, Ildik{\'o}},
TITLE = {Parameterized complexity of the arc-preserving subsequence problem},
BOOKTITLE = {Proceedings of the 36th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2010 (Zar{\'o}s, Crete, Greece, June 28-30, 2010)},
SERIES = {LNCS},
VOLUME = {6410},
PAGES = {244-255},
YEAR = {2010},
EDITOR = {Thilikos, Dimitrios M.},
URL = {http://springerlink.metapress.com/content/n7848685250h3538/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Chaplick-Gutierrez-Leveque-Tondato/10,
AUTHOR = {Chaplick, Steven and Gutierrez, Marisa and L{\'e}v{\^e}que, Benjamin and Tondato, Silvia B.},
TITLE = {From path graphs to directed path graphs},
BOOKTITLE = {Proceedings of the 36th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2010 (Zar{\'o}s, Crete, Greece, June 28-30, 2010)},
SERIES = {LNCS},
VOLUME = {6410},
PAGES = {256-265},
YEAR = {2010},
EDITOR = {Thilikos, Dimitrios M.},
URL = {http://springerlink.metapress.com/content/xg1g4036681pw11p/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Bonichon-Gavoille-Hanusse-Ilcinkas/10,
AUTHOR = {Bonichon, Nicolas and Gavoille, Cyril and Hanusse, Nicolas and Ilcinkas, David},
TITLE = {Connections between theta-graphs, delaunay triangulations, and orthogonal surfaces},
BOOKTITLE = {Proceedings of the 36th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2010 (Zar{\'o}s, Crete, Greece, June 28-30, 2010)},
SERIES = {LNCS},
VOLUME = {6410},
PAGES = {266-278},
YEAR = {2010},
EDITOR = {Thilikos, Dimitrios M.},
URL = {http://springerlink.metapress.com/content/96m1007633tq1848/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Elsasser-Ogierman/10,
AUTHOR = {Els{\"a}sser, Robert and Ogierman, Adrian},
TITLE = {Efficient broadcasting in random power law networks},
BOOKTITLE = {Proceedings of the 36th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2010 (Zar{\'o}s, Crete, Greece, June 28-30, 2010)},
SERIES = {LNCS},
VOLUME = {6410},
PAGES = {279-291},
YEAR = {2010},
EDITOR = {Thilikos, Dimitrios M.},
URL = {http://springerlink.metapress.com/content/u8741t6j00w5r0q6/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Mukkamala-Pach-Saroz/10,
AUTHOR = {Mukkamala, Padmini and Pach, J{\'a}nos and Sar{\i}{\"o}z, Deniz},
TITLE = {Graphs with large obstacle numbers},
BOOKTITLE = {Proceedings of the 36th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2010 (Zar{\'o}s, Crete, Greece, June 28-30, 2010)},
SERIES = {LNCS},
VOLUME = {6410},
PAGES = {292-303},
YEAR = {2010},
EDITOR = {Thilikos, Dimitrios M.},
URL = {http://springerlink.metapress.com/content/l6rm432u88662158/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Szymanska/10,
AUTHOR = {Szyma{\'n}ska, Edyta},
TITLE = {The complexity of vertex coloring problems in uniform hypergraphs with high degree},
BOOKTITLE = {Proceedings of the 36th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2010 (Zar{\'o}s, Crete, Greece, June 28-30, 2010)},
SERIES = {LNCS},
VOLUME = {6410},
PAGES = {304-314},
YEAR = {2010},
EDITOR = {Thilikos, Dimitrios M.},
URL = {http://springerlink.metapress.com/content/510v1t03312918t4/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{McDiarmid-Muller/10,
AUTHOR = {McDiarmid, Colin and M{\"u}ller, Tobias},
TITLE = {The number of bits needed to represent a unit disk graph},
BOOKTITLE = {Proceedings of the 36th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2010 (Zar{\'o}s, Crete, Greece, June 28-30, 2010)},
SERIES = {LNCS},
VOLUME = {6410},
PAGES = {315-323},
YEAR = {2010},
EDITOR = {Thilikos, Dimitrios M.},
URL = {http://springerlink.metapress.com/content/k076j1w7m7q286n2/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Matuschke-Peis/10,
AUTHOR = {Matuschke, Jannik and Peis, Britta},
TITLE = {Lattices and maximum flow algorithms in planar graphs},
BOOKTITLE = {Proceedings of the 36th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2010 (Zar{\'o}s, Crete, Greece, June 28-30, 2010)},
SERIES = {LNCS},
VOLUME = {6410},
PAGES = {324-335},
YEAR = {2010},
EDITOR = {Thilikos, Dimitrios M.},
URL = {http://springerlink.metapress.com/content/r6l436056k1j0351/fulltext.pdf" title="Download PDF (221.2 KB)"><span>Download PDF (221.2 KB)</span></a></li> 	</ul></li><li class="primitive primitiveResource Backmatter"><p class="title">Back matter</p><ul class="resources fulltextResources" data-ftxUrl="/content/978-3-642-16925-0/#section=810898"> 		<li><a class="sprite pdf-resource-spritehttp://springerlink.metapress.com/content/978-3-642-16925-0/back-matter.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}