Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=2108

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

Competitive facility location along a highway
Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Mordecai Golin, René van Oostrum
Lecture Notes in Computer Science 2108, 2001, pp. 237-246
Membership for core of LP games and other games
Qizhi Fang, Shanfeng Zhu, Maocheng Cai, Xiaotie Deng
Lecture Notes in Computer Science 2108, 2001, pp. 247-256
Strong solutions to the identification problem
Pino Caballero-Gil, Candelaria Hernández-Goya
Lecture Notes in Computer Science 2108, 2001, pp. 257-261
Area efficient exponentiation using modular multiplier/squarer in GF(2^m)
Hyun-Sung Kim, Kee-Young Yoo
Lecture Notes in Computer Science 2108, 2001, pp. 262-267
A space saving trick for directed dynamic transitive closure and shortest path algorithms
Valerie King, Mikkel Thorup
Lecture Notes in Computer Science 2108, 2001, pp. 268-277
Finding the most vital node of a shortest path
Enrico Nardelli, Guido Proietti, Peter Widmayer
Lecture Notes in Computer Science 2108, 2001, pp. 278-287
Algorithm for the cost edge-coloring of trees
Xiao Zhou, Takao Nishizeki
Lecture Notes in Computer Science 2108, 2001, pp. 288-297
Counting H-colorings of partial k-trees
Josep Díaz, Maria Serna, Dimitrios M. Thilikos
Lecture Notes in Computer Science 2108, 2001, pp. 298-307
A linear time algorithm for enumerating all the minimum and minimal separators of a chordal graph
L. Sunil Chandran
Lecture Notes in Computer Science 2108, 2001, pp. 308-317
Graph separators: A parameterized view
Jochen Alber, Henning Fernau, Rolf Niedermeier
Lecture Notes in Computer Science 2108, 2001, pp. 318-327
On assigning prefix free codes to the vertices of a graph
N.S. Narayanaswamy, C.E. Veni Madhavan
Lecture Notes in Computer Science 2108, 2001, pp. 328-337
A new measure of edit distance between labeled trees
Chin Lung Lu, Zheng-Yao Su, Chuan Yi Tang
Lecture Notes in Computer Science 2108, 2001, pp. 338-348
A highly efficient algorithm to determine bicritical graphs
Dingjun Lou, Ning Zhong
Lecture Notes in Computer Science 2108, 2001, pp. 349-356
Layered drawings of graphs with crossing constraints
Irene Finocchi
Lecture Notes in Computer Science 2108, 2001, pp. 357-367
On the validity of hierarchical decompositions
Irene Finocchi, Rossella Petreschi
Lecture Notes in Computer Science 2108, 2001, pp. 368-374
Lower bounds on the minus domination and k-subdomination numbers
Liying Kang, Hong Qiao, Erfang Shan, Ding-Zhu Du
Lecture Notes in Computer Science 2108, 2001, pp. 375-383
Edge connectivity vs. vertex connectivity in chordal graphs
L. Sunil Chandran
Lecture Notes in Computer Science 2108, 2001, pp. 384-389
Changing the diameter of graph products
Ting-Yi Sung, Jeng-Jung Wang
Lecture Notes in Computer Science 2108, 2001, pp. 390-394
Plane graphs with acyclic complex
Baogang Xu
Lecture Notes in Computer Science 2108, 2001, pp. 395-399
On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs
Yosuke Kikuchi, Yukio Shibata
Lecture Notes in Computer Science 2108, 2001, pp. 400-408
A notion of cross-perfect bipartite graphs
Milind Dawande
Lecture Notes in Computer Science 2108, 2001, pp. 409-413
Some results on orthogonal factorizations
Haodi Feng
Lecture Notes in Computer Science 2108, 2001, pp. 414-419
Cluttered orderings for the complete graph
Myra B. Cohen, Charles J. Colbourn, Dalibor Froncek
Lecture Notes in Computer Science 2108, 2001, pp. 420-431
Improved on-line stream merging: From a restricted to a general setting
Wun-Tat Chan, Tak-Wah Lam, Hing-Fung Ting, Wai-Ha Wong
Lecture Notes in Computer Science 2108, 2001, pp. 432-442
On-line deadline scheduling on multiple resources
Jae-Hoon Kim, Kyung-Yong Chwa
Lecture Notes in Computer Science 2108, 2001, pp. 443-452

Seiten < 1 2 3 >