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=10
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An out-of-kilter method for the algebraic circulation problem
P. Brucker
,
W. Papenjohann
Discrete Applied Mathematics
10
, 1985, pp. 1-18
Necessary solvability conditions of systems of linear extremal equations
Peter Butovic̑
Discrete Applied Mathematics
10
, 1985, pp. 19-26
Solving NP-hard problems in `almost trees': Vertex cover
Don Coppersmith
,
Uzi Vishkin
Discrete Applied Mathematics
10
, 1985, pp. 27-45
On the value of a random minimum spanning tree problem
A.M. Frieze
Discrete Applied Mathematics
10
, 1985, pp. 47-56
The shortest-path problem for graphs with random arc-lengths
A.M. Frieze
,
G.R. Grimmett
Discrete Applied Mathematics
10
, 1985, pp. 57-77
On combinatorial structures of line drawings of polyhedra
Hiroshi Imai
Discrete Applied Mathematics
10
, 1985, pp. 79-92
Applications of edge coverings by cliques
Fred S. Roberts
Discrete Applied Mathematics
10
, 1985, pp. 93-109
Some new two-weight codes and strongly regular graphs
A.E. Brouwer
Discrete Applied Mathematics
10
, 1985, pp. 111-114
Minimum cost flow algorithms for series-parallel networks
Wolfgang W. Bein
,
Peter Brucker
,
Arie Tamir
Discrete Applied Mathematics
10
, 1985, pp. 117-124
A heuristic approach to hard constrained shortest path problems
Celso C. Ribeiro
,
Michel Minoux
Discrete Applied Mathematics
10
, 1985, pp. 125-137
On the complexity of partitioning graphs into connected subgraphs
M.E. Dyer
,
A.M. Frieze
Discrete Applied Mathematics
10
, 1985, pp. 139-153
Analysis of a linear programming heuristic for scheduling unrelated parallel machines
C.N. Potts
Discrete Applied Mathematics
10
, 1985, pp. 155-164
First fit decreasing scheduling on uniform multiprocessors
Manfred Kunde
,
Horst Steppat
Discrete Applied Mathematics
10
, 1985, pp. 165-177
A successful algorithm for the undirected Hamiltonian path problem
Gerald L. Thompson
,
Sharad Singhal
Discrete Applied Mathematics
10
, 1985, pp. 179-195
On some conditioning results in the probabilistic analysis of algorithms
Colin McDiarmid
Discrete Applied Mathematics
10
, 1985, pp. 197-201
A note on matchings and separability
W. Cook
Discrete Applied Mathematics
10
, 1985, pp. 203-209
On the number of cycles possible in digraphs with large girth
Eric W. Allender
Discrete Applied Mathematics
10
, 1985, pp. 211-225
Constructive characterizations of the value function of a mixed-integer program II
C.E. Blair
,
R.G. Jeroslow
Discrete Applied Mathematics
10
, 1985, pp. 227-240
Dynamic storage allocation with limited compaction - complexity and some practical implications
J. Bƚażewicz
,
J.R. Nawrocki
Discrete Applied Mathematics
10
, 1985, pp. 241-253
An extended result of Kleitman and Saks concerning binary trees
Yung-ching Chu
Discrete Applied Mathematics
10
, 1985, pp. 255-259
An efficient algorithm for the parametric resource allocation problem
Naoki Katoh
,
Toshihide Ibaraki
Discrete Applied Mathematics
10
, 1985, pp. 261-274
Extremal length of an infinite network related to an accessible boundary point
Takashi Kayano
Discrete Applied Mathematics
10
, 1985, pp. 275-285
Solving satisfiability in less than
2^n
steps
B. Monien
,
E. Speckenmeyer
Discrete Applied Mathematics
10
, 1985, pp. 287-295
Detection of structural inconsistency in systems of equations with degrees of freedom and its applications
Kōkichi Sugihara
Discrete Applied Mathematics
10
, 1985, pp. 297-312
Orientations with single source and sink
Jayme L. Szwarcfiter
,
Ronaldo C.M. Persiano
,
Antonio A.F. Oliveira
Discrete Applied Mathematics
10
, 1985, pp. 313-321