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=44
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Absolute reflexive retracts and absolute bipartite retracts
Hans-Jürgen Bandelt
,
Martin Farber
,
Pavol Hell
Discrete Applied Mathematics
44
(1-3), 1993, pp. 9-20
Monge and feasibility sequences in general flow problems
Ilan Adler
,
Alan J. Hoffman
,
Ron Shamir
Discrete Applied Mathematics
44
(1-3), 1993, pp. 21-38
Independence and domination in polygon graphs
Ehab S. Elmallah
,
Lorna K. Stewart
Discrete Applied Mathematics
44
(1-3), 1993, pp. 65-77
Irredundancy in circular arc graphs
Martin Charles Golumbic
,
Renu C. Laskar
Discrete Applied Mathematics
44
(1-3), 1993, pp. 79-89
A note on graphs which have upper irredundance equal to independence
Michael S. Jacobson
,
Kenneth Peters
Discrete Applied Mathematics
44
(1-3), 1993, pp. 91-97
Efficient sets in graphs
P.J. Bernhard
,
S.T. Hedetniemi
,
D.P. Jacobs
Discrete Applied Mathematics
44
(1-3), 1993, pp. 99-108
Efficient sets in partial
k
-trees
Jan Arne Telle
,
Andrzej Proskurowski
Discrete Applied Mathematics
44
(1-3), 1993, pp. 109-117
The efficiency of AC graphs
Jean R.S. Blair
Discrete Applied Mathematics
44
(1-3), 1993, pp. 119-138
On the SPANNING
k
-TREE problem
Leizhen Cai
,
Frédéric Maffray
Discrete Applied Mathematics
44
(1-3), 1993, pp. 139-156
Bounded discrete representations of interval orders
Garth Isaak
Discrete Applied Mathematics
44
(1-3), 1993, pp. 157-183
A linear algorithm for the group path problem on chordal graphs
Srinivasa R. Arikati
,
Uri N. Peled
Discrete Applied Mathematics
44
(1-3), 1993, pp. 185-190
\Phi
-treshold and
\Phi
-tolerance chain graphs
M.S. Jacobson
,
J. Lehel
,
L.M. Lesniak
Discrete Applied Mathematics
44
(1-3), 1993, pp. 191-203
Subtree and substar intersection numbers
Yi-Wu Chang
,
Michael S. Jacobson
,
Clyde L. Monma
,
Douglas B. West
Discrete Applied Mathematics
44
(1-3), 1993, pp. 205-220
Computing residual connectedness reliability for restricted networks
Charles J. Colbourn
,
A. Satyanarayana
,
C. Suffel
,
K. Sutner
Discrete Applied Mathematics
44
(1-3), 1993, pp. 221-232
On generalized perfect graphs: bounded degree and bounded edge perfection
Edward R. Scheinerman
,
Ann Trenk
Discrete Applied Mathematics
44
(1-3), 1993, pp. 233-245
Minimum vertex weighted deficiency of
(g,f)
-factors: A greedy algorithm
R.P. Anstee
Discrete Applied Mathematics
44
(1-3), 1993, pp. 247-260
Elementary sequences, sub-Fibonacci sequences
Peter C. Fishburn
,
Fred S. Roberts
Discrete Applied Mathematics
44
(1-3), 1993, pp. 261-281
Excluding induced subgraphs II: extremal graphs
H.J. Prömel
,
A. Steger
Discrete Applied Mathematics
44
(1-3), 1993, pp. 283-294
Extremal graphs domination insensitive to the removal of
k
edges
Teresa W. Haynes
,
Robert C. Brigham
,
Ronald D. Dutton
Discrete Applied Mathematics
44
(1-3), 1993, pp. 295-304
Covering the complete graph with plane cycles
Alan Hartman
,
Yoav Medan
Discrete Applied Mathematics
44
(1-3), 1993, pp. 305-310