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
[2]
Hilfe
Suche: Booktitle=Proceedings of the International Workshop on Graphtheoretic Concepts in Computer Science, WG'84 (Berlin, F.R. Germany, June 13-15, 1984)
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A graph theoretic approach to aestetic layout for information systems diagrams
C. Batini
,
E. Nardelli
,
M. Talamo
,
R. Tamassia
Applied Computer Science
, 1984, pp. 9-18
Uniform emulations of the shuffle-exchange network
H.L. Bodlaender
,
J. van Leeuwen
Applied Computer Science
, 1984, pp. 19-28
Graph-theoretical tools for dynamically und flexibly reorganizing large organizations
H.-D. Bremer
,
H.F. Wedde
Applied Computer Science
, 1984, pp. 29-57
The cardinality matching problem - A state of the art tutorial
U. Derigs
Applied Computer Science
, 1984, pp. 58-78
Bisimplicial edges, Gaussian elimination and matchings in bipartite graphs
U. Derigs
,
O. Goecke
,
R. Schrader
Applied Computer Science
, 1984, pp. 79-87
Ham-sandwich theorems applied to intrsection problems
D.P. Dobkin
,
H. Edelsbrunner
Applied Computer Science
, 1984, pp. 88-99
A graph grammar providing a predicate transition net semantic for CSP-80
W. Dolezol
,
Th. Schübel
,
J. Triebel
,
G. Wirtz
Applied Computer Science
, 1984, pp. 100-124
Storing static tries
K.P. Dürre
Applied Computer Science
, 1984, pp. 125-135
Comparibility graphs and order invariants
U. Faigle
,
R. Schrader
Applied Computer Science
, 1984, pp. 136-145
Some bounds for stochastic network flow problems
U. Finke
,
H.W. Hamacher
Applied Computer Science
, 1984, pp. 146-160
Implementation of attributed graph-grammars
H. Göttler
Applied Computer Science
, 1984, pp. 161-173
Implementation of algorithms for telecommunication network planning
K.-D. Hackbarth
Applied Computer Science
, 1984, pp. 174-188
Processes on Petri nets and graph grammars
H.-J. Kreowski
,
A. Wilharm
Applied Computer Science
, 1984, pp. 189-200
Ordered edge colorings of weighted multigraphs
M. Kubale
Applied Computer Science
, 1984, pp. 201-212
Tearing down and building up a data network
P. Läuchli
Applied Computer Science
, 1984, pp. 213-214
Reliability of probabilistic algorithms and their implementation
C. Lautemann
,
B. Mahr
Applied Computer Science
, 1984, pp. 215-223
A formal specification language for software systems defined by graph grammars
C. Lewerentz
,
M. Nagl
Applied Computer Science
, 1984, pp. 224-241
Syntax-controlled specification of process structures using process nets
H. Lorenz
,
J. Perl
Applied Computer Science
, 1984, pp. 242-248
A decomposition method for network design with multi-commodity non-simultaneous flows
M. Lucertini
,
G. Paletta
Applied Computer Science
, 1984, pp. 249-258
A refined analysis of AVL-trees
Kurt Mehlhorn
,
A. Tsakalidis
Applied Computer Science
, 1984, pp. 259-277
The graphs which correspond to pathgenerated digital metrics
R.A. Melter
,
I. Tomescu
Applied Computer Science
, 1984, pp. 278-288
The statistic time complexity of hereditary graph properties
H. Müller
Applied Computer Science
, 1984, pp. 289-300
Storing paths in kth shortest path problems
A. Perko
Applied Computer Science
, 1984, pp. 301-306
On alpha-acyclic BCNF-decompositions of relational database schemes
D. Ruland
Applied Computer Science
, 1984, pp. 307-326
Some remarks concerning the complexity of sorting searching in an orthogonal memory
H.-J. Schneider
Applied Computer Science
, 1984, pp. 327-334
Seiten 1
2
>