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 YEAR=2013

• 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
• 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
• Beyond knights and knaves
  Christine T. Cheng, Andrew McConvey, Drew Onderko, Nathaniel Shar, Charles Tomlinson
  Lecture Notes in Computer Science 8165, 2013, pp. 394-405
• On the dimension of solution spaces of full rank linear differential systems
  S.A. Abramov, M.A. Barkatou
  Lecture Notes in Computer Science 8136, 2013, pp. 1-9
• Polyhedral methods for space curves exploiting symmetry applied to the cyclic n-roots problem
  Danko Adrovic, Jan Verschelde
  Lecture Notes in Computer Science 8136, 2013, pp. 10-29
• Computing the limit points of the quasi-component of a regular chain in dimension one
  Parisa Alvandi, Changbo Chen, Marc Moreno Maza
  Lecture Notes in Computer Science 8136, 2013, pp. 30-45
• On consistency of finite difference approximations to the Navier-Stokes equations
  Pierluigi Amodio, Yuri Blinkov, Vladimir Gerdt, Roberto La Scala
  Lecture Notes in Computer Science 8136, 2013, pp. 46-60
• Faster sparse interpolation of straight-line programs
  Andrew Arnold, Mark Giesbrecht, Daniel S. Roche
  Lecture Notes in Computer Science 8136, 2013, pp. 61-74
• On possibility of additional solutions of the degenerate system near double degeneration at the special value of the parameter
  Alexander D. Bruno, Victor F. Edneral
  Lecture Notes in Computer Science 8136, 2013, pp. 75-87
• The online replacement path problem
  David Adjiashvili, Gianpaolo Oriolo, Marco Senatore
  Lecture Notes in Computer Science 8125, 2013, pp. 1-12
• Flip distance between triangulations of a simple polygon is NP-complete
  Oswin Aichholzer, Wolfgang Mulzer, Alexander Pilz
  Lecture Notes in Computer Science 8125, 2013, pp. 13-24
• Empirical evaluation of the parallel distribution sweeping framework on multicore architectures
  Deepak Ajwani, Nodari Sitchinava
  Lecture Notes in Computer Science 8125, 2013, pp. 25-36
• Computing the greedy spanner in linear space
  Sander P.A. Alewijnse, Quirijn W. Bouts, Alex P. ten Brink, Kevin Buchin
  Lecture Notes in Computer Science 8125, 2013, pp. 37-48