×

Graph-theoretic concepts in computer science. 38th international workshop, WG 2012, Jerusalem, Israel, June 26–28, 2012. Revised selected papers. (English) Zbl 1250.68031

Lecture Notes in Computer Science 7551. Berlin: Springer (ISBN 978-3-642-34610-1/pbk). xiii, 346 p. (2012).

Show indexed articles as search result.

The articles of this volume will be reviewed individually. For the preceding workshop see Zbl 1228.68007.
Indexed articles:
Berry, Anne; Wagler, Annegret, Triangulation and clique separator decomposition of claw-free graphs, 7-21 [Zbl 1341.05199]
Bonomo, Flavia; Oriolo, Gianpaolo; Snels, Claudia, Minimum weighted clique cover on strip-composed perfect graphs, 22-33 [Zbl 1341.05092]
Kratsch, Stefan; Schweitzer, Pascal, Graph isomorphism for graph classes characterized by two forbidden induced subgraphs, 34-45 [Zbl 1341.05168]
Hermelin, Danny; Mestre, Julián; Rawitz, Dror, Optimization problems in dotted interval graphs, 46-56 [Zbl 1341.05190]
Francis, Mathew C.; Gonçalves, Daniel; Ochem, Pascal, The maximum clique problem in multiple interval graphs (extended abstract), 57-68 [Zbl 1341.05187]
Biró, Péter; Bomhoff, Matthijs; Golovach, Petr A.; Kern, Walter; Paulusma, Daniël, Solutions for the stable roommates problem with payments, 69-80 [Zbl 1341.05106]
Berend, Daniel; Sapir, Amir, Which multi-peg Tower of Hanoi problems are exponential?, 81-90 [Zbl 1321.68297]
Di Giacomo, Emilio; Didimo, Walter; Liotta, Giuseppe; Montecchiani, Fabrizio, \(h\)-quasi planar drawings of bounded treewidth graphs in linear area, 91-102 [Zbl 1341.05173]
Auer, Christopher; Bachmaier, Christian; Brandenburg, Franz J.; Gleißner, Andreas; Hanauer, Kathrin, The duals of upward planar graphs on cylinders, 103-113 [Zbl 1312.68155]
Epstein, Leah; Levin, Asaf; Woeginger, Gerhard J., The (weighted) metric dimension of graphs: hard and easy cases, 114-125 [Zbl 1341.05049]
Junosza-Szaniawski, Konstanty; Kratochvíl, Jan; Liedloff, Mathieu; Rzążewski, Paweł, Determining the \(L(2,1)\)-span in polynomial space, 126-137 [Zbl 1341.05223]
Javelle, Jérôme; Mhalla, Mehdi; Perdrix, Simon, On the minimum degree up to local complementation: bounds and complexity, 138-147 [Zbl 1341.05031]
Müller, Haiko, On the stable degree of graphs, 148-159 [Zbl 1341.05032]
Kowalik, Łukasz; Mucha, Marcin, A \(9k\) kernel for nonseparating independent set in planar graphs, 160-171 [Zbl 1341.05193]
Misra, Pranabendu; Raman, Venkatesh; Ramanujan, M. S.; Saurabh, Saket, Parameterized algorithms for even cycle transversal, 172-183 [Zbl 1341.05248]
Mnich, Matthias; Zenklusen, Rico, Bisections above tight lower bounds, 184-193 [Zbl 1341.05214]
Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michał, On group feedback vertex set parameterized by the size of the cutset, 194-205 [Zbl 1331.68100]
Braunschvig, Gilad; Chechik, Shiri; Peleg, David, Fault tolerant additive spanners, 206-214 [Zbl 1341.05166]
Hibi, Tomoya; Fujito, Toshihiro, Multi-rooted greedy approximation of directed Steiner trees with applications, 215-224 [Zbl 1330.68347]
Leithäuser, Neele; Krumke, Sven O.; Merkert, Maximilian, Approximating infeasible 2VPI-systems, 225-236 [Zbl 1341.05042]
Sloan, Robert H.; Stasi, Despina; Turán, György, Hydras: directed hypergraphs and Horn formulas, 237-248 [Zbl 1341.05181]
Brunetti, Sara; Cordasco, Gennaro; Gargano, Luisa; Lodi, Elena; Quattrociocchi, Walter, Minimum weight dynamo and fast opinion spreading. (Extended abstract), 249-261 [Zbl 1341.05107]
Centeno, Carmen Cecilia; Penso, Lucia Draque; Rautenbach, Dieter; Pereira de Sá, Vinícius Gusmão, Immediate versus eventual conversion: comparing geodetic and hull numbers in \(P _{3}\)-convexity, 262-273 [Zbl 1332.05105]
Chaplick, Steven; Jelínek, Vít; Kratochvíl, Jan; Vyskočil, Tomáš, Bend-bounded path intersection graphs: sausages, noodles, and waffles on a grill, 274-285 [Zbl 1341.05203]
Levit, Vadim E.; Milanič, Martin; Tankus, David, On the recognition of \(k\)-equistable graphs, 286-296 [Zbl 1341.05110]
Gavril, Fanica, Maximum induced multicliques and complete multipartite subgraphs in polygon-circle graphs and circle graphs, 297-307 [Zbl 1341.05188]
Bousquet, Nicolas; Gonçalves, Daniel; Mertzios, George B.; Paul, Christophe; Sau, Ignasi; Thomassé, Stéphan, Parameterized domination in circle graphs, 308-319 [Zbl 1341.05184]
Golovach, Petr A.; Heggernes, Pinar; van’t Hof, Pim; Manne, Fredrik; Paulusma, Daniël; Pilipczuk, Michał, How to eliminate a graph, 320-331 [Zbl 1311.68119]
Heggernes, Pinar; van’t Hof, Pim; Marx, Dániel; Misra, Neeldhara; Villanger, Yngve, On the parameterized complexity of finding separators with non-hereditary properties, 332-343 [Zbl 1341.68060]

MSC:

68-06 Proceedings, conferences, collections, etc. pertaining to computer science
68R10 Graph theory (including graph drawing) in computer science
00B25 Proceedings of conferences of miscellaneous specific interest

Citations:

Zbl 1228.68007
PDFBibTeX XMLCite
Full Text: DOI