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=61
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On specifying Boolean functions by labelled examples
Martin Anthony
,
Graham Brightwell
,
John Shawe-Taylor
Discrete Applied Mathematics
61
, 1995, pp. 1-25
Facets of the
k
-partition polytope
Sunil Chopra
,
M.R. Rao
Discrete Applied Mathematics
61
, 1995, pp. 27-48
An approximation algorithm for scheduling on three dedicated machines
Michel X. Goemans
Discrete Applied Mathematics
61
, 1995, pp. 49-59
Asymptotically optimal gossiping in radio networks
Krishnamurthi Ravishankar
,
Suresh Singh
Discrete Applied Mathematics
61
, 1995, pp. 61-82
NP-completeness of some edge-disjoint paths problems
Jens Vygen
Discrete Applied Mathematics
61
, 1995, pp. 83-90
Classification by polynomial surfaces
Martin Anthony
Discrete Applied Mathematics
61
, 1995, pp. 91-103
On the problem of sorting burnt pancakes
David S. Cohen
,
Manuel Blum
Discrete Applied Mathematics
61
, 1995, pp. 105-120
Optimal detection of a counterfeit coin with multi-arms balances
Annalisa De Bonis
,
Luisa Gargano
,
Ugo Vaccaro
Discrete Applied Mathematics
61
, 1995, pp. 121-131
Large planar graphs with given diameter and maximum degree
M. Fellows
,
P. Hell
,
K. Seyffarth
Discrete Applied Mathematics
61
, 1995, pp. 133-153
Linear time optimization algorithms for
P_4
-sparse graphs
Beverly Jamison
,
Stephan Olariu
Discrete Applied Mathematics
61
, 1995, pp. 155-175
Lower bounds for hypergraph Ramsey numbers
H.L. Abbott
,
M.J. Smuga-Otto
Discrete Applied Mathematics
61
, 1995, pp. 177-180
Large survivable nets and the generalized prisms
Hong-Jian Lai
Discrete Applied Mathematics
61
, 1995, pp. 181-185
Bounds on the size of merging networks
Martin Aigner
,
Otfried Schwarzkopf
Discrete Applied Mathematics
61
, 1995, pp. 187-194
A unified approach to polynomially solvable cases of integer ``non-separable'' quadratic optimization
Ross Baldick
Discrete Applied Mathematics
61
, 1995, pp. 195-212
An algebraic analysis of the connectivity of DeBruijn and shuffle-exchange digraphs
Marc Baumslag
Discrete Applied Mathematics
61
, 1995, pp. 213-227
A theorem on the principal structure for independent matchings
Satoru Iwata
,
Kazuo Murota
Discrete Applied Mathematics
61
, 1995, pp. 229-244
Scheduling of conditional executed jobs on unrelated processors
Klaus Jansen
Discrete Applied Mathematics
61
, 1995, pp. 245-255
Thin and slender languages
Gheorghe Pȃun
,
Arto Salomaa
Discrete Applied Mathematics
61
, 1995, pp. 257-270
Deterministic communication complexity of set intersection
Ulrich Tamm
Discrete Applied Mathematics
61
, 1995, pp. 271-283