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: Booktitle=Proceedings of the 11th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'85 (Schlo{\ss} Schwanberg, W{\"u}rzburg, Germany, June 18-21, 1985)
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Efficient solutions to a class of placement problems
Mikhail J. Atallah
,
Susanne E. Hambrusch
Applied Computer Science
, 1985, pp. 11-21
Some remarks on the
m
-machine unit time scheduling problem
M. Bartusch
,
R.H. Möhring
,
F.J. Radermacher
Applied Computer Science
, 1985, pp. 23-26
Parametric programming and circulation problems with one additional linear constraint
P. Brucker
Applied Computer Science
, 1985, pp. 27-41
Solving geometric problems on mesh-connected and one dimensional processor arrays
F. Dehne
Applied Computer Science
, 1985, pp. 43-59
COMES - Computer aided music composition
Chr. Draeger
,
R. Sturm
,
F. Wankmüller
Applied Computer Science
, 1985, pp. 61-72
Graph implementation of a functional language
Jürgen Ebert
Applied Computer Science
, 1985, pp. 73-84
A location problem with minimax objective
H.A. Eiselt
Applied Computer Science
, 1985, pp. 85-99
Setup minimization techniques for comparability graphs
U. Faigle
,
R. Schrader
Applied Computer Science
, 1985, pp. 101-117
Attributed graph-grammars & composition-nets (joining two concepts for handling diagrams)
Herbert Göttler
,
Ewa Grabska
Applied Computer Science
, 1985, pp. 119-130
Aliasing in PASCAL-like programming languages
P. Kandzia
Applied Computer Science
, 1985, pp. 131-142
Transitive orientation of graphs with side constraints
N. Korte
,
R.H. Möhring
Applied Computer Science
, 1985, pp. 143-160
Solving conflicts in graph grammar derivation processes
Hans-Jörg Kreowski
,
Anne Wilharm
Applied Computer Science
, 1985, pp. 161-179
Growth functions and syntactic inference of deterministic graph OL systems
Kamala Krithivasan
,
S. Kalavathi
,
Anindya Das
Applied Computer Science
, 1985, pp. 181-190
Single successor context-free graph grammar and application to flowchart compilation
Kamala Krithivasan
,
Usha B. Menon
Applied Computer Science
, 1985, pp. 191-200
Efficient solution of biconnectivity problems on hierarchically defined graphs
T. Lengauer
Applied Computer Science
, 1985, pp. 201-215
Subgraph isomorphism for easily separable graphs of bounded valence
Andrzej Lingas
Applied Computer Science
, 1985, pp. 217-229
Optimizing the compression of grids into grids
Fillia Makedon
,
Paul Spirakis
,
Stathis Zachos
Applied Computer Science
, 1985, pp. 231-248
Fast selection on paracomputers
Ernst W. Mayr
Applied Computer Science
, 1985, pp. 249-254
Optimal algorithms for square matrix product on rectangular arrays
L. Melkemi
,
M. Tchuente
Applied Computer Science
, 1985, pp. 255-266
Net representation for take-grant protection model
E. Montonen
,
L. Ojala
,
T. Tuuliniemi
Applied Computer Science
, 1985, pp. 267-279
Rastered point location
H. Müller
Applied Computer Science
, 1985, pp. 281-293
Range searching on a grid
Mark H. Overmars
Applied Computer Science
, 1985, pp. 295-305
Use of a closure operator to partially order domains of objects
John L. Pfaltz
Applied Computer Science
, 1985, pp. 307-320
A consistency model for nonstandard database applications
Detlev Ruland
Applied Computer Science
, 1985, pp. 321-335
On the complexity of distributed elections in synchronous graphs
Nicola Santoro
,
Doron Rotem
Applied Computer Science
, 1985, pp. 337-346
Seiten 1
2
>