Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=1178

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

Applications of a numbering scheme for polygonal obstacles in the plane
Mikhail J. Atallah, Danny Z. Chen
Lecture Notes in Computer Science 1178, 1996, pp. 1-24
Multicast communication in high speed networks
Jonathan S. Turner
Lecture Notes in Computer Science 1178, 1996, pp. 25-25
Incremental convex hull algorithms are not output sensitive
David Bremner
Lecture Notes in Computer Science 1178, 1996, pp. 26-35
Separating and shattering long line segments
Alon Efrat, Otfried Schwarzkopf
Lecture Notes in Computer Science 1178, 1996, pp. 36-44
Optimal line bipartitions of point sets
Olivier Devillers, Matthew J. Katz
Lecture Notes in Computer Science 1178, 1996, pp. 45-54
Interval finding and its application to data mining
Takeshi Fukuda, Yasuhiko Morimoto, Shinich Morishita, Takeshi Tokuyama
Lecture Notes in Computer Science 1178, 1996, pp. 55-64
On the approximability of the Steiner tree problem in phylogeny
David Fernández-Baca, Jens Lagergren
Lecture Notes in Computer Science 1178, 1996, pp. 65-74
Approximation and special cases of common subtrees and editing distance
Magnús M. Halldórsson, Keisuke Tanaka
Lecture Notes in Computer Science 1178, 1996, pp. 75-84
Two-dimensional dynamic dictionary matching
Ying Choi, Tak Wah Lam
Lecture Notes in Computer Science 1178, 1996, pp. 85-94
Discovering unbounded unions of regular pattern languages from positive examples
Alvis Brāzma, Esko Ukkonen, Jaak Vilo
Lecture Notes in Computer Science 1178, 1996, pp. 95-104
Extremal problems for geometric hypergraphs
Tamal K. Dey, János Pach
Lecture Notes in Computer Science 1178, 1996, pp. 105-114
Computing fair and bottleneck matchings in geometric graphs
Alon Efrat, Matthew J. Katz
Lecture Notes in Computer Science 1178, 1996, pp. 115-125
Computing the maximum overlap of two convex polygons under translations
Mark de Berg, Olivier Devillers, Marc van Kreveld, Otfried Schwarzkopf, Monique Teillaud
Lecture Notes in Computer Science 1178, 1996, pp. 126-135
OBDDs of a monotone function and of its prime implicants
Kazuyoshi Hayase, Hiroshi Imai
Lecture Notes in Computer Science 1178, 1996, pp. 136-145
Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs
Maw-Shang Chang
Lecture Notes in Computer Science 1178, 1996, pp. 146-155
Graph searching on chordal graphs
Sheng-Lung Peng, Ming-Tat Ko, Chin-Wen Ho, Tsan-sheng Hsu, Chuan-Yi Tang
Lecture Notes in Computer Science 1178, 1996, pp. 156-165
An algorithm for enumerating all directed spanning trees in a directed graph
Takeaki Uno
Lecture Notes in Computer Science 1178, 1996, pp. 166-173
Vertex ranking of asteroidal triple-free graphs
Ton Kloks, Haiko Müller, C.K. Wong
Lecture Notes in Computer Science 1178, 1996, pp. 174-182
Recursively divisible problems
Rolf Niedermeier
Lecture Notes in Computer Science 1178, 1996, pp. 183-192
StUSPACE(\log n) \subseteq DSPACE (\log^2 n/ \log\log n)
Eric Allender, Klaus-Jörn Lange
Lecture Notes in Computer Science 1178, 1996, pp. 193-202
Finding edge-disjoint paths in partial k-trees
Xiao Zhou, Syurei Tamura, Takao Nishizeki
Lecture Notes in Computer Science 1178, 1996, pp. 203-212
Optimal augmentation for bipartite componentwise biconnectivity in linear time
Tsan-sheng Hsu, Ming-Yang Kao
Lecture Notes in Computer Science 1178, 1996, pp. 213-222
Towards more precise parallel biconnectivity approximation
Ka Wong Chong, Tak Wah Lam
Lecture Notes in Computer Science 1178, 1996, pp. 223-232
The complexity of probabilistic versus deterministic finite automata
Andris Ambainis
Lecture Notes in Computer Science 1178, 1996, pp. 233-238
Bounded length UCFG equivalence
B. Litow
Lecture Notes in Computer Science 1178, 1996, pp. 239-246

Seiten 1 2 >