Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=4835

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

New bounds for the nearly equitable edge coloring problem
Xuzhen Xie, Mutsunori Yagiura, Takao Ono, Tomio Hirata, Uri Zwick
Lecture Notes in Computer Science 4835, 2007, pp. 280-291
Approximation to the minimum cost edge installation problem
Ehab Morsy, Hiroshi Nagamochi
Lecture Notes in Computer Science 4835, 2007, pp. 292-303
Approximability of packing disjoint cycles
Zachary Friggstad, Mohammad R. Salavatipour
Lecture Notes in Computer Science 4835, 2007, pp. 304-315
Succinct representation of labeled graphs
Jérémy Barbay, Luca Castelli Aleardi, Meng He, J. Ian Munro
Lecture Notes in Computer Science 4835, 2007, pp. 316-328
More efficient algorithms and analyses for unequal letter cost prefix-free coding
Mordecai Golin, Jian Li
Lecture Notes in Computer Science 4835, 2007, pp. 329-340
Kinetic maintenance of mobile k-centres on trees
Stephane Durocher, Christophe Paul
Lecture Notes in Computer Science 4835, 2007, pp. 341-352
Checking value-sensitive data structures in sublinear space
Michael T. Goodrich, Jonathan Z. Sun
Lecture Notes in Computer Science 4835, 2007, pp. 353-364
Manipulation in games
Raphael Eidenbenz, Yvonne Anne Oswald, Stefan Schmid, Roger Wattenhofer
Lecture Notes in Computer Science 4835, 2007, pp. 365-376
Using Nash implementation to achieve better frugality ratios
Chien-Chung Huang, Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang
Lecture Notes in Computer Science 4835, 2007, pp. 377-389
The price of Nash equilibria in multicast transmissions games
Vittorio Bilò
Lecture Notes in Computer Science 4835, 2007, pp. 390-401
An efficient algorithm for enumerating pseudo cliques
Takeaki Uno
Lecture Notes in Computer Science 4835, 2007, pp. 402-414
Fast adaptive diagnosis with a minimum number of tests
Samuel Guilbault, Andrzej Pelc
Lecture Notes in Computer Science 4835, 2007, pp. 415-426
Dynamic structures for top-k queries on uncertain data
Jiang Chen, Ke Yi
Lecture Notes in Computer Science 4835, 2007, pp. 427-438
Separating populations with wide data: A spectral analysis
Avrim Blum, Amin Coja-Oghlan, Alan Frieze, Shuheng Zhou
Lecture Notes in Computer Science 4835, 2007, pp. 439-451
A constant-competitive algorithm for online OVSF code assignment
F.Y.L. Chin, H.F. Ting, Y. Zhang
Lecture Notes in Computer Science 4835, 2007, pp. 452-463
Average-case analysis of online topological ordering
Deepak Ajwani, Tobias Friedrich
Lecture Notes in Computer Science 4835, 2007, pp. 464-475
Energy efficient deadline scheduling in two processor systems
Tak-Wah Lam, Lap-Kei Lee, Isaac K.K. To, Prudence W.H. Wong
Lecture Notes in Computer Science 4835, 2007, pp. 476-487
On the relative dominance of paging algorithms
Reza Dorrigiv, Alejandro López-Ortiz, J. Ian Munro
Lecture Notes in Computer Science 4835, 2007, pp. 488-499
I/O-efficient map overlay and point location in low-density subdivisions
Mark de Berg, Herman Haverkort, Shripad Thite, Laura Toma
Lecture Notes in Computer Science 4835, 2007, pp. 500-511
Geometric streaming algorithms with a sorting primitive
Eric Y. Chen
Lecture Notes in Computer Science 4835, 2007, pp. 512-524
External memory range reporting on a grid
Yakov Nekrich
Lecture Notes in Computer Science 4835, 2007, pp. 525-535
Approximate range searching in external memory
Micha Streppel, Ke Yi
Lecture Notes in Computer Science 4835, 2007, pp. 536-548
Faster treasure hunt and better strongly universal exploration sequences
Qin Xin
Lecture Notes in Computer Science 4835, 2007, pp. 549-560
Hardness and approximation of traffic grooming
Omid Amini, Stéphane Pérennes, Ignasi Sau
Lecture Notes in Computer Science 4835, 2007, pp. 561-573
Depth of field and cautious-greedy routing in social networks
David Barbella, George Kachergis, David Liben-Nowell, Anna Sallstrom, Ben Sowell
Lecture Notes in Computer Science 4835, 2007, pp. 574-586

Seiten < 1 2 3 4 >