Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND YEAR=2002

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

Axiomatizing GSOS with termination
J.C.M. Baeten, E.P. de Vink
Lecture Notes in Computer Science 2285, 2002, pp. 583-595
Axiomatising tree-interpretable structures
Achim Blumensath
Lecture Notes in Computer Science 2285, 2002, pp. 596-607
A parametric analysis of the state explosion problem in model checking
S. Demri, F. Laroussinie, P. Schnoebelen
Lecture Notes in Computer Science 2285, 2002, pp. 620-631
A fixed-parameter approach to two-layer planarization
V. Dujmović, M. Fellows, M. Hallett, M. Kitching, Giuseppe Liotta, C. McCartin, N. Nishimura, P. Ragde, F. Rosamond, M. Suderman, S. Whitesides, David R. Wood
Lecture Notes in Computer Science 2265, 2002, pp. 1-15
Fast and simple horizontal coordinate assignment
Ulrik Brandes, Boris Köpf
Lecture Notes in Computer Science 2265, 2002, pp. 31-44
An improved lower bound for crossing numbers
Hristo Djidjev, Imrich Vrt'o
Lecture Notes in Computer Science 2265, 2002, pp. 96-101
Labeling heuristics for orthogonal drawings
Carla Binucci, Walter Didimo, Giuseppe Liotta, Maddalena Nonato
Lecture Notes in Computer Science 2265, 2002, pp. 139-153
Detecting symmetries by branch & cut
Christoph Buchheim, Michael Jünger
Lecture Notes in Computer Science 2265, 2002, pp. 178-188
On intersection graphs of segments with prescribed slopes
Jakub C̑erný, Daniel Král', Helena Nyklová, Ondȓej Pangrác
Lecture Notes in Computer Science 2265, 2002, pp. 261-271
Towards an aesthetic invariant for graph drawing
Jan Adamec, Jaroslav Nes̑etȓil
Lecture Notes in Computer Science 2265, 2002, pp. 287-296
Orthogonal drawings with few layers
Therese Biedl, John R. Johansen, Thomas Shermer, David R. Wood
Lecture Notes in Computer Science 2265, 2002, pp. 297-311
Low-distortion embeddings of trees
Robert Babilon, Jiȓí Matous̑ek, Jana Maxová, Pavel Valtr
Lecture Notes in Computer Science 2265, 2002, pp. 343-351
Tulip
Auber David
Lecture Notes in Computer Science 2265, 2002, pp. 435-437
Exploration and visualization of computer networks: Polyphemus and Hermes
Gabriele Barbagallo, Andrea Carmignani, Giuseppe di Battista, Walter Didimo, Maurizio Pizzonia
Lecture Notes in Computer Science 2265, 2002, pp. 444-445
The graph drawing server
Stina Bridgeman, Roberto Tamassia
Lecture Notes in Computer Science 2265, 2002, pp. 448-450
BioPath
Franz J. Brandenburg, Michael Forster, Andreas Pick, Marcus Raitner, Falk Schreiber
Lecture Notes in Computer Science 2265, 2002, pp. 455-456
Graph visualization API library for application builders
François Bertault, Wendy Feng, Uli Fößmeier, Gabe Grigorescu, Brendan Madden
Lecture Notes in Computer Science 2265, 2002, pp. 457-458
JGraph - A Java based system for drawing graphs and running graph algorithms
Jay Bagga, Adrian Heinz
Lecture Notes in Computer Science 2265, 2002, pp. 459-460
Visone
Michael Baur, Marc Benkert, Ulrik Brandes, Sabine Cornelsen, Marco Gaertler, Boris Köpf, Jürgen Lerner, Dorothea Wagner
Lecture Notes in Computer Science 2265, 2002, pp. 463-464
Knowledge index manager
Jean Delahousse, Pascal Auillans
Lecture Notes in Computer Science 2265, 2002, pp. 469-470
Industrial plant drawer
Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia
Lecture Notes in Computer Science 2265, 2002, pp. 475-476
Pajek - Analysis and visualization of large networks
Vladimir Batagelj, Andrej Mrvar
Lecture Notes in Computer Science 2265, 2002, pp. 477-478
ViSta
Rodolfo Castelló, Rym Mili, Ioannis G. Tollis
Lecture Notes in Computer Science 2265, 2002, pp. 481-482
GraphML progress report - Structural layer proposal
Ulrik Brandes, Markus Eiglsperger, Ivan Herman, Michael Himsolt, M. Scott Marshall
Lecture Notes in Computer Science 2265, 2002, pp. 501-512
Graph-drawing contest report
Therese Biedl, Franz J. Brandenburg
Lecture Notes in Computer Science 2265, 2002, pp. 513-521

Seiten < 1 2 3 4 5 6 7 8 9 10 11 12