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: Journal=Discrete Appl.~Math. AND Volume=27
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Applications of generalized matrix searching to geometric algorithms
Alok Aggarwal
,
Maria Klawe
Discrete Applied Mathematics
27
, 1990, pp. 3-23
Universal sequences for complete graphs
N. Alon
,
Y. Azar
,
Y. Ravid
Discrete Applied Mathematics
27
, 1990, pp. 25-28
Simplified existence theorems for
(g,f)
-factors
R.P. Anstee
Discrete Applied Mathematics
27
, 1990, pp. 29-38
Algorithms for high dimensional stabbing problems
David Avis
,
Mike Doskas
Discrete Applied Mathematics
27
, 1990, pp. 39-48
Parallel selection
Yossi Azar
,
Nicholas Pippenger
Discrete Applied Mathematics
27
, 1990, pp. 49-58
The complexity of regular subgraph recognition
F. Cheah
,
D.G. Corneil
Discrete Applied Mathematics
27
, 1990, pp. 59-68
Parallel algorithms for fractional and maximal independent sets in planar graphs
N. Dadoun
,
D.G. Kirkpatrick
Discrete Applied Mathematics
27
, 1990, pp. 69-83
Completely separable graphs
Peter L. Hammer
,
Frédéric Maffray
Discrete Applied Mathematics
27
, 1990, pp. 85-99
Probabilistic single processor scheduling
Janelle J. Harms
,
Charles J. Colbourn
Discrete Applied Mathematics
27
, 1990, pp. 101-112
Sparsest cuts and bottlenecks in graphs
David W. Matula
,
Farhad Shahrokhi
Discrete Applied Mathematics
27
, 1990, pp. 113-123
Multicommodity flows in certain planar directed networks
Hiroshi Nagamochi
,
Toshihide Ibaraki
Discrete Applied Mathematics
27
, 1990, pp. 125-145
Representing orders on the plane by translating points and lines
Richard Nowakowski
,
Ivan Rival
,
Jorge Urrutia
Discrete Applied Mathematics
27
, 1990, pp. 147-156
Edge-disjoint paths in a grid bounded by two nested rectangles
Hitoshi Suzuki
,
Akira Ishiguro
,
Takao Nishizeki
Discrete Applied Mathematics
27
, 1990, pp. 157-178
Mean distance in a tree
Peter Winkler
Discrete Applied Mathematics
27
, 1990, pp. 179-185
Linear recursion properties of uncorrelated binary sequences
A.J. Bromfield
,
F.C. Piper
Discrete Applied Mathematics
27
, 1990, pp. 187-193
On the computational complexity of upper fractional domination
Grant A. Cheston
,
G. Fricke
,
S.T. Hedetniemi
,
D. Pokrass Jacobs
Discrete Applied Mathematics
27
, 1990, pp. 195-207
van Lier sequences
Peter C. Fishburn
,
Fred S. Roberts
,
Helen M. Marcus-Roberts
Discrete Applied Mathematics
27
, 1990, pp. 209-220
Principal structure of layered mixed matrices
Kazuo Murota
Discrete Applied Mathematics
27
, 1990, pp. 221-234
The discrete moment problem and linear programming
András Prékopa
Discrete Applied Mathematics
27
, 1990, pp. 235-254
Design of a
d
-connected digraph with a minimum number of edges and a quasiminimal diameter
Terunao Soneoka
,
Hiroshi Nakada
,
Makoto Imase
Discrete Applied Mathematics
27
, 1990, pp. 255-265
Efficient algorithms for path partitions
Craig Williams
,
Dana Richards
Discrete Applied Mathematics
27
, 1990, pp. 267-276
Subset-sum problems with different summands: Computation
Mark Chaimovich
Discrete Applied Mathematics
27
, 1990, pp. 277-282
Computing the binding number of a graph
William H. Cunningham
Discrete Applied Mathematics
27
, 1990, pp. 283-285
Fractional total colouring
Jennifer Ryan
Discrete Applied Mathematics
27
, 1990, pp. 287-292