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
Hilfe
Suche: Series=LNCS AND Volume=1858
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Theoretical problems related to the Internet
Christos H. Papadimitriou
Lecture Notes in Computer Science
1858
, 2000, pp. 1-2
Recent progress and prospects for integer factorisation algorithms
Richard P. Brent
Lecture Notes in Computer Science
1858
, 2000, pp. 3-22
Approximating uniform triangular meshes in polygons
Franz Aurenhammer
,
Naoki Katoh
,
Hiromichi Kojima
,
Makoto Ohsaki
,
Yinfeng Xu
Lecture Notes in Computer Science
1858
, 2000, pp. 23-33
Maximum induced matchings of random cubic graphs
William Duckworth
,
Nicholas C. Wormald
,
Michele Zito
Lecture Notes in Computer Science
1858
, 2000, pp. 34-43
A duality between small-face problems in arrangements of lines and Heilbronn-type problems
Gill Barequet
Lecture Notes in Computer Science
1858
, 2000, pp. 44-53
On local transformation of polygons with visibility properties
Carmen Hernando
,
Michael E. Houle
,
Ferran Hurtado
Lecture Notes in Computer Science
1858
, 2000, pp. 54-63
Embedding problems for paths with direction constrained edges
Giuseppe Di Battista
,
Giuseppe Liotta
,
Anna Lubiw
,
Sue Whitesides
Lecture Notes in Computer Science
1858
, 2000, pp. 64-73
Characterization of level non-planar graphs by minimal patterns
Patrick Healy
,
Ago Kuusik
,
Sebastian Leipert
Lecture Notes in Computer Science
1858
, 2000, pp. 74-84
Rectangular drawings of plane graphs without designated corners
Md. Saidur Rahman
,
Shin-ichi Nakano
,
Takao Nishizeki
Lecture Notes in Computer Science
1858
, 2000, pp. 85-94
Computing optimal embeddings for planar graphs
Petra Mutzel
,
René Weiskircher
Lecture Notes in Computer Science
1858
, 2000, pp. 95-104
Approximation algorithms for independent sets in map graphs
Zhi-Zhong Chen
Lecture Notes in Computer Science
1858
, 2000, pp. 105-114
Hierarchical topological inference on planar disc maps
Zhi-Zhong Chen
,
Xin He
Lecture Notes in Computer Science
1858
, 2000, pp. 115-125
Efficient algorithms for the minimum connected domination on trapezoid graphs
Yaw-Ling Lin
,
Fang Rong Hsu
,
Yin-Te Tsai
Lecture Notes in Computer Science
1858
, 2000, pp. 126-136
Parameterized complexity of finding subgraphs with hereditary properties
Subhash Khot
,
Venkatesh Raman
Lecture Notes in Computer Science
1858
, 2000, pp. 137-147
Some results on tries with adaptive branching
Yuriy A. Reznik
Lecture Notes in Computer Science
1858
, 2000, pp. 148-158
Optimal coding with one asymmetric error: Below the sphere packing bound
Ferdinando Cicalese
,
Daniele Mundici
Lecture Notes in Computer Science
1858
, 2000, pp. 159-169
Closure properties of real number classes under limits and computable operators
Xizhong Zheng
Lecture Notes in Computer Science
1858
, 2000, pp. 170-179
A characterization of graphs with vertex cover six
Michael J. Dinneen
,
Liu Xiong
Lecture Notes in Computer Science
1858
, 2000, pp. 180-192
On the monotonicity of minimum diameter with respet to order and maximum out-degree
Mirka Miller
,
Slamin
Lecture Notes in Computer Science
1858
, 2000, pp. 193-201
Online independent sets
Magnús M. Halldórsson
,
Kazuo Iwama
,
Shuichi Miyazaki
,
Shiro Taketomi
Lecture Notes in Computer Science
1858
, 2000, pp. 202-209
Two-dimensional on-line bin packing problem with rotatable items
Satoshi Fujita
,
Takeshi Hada
Lecture Notes in Computer Science
1858
, 2000, pp. 210-220
Better bounds on the accommodating ratio for the seat reservation problem
Eric Bach
,
Joan Boyar
,
Tao Jiang
,
Kim S. Larsen
,
Guo-Hui Lin
Lecture Notes in Computer Science
1858
, 2000, pp. 221-231
Ordinal on-line scheduling on two uniform machines
Zhiyi Tan
,
Yong He
Lecture Notes in Computer Science
1858
, 2000, pp. 232-241
Agents, distributed algorithms, and stabilization
Sukumar Ghosh
Lecture Notes in Computer Science
1858
, 2000, pp. 242-251
A fast sorting algorithm and its generalization on broadcast communications
Shyue-Horng Shiau
,
Chang-Biau Yang
Lecture Notes in Computer Science
1858
, 2000, pp. 252-261
Seiten 1
2
>