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=63
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Paths to marriage stability
Hernan Abeledo
,
Uriel G. Rothblum
Discrete Applied Mathematics
63
, 1995, pp. 1-12
Establishing determinantal inequalities for positive-definite matrices
J. Orestes Cerdeira
,
Isabel Faria
,
Paulo Bárcia
Discrete Applied Mathematics
63
, 1995, pp. 13-24
Minimizing the sum of weighted completion times with unrestricted weights
Mauro Dell'Amico
,
Silvano Martello
,
Daniele Vigo
Discrete Applied Mathematics
63
, 1995, pp. 25-41
On the recognition of permuted bottleneck Monge matrices
Bettina Klinz
,
Rüdiger Rudolf
,
Gerhard J. Woeginger
Discrete Applied Mathematics
63
, 1995, pp. 43-74
Drawing graphs on rectangular grids
Markus Schäffter
Discrete Applied Mathematics
63
, 1995, pp. 75-89
Edge deletion preserving the diameter of the hypercube
A. Bouabdallah
,
C. Delorme
,
S. Djelloul
Discrete Applied Mathematics
63
, 1995, pp. 91-95
Scheduling dyadic intervals
James R. Driscoll
,
Dennis M. Healy
,
Garth T. Isaak
Discrete Applied Mathematics
63
, 1995, pp. 101-116
Directed Moore hypergraphs
Fahir Ö. Ergincan
,
David A. Gregory
Discrete Applied Mathematics
63
, 1995, pp. 117-127
Close-to-optimal and near-optimal broadcasting in random graphs
Alexandros V. Gerbessiotis
Discrete Applied Mathematics
63
, 1995, pp. 129-150
Every matroid is a submatroid of a uniformly dense matroid
Hong-Jian Lai
,
Hongyuan Lai
Discrete Applied Mathematics
63
, 1995, pp. 151-160
Matroid optimization with generalized constraints
Mandayam A. Srinivas
Discrete Applied Mathematics
63
, 1995, pp. 161-174
The modified differencing method for the set partitioning problem with cardinality constraints
Li-Hui Tasi
Discrete Applied Mathematics
63
, 1995, pp. 175-180
A simple a.s. correct algorithm for deciding if a graph has a perfect matching
María Rosa Brito
Discrete Applied Mathematics
63
, 1995, pp. 181-185
On powers of
m
-trapezoid graphs
Carsten Flotow
Discrete Applied Mathematics
63
, 1995, pp. 187-192
Strongly prime PCP words
Marjo Lipponen
,
Gheorghe Păun
Discrete Applied Mathematics
63
, 1995, pp. 193-197
Constrained matroidal bottleneck problems
Igor Averbakh
,
Oded Berman
,
Abraham P. Punnen
Discrete Applied Mathematics
63
, 1995, pp. 201-214
Weighted independent perfect domination on cocomparability graphs
Gerard J. Chang
,
C. Pandu Rangan
,
Satyan R. Coorg
Discrete Applied Mathematics
63
, 1995, pp. 215-222
Labeled versus unlabeled distributed Cayley networks
Evangelos Kranakis
,
Danny Krizanc
Discrete Applied Mathematics
63
, 1995, pp. 223-236
A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times
Eugeniusz Nowicki
,
Stanislaw Zdrzaƚka
Discrete Applied Mathematics
63
, 1995, pp. 237-256
Selecting jobs for scheduling on a machine subject to failure
Wolfgang Stadje
Discrete Applied Mathematics
63
, 1995, pp. 257-265
Well irredundant graphs
Jerzy Topp
,
Preben D. Vestergaard
Discrete Applied Mathematics
63
, 1995, pp. 267-276
On subwords of infinite words
Lucian Ilie
Discrete Applied Mathematics
63
, 1995, pp. 277-279