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=1990
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Lower bounds for recognizing small cliques on CRCW PRAM's
Paul Beame
Discrete Applied Mathematics
29
, 1990, pp. 3-20
The complexity of short two-person games
Ashok K. Chandra
,
Martin Tompa
Discrete Applied Mathematics
29
, 1990, pp. 21-33
Subtree isomorphism is in random NC
Phillip B. Gibbons
,
Richard M. Karp
,
Gary L. Miller
,
Danny Soroker
Discrete Applied Mathematics
29
, 1990, pp. 35-62
Incomparability in parallel computation
Vince Grolmusz
,
Prahbakar Ragde
Discrete Applied Mathematics
29
, 1990, pp. 63-78
Parallel recognition of complement reducible graphs and cotree construction
D.G. Kirkpatrick
,
T. Przytycka
Discrete Applied Mathematics
29
, 1990, pp. 79-96
Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm
Baruch Schieber
,
Uzi Vishkin
Discrete Applied Mathematics
29
, 1990, pp. 97-111
Optimal parallel construction of prescribed tournaments
Danny Soroker
Discrete Applied Mathematics
29
, 1990, pp. 113-125
Unconstrained
0-1
optimization and Lagrangean relaxation
Warren E. Adams
,
Alain Billionnet
,
Alain Sutter
Discrete Applied Mathematics
29
, 1990, pp. 131-142
Irreducible disjoint covering systems (with an application to Boolean algebra)
Marc A. Berger
,
Alexander Felzenbaum
,
Aviezri S. Fraenkel
Discrete Applied Mathematics
29
, 1990, pp. 143-164
A note on line digraphs and the directed max-cut problem
V. Chvátal
,
C. Ebenegger
Discrete Applied Mathematics
29
, 1990, pp. 165-170
The basic algorithm for pseudo-Boolean programming revisited
Yves Crama
,
Pierre Hansen
,
Brigitte Jaumard
Discrete Applied Mathematics
29
, 1990, pp. 171-185
On the equivalence of paved-duality and standard linearization in nonlinear
0-1
optimization
P. Hansen
,
S.-H. Lu
,
B. Simeone
Discrete Applied Mathematics
29
, 1990, pp. 187-193
Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems
M. Minoux
,
K. Barkaoui
Discrete Applied Mathematics
29
, 1990, pp. 195-210
Vicinal orders of trees
Uri N. Peled
,
Murali K. Srinivasan
Discrete Applied Mathematics
29
, 1990, pp. 211-219
Meaningfulness of conclusions from combinatorial optimization
Fred S. Roberts
Discrete Applied Mathematics
29
, 1990, pp. 221-241
Recognition of a class of unimodular functions
B. Simeone
,
D. de Werra
,
M. Cochand
Discrete Applied Mathematics
29
, 1990, pp. 243-250
Valid inequalities for
0-1
knapsacks and mips with generalised upper bound constraints
Laurence A. Wolsey
Discrete Applied Mathematics
29
, 1990, pp. 251-261
The permutahedron of series-parallel posets
Annelie von Arnim
,
Ulrich Faigle
,
Rainer Schrader
Discrete Applied Mathematics
28
, 1990, pp. 3-9
Scheduling independent two processor tasks on a uniform duo-processor system
J. Bƚażewicz
,
M. Drozdowski
,
G. Schmidt
,
D. de Werra
Discrete Applied Mathematics
28
, 1990, pp. 11-20
Constrained partitioning problems
Rainer E. Burkard
,
En-Yu Yao
Discrete Applied Mathematics
28
, 1990, pp. 21-34
Difference graphs
Peter L. Hammer
,
Uri N. Peled
,
Xiaorong Sun
Discrete Applied Mathematics
28
, 1990, pp. 35-44
Minimizing the number of tardy job units under release time constraints
Dorit S. Hochbaum
,
Ron Shamir
Discrete Applied Mathematics
28
, 1990, pp. 45-57
Lower bounds and reduction procedures for the bin packing problem
Silvano Martello
,
Paolo Toth
Discrete Applied Mathematics
28
, 1990, pp. 59-70
The complexity of determinacy problem on group testing
Feng Yang
,
Ding-Zhu Du
Discrete Applied Mathematics
28
, 1990, pp. 71-81
A relationship between Gale transforms and Voronoi diagrams
F. Aurenhammer
Discrete Applied Mathematics
28
, 1990, pp. 83-91
Seiten 1
2
3
4
>