Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=6506

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

Regular labelings and geometric structures
David Eppstein
Lecture Notes in Computer Science 6506, 2010, pp. 1-1
Algorithmic aspects of secure computation and communication
Matt Franklin
Lecture Notes in Computer Science 6506, 2010, pp. 2-2
Faster algorithms for feedback arc set tournament, Kemeny rank aggregation and betweenness tournament
Marek Karpinski, Warren Schudy
Lecture Notes in Computer Science 6506, 2010, pp. 3-14
A 3/2-approximation algorithm for Generalized Steiner Trees in complete graphs with edge lengths 1 and 2
Piotr Berman, Marek Karpinski, Alexander Zelikovsky
Lecture Notes in Computer Science 6506, 2010, pp. 15-24
Approximate periodicity
Amihood Amir, Estrella Eisenberg, Avivit Levy
Lecture Notes in Computer Science 6506, 2010, pp. 25-36
Approximating the average stretch factor of geometric graphs
Siu-Wing Cheng, Christian Knauer, Stefan Langerman, Michiel Smid
Lecture Notes in Computer Science 6506, 2010, pp. 37-48
Satisfiability with index dependency
Hongyu Liang, Jing He
Lecture Notes in Computer Science 6506, 2010, pp. 49-60
Anonymous fuzzy identity-based encryption for similarity search
David W. Cheung, Nikos Mamoulis, W.K. Wong, S.M. Yiu, Ye Zhang
Lecture Notes in Computer Science 6506, 2010, pp. 61-72
Improved randomized algorithms for 3-SAT
Kazuo Iwama, Kazuhisa Seto, Tadashi Takai, Suguru Tamaki
Lecture Notes in Computer Science 6506, 2010, pp. 73-84
Quantum counterfeit coin problems
Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Junichi Teruyama
Lecture Notes in Computer Science 6506, 2010, pp. 85-96
Priority range trees
Michael T. Goodrich, Darren Strash
Lecture Notes in Computer Science 6506, 2010, pp. 97-108
Should static search trees ever be unbalanced?
Prosenjit Bose, Karim Douïeb
Lecture Notes in Computer Science 6506, 2010, pp. 109-120
Levelwise mesh sparsification for shortest path queries
Yuichiro Miyamoto, Takeaki Uno, Mikio Kubo
Lecture Notes in Computer Science 6506, 2010, pp. 121-132
Unit-time predecessor queries on massive data sets
Andrej Brodnik, John Iacono
Lecture Notes in Computer Science 6506, 2010, pp. 133-144
Popularity at minimum cost
Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar
Lecture Notes in Computer Science 6506, 2010, pp. 145-156
Structural and complexity aspects of line systems of graphs
Jozef Jirásek, Pavel Klavík
Lecture Notes in Computer Science 6506, 2010, pp. 157-168
Neighbor systems, jump systems, and bisubmodular polyhedra
Akiyoshi Shioura
Lecture Notes in Computer Science 6506, 2010, pp. 169-181
Generating trees on multisets
Bingbing Zhuang, Hiroshi Nagamochi
Lecture Notes in Computer Science 6506, 2010, pp. 182-193
Seidel minor, permutation graphs and combinatorial properties
Vincent Limouzy
Lecture Notes in Computer Science 6506, 2010, pp. 194-205
Simultaneous interval graphs
Krishnam Raju Jampani, Anna Lubiw
Lecture Notes in Computer Science 6506, 2010, pp. 206-217
Unbalanced graph partitioning
Angsheng Li, Peng Zhang
Lecture Notes in Computer Science 6506, 2010, pp. 218-229
On the intersection of tolerance and cocomparability graphs
George B. Mertzios, Shmuel Zaks
Lecture Notes in Computer Science 6506, 2010, pp. 230-240
Flows in one-crossing-minor-free graphs
Erin Chambers, David Eppstein
Lecture Notes in Computer Science 6506, 2010, pp. 241-252
From Holant to \#CSP and back: Dichotomy for Holant^c problems
Jin-Yi Cai, Sangxia Huang, Pinyan Lu
Lecture Notes in Computer Science 6506, 2010, pp. 253-265
Computing sparse multiples of polynomials
Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak
Lecture Notes in Computer Science 6506, 2010, pp. 266-278

Seiten 1 2 >