@incollection{Dragan/13,
AUTHOR = {Dragan, Feodor F.},
TITLE = {Tree-like structures in graphs: A metric point of view},
BOOKTITLE = {Proceedings of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2013 (L{\"u}beck, Germany, June 19-21, 2013)},
SERIES = {LNCS},
VOLUME = {8165},
PAGES = {1-4},
YEAR = {2013},
EDITOR = {Brandst{\"a}dt, Andreas and Jansen, Klaus and Reischuk, R{\"u}diger},
URL = {http://dx.doi.org/10.1007/978-3-642-45043-3_1},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Svensson/13,
AUTHOR = {Svensson, Ola},
TITLE = {Overview of new approaches for approximating TSP},
BOOKTITLE = {Proceedings of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2013 (L{\"u}beck, Germany, June 19-21, 2013)},
SERIES = {LNCS},
VOLUME = {8165},
PAGES = {5-11},
YEAR = {2013},
EDITOR = {Brandst{\"a}dt, Andreas and Jansen, Klaus and Reischuk, R{\"u}diger},
URL = {http://dx.doi.org/10.1007/978-3-642-45043-3_2},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Adler-Kante/13,
AUTHOR = {Adler, Isolde and Kant{\'e}, Mamadou Moustapha},
TITLE = {Linear rank-width and linear clique-width of trees},
BOOKTITLE = {Proceedings of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2013 (L{\"u}beck, Germany, June 19-21, 2013)},
SERIES = {LNCS},
VOLUME = {8165},
PAGES = {12-25},
YEAR = {2013},
EDITOR = {Brandst{\"a}dt, Andreas and Jansen, Klaus and Reischuk, R{\"u}diger},
URL = {http://dx.doi.org/10.1007/978-3-642-45043-3_3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Alam-Chaplick-Fijavz-Kaufmann-Kobourov-Pupyrev/13,
AUTHOR = {Alam, Md. Jawaherul and Chaplick, Steven and Fijav{\v{z}}, Ga{\v{s}}per and Kaufmann, Michael and Kobourov, Stephen G. and Pupyrev, Sergey},
TITLE = {Threshold-coloring and unit-cube contact representation of graphs},
BOOKTITLE = {Proceedings of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2013 (L{\"u}beck, Germany, June 19-21, 2013)},
SERIES = {LNCS},
VOLUME = {8165},
PAGES = {26-37},
YEAR = {2013},
EDITOR = {Brandst{\"a}dt, Andreas and Jansen, Klaus and Reischuk, R{\"u}diger},
URL = {http://dx.doi.org/10.1007/978-3-642-45043-3_4},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Auer-Bachmaier-Brandenburg-Hanauer/13,
AUTHOR = {Auer, Christopher and Bachmaier, Christian and Brandenburg, Franz J. and Hanauer, Kathrin},
TITLE = {Rolling upward planarity testing of strongly connected graphs},
BOOKTITLE = {Proceedings of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2013 (L{\"u}beck, Germany, June 19-21, 2013)},
SERIES = {LNCS},
VOLUME = {8165},
PAGES = {38-49},
YEAR = {2013},
EDITOR = {Brandst{\"a}dt, Andreas and Jansen, Klaus and Reischuk, R{\"u}diger},
URL = {http://dx.doi.org/10.1007/978-3-642-45043-3_5},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Bento-Boccardo-Machado-Pereira_de_Sa-Szwarcfiter/13,
AUTHOR = {Bento, Lucila Maria Souza and Boccardo, Davidson and Machado, Raphael Carlos Santos and Pereira de S{\'a}, Vin{\'{i}}cius Gusm{\~a}o and Szwarcfiter, Luiz},
TITLE = {Towards a provably resilient scheme for graph-based watermarking},
BOOKTITLE = {Proceedings of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2013 (L{\"u}beck, Germany, June 19-21, 2013)},
SERIES = {LNCS},
VOLUME = {8165},
PAGES = {50-63},
YEAR = {2013},
EDITOR = {Brandst{\"a}dt, Andreas and Jansen, Klaus and Reischuk, R{\"u}diger},
URL = {http://dx.doi.org/10.1007/978-3-642-45043-3_6},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Berry-Wagler/13,
AUTHOR = {Berry, Anne and Wagler, Annegret},
TITLE = {The normal graph conjecture for classes of sparse graphs},
BOOKTITLE = {Proceedings of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2013 (L{\"u}beck, Germany, June 19-21, 2013)},
SERIES = {LNCS},
VOLUME = {8165},
PAGES = {64-75},
YEAR = {2013},
EDITOR = {Brandst{\"a}dt, Andreas and Jansen, Klaus and Reischuk, R{\"u}diger},
URL = {http://dx.doi.org/10.1007/978-3-642-45043-3_7},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{van_Bevern-Feldmann-Sorge-Suchy/13,
AUTHOR = {van Bevern, Ren{\'e} and Feldmann, Andreas Emil and Sorge, Manuel and Such{\'y}, Ond{\v{r}}ej},
TITLE = {On the parameterized complexity of computing graph bisections},
BOOKTITLE = {Proceedings of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2013 (L{\"u}beck, Germany, June 19-21, 2013)},
SERIES = {LNCS},
VOLUME = {8165},
PAGES = {76-87},
YEAR = {2013},
EDITOR = {Brandst{\"a}dt, Andreas and Jansen, Klaus and Reischuk, R{\"u}diger},
URL = {http://dx.doi.org/10.1007/978-3-642-45043-3_8},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Bodlaender-Kratsch-Kreuzen/13,
AUTHOR = {Bodlaender, Hans L. and Kratsch, Stefan and Kreuzen, Vincent J.C.},
TITLE = {Fixed-parameter tractability and characterizations of small special treewidth},
BOOKTITLE = {Proceedings of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2013 (L{\"u}beck, Germany, June 19-21, 2013)},
SERIES = {LNCS},
VOLUME = {8165},
PAGES = {88-99},
YEAR = {2013},
EDITOR = {Brandst{\"a}dt, Andreas and Jansen, Klaus and Reischuk, R{\"u}diger},
URL = {http://dx.doi.org/10.1007/978-3-642-45043-3_9},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Bose-Morin-van_Renssen-Verdonschot/13,
AUTHOR = {Bose, Prosenjit and Morin, Pat and van Renssen, Andr{\'e} and Verdonschot, Sander},
TITLE = {The $\theta_5$-graph is a spanner},
BOOKTITLE = {Proceedings of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2013 (L{\"u}beck, Germany, June 19-21, 2013)},
SERIES = {LNCS},
VOLUME = {8165},
PAGES = {100-114},
YEAR = {2013},
EDITOR = {Brandst{\"a}dt, Andreas and Jansen, Klaus and Reischuk, R{\"u}diger},
URL = {http://dx.doi.org/10.1007/978-3-642-45043-3_10},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Boyac-Ekim-Shalom-Zaks/13,
AUTHOR = {Boyac{\i}, Arman and Ekim, T{\i}naz and Shalom, Mordechai and Zaks, Shmuel},
TITLE = {Graphs of edge-intersecting non-splitting paths in a tree: Towards hole representations},
BOOKTITLE = {Proceedings of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2013 (L{\"u}beck, Germany, June 19-21, 2013)},
SERIES = {LNCS},
VOLUME = {8165},
PAGES = {115-126},
YEAR = {2013},
EDITOR = {Brandst{\"a}dt, Andreas and Jansen, Klaus and Reischuk, R{\"u}diger},
URL = {http://dx.doi.org/10.1007/978-3-642-45043-3_11},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
PCOMMENT = {extended abstract},
}
@incollection{Broersma-Fiala-Golovach-Kaiser-Paulusma-Proskurowski/13,
AUTHOR = {Broersma, Hajo and Fiala, Ji{\v{r}}{\'{i}} and Golovach, Petr A. and Kaiser, Tom{\'a}{\v{s}} and Paulusma, Dani{\"e}l and Proskurowski, Andrej},
TITLE = {Linear-time algorithms for scattering number and Hamilton-connectivity of interval graphs},
BOOKTITLE = {Proceedings of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2013 (L{\"u}beck, Germany, June 19-21, 2013)},
SERIES = {LNCS},
VOLUME = {8165},
PAGES = {127-138},
YEAR = {2013},
EDITOR = {Brandst{\"a}dt, Andreas and Jansen, Klaus and Reischuk, R{\"u}diger},
URL = {http://dx.doi.org/10.1007/978-3-642-45043-3_12},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Chaplick-Kobourov-Ueckerdt/13,
AUTHOR = {Chaplick, Steven and Kobourov, Stephen G. and Ueckerdt, Torsten},
TITLE = {Equilateral L-contact graphs},
BOOKTITLE = {Proceedings of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2013 (L{\"u}beck, Germany, June 19-21, 2013)},
SERIES = {LNCS},
VOLUME = {8165},
PAGES = {139-151},
YEAR = {2013},
EDITOR = {Brandst{\"a}dt, Andreas and Jansen, Klaus and Reischuk, R{\"u}diger},
URL = {http://dx.doi.org/10.1007/978-3-642-45043-3_13},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Chen-Fan-Sze/13,
AUTHOR = {Chen, Jianer and Fan, Jia-Hao and Sze, Sing-Hoi},
TITLE = {Parameterized and approximation algorithms for the MAF problem in multifurcating trees},
BOOKTITLE = {Proceedings of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2013 (L{\"u}beck, Germany, June 19-21, 2013)},
SERIES = {LNCS},
VOLUME = {8165},
PAGES = {152-164},
YEAR = {2013},
EDITOR = {Brandst{\"a}dt, Andreas and Jansen, Klaus and Reischuk, R{\"u}diger},
URL = {http://dx.doi.org/10.1007/978-3-642-45043-3_14},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Chiarelli-Milanic/13,
AUTHOR = {Chiarelli, Nina and Milani{\v{c}}, Martin},
TITLE = {Linear separation of total dominating sets in graphs},
BOOKTITLE = {Proceedings of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2013 (L{\"u}beck, Germany, June 19-21, 2013)},
SERIES = {LNCS},
VOLUME = {8165},
PAGES = {165-176},
YEAR = {2013},
EDITOR = {Brandst{\"a}dt, Andreas and Jansen, Klaus and Reischuk, R{\"u}diger},
URL = {http://dx.doi.org/10.1007/978-3-642-45043-3_15},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Cochefert-Couturier-Golovach-Kratsch-Paulusma/13,
AUTHOR = {Cochefert, Manfred and Couturier, Jean-Fran{\c{c}}ois and Golovach, Petr A. and Kratsch, Dieter and Paulusma, Danie{\"e}l},
TITLE = {Sparse square roots},
BOOKTITLE = {Proceedings of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2013 (L{\"u}beck, Germany, June 19-21, 2013)},
SERIES = {LNCS},
VOLUME = {8165},
PAGES = {177-188},
YEAR = {2013},
EDITOR = {Brandst{\"a}dt, Andreas and Jansen, Klaus and Reischuk, R{\"u}diger},
URL = {http://dx.doi.org/10.1007/978-3-642-45043-3_16},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Cook-Eschen-Sritharan-Wang/13,
AUTHOR = {Cook, Kathryn and Eschen, Elaine M. and Sritharan, R. and Wang, Xiaoqiang},
TITLE = {Completing colored graphs to meet a target property},
BOOKTITLE = {Proceedings of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2013 (L{\"u}beck, Germany, June 19-21, 2013)},
SERIES = {LNCS},
VOLUME = {8165},
PAGES = {189-200},
YEAR = {2013},
EDITOR = {Brandst{\"a}dt, Andreas and Jansen, Klaus and Reischuk, R{\"u}diger},
URL = {http://dx.doi.org/10.1007/978-3-642-45043-3_17},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Dabrowski-Golovach-Paulusma/13,
AUTHOR = {Dabrowski, Konrad K. and Golovach, Petr A. and Paulusma, Dani{\"e}l},
TITLE = {Colouring of graphs with ramsey-type forbidden subgraphs},
BOOKTITLE = {Proceedings of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2013 (L{\"u}beck, Germany, June 19-21, 2013)},
SERIES = {LNCS},
VOLUME = {8165},
PAGES = {201-212},
YEAR = {2013},
EDITOR = {Brandst{\"a}dt, Andreas and Jansen, Klaus and Reischuk, R{\"u}diger},
URL = {http://dx.doi.org/10.1007/978-3-642-45043-3_18},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Di_Giacomo-Liotta-Mchedlidze/13,
AUTHOR = {Di Giacomo, Emilio and Liotta, Giuseppe and Mchedlidze, Tamara},
TITLE = {Lower and upper bounds for long induced paths in 3-connected planar graphs},
BOOKTITLE = {Proceedings of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2013 (L{\"u}beck, Germany, June 19-21, 2013)},
SERIES = {LNCS},
VOLUME = {8165},
PAGES = {213-224},
YEAR = {2013},
EDITOR = {Brandst{\"a}dt, Andreas and Jansen, Klaus and Reischuk, R{\"u}diger},
URL = {http://dx.doi.org/10.1007/978-3-642-45043-3_19},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Doerr-Ramakrishna-Schmidt/13,
AUTHOR = {Doerr, Carola and Ramakrishna, G. and Schmidt, Jens M.},
TITLE = {Computing minimum cycle bases in weighted partial 2-trees in linear time},
BOOKTITLE = {Proceedings of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2013 (L{\"u}beck, Germany, June 19-21, 2013)},
SERIES = {LNCS},
VOLUME = {8165},
PAGES = {225-236},
YEAR = {2013},
EDITOR = {Brandst{\"a}dt, Andreas and Jansen, Klaus and Reischuk, R{\"u}diger},
URL = {http://dx.doi.org/10.1007/978-3-642-45043-3_20},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Durocher-Gethner-Mondal/13,
AUTHOR = {Durocher, Stephane and Gethner, Ellen and Mondal, Debajyoti},
TITLE = {Thickness and colorability of geometric graphs},
BOOKTITLE = {Proceedings of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2013 (L{\"u}beck, Germany, June 19-21, 2013)},
SERIES = {LNCS},
VOLUME = {8165},
PAGES = {237-248},
YEAR = {2013},
EDITOR = {Brandst{\"a}dt, Andreas and Jansen, Klaus and Reischuk, R{\"u}diger},
URL = {http://dx.doi.org/10.1007/978-3-642-45043-3_21},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Faria-de_Figueiredo-Richter-Vrto/13,
AUTHOR = {Faria, Luerbio and de Figueiredo, Celina M.H. and Richter, R. Bruce and Vrt'o, Imrich},
TITLE = {The same upper bound for both: The 2-page and the rectilinear crossing numbers of the $n$-cube},
BOOKTITLE = {Proceedings of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2013 (L{\"u}beck, Germany, June 19-21, 2013)},
SERIES = {LNCS},
VOLUME = {8165},
PAGES = {249-260},
YEAR = {2013},
EDITOR = {Brandst{\"a}dt, Andreas and Jansen, Klaus and Reischuk, R{\"u}diger},
URL = {http://dx.doi.org/10.1007/978-3-642-45043-3_22},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Fellows-Jansen/13,
AUTHOR = {Fellows, Michael R. and Jansen, Bart M.P.},
TITLE = {FPT is characterized by useful obstruction sets},
BOOKTITLE = {Proceedings of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2013 (L{\"u}beck, Germany, June 19-21, 2013)},
SERIES = {LNCS},
VOLUME = {8165},
PAGES = {261-273},
YEAR = {2013},
EDITOR = {Brandst{\"a}dt, Andreas and Jansen, Klaus and Reischuk, R{\"u}diger},
URL = {http://dx.doi.org/10.1007/978-3-642-45043-3_23},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Giannopoulou-Kaminski-Thilikos/13,
AUTHOR = {Giannopoulou, Archontia C. and Kami{\'n}ski, Marcin and Thilikos, Dimitrios M.},
TITLE = {Excluding graphs as immersions in surface embedded graphs},
BOOKTITLE = {Proceedings of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2013 (L{\"u}beck, Germany, June 19-21, 2013)},
SERIES = {LNCS},
VOLUME = {8165},
PAGES = {274-285},
YEAR = {2013},
EDITOR = {Brandst{\"a}dt, Andreas and Jansen, Klaus and Reischuk, R{\"u}diger},
URL = {http://dx.doi.org/10.1007/978-3-642-45043-3_24},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Gille/13,
AUTHOR = {Gill{\'e}, Marc},
TITLE = {OBDD-based representation of interval graphs},
BOOKTITLE = {Proceedings of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2013 (L{\"u}beck, Germany, June 19-21, 2013)},
SERIES = {LNCS},
VOLUME = {8165},
PAGES = {286-297},
YEAR = {2013},
EDITOR = {Brandst{\"a}dt, Andreas and Jansen, Klaus and Reischuk, R{\"u}diger},
URL = {http://dx.doi.org/10.1007/978-3-642-45043-3_25},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Hanauer-Brandenburg-Auer/13,
AUTHOR = {Hanauer, Kathrin and Brandenburg, Franz J. and Auer, Christopher},
TITLE = {Tight upper bounds for minimum feedback arc sets of regular graphs},
BOOKTITLE = {Proceedings of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2013 (L{\"u}beck, Germany, June 19-21, 2013)},
SERIES = {LNCS},
VOLUME = {8165},
PAGES = {298-309},
YEAR = {2013},
EDITOR = {Brandst{\"a}dt, Andreas and Jansen, Klaus and Reischuk, R{\"u}diger},
URL = {http://dx.doi.org/10.1007/978-3-642-45043-3_26},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Kammer/13,
AUTHOR = {Kammer, Frank},
TITLE = {A linear-time kernelization for the rooted $k$-leaf outbranching problem},
BOOKTITLE = {Proceedings of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2013 (L{\"u}beck, Germany, June 19-21, 2013)},
SERIES = {LNCS},
VOLUME = {8165},
PAGES = {310-320},
YEAR = {2013},
EDITOR = {Brandst{\"a}dt, Andreas and Jansen, Klaus and Reischuk, R{\"u}diger},
URL = {http://dx.doi.org/10.1007/978-3-642-45043-3_27},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Kloks-Wang/13,
AUTHOR = {Kloks, Ton and Wang, Yue-Li},
TITLE = {On retracts, absolute retracts, and folds in cographs},
BOOKTITLE = {Proceedings of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2013 (L{\"u}beck, Germany, June 19-21, 2013)},
SERIES = {LNCS},
VOLUME = {8165},
PAGES = {321-332},
YEAR = {2013},
EDITOR = {Brandst{\"a}dt, Andreas and Jansen, Klaus and Reischuk, R{\"u}diger},
URL = {http://dx.doi.org/10.1007/978-3-642-45043-3_28},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Krawczyk-Pawlik-Walczak/13,
AUTHOR = {Krawczyk, Tomasz and Pawlik, Arkadiusz and Walczak, Bartosz},
TITLE = {Coloring triangle-free rectangular frame intersection graphs with $O(\log\log  n)$ colors},
BOOKTITLE = {Proceedings of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2013 (L{\"u}beck, Germany, June 19-21, 2013)},
SERIES = {LNCS},
VOLUME = {8165},
PAGES = {333-344},
YEAR = {2013},
EDITOR = {Brandst{\"a}dt, Andreas and Jansen, Klaus and Reischuk, R{\"u}diger},
URL = {http://dx.doi.org/10.1007/978-3-642-45043-3_29},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Lindzey-McConnell/13,
AUTHOR = {Lindzey, Nathan and McConnell, Ross M.},
TITLE = {On finding Tucker submatrices and Lekkerkerker-Boland subgraphs},
BOOKTITLE = {Proceedings of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2013 (L{\"u}beck, Germany, June 19-21, 2013)},
SERIES = {LNCS},
VOLUME = {8165},
PAGES = {345-357},
YEAR = {2013},
EDITOR = {Brandst{\"a}dt, Andreas and Jansen, Klaus and Reischuk, R{\"u}diger},
URL = {http://dx.doi.org/10.1007/978-3-642-45043-3_30},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Mehlhorn-Neumann-Schmidt/13,
AUTHOR = {Mehlhorn, Kurt and Neumann, Adrian and Schmidt, Jens M.},
TITLE = {Certifying 3-edge-connectivity},
BOOKTITLE = {Proceedings of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2013 (L{\"u}beck, Germany, June 19-21, 2013)},
SERIES = {LNCS},
VOLUME = {8165},
PAGES = {358-369},
YEAR = {2013},
EDITOR = {Brandst{\"a}dt, Andreas and Jansen, Klaus and Reischuk, R{\"u}diger},
URL = {http://dx.doi.org/10.1007/978-3-642-45043-3_31},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Misra-Panolan-Rai-Raman-Saurabh/13,
AUTHOR = {Misra, Neeldhara and Panolan, Fahad and Rai, Ashutosh and Raman, Venkatesh and Saurabh, Saket},
TITLE = {Parameterized algorithms for {\sc Max Colorable Induced Subgraph} problem on perfect graphs},
BOOKTITLE = {Proceedings of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2013 (L{\"u}beck, Germany, June 19-21, 2013)},
SERIES = {LNCS},
VOLUME = {8165},
PAGES = {370-381},
YEAR = {2013},
EDITOR = {Brandst{\"a}dt, Andreas and Jansen, Klaus and Reischuk, R{\"u}diger},
URL = {http://dx.doi.org/10.1007/978-3-642-45043-3_32},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Nevries-Rosenke/13,
AUTHOR = {Nevries, Ragnar and Rosenke, Christian},
TITLE = {Characterizing and computing the structure of clique intersections in strongly chordal graphs},
BOOKTITLE = {Proceedings of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2013 (L{\"u}beck, Germany, June 19-21, 2013)},
SERIES = {LNCS},
VOLUME = {8165},
PAGES = {382-393},
YEAR = {2013},
EDITOR = {Brandst{\"a}dt, Andreas and Jansen, Klaus and Reischuk, R{\"u}diger},
URL = {http://dx.doi.org/10.1007/978-3-642-45043-3_33},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Cheng-McConvey-Onderko-Shar-Tomlinson/13,
AUTHOR = {Cheng, Christine T. and McConvey, Andrew and Onderko, Drew and Shar, Nathaniel and Tomlinson, Charles},
TITLE = {Beyond knights and knaves},
BOOKTITLE = {Proceedings of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2013 (L{\"u}beck, Germany, June 19-21, 2013)},
SERIES = {LNCS},
VOLUME = {8165},
PAGES = {394-405},
YEAR = {2013},
EDITOR = {Brandst{\"a}dt, Andreas and Jansen, Klaus and Reischuk, R{\"u}diger},
URL = {http://dx.doi.org/10.1007/978-3-642-45043-3_34},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Schulz/13a,
AUTHOR = {Schulz, Andr{\'e}},
TITLE = {Drawing graphs with few arcs},
BOOKTITLE = {Proceedings of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2013 (L{\"u}beck, Germany, June 19-21, 2013)},
SERIES = {LNCS},
VOLUME = {8165},
PAGES = {406-417},
YEAR = {2013},
EDITOR = {Brandst{\"a}dt, Andreas and Jansen, Klaus and Reischuk, R{\"u}diger},
URL = {http://dx.doi.org/10.1007/978-3-642-45043-3_35},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Telle-Villanger/13,
AUTHOR = {Telle, Jan Arne and Villanger, Yngve},
TITLE = {Connecting terminals and 2-disjoint connected subgraphs},
BOOKTITLE = {Proceedings of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2013 (L{\"u}beck, Germany, June 19-21, 2013)},
SERIES = {LNCS},
VOLUME = {8165},
PAGES = {418-428},
YEAR = {2013},
EDITOR = {Brandst{\"a}dt, Andreas and Jansen, Klaus and Reischuk, R{\"u}diger},
URL = {http://dx.doi.org/10.1007/978-3-642-45043-3_36},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}