Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Booktitle=Proceedings of the 40th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2014 (Nouan-le-Fuzelier, France, June 25-27, 2014)

• Unifying duality theorems for width parameters in graphs and matroids
  Reinhard Diestel, Sang-il Oum
  Lecture Notes in Computer Science 8747, 2014, pp. 1-14
• Distributedly testing cycle-freeness
  Heger Arfaoui, Pierre Fraigniaud, David Ilcinkas, Fabien Mathieu
  Lecture Notes in Computer Science 8747, 2014, pp. 15-28
• DMVP: Foremost waypoint coverage of time-varying graphs
  Eric Aaron, Danny Krizanc, Elliot Meyerson
  Lecture Notes in Computer Science 8747, 2014, pp. 29-41
• Linear rank-width of distance-hereditary graphs
  Isolde Adler, Mamadou Moustapha Kanté, O-joung Kwon
  Lecture Notes in Computer Science 8747, 2014, pp. 42-55
• Vertex contact graphs of paths on a grid
  Nieke Aerts, Stefan Felsner
  Lecture Notes in Computer Science 8747, 2014, pp. 56-68
• Deciding the bell number for hereditary graph properties
  Aistis Atminas, Andrew Collins, Jan Foniok, Vadim V. Lozin
  Lecture Notes in Computer Science 8747, 2014, pp. 69-80
• Boxicity and separation dimension
  Manu Basavaraju, L. Sunil Chandran, Martin Charles Golumbic, Rogers Mathew, Deepak Rajendraprasad
  Lecture Notes in Computer Science 8747, 2014, pp. 81-92
• Maximal induced matchings in triangle-free graphs
  Manu Basavaraju, Pinar Heggernes, Pim van 't Hof, Reza Saei, Yngve Villanger
  Lecture Notes in Computer Science 8747, 2014, pp. 93-104
• Independent set reconfiguration in cographs
  Paul Bonsma
  Lecture Notes in Computer Science 8747, 2014, pp. 105-116
• Structural parameterizations for boxicity
  Henning Bruhn, Morgan Chopin, Felix Joos, Oliver Schaudt
  Lecture Notes in Computer Science 8747, 2014, pp. 117-128
• A new characterization of P_k-free graphs
  Eglantine Camby, Oliver Schaudt
  Lecture Notes in Computer Science 8747, 2014, pp. 129-138
• Contact representations of planar graphs: Extending a partial representation is hard
  Steven Chaplick, Paul Dorbec, Jan Kratochvíl, Mickael Montassier, Juraj Stacho
  Lecture Notes in Computer Science 8747, 2014, pp. 139-151
• The maximum labeled path problem
  Basile Couëtoux, Elie Nakache, Yann Vax`es
  Lecture Notes in Computer Science 8747, 2014, pp. 152-163
• Minimum spanning tree verification under uncertainty
  Thomas Erlebach, Michael Hoffmann
  Lecture Notes in Computer Science 8747, 2014, pp. 164-175
• Towards the Hanani-Tutte theorem for clustered graphs
  Radoslav Fulek
  Lecture Notes in Computer Science 8747, 2014, pp. 176-188
• On set expansion problems and the small set expansion conjecture
  Rajiv Gandhi, Guy Kortsarz
  Lecture Notes in Computer Science 8747, 2014, pp. 189-200
• Hadwiger number of graphs with small chordality
  Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Christophe Paul
  Lecture Notes in Computer Science 8747, 2014, pp. 201-213
• Recognizing threshold tolerance graphs in O(n^2) time
  Petr A. Golovach, Pinar Heggernes, Nathan Lindzey, Ross M. McConnell, Vinícius Fernandes dos Santos, Jeremy P. Spinrad
  Lecture Notes in Computer Science 8747, 2014, pp. 214-224
• Induced disjoint paths in circular-arc graphs in linear time
  Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen
  Lecture Notes in Computer Science 8747, 2014, pp. 225-237
• Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs
  Qian-Ping Gu, Gengchun Xu
  Lecture Notes in Computer Science 8747, 2014, pp. 238-249
• Parameterized directed k-Chinese Postman Problem and k Arc-Disjoint Cycles Problem on Euler digraphs
  Gregory Gutin, Mark Jones, Bin Sheng, Magnus Wahlström
  Lecture Notes in Computer Science 8747, 2014, pp. 250-262
• Colored modular and split decompositions of graphs with applications to trigraphs
  Michel Habib, Antoine Mamcarz
  Lecture Notes in Computer Science 8747, 2014, pp. 263-274
• Edge elimination in TSP instances
  Stefan Hougardy, Rasmus T. Schroeder
  Lecture Notes in Computer Science 8747, 2014, pp. 275-286
• The parameterized complexity of the rainbow subgraph problem
  Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier, Martin Rötzschke
  Lecture Notes in Computer Science 8747, 2014, pp. 287-298
• Kernelizations for the hybridization number problem on multiple nonbinary trees
  Leo van Iersel, Steven Kelk
  Lecture Notes in Computer Science 8747, 2014, pp. 299-311