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: Series=LNCS AND Volume=8165

• Tree-like structures in graphs: A metric point of view
  Feodor F. Dragan
  Lecture Notes in Computer Science 8165, 2013, pp. 1-4
• Overview of new approaches for approximating TSP
  Ola Svensson
  Lecture Notes in Computer Science 8165, 2013, pp. 5-11
• Linear rank-width and linear clique-width of trees
  Isolde Adler, Mamadou Moustapha Kanté
  Lecture Notes in Computer Science 8165, 2013, pp. 12-25
• Threshold-coloring and unit-cube contact representation of graphs
  Md. Jawaherul Alam, Steven Chaplick, Gas̑per Fijavz̑, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev
  Lecture Notes in Computer Science 8165, 2013, pp. 26-37
• Rolling upward planarity testing of strongly connected graphs
  Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Kathrin Hanauer
  Lecture Notes in Computer Science 8165, 2013, pp. 38-49
• Towards a provably resilient scheme for graph-based watermarking
  Lucila Maria Souza Bento, Davidson Boccardo, Raphael Carlos Santos Machado, Vinícius Gusmão Pereira de Sá, Luiz Szwarcfiter
  Lecture Notes in Computer Science 8165, 2013, pp. 50-63
• The normal graph conjecture for classes of sparse graphs
  Anne Berry, Annegret Wagler
  Lecture Notes in Computer Science 8165, 2013, pp. 64-75
• On the parameterized complexity of computing graph bisections
  René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondȓej Suchý
  Lecture Notes in Computer Science 8165, 2013, pp. 76-87
• Fixed-parameter tractability and characterizations of small special treewidth
  Hans L. Bodlaender, Stefan Kratsch, Vincent J.C. Kreuzen
  Lecture Notes in Computer Science 8165, 2013, pp. 88-99
• The \theta_5-graph is a spanner
  Prosenjit Bose, Pat Morin, André van Renssen, Sander Verdonschot
  Lecture Notes in Computer Science 8165, 2013, pp. 100-114
• Graphs of edge-intersecting non-splitting paths in a tree: Towards hole representations
  Arman Boyacı, Tınaz Ekim, Mordechai Shalom, Shmuel Zaks
  Lecture Notes in Computer Science 8165, 2013, pp. 115-126
• Linear-time algorithms for scattering number and Hamilton-connectivity of interval graphs
  Hajo Broersma, Jiȓí Fiala, Petr A. Golovach, Tomás̑ Kaiser, Daniël Paulusma, Andrej Proskurowski
  Lecture Notes in Computer Science 8165, 2013, pp. 127-138
• Equilateral L-contact graphs
  Steven Chaplick, Stephen G. Kobourov, Torsten Ueckerdt
  Lecture Notes in Computer Science 8165, 2013, pp. 139-151
• Parameterized and approximation algorithms for the MAF problem in multifurcating trees
  Jianer Chen, Jia-Hao Fan, Sing-Hoi Sze
  Lecture Notes in Computer Science 8165, 2013, pp. 152-164
• Linear separation of total dominating sets in graphs
  Nina Chiarelli, Martin Milanic̑
  Lecture Notes in Computer Science 8165, 2013, pp. 165-176
• Sparse square roots
  Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Danieël Paulusma
  Lecture Notes in Computer Science 8165, 2013, pp. 177-188
• Completing colored graphs to meet a target property
  Kathryn Cook, Elaine M. Eschen, R. Sritharan, Xiaoqiang Wang
  Lecture Notes in Computer Science 8165, 2013, pp. 189-200
• Colouring of graphs with ramsey-type forbidden subgraphs
  Konrad K. Dabrowski, Petr A. Golovach, Daniël Paulusma
  Lecture Notes in Computer Science 8165, 2013, pp. 201-212
• Lower and upper bounds for long induced paths in 3-connected planar graphs
  Emilio Di Giacomo, Giuseppe Liotta, Tamara Mchedlidze
  Lecture Notes in Computer Science 8165, 2013, pp. 213-224
• Computing minimum cycle bases in weighted partial 2-trees in linear time
  Carola Doerr, G. Ramakrishna, Jens M. Schmidt
  Lecture Notes in Computer Science 8165, 2013, pp. 225-236
• Thickness and colorability of geometric graphs
  Stephane Durocher, Ellen Gethner, Debajyoti Mondal
  Lecture Notes in Computer Science 8165, 2013, pp. 237-248
• The same upper bound for both: The 2-page and the rectilinear crossing numbers of the n-cube
  Luerbio Faria, Celina M.H. de Figueiredo, R. Bruce Richter, Imrich Vrt'o
  Lecture Notes in Computer Science 8165, 2013, pp. 249-260
• FPT is characterized by useful obstruction sets
  Michael R. Fellows, Bart M.P. Jansen
  Lecture Notes in Computer Science 8165, 2013, pp. 261-273
• Excluding graphs as immersions in surface embedded graphs
  Archontia C. Giannopoulou, Marcin Kamiński, Dimitrios M. Thilikos
  Lecture Notes in Computer Science 8165, 2013, pp. 274-285
• OBDD-based representation of interval graphs
  Marc Gillé
  Lecture Notes in Computer Science 8165, 2013, pp. 286-297