Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=7357

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

\alpha-visibility
Mohammad Ghodsi, Anil Maheshwari, Mostafa Nouri, Jörg-Rüdiger Sack, Hamid Zarrabi-Zadeh
Lecture Notes in Computer Science 7357, 2012, pp. 1-12
Partial matching between surfaces using Fréchet distance
Jessica Sherette, Carola Wenk
Lecture Notes in Computer Science 7357, 2012, pp. 13-23
A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares
Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
Lecture Notes in Computer Science 7357, 2012, pp. 24-35
Watchman routes for lines and segments
Adrian Dumitrescu, Joseph S.B. Mitchell, Paweƚ Żyliński
Lecture Notes in Computer Science 7357, 2012, pp. 36-47
Kinetic Pie Delaunay graph and its applications
Mohammad Ali Abam, Zahed Rahmati, Alireza Zarei
Lecture Notes in Computer Science 7357, 2012, pp. 48-58
Higher order city Voronoi diagrams
Andreas Gemsa, D.T. Lee, Chih-Hung Liu, Dorothea Wagner
Lecture Notes in Computer Science 7357, 2012, pp. 59-70
On minimum sum of Radii and diameters clustering
Babak Behsaz, Mohammad R. Salavatipour
Lecture Notes in Computer Science 7357, 2012, pp. 71-82
A simple framework for the generalized nearest neighbor problem
Tomas Hruz, Marcel Schöngens
Lecture Notes in Computer Science 7357, 2012, pp. 83-94
Deterministic parameterized connected vertex cover
Marek Cygan
Lecture Notes in Computer Science 7357, 2012, pp. 95-106
Faster parameterized algorithms for deletion to split graphs
Esha Ghosh, Sudeshna Kolay, Mrinal Kumar, Pranabendu Misra, Fahad Panolan, Ashutosh Rai, M.S. Ramanujan
Lecture Notes in Computer Science 7357, 2012, pp. 107-118
A single-exponential FPT algorithm for the K_4-minor cover problem
Eun Jung Kim, Christophe Paul, Geevarghese Philip
Lecture Notes in Computer Science 7357, 2012, pp. 119-130
An O(n^3\log\log n/\log^2n) time algorithm for all pairs shortest paths
Yijie Han, Tadao Takaoka
Lecture Notes in Computer Science 7357, 2012, pp. 131-141
Linear time algorithm for computing a small biclique in graphs without long induced paths
Aistis Atminas, Vadim V. Lozin, Igor Razgon
Lecture Notes in Computer Science 7357, 2012, pp. 142-152
Induced disjoint paths in AT-free graphs
Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen
Lecture Notes in Computer Science 7357, 2012, pp. 153-164
Effective computation of immersion obstructions for unions of graph classes
Archontia C. Giannopoulou, Iosif Salem, Dimitris Zoros
Lecture Notes in Computer Science 7357, 2012, pp. 165-176
Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain
Danny Z. Chen, Yan Gu, Jian Li, Haitao Wang
Lecture Notes in Computer Science 7357, 2012, pp. 177-188
Annotating simplices with a homology basis and its applications
Oleksiy Busaryev, Sergio Cabello, Chao Chen, Tamal K. Dey, Yusu Wang
Lecture Notes in Computer Science 7357, 2012, pp. 189-200
Do directional antennas facilitate in reducing interferences?
Rom Aschner, Matthew J. Katz, Gila Morgenstern
Lecture Notes in Computer Science 7357, 2012, pp. 201-212
Minimum convex partitions and maximum empty polytopes
Adrian Dumitrescu, Sariel Har-Peled, Csaba D. Tóth
Lecture Notes in Computer Science 7357, 2012, pp. 213-224
A probabilistic analysis of Christofides' algorithm
Markus Bläser, Konstatinos Panagiotou, Raghavendra Rao
Lecture Notes in Computer Science 7357, 2012, pp. 225-236
New approximation algorithms for the unsplittable capacitated facility location problem
Babak Behsaz, Mohammad R. Salavatipour, Zoya Svitkina
Lecture Notes in Computer Science 7357, 2012, pp. 237-248
Non-preemptive speed scaling
Antonios Antoniadis, Chien-Chung Huang
Lecture Notes in Computer Science 7357, 2012, pp. 249-260
A fast algorithm for permutation pattern matching based on alternating runs
Marie-Louise Bruner, Martin Lackner
Lecture Notes in Computer Science 7357, 2012, pp. 261-270
Sorted range reporting
Yakov Nekrich, Gonzalo Navarro
Lecture Notes in Computer Science 7357, 2012, pp. 271-282
String indexing for patterns with wildcards
Philip Bille, Inge Li Grtz, Hjalte Wedel Vildhj, Sren Vind
Lecture Notes in Computer Science 7357, 2012, pp. 283-294

Seiten 1 2 >