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=41
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Search and sweep numbers of finite directed acyclic graphs
Richard J. Nowakowski
Discrete Applied Mathematics
41
, 1993, pp. 1-11
Recognizing hidden bicircular networks
Randy Shull
,
Alan Shuchat
,
James B. Orlin
,
Marianne Lepp
Discrete Applied Mathematics
41
, 1993, pp. 13-53
Coloring drawings of bipartite graphs: A problem in automated assembly
F.W. Sinden
Discrete Applied Mathematics
41
, 1993, pp. 55-68
Generalization of a theorem on the parametric maximum flow problem
Tadashi Arai
,
Shuichi Ueno
,
Yoji Kajitani
Discrete Applied Mathematics
41
, 1993, pp. 69-74
Fast algorithms for finding Hamiltonian paths and cycles in in-tournament digraphs
Jrgen Bang-Jensen
,
Pavol Hell
Discrete Applied Mathematics
41
, 1993, pp. 75-79
Rational and affine expressions for image description
Karel Culik II
,
Simant Dube
Discrete Applied Mathematics
41
, 1993, pp. 85-120
Stability number of bull- and chair-free graphs
Caterina de Simone
,
Antonio Sassano
Discrete Applied Mathematics
41
, 1993, pp. 121-129
Errata to ``Selecting the top three elements'' by M. Aigner: A result of a computer-assisted proof search
Jutta Eusterbrock
Discrete Applied Mathematics
41
, 1993, pp. 131-137
On polynomial solvability of the high multiplicity total weighted tardiness problem
Frieda Granot
,
Jadranka Skorin-Kapov
Discrete Applied Mathematics
41
, 1993, pp. 139-146
General vertex disjoint paths in series-parallel graphs
Ephraim Korach
,
Ady Tal
Discrete Applied Mathematics
41
, 1993, pp. 147-164
Probability of diameter two for Steinhaus graphs
Neal Brand
,
Stephen Curran
,
Sajal Das
,
Tom Jacob
Discrete Applied Mathematics
41
, 1993, pp. 165-171
A simple proof of Liang's lower bound for on-line bin packing and the extension to the parametric case
B. Galambos
,
J.B.G. Frenk
Discrete Applied Mathematics
41
, 1993, pp. 173-178
Polyhedral results for the precedence-constrained knapsack problem
E. Andrew Boyd
Discrete Applied Mathematics
41
, 1993, pp. 185-201
On the occurrence of null clauses in random instances of satisfiability
John Franco
Discrete Applied Mathematics
41
, 1993, pp. 203-209
Capacitated two-parallel machines scheduling to minimize sum of job completion times
Chung-Yee Lee
,
Surya Danusaputro Liman
Discrete Applied Mathematics
41
, 1993, pp. 211-222
Balance, uncorrelatedness and the strict avalanche criterion
Sheelagh Lloyd
Discrete Applied Mathematics
41
, 1993, pp. 223-233
The optimal unicyclic graphs for pair-connected reliability
Kyle T. Siegrist
,
Ashok T. Amin
,
Peter J. Slater
Discrete Applied Mathematics
41
, 1993, pp. 235-243
Distributions on bicoloured binary trees arising from the principle of parsimony
M.A. Steel
Discrete Applied Mathematics
41
, 1993, pp. 245-261
The chromatic difference sequence of the Cartesian product of graphs: Part II
Huishan Zhou
Discrete Applied Mathematics
41
, 1993, pp. 263-267
Dating to marriage
J. Csima
,
L. Lovász
Discrete Applied Mathematics
41
, 1993, pp. 269-270
Simple reductions between
D0L
language and sequence equivalence problems
Arto Salomaa
Discrete Applied Mathematics
41
, 1993, pp. 271-274