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

• Computing labeled orthogonal drawings
  Carla Binucci, Walter Didimo, Giuseppe Liotta, Maddalena Nonato
  Lecture Notes in Computer Science 2528, 2002, pp. 66-73
• Computing and drawing isomorphic subgraphs
  Sabine Bachl, Franz-Josef Brandenburg
  Lecture Notes in Computer Science 2528, 2002, pp. 74-85
• A group-theoretic method for drawing graphs symmetrically
  David Abelson, Seok-Hee Hong, Donald E. Taylor
  Lecture Notes in Computer Science 2528, 2002, pp. 86-97
• Simple and efficient bilayer cross counting
  Wilhelm Barth, Michael Jünger, Petra Mutzel
  Lecture Notes in Computer Science 2528, 2002, pp. 130-141
• Compact encodings of planar orthogonal drawings
  Amrita Chanda, Ashim Garg
  Lecture Notes in Computer Science 2528, 2002, pp. 174-185
• Drawing directed graphs using one-dimensional optimization
  Liran Carmel, David Harel, Yehuda Koren
  Lecture Notes in Computer Science 2528, 2002, pp. 193-206
• Some applications of orderly spanning trees in graph drawing
  Ho-Lin Chen, Chien-Chih Liao, Hsueh-I Lu, Hsu-Chun Yen
  Lecture Notes in Computer Science 2528, 2002, pp. 332-343
• Improving Walker's algorithm to run in linear time
  Christoph Buchheim, Michael Jünger, Sebastian Leipert
  Lecture Notes in Computer Science 2528, 2002, pp. 344-353
• Semi-dynamic orthogonal drawings of planar graphs
  Walter Bachl
  Lecture Notes in Computer Science 2528, 2002, pp. 354-361
• Graph layout for workflow applications with ILOG JViews
  Gilles Diguglielmo, Eric Durocher, Philippe Kaplan, Georg Sander, Adrian Vasiliu
  Lecture Notes in Computer Science 2528, 2002, pp. 362-363
• Some modifications of Sugiyama approach
  Danil E. Baburin
  Lecture Notes in Computer Science 2528, 2002, pp. 366-367
• A framework for complexity management in graph visualization
  Ugur Dogrusoz, Burkay Genc
  Lecture Notes in Computer Science 2528, 2002, pp. 368-369
• A partitioned approach to protein interaction mapping
  Yanga Byun, Euna Jeong, Kyungsook Han
  Lecture Notes in Computer Science 2528, 2002, pp. 370-371
• Graph-drawing contest report
  Franz J. Brandenburg
  Lecture Notes in Computer Science 2528, 2002, pp. 376-379
• Techniques for interactive graph drawing
  James Arvo
  Lecture Notes in Computer Science 2528, 2002, pp. 380-380
• Biased skip lists
  Amitabha Bagchi, Adam L. Buchsbaum, Michael T. Goodrich
  Lecture Notes in Computer Science 2518, 2002, pp. 1-13
• On the clique-width of graphs in hereditary classes
  Rodica Boliac, Vadim Lozin
  Lecture Notes in Computer Science 2518, 2002, pp. 44-54
• The probability of a rendezvous is minimal in complete graphs
  Martin Dietzfelbinger
  Lecture Notes in Computer Science 2518, 2002, pp. 55-66
• On the minimum volume of a perturbed unit cube
  Jin-Yi Cai
  Lecture Notes in Computer Science 2518, 2002, pp. 67-78
• On the emptiness problem for two-way NFA with one reversal-bounded counter
  Zhe Dang, Oscar H. Ibarra, Zhi-Wei Sun
  Lecture Notes in Computer Science 2518, 2002, pp. 103-114
• Some remarks on the L-conjecture
  Qi Cheng
  Lecture Notes in Computer Science 2518, 2002, pp. 128-136
• Tree spanners on chordal graphs: Complexity, algorithms, open problems
  A. Brandstädt, F.F. Dragan, H.-O. Le, V.B. Le
  Lecture Notes in Computer Science 2518, 2002, pp. 163-174
• Improved approximation algorithms for Max-2SAT with cardinality constraint
  Markus Bläser, Bodo Manthey
  Lecture Notes in Computer Science 2518, 2002, pp. 187-198
• Funnel heap - A cache oblivious priority queue
  Gerth Stlting Brodal, Rolf Fagerberg
  Lecture Notes in Computer Science 2518, 2002, pp. 219-228
• Exponential speedup of fixed-parameter algorithms on K_{3,3}-minor-free or K_5-minor-free graphs
  Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
  Lecture Notes in Computer Science 2518, 2002, pp. 262-273