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=39
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Solving the Euclidean bottleneck biconnected edge subgraph problem by 2-relative neighborhood graphs
M.S. Chang
,
C.Y. Tang
,
R.C.T. Lee
Discrete Applied Mathematics
39
, 1992, pp. 1-12
Fast detection and display of symmetry in outerplanar graphs
Joseph Manning
,
Mikhail J. Atallah
Discrete Applied Mathematics
39
, 1992, pp. 13-35
Paroids: A canonical format for combinatorial optimization
Ronald L. Rardin
,
Moises Sudit
Discrete Applied Mathematics
39
, 1992, pp. 37-56
Random walks with absorbing points
Louis Shapiro
Discrete Applied Mathematics
39
, 1992, pp. 57-67
Structural properties of matroid matchings
John H. Vande Vate
Discrete Applied Mathematics
39
, 1992, pp. 69-85
Generalized vertex covering in interval graphs
Madhav V. Marathe
,
R. Ravi
,
C. Pandu Rangan
Discrete Applied Mathematics
39
, 1992, pp. 87-93
Games, equations and dot-depth two monoids
F. Blanchet-Sadri
Discrete Applied Mathematics
39
, 1992, pp. 99-111
The complexity of lifted inequalities for the knapsack problem
David Hartvigsen
,
Eitan Zemel
Discrete Applied Mathematics
39
, 1992, pp. 113-123
Measure theoretic approach to the classification of cellular automata
Shin'ichirou Ishii
Discrete Applied Mathematics
39
, 1992, pp. 125-136
One-story buildings as tensegrity frameworks III
András Recski
,
Werner Schwärzler
Discrete Applied Mathematics
39
, 1992, pp. 137-146
Minimum perfect bipartite matchings and spanning trees under categorization
Michael B. Richey
,
Abraham P. Punnen
Discrete Applied Mathematics
39
, 1992, pp. 147-153
Generating bent sequences
C.M. Adams
,
S.E. Tavares
Discrete Applied Mathematics
39
, 1992, pp. 155-159
Communication complexity of two decision problems
Anders Björner
,
Johan Karlander
,
Bernt Lindström
Discrete Applied Mathematics
39
, 1992, pp. 161-163
Hamiltonian cycle is polynomial on cocomparability graphs
Jitender S. Deogun
,
George Steiner
Discrete Applied Mathematics
39
, 1992, pp. 165-172
Correlation in partially ordered sets
Peter C. Fishburn
Discrete Applied Mathematics
39
, 1992, pp. 173-191
Openshop scheduling with machine dependent processing times
Moshe Dror
Discrete Applied Mathematics
39
, 1992, pp. 197-205
Birthday paradox, coupon collectors, caching algorithms and self-organizing search
Philippe Flajolet
,
Danièle Gardy
,
Loÿs Thimonier
Discrete Applied Mathematics
39
, 1992, pp. 207-229
The capacity of the subarray partial concentrators
F.K. Hwang
,
G.W. Richards
Discrete Applied Mathematics
39
, 1992, pp. 231-240
Characterizations of max-balanced flows
Uriel G. Rothblum
,
Hans Schneider
,
Michael H. Schneider
Discrete Applied Mathematics
39
, 1992, pp. 241-261
P_4
-trees and substitution decomposition
Jeremy Spinrad
Discrete Applied Mathematics
39
, 1992, pp. 263-291
Strong elimination ordering of the total graph of a tree
J. Ales̆
,
R. Bac̆ik
Discrete Applied Mathematics
39
, 1992, pp. 293-295