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 [3]	Hilfe

Suche: Series=LNCS AND YEAR=2011

• An improved algorithm for reconstructing a simple polygon from the visibility angles
  Danny Z. Chen, Haitao Wang
  Lecture Notes in Computer Science 7074, 2011, pp. 604-613
• On the parameterized complexity of consensus clustering
  Martin Dörnfelder, Jiong Guo, Christian Komusiewicz, Mathias Weller
  Lecture Notes in Computer Science 7074, 2011, pp. 624-633
• Two fixed-parameter algorithms for the cocoloring problem
  Victor Campos, Sulamita Klein, Rudini Sampaio, Ana Silva
  Lecture Notes in Computer Science 7074, 2011, pp. 634-642
• Parameterized complexity of the firefighter problem
  Cristina Bazgan, Morgan Chopin, Michael R. Fellows
  Lecture Notes in Computer Science 7074, 2011, pp. 643-652
• Range LCP
  Amihood Amir, Alberto Apostolico, Gad M. Landau, Avivit Levy, Moshe Lewenstein, Ely Porat
  Lecture Notes in Computer Science 7074, 2011, pp. 683-692
• Closest periodic vectors in L_p spaces
  Amihood Amir, Estrella Eisenberg, Avivit Levy, Noa Lewenstein
  Lecture Notes in Computer Science 7074, 2011, pp. 714-723
• Algorithms for building consensus MUL-trees
  Yun Cui, Jesper Jansson, Wing-Kin Sung
  Lecture Notes in Computer Science 7074, 2011, pp. 744-753
• Adaptive phenotype testing for AND/OR items
  Francis Y.L. Chin, Henry C.M. Leung, S.M. Yiu
  Lecture Notes in Computer Science 7074, 2011, pp. 754-763
• Split clique graph complexity
  Liliana Alcón, Luerbio Faria, Celina M.H. de Figueiredo, Marisa Gutierrez
  Lecture Notes in Computer Science 6986, 2011, pp. 11-22
• On searching for small Kochen-Specker vector systems
  Felix Arends, Joël Ouaknine, Charles W. Wampler
  Lecture Notes in Computer Science 6986, 2011, pp. 23-34
• Characterizations of deque and queue graphs
  Christopher Auer, Andreas Gleißner
  Lecture Notes in Computer Science 6986, 2011, pp. 35-46
• Graph classes with structured neighborhoods and algorithmic applications
  Rémy Belmonte, Martin Vatshelle
  Lecture Notes in Computer Science 6986, 2011, pp. 47-58
• Exact algorithms for Kayles
  Hans L. Bodlaender, Dieter Kratsch
  Lecture Notes in Computer Science 6986, 2011, pp. 59-70
• The Cinderella game on holes and anti-holes
  Marijke H.L. Bodlaender, Cor A.J. Hurkens, Gerhard J. Woeginger
  Lecture Notes in Computer Science 6986, 2011, pp. 71-82
• On the complexity of planar covering of small graphs
  Ondȓej Bílka, Jozef Jirásek, Pavel Klavík, Martin Tancer, Jan Volec
  Lecture Notes in Computer Science 6986, 2011, pp. 83-94
• Approximability of economic equilibrium for housing markets with duplicate houses
  Katarína Cechlárová, Eva Jelínková
  Lecture Notes in Computer Science 6986, 2011, pp. 95-106
• Planarization and acyclic colorings of subcubic claw-free graphs
  Christine Cheng, Eric McDermid, Ichiro Suzuki
  Lecture Notes in Computer Science 6986, 2011, pp. 107-118
• List coloring in the absence of a linear forest
  Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma
  Lecture Notes in Computer Science 6986, 2011, pp. 119-130
• Parameterized complexity of Eulerian deletion problems
  Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michaƚ Pilipczuk, Ildikó Schlotter
  Lecture Notes in Computer Science 6986, 2011, pp. 131-142
• Restricted cuts for bisections in solid grids: A proof via polygons
  Andreas Emil Feldmann, Shantanu Das, Peter Widmayer
  Lecture Notes in Computer Science 6986, 2011, pp. 143-154
• Maximum independent set in 2-direction outersegment graphs
  Holger Flier, Matús̑ Mihalák, Peter Widmayer, Anna Zych
  Lecture Notes in Computer Science 6986, 2011, pp. 155-166
• Recognizing some subclasses of vertex intersection graphs of 0-bend paths in a grid
  Steven Chaplick, Elad Cohen, Juraj Stacho
  Lecture Notes in Computer Science 6986, 2011, pp. 319-330
• Improved approximation algorithms for Bipartite Correlation Clustering
  Nir Ailon, Noa Avigdor-Elgrabli, Edo Liberty, Anke van Zuylen
  Lecture Notes in Computer Science 6942, 2011, pp. 25-36
• Approximating minimum Manhattan networks in higher dimensions
  Aparna Das, Emden R. Gansner, Michael Kaufmann, Stephen Kobourov, Joachim Spoerhase, Alexander Wolff
  Lecture Notes in Computer Science 6942, 2011, pp. 49-60
• Can nearest neighbor searching be simple and always fast?
  Victor Alvarez, David G. Kirkpatrick, Raimund Seidel
  Lecture Notes in Computer Science 6942, 2011, pp. 82-92