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=73
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A decision method for Parikh slenderness of context-free languages
Juha Honkala
Discrete Applied Mathematics
73
(1), 1997, pp. 1-4
The rotation graphs of perfect matchings of plane bipartite graphs
Haping Zhang
,
Fuji Zhang
Discrete Applied Mathematics
73
(1), 1997, pp. 5-12
Preserving approximation in the Min-Weighted Set Cover Problem
Giorgio Gambosi
,
Marco Protasi
,
Maurizio Talamo
Discrete Applied Mathematics
73
(1), 1997, pp. 13-22
A note on approximate inclusion-exclusion
Avraham A. Melkman
,
Solomon E. Shimony
Discrete Applied Mathematics
73
(1), 1997, pp. 23-26
A linear-time algorithm for computing the intersection of all odd cycles in a graph
Leizhen Cai
,
Baruch Schieber
Discrete Applied Mathematics
73
(1), 1997, pp. 27-34
Directed rectangle-visibility graphs have unbounded dimension
Kathleen Romanik
Discrete Applied Mathematics
73
(1), 1997, pp. 35-39
Nondegenerate functions and permutations
Luke O'Connor
Discrete Applied Mathematics
73
(1), 1997, pp. 41-57
On the number of spanning trees and Eulerian tours in iterated line digraphs
Zhang Huaxiao
,
Zhang Fuji
,
Huang Qiongxiang
Discrete Applied Mathematics
73
(1), 1997, pp. 59-67
Random walks and electrical resistances in products of graphs
Béla Bollobás
,
Grahm Brightwell
Discrete Applied Mathematics
73
(1), 1997, pp. 69-79
Resolution search
V. Chvátal
Discrete Applied Mathematics
73
(1), 1997, pp. 81-99
The Wiener number of the hexagonal net
W.C. Shiu
,
Peter C.B. Lam
Discrete Applied Mathematics
73
(2), 1997, pp. 101-111
From ternary strings to Wiener indices of benzenoid chains
Wen-Chung Huang
,
Bo-Yin Yang
,
Yeong-Nan Yeh
Discrete Applied Mathematics
73
(2), 1997, pp. 113-131
On bandwidth for the tensor product of paths and cycles
Yung-Ling Lai
,
Kenneth Williams
Discrete Applied Mathematics
73
(2), 1997, pp. 133-141
Bond graphs II: Causality and singularity
J.D. Lamb
,
D.R. Woodall
,
G.M. Asher
Discrete Applied Mathematics
73
(2), 1997, pp. 143-173
Peakless functions on graphs
Victor Chepoi
Discrete Applied Mathematics
73
(2), 1997, pp. 175-189
Meyniel weakly triangulated graphs - I: Co-perfect orderability
Ryan B. Hayward
Discrete Applied Mathematics
73
(3), 1997, pp. 199-210
Bond graphs III: Bond graphs and electrical networks
J.D. Lamb
,
G.M. Asher
,
D.R. Woodall
Discrete Applied Mathematics
73
(3), 1997, pp. 211-250
An efficient algorithm for the knight's tour problem
Ian Parberry
Discrete Applied Mathematics
73
(3), 1997, pp. 251-260
A cost-scaling algorithm for 0-1 submodular flows
Maiko Shigeno
,
Satoru Iwata
Discrete Applied Mathematics
73
(3), 1997, pp. 261-273
A note on the number of perfect matchings of bipartite graphs
Fuji Zhang
,
Heping Zhang
Discrete Applied Mathematics
73
(3), 1997, pp. 275-282
Two machine openshop scheduling with machine-dependent processing times
Asoo J. Vakharia
,
Bülent Çatay
Discrete Applied Mathematics
73
(3), 1997, pp. 283-288
Note on complexity of computing the domination of binary systems
A.A. Chernyak
,
Zh.A. Chernyak
Discrete Applied Mathematics
73
(3), 1997, pp. 289-295