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 YEAR=1999

• On the undecidability of some sub-classical first-order logics
  Matthias Baaz, Agata Ciabattoni, Christian Fermüller, Helmut Veith
  Lecture Notes in Computer Science 1738, 1999, pp. 258-268
• A high girth graph construction and a lower bound for hitting set size for combinatorial rectangles
  L. Sunil Chandran
  Lecture Notes in Computer Science 1738, 1999, pp. 283-290
• The receptive distributed \pi-calculus
  Roberto M. Amadio, Gérard Boudol, Cédric Lhoussaine
  Lecture Notes in Computer Science 1738, 1999, pp. 304-315
• Graded modalities and resource bisimulation
  Flavio Corradini, Rocco de Nicola, Anna Labella
  Lecture Notes in Computer Science 1738, 1999, pp. 381-393
• The TUM PCI/SCI adapter
  Georg Acher, Wolfgang Karl, Markus Leberecht
  Lecture Notes in Computer Science 1734, 1999, pp. 89-101
• Affordable scalability using multi-cubes
  Håkon Bugge, Knut Omang
  Lecture Notes in Computer Science 1734, 1999, pp. 167-175
• Interfacaing SCI device drivers to Linux
  Roger Butenuth, Hans-Ulrich Heiss
  Lecture Notes in Computer Science 1734, 1999, pp. 179-190
• SCI prototyping for the second level trigger system of the ATLAS experiment
  A. Belias, A. Bogaerts, D. Botterill, J. Dawson, E. Denes, F. Giacomini, R. Hauser, C. Hortnagl, R. Hughes-Jones, S. Kolya, D. Mercer, R. Middleton, J. Schlereth, P. Werner, F. Wickens
  Lecture Notes in Computer Science 1734, 1999, pp. 397-414
• Multi-user system management on SCI clusters
  Matthias Brune, Axel Keller, Alexander Reinefeld
  Lecture Notes in Computer Science 1734, 1999, pp. 443-461
• Turn-regularity and planar orthogonal drawings
  Stina S. Bridgeman, Giuseppe di Battista, Walter Didimo, Giuseppe Liotta, Roberto Tamassia, Luca Vismara
  Lecture Notes in Computer Science 1731, 1999, pp. 8-26
• Fully dynamic 3-dimensional orthogonal graph drawing
  M. Closson, S. Gartshore, J. Johansen, S.K. Wismath
  Lecture Notes in Computer Science 1731, 1999, pp. 49-58
• Partitioning approach to visualization of large graphs
  Vladimir Batagelj, Andrej Mrvar, Matjaz̆ Zavers̆nik
  Lecture Notes in Computer Science 1731, 1999, pp. 90-97
• Drawing planar graphs with circular arcs
  C.C. Cheng, C.A. Duncan, M.T. Goodrich, S.G. Kobourov
  Lecture Notes in Computer Science 1731, 1999, pp. 117-126
• An algorithm for drawing compound graphs
  François Bertault, Mirka Miller
  Lecture Notes in Computer Science 1731, 1999, pp. 197-204
• Visualizing algorithms for the design and analysis of survivable networks
  Ala Eddine Barouni, Ali Jaoua, Nejib Zaguia
  Lecture Notes in Computer Science 1731, 1999, pp. 232-241
• LayoutShow: A signed applet/application for graph drawing and experimentation - System demonstration
  Lila Behzadi
  Lecture Notes in Computer Science 1731, 1999, pp. 242-249
• Centrality in policy network drawings
  Ulrik Brandes, Patrick Kenis, Dorothea Wagner
  Lecture Notes in Computer Science 1731, 1999, pp. 250-258
• Straight-line drawings of protein interactions - System demonstration
  Wojciech Basalaj, Karen Eilbeck
  Lecture Notes in Computer Science 1731, 1999, pp. 259-266
• Isomorphic subgraphs
  Sabine Bachl
  Lecture Notes in Computer Science 1731, 1999, pp. 286-296
• Visibility representations of complete graphs
  Robert Babilon, Helena Nyklová, Ondȓej Pangrác, Jan Vondrák
  Lecture Notes in Computer Science 1731, 1999, pp. 333-340
• A force-directed algorithm that preserves edge crossing properties
  François Bertault
  Lecture Notes in Computer Science 1731, 1999, pp. 351-358
• Rectangle of influence drawings of graphs without filled 3-cycles
  Therese Biedl, Anna Bretscher, Henk Meijer
  Lecture Notes in Computer Science 1731, 1999, pp. 359-368
• Infinite trees and the future
  Camil Demetrescu, Giuseppe di Battista, Irene Finocchi, Giuseppe Liotta, Maurizio Patrignani, Maurizio Pizzonia
  Lecture Notes in Computer Science 1731, 1999, pp. 379-391
• Graph-drawing contest report
  Franz J. Brandenburg, Michael Jünger, Joe Marks, Petra Mutzel, Falk Schreiber
  Lecture Notes in Computer Science 1731, 1999, pp. 400-409
• Hunting down graph B
  Ulrik Brandes
  Lecture Notes in Computer Science 1731, 1999, pp. 410-415