Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=1272

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

Position-independent near optimal searching and on-line recognition in star polygons
Alejandro López-Ortiz, Sven Schuierer
Lecture Notes in Computer Science 1272, 1997, pp. 284-296
Dynamic data structures for fat objects and their applications
Alon Efrat, Matthew J. Katz, Franck Nielsen, Micha Sharir
Lecture Notes in Computer Science 1272, 1997, pp. 297-306
Intractability of assembly sequencing: Unit disks in the plane
Michael Goldwasser, Rajeev Motwani
Lecture Notes in Computer Science 1272, 1997, pp. 307-320
On Hamiltonian triangulations in simple polygons
Giri Narasimhan
Lecture Notes in Computer Science 1272, 1997, pp. 321-330
Computing orthogonal drawings with the minimum number of bends
Paola Bertolazzi, Giuseppe di Battista, Walter Didimo
Lecture Notes in Computer Science 1272, 1997, pp. 331-344
On a simple depth-first search strategy for exploring unknown graphs
Stephen Kwek
Lecture Notes in Computer Science 1272, 1997, pp. 345-353
Orthogonal drawing of high degree graphs with small area and few bends
Achilleas Papakostas, Ioannis G. Tollis
Lecture Notes in Computer Science 1272, 1997, pp. 354-367
A centroid labelling technique and its application to path selection in trees
Sarnath Ramnath, Hong Shen
Lecture Notes in Computer Science 1272, 1997, pp. 368-377
Offset-polygon annulus placement problems
Gill Barequet, Amy J. Briggs, Matthew T. Dickerson, Michael T. Goodrich
Lecture Notes in Computer Science 1272, 1997, pp. 378-391
Computing constrained minimum-width annuli of point sets
Mark de Berg, Prosenjit Bose, David Bremner, Suneeta Ramaswami, Gordon Wilfong
Lecture Notes in Computer Science 1272, 1997, pp. 392-401
Geometric applications of posets
Michael Segal, Klara Kedem
Lecture Notes in Computer Science 1272, 1997, pp. 402-415
Constructing pairwise disjoint paths with few links
Himanshu Gupta, Rephael Wenger
Lecture Notes in Computer Science 1272, 1997, pp. 416-425
Trans-dichotomous algorithms without multiplication - Some upper and lower bounds
Andrej Brodnik, Peter Bro Miltersen, J. Ian Munro
Lecture Notes in Computer Science 1272, 1997, pp. 426-439
An approximation algorithm for stacking up bins from a conveyer onto pallets
J. Rethmann, E. Wanke
Lecture Notes in Computer Science 1272, 1997, pp. 440-449
Relaxed balance through standard rotations
Kim S. Larsen, Eljas Soisalon-Soininen, Peter Widmayer
Lecture Notes in Computer Science 1272, 1997, pp. 450-461
Efficient breakout routing in printed circuit boards
John Hershberger, Subhash Suri
Lecture Notes in Computer Science 1272, 1997, pp. 462-471
Planarity, revisited
Zhi-Zhong Chen, Michelangelo Grigni, Christos H. Papadimitriou
Lecture Notes in Computer Science 1272, 1997, pp. 472-473

Seiten < 1 2