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 YEAR=1994
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Recognition of
q
-Horn formulae in linear time
Endre Boros
,
Peter L. Hammer
,
Xiaorong Sun
Discrete Applied Mathematics
55
, 1994, pp. 1-13
Maximal path length of binary trees
Helen Cameron
,
Derick Wood
Discrete Applied Mathematics
55
, 1994, pp. 15-35
Isostatic bar and joint frameworks in the plane with irreducible pure conditions
Rudi Penne
Discrete Applied Mathematics
55
, 1994, pp. 37-57
On some geometric methods in scheduling theory: A survey
S.V. Sevast'janov
Discrete Applied Mathematics
55
, 1994, pp. 59-82
Some combinatorial properties of self-reading sequences
Gabriel Istrate
,
Gheorghe Pȃun
Discrete Applied Mathematics
55
, 1994, pp. 83-86
Graphs in which all Hamiltonian cycles have the same length
Stanislaw Kryński
Discrete Applied Mathematics
55
, 1994, pp. 87-89
Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem
Abraham P. Punnen
,
K.P.K. Nair
Discrete Applied Mathematics
55
, 1994, pp. 91-93
Broadcasting multiple messages in simultaneous send/receive systems
Amotz Bar-Noy
,
Shlomo Kipnis
Discrete Applied Mathematics
55
, 1994, pp. 95-105
On an optimization problem occurring in FMSs: A hypergraph-theoretical formulation
D. de Werra
Discrete Applied Mathematics
55
, 1994, pp. 107-111
On the equivalence of constrained and unconstrained flows
Antoine Gautier
,
Frieda Granot
Discrete Applied Mathematics
55
, 1994, pp. 113-132
Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
Chính T. Hoàng
Discrete Applied Mathematics
55
, 1994, pp. 133-143
Sensitivity analysis of list scheduling heuristics
A.W.J. Kolen
,
A.H.G. Rinnooy Kan
,
C.P.M. van Hoesel
,
A.P. Wagelmans
Discrete Applied Mathematics
55
, 1994, pp. 145-162
Geometric comparison of combinatorial polytopes
Jon Lee
,
Walter D., Jr. Morris
Discrete Applied Mathematics
55
, 1994, pp. 163-182
Maximum number of disjoint paths connecting specified terminals in a graph
Hananya Yinnone
Discrete Applied Mathematics
55
, 1994, pp. 183-195
Approximation algorithms for the geometric Covering Salesman Problem
Esther M. Arkin
,
Refael Hassin
Discrete Applied Mathematics
55
, 1994, pp. 197-218
Scheduling with incompatible jobs
Hans L. Bodlaender
,
Klaus Jansen
,
Gerhard J. Woeginger
Discrete Applied Mathematics
55
, 1994, pp. 219-232
An algorithm for an Eulerian trail traversing specified edges in given order
Mao-Cheng Cai
Discrete Applied Mathematics
55
, 1994, pp. 233-239
Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance
Grant A. Cheston
,
Gerd Fricke
Discrete Applied Mathematics
55
, 1994, pp. 241-258
Complexity of scheduling multiprocessor tasks with prespecified processor allocations
J.A. Hoogeveen
,
S.L. van de Velde
,
B. Veltman
Discrete Applied Mathematics
55
, 1994, pp. 259-272
The Copeland measure of Condorcet choice functions
G. Laffond
,
J.F. Laslier
,
M. Le Breton
Discrete Applied Mathematics
55
, 1994, pp. 273-279
A new exact algorithm for the solution of quadratic assignment problems
Thierry Mautor
,
Catherine Roucairol
Discrete Applied Mathematics
55
, 1994, pp. 281-293
k
-connectivity and decomposition of graphs into forests
Takao Nishizeki
,
Svatopluk Poljak
Discrete Applied Mathematics
55
, 1994, pp. 295-301
Stable matchings and linear inequalities
Hernán G. Abeledo
,
Uriel G. Rothblum
Discrete Applied Mathematics
54
, 1994, pp. 1-27
Graph homomorphisms with infinite targets
Gary MacGillivray
Discrete Applied Mathematics
54
, 1994, pp. 29-35
A lower bound for tree resolution
David J. McClurkin
Discrete Applied Mathematics
54
, 1994, pp. 37-53
Seiten 1
2
3
4
5
6
7
8
>