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

Suche: Series=LNCS AND YEAR=2013

• An efficient algorithm for one-sided block ordering problem with block-interchange distance
  Kun-Tze Chen, Chi-Long Li, Chung-Han Yang, Chin Lung Lu
  Lecture Notes in Computer Science 7936, 2013, pp. 409-420
• A combinatorial approach for multiple RNA interaction: Formulations, approximations, and heuristics
  Syed Ali Ahmed, Saad Mneimneh, Nancy L. Greenbaum
  Lecture Notes in Computer Science 7936, 2013, pp. 421-433
• Maximum balanced subgraph problem parameterized above lower bound
  Robert Crowston, Gregory Gutin, Mark Jones, Gabriele Muciaccia
  Lecture Notes in Computer Science 7936, 2013, pp. 434-445
• A toolbox for provably optimal multistage strict group testing strategies
  Peter Damaschke, Azam Sheikh Muhammad
  Lecture Notes in Computer Science 7936, 2013, pp. 446-457
• A linear-time algorithm for computing the prime decomposition of a directed graph with regard to the Cartesian product
  Christophe Crespelle, Eric Thierry, Thomas Lambert
  Lecture Notes in Computer Science 7936, 2013, pp. 469-480
• Metrical service systems with multiple servers
  Ashish Chiplunkar, Sundar Vishwanathan
  Lecture Notes in Computer Science 7936, 2013, pp. 481-492
• The string guessing problem as a method to prove lower bounds on the advice complexity
  Hans-Joachim Böckenhauer, Juraj Hromkovic̑, Dennis Komm, Sacha Krug, Jasmin Smula, Andreas Sprock
  Lecture Notes in Computer Science 7936, 2013, pp. 493-505
• Parameterized approximability of maximizing the spread of influence in networks
  Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora
  Lecture Notes in Computer Science 7936, 2013, pp. 543-554
• On the complexity of solving or approximating convex recoloring problems
  Manoel B. Campêlo, Cristiana G. Huiban, Rudini M. Sampaio, Yoshiko Wakabayashi
  Lecture Notes in Computer Science 7936, 2013, pp. 614-625
• 2-connecting outerplanar graphs without blowing up the pathwidth
  Jasine Babu, Manu Basavaraju, Sunil Chandran Leela, Deepak Rajendraprasad
  Lecture Notes in Computer Science 7936, 2013, pp. 626-637
• How to catch L_2-heavy-hitters on sliding windows
  Vladimir Braverman, Ran Gelles, Rafail Ostrovsky
  Lecture Notes in Computer Science 7936, 2013, pp. 638-650
• Community expansion model based on charged system theory
  Yuanjun Bi, Weili Wu, Ailian Wang, Lidan Fan
  Lecture Notes in Computer Science 7936, 2013, pp. 780-790
• Expressing and computing passage time measures of GSPN models with HASL
  Elvio Gilberto Amparore, Paolo Ballarini, Marco Beccuti, Susanna Donatelli, Giuliana Franceschinis
  Lecture Notes in Computer Science 7927, 2013, pp. 110-129
• On multi-enabledness in time Petri nets
  Hanifa Boucheneb, Didier Lime, Olivier H. Roux
  Lecture Notes in Computer Science 7927, 2013, pp. 130-149
• The vehicle relocation problem in car sharing systems: Modeling and simulation in a Petri net framework
  Monica Clemente, Maria Pia Fanti, Agostino M. Mangini, Walter Ukovich
  Lecture Notes in Computer Science 7927, 2013, pp. 250-269
• Faster verification of partially ordered runs in Petri nets using compact tokenflows
  Robin Bergenthum
  Lecture Notes in Computer Science 7927, 2013, pp. 330-348
• Forty years of text indexing
  Alberto Apostolico, Maxime Crochemore, Martin Farach-Colton, Zvi Galil, S. Muthukrishnan
  Lecture Notes in Computer Science 7922, 2013, pp. 1-10
• Locating all maximal approximate runs in a string
  Mika Amit, Maxime Crochemore, Gad M. Landau
  Lecture Notes in Computer Science 7922, 2013, pp. 13-27
• On minimal and maximal suffixes of a substring
  Maxim Babenko, Ignat Kolesnichenko, Tatiana Starikovskaya
  Lecture Notes in Computer Science 7922, 2013, pp. 28-37
• Converting SLP to LZ78 in almost linear time
  Hideo Bannai, Paweƚ Gawrychowski, Shunsuke Inenaga, Masayuki Takeda
  Lecture Notes in Computer Science 7922, 2013, pp. 38-49
• A bit-parallel, general integer-scoring sequence alignment algorithm
  Gary Benson, Yozen Hernandez, Joshua Loving
  Lecture Notes in Computer Science 7922, 2013, pp. 50-61
• Compact q-gram profiling of compressed strings
  Philip Bille, Patrick Hagge Cording, Inge Li Grtz
  Lecture Notes in Computer Science 7922, 2013, pp. 62-73
• A constant-space comparison-based algorithm for computing the Burrows-Wheeler transform
  Maxime Crochemore, Roberto Grossi, Juha Kärkkäinen, Gad M. Landau
  Lecture Notes in Computer Science 7922, 2013, pp. 74-82
• Approximation algorithms for disjoint st-paths with minimum activation cost
  Hasna Mohsen Alqahtani, Thomas Erlebach
  Lecture Notes in Computer Science 7878, 2013, pp. 1-12
• Parameterized complexity and kernel bounds for hard planning problems
  Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider
  Lecture Notes in Computer Science 7878, 2013, pp. 13-24