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=1998

• A generalization of resource-bounded measure, with an application
  Harry Buhrman, Dieter van Melkebeek, Kenneth W. Regan, D. Sivakumar, Martin Strauss
  Lecture Notes in Computer Science 1373, 1998, pp. 161-171
• The complexity of modular graph automorphism
  V. Arvind, R. Beigel, A. Lozano
  Lecture Notes in Computer Science 1373, 1998, pp. 172-182
• On the structure of Valiant's complexity classes
  Peter Bürgisser
  Lecture Notes in Computer Science 1373, 1998, pp. 194-204
• Equivalence test and ordering transformation for parity-OBDDs of different variable ordering
  Jan Behrens, Stephan Waack
  Lecture Notes in Computer Science 1373, 1998, pp. 227-237
• On the approximation of finding a(nother) Hamiltonian cycle in cubic Hamiltonian graphs
  Cristina Bazgan, Miklos Santha, Zsolt Tuza
  Lecture Notes in Computer Science 1373, 1998, pp. 276-286
• Massaging a linear programming solution to give a 2-approximation for a generalization of the vertex cover problem
  Nader H. Bshouty, Lynn Burroughs
  Lecture Notes in Computer Science 1373, 1998, pp. 298-308
• Communication-efficient deterministic parallel algorithms for planar point location and 2d Voronoi diagram
  Mohamadou Diallo, Afonso Ferreira, Andrew Rau-Chaplin
  Lecture Notes in Computer Science 1373, 1998, pp. 399-409
• Optimal broadcasting in almost trees and partial k-trees
  Anders Dessmark, Andrzej Lingas, Hans Olsson, Hiroaki Yamamoto
  Lecture Notes in Computer Science 1373, 1998, pp. 432-443
• Cell flipping in permutation diagrams
  Martin Charles Columbic, Haim Kaplan
  Lecture Notes in Computer Science 1373, 1998, pp. 577-586
• Recursively enumerable reals and Chaitin \Omega numbers
  Cristian S. Calude, Peter H. Hertling, Bakhadyr Khoussainov, Yongge Wang
  Lecture Notes in Computer Science 1373, 1998, pp. 596-606
• Introduction to randomized algorithms
  Artur Andrzejak
  Lecture Notes in Computer Science 1367, 1998, pp. 29-39
• On embedding an outer-planar graph in a point set
  Prosenjit Bose
  Lecture Notes in Computer Science 1353, 1998, pp. 25-36
• On three-dimensional layout of interconnection networks
  Tiziana Calamoneri, Annalisa Massini
  Lecture Notes in Computer Science 1353, 1998, pp. 64-75
• Orthogonal 3-D graph drawing
  T. Biedl, T. Shermer, S. Whitesides, S. Wismath
  Lecture Notes in Computer Science 1353, 1998, pp. 76-86
• Graph clustering I: Cycles of cliques
  F.J. Brandenburg
  Lecture Notes in Computer Science 1353, 1998, pp. 158-168
• A Bayesian paradigm for dynamic graph layout
  Ulrik Brandes, Dorothea Wagner
  Lecture Notes in Computer Science 1353, 1998, pp. 236-247
• Implementing a general-purpose edge router
  David P. Dobkin, Emden R. Gansner, Eleftherios Koutsofios, Stephen C. North
  Lecture Notes in Computer Science 1353, 1998, pp. 262-271
• InteractiveGiotto: An algorithm for interactive orthogonal graph drawing
  Stina S. Bridgeman, Jody Fanto, Ashim Garg, Roberto Tamassia, Luca Vismara
  Lecture Notes in Computer Science 1353, 1998, pp. 303-308
• GRID: An interactive tool for computing orthogonal drawings with the minimum numer of bends
  Walter Didimo, Antonio Leonforte
  Lecture Notes in Computer Science 1353, 1998, pp. 309-315
• Desigh gallery browsers based on 2D and 3D graph drawing
  Brad Andalman, Kathy Ryall, Wheeler Ruml, Joe Marks, Stuart Shieber
  Lecture Notes in Computer Science 1353, 1998, pp. 322-329
• Grappa: A GRAPh PAckage in Java
  Naser S. Barghouti, John M. Mocenigo, Wenke Lee
  Lecture Notes in Computer Science 1353, 1998, pp. 336-343
• Discrete realizations of contact and intersection graphs
  Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Jorge Urrutia
  Lecture Notes in Computer Science 1353, 1998, pp. 359-370
• Minimum-area h-v drawings of complete binary trees
  P. Crescenzi, P. Penna
  Lecture Notes in Computer Science 1353, 1998, pp. 371-382
• The three-phase method: A unified approach to orthogonal graph drawing
  Therese C. Biedl, Brendan P. Madden, Ioannis G. Tollis
  Lecture Notes in Computer Science 1353, 1998, pp. 391-402
• Graph drawing and manipulation with LINK
  Jonathan Berry, Nathaniel Dean, Mark Goldberg, Gregory Shannon, Steven Skiena
  Lecture Notes in Computer Science 1353, 1998, pp. 425-437