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 Volume=8283

• Market approach to social ads: The Mylikes example and related problems
  Darja Krushevskaja, S. Muthukrishnan
  Lecture Notes in Computer Science 8283, 2013, pp. 1-10
• Geodesic-preserving polygon simplification
  Oswin Aichholzer, Thomas Hackl, Matias Korman, Alexander Pilz, Birgit Vogtenhuber
  Lecture Notes in Computer Science 8283, 2013, pp. 11-21
• Space-efficient and data-sensitive polygon reconstruction algorithms from visibility angle information
  Jinhee Chun, Ricardo Garcia de Gonzalo, Takeshi Tokuyama
  Lecture Notes in Computer Science 8283, 2013, pp. 22-32
• On the edge crossing properties of Euclidean minimum weight Laman graphs
  Sergey Bereg, Seok-Hee Hong, Naoki Katoh, Sheung-Hung Poon, Shin-ichi Tanigawa
  Lecture Notes in Computer Science 8283, 2013, pp. 33-43
• Structure and computation of straight skeletons in 3-space
  Franz Aurenhammer, Gernot Walzl
  Lecture Notes in Computer Science 8283, 2013, pp. 44-54
• Pattern matching with non overlapping reversals - Approximation and on-line algorithms
  Amihood Amir, Benny Porat
  Lecture Notes in Computer Science 8283, 2013, pp. 55-65
• Single and multiple consecutive permutation motif search
  Djamal Belazzougui, Adeline Pierrot, Mathieu Raffinot, Stéphane Vialette
  Lecture Notes in Computer Science 8283, 2013, pp. 66-77
• Beating \mathcal{O}(nm) in approximate LZW-compressed pattern matching
  Paweƚ Gawrychowski, Damian Straszak
  Lecture Notes in Computer Science 8283, 2013, pp. 78-88
• Less space: Indexing for queries with wildcards
  Moshe Lewenstein, J. Ian Munro, Venkatesh Raman, Sharma V. Thankachan
  Lecture Notes in Computer Science 8283, 2013, pp. 89-99
• On determining deep holes of generalized Reed-Solomon codes
  Qi Cheng, Jiyou Li, Jincheng Zhuang
  Lecture Notes in Computer Science 8283, 2013, pp. 100-110
• Isomorphism on subgraph-closed graph classes: A complexity dichotomy and intermediate graph classes
  Yota Otachi, Pascal Schweitzer
  Lecture Notes in Computer Science 8283, 2013, pp. 111-118
• Determinantal complexities and field extensions
  Youming Qiao, Xiaoming Sun, Nengkun Yu
  Lecture Notes in Computer Science 8283, 2013, pp. 119-129
• Algorithms to measure diversity and clustering in social networks through dot product graphs
  Matthew Johnson, Daniël Paulusma, Erik Jan van Leeuwen
  Lecture Notes in Computer Science 8283, 2013, pp. 130-140
• Sublinear-time algorithms for monomer-dimer systems on bounded degree graphs
  Marc Lelarge, Hang Zhou
  Lecture Notes in Computer Science 8283, 2013, pp. 141-151
• The complexity of finding a large subgraph under anonymity constraints
  Robert Bredereck, Sepp Hartung, André Nichterlein, Gerhard J. Woeginger
  Lecture Notes in Computer Science 8283, 2013, pp. 152-162
• On the number of edges of fan-crossing free graphs
  Otfried Cheong, Sariel Har-Peled, Heuna Kim, Hyo-Sil Kim
  Lecture Notes in Computer Science 8283, 2013, pp. 163-173
• Cops and robbers on intersection graphs
  Tomás̑ Gavenc̑iak, Vít Jelínek, Pavel Klavík, Jan Kratochvíl
  Lecture Notes in Computer Science 8283, 2013, pp. 174-184
• SEFE with no mapping via large induced outerplane graphs in plane graphs
  Patrizio Angelini, William Evans, Fabrizio Frati, Joachim Gudmundsson
  Lecture Notes in Computer Science 8283, 2013, pp. 185-195
• Hardness and algorithms for variants of line graphs of directed graphs
  Mourad Baïou, Laurent Beaudou, Zhentao Li, Vincent Limouzy
  Lecture Notes in Computer Science 8283, 2013, pp. 196-206
• Performance guarantees for scheduling algorithms under perturbed machine speeds
  Michael Etscheid
  Lecture Notes in Computer Science 8283, 2013, pp. 207-217
• Better bounds for online k-frame throughput maximization in network switches
  Jun Kawahara, Koji M. Kobayashi, Shuichi Miyazaki
  Lecture Notes in Computer Science 8283, 2013, pp. 218-228
• The solvable cases of a scheduling algorithm
  Sam Walker, Yakov Zinder
  Lecture Notes in Computer Science 8283, 2013, pp. 229-239
• Exact sublinear binomial sampling
  Martín Farach-Colton, Meng-Tsung Tsai
  Lecture Notes in Computer Science 8283, 2013, pp. 240-250
• Trivial, tractable, hard. A not so sudden complexity jump in neighborhood restricted CNF formulas
  Dominik Scheder
  Lecture Notes in Computer Science 8283, 2013, pp. 251-261
• Dynamic point labeling is strongly PSPACE-complete
  Kevin Buchin, Dirk H.P. Gerrits
  Lecture Notes in Computer Science 8283, 2013, pp. 262-272