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=59
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Graphs with most number of three point induced connected subgraphs
F.T. Boesch
,
X. Li
,
J. Rodriguez
Discrete Applied Mathematics
59
, 1995, pp. 1-10
A polynomial algorithm for an open shop problem with unit processing times and tree constraints
H. Bräsel
,
D. Kluge
,
F. Werner
Discrete Applied Mathematics
59
, 1995, pp. 11-21
Recognizing renamable generalized propositional Horn formulas is NP-complete
Thomas Eiter
,
Pekka Kilpeläinen
,
Heikki Mannila
Discrete Applied Mathematics
59
, 1995, pp. 23-31
On determining non-isotopic configurations of points on a circle
Xin He
,
David B. Sher
Discrete Applied Mathematics
59
, 1995, pp. 33-50
Matrices generated by semilattices
Johan Karlander
Discrete Applied Mathematics
59
, 1995, pp. 51-56
Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
Yves Pochet
,
Laurence A. Wolsey
Discrete Applied Mathematics
59
, 1995, pp. 57-74
Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds
Vitaly A. Strusevich
Discrete Applied Mathematics
59
, 1995, pp. 75-86
A generalization of the stable matching problem
Jimmy J.M. Tan
,
Yuang-Cheh Hsueh
Discrete Applied Mathematics
59
, 1995, pp. 87-102
Large
(d,D,D',s)
-bipartite digraphs
J. Gómez
,
P. Morillo
,
C. Padró
Discrete Applied Mathematics
59
, 1995, pp. 103-114
Approximation techniques for hypergraph partitioning problems
Scott W. Hadley
Discrete Applied Mathematics
59
, 1995, pp. 115-127
Dominating Cartesian products of cycles
Sandi Klavz̑ar
,
Norbert Seifter
Discrete Applied Mathematics
59
, 1995, pp. 129-136
Generating lower bounds for the linear arrangement problem
Weiguo Liu
,
Anthony Vannelli
Discrete Applied Mathematics
59
, 1995, pp. 137-151
A framework for adaptive sorting
Ola Petersson
,
Alistair Moffat
Discrete Applied Mathematics
59
, 1995, pp. 153-179
Algorithms for weakly triangulated graphs
Jeremy Spinrad
,
R. Sritharan
Discrete Applied Mathematics
59
, 1995, pp. 181-191
The Shields-Harary number for wheel and broken wheel graphs
Jared Wunsch
Discrete Applied Mathematics
59
, 1995, pp. 193-199
The NP-completeness of finding
A
-trails in Eulerian graphs and of finding spanning trees in hypergraphs
Lars Dvling Andersen
,
Herbert Fleischner
Discrete Applied Mathematics
59
, 1995, pp. 203-214
Optimal separable partitioning in the plane
Michal Benelli
,
Refael Hassin
Discrete Applied Mathematics
59
, 1995, pp. 215-224
On the
k
-coloring of intervals
Martin C. Carlisle
,
Errol L. Lloyd
Discrete Applied Mathematics
59
, 1995, pp. 225-235
NP-hardness of shop-scheduling problems with three jobs
Yu.N. Sotskov
,
N.V. Shakhlevich
Discrete Applied Mathematics
59
, 1995, pp. 237-266
The arborescence-realization problem
R.P. Donald K. Wagner Swaminathan
Discrete Applied Mathematics
59
, 1995, pp. 267-283
How do I marry thee? Let me count the ways
Arthur T. Benjamin
,
Cherlyn Converse
,
Henry A. Krieger
Discrete Applied Mathematics
59
, 1995, pp. 285-292
Some democratic secret sharing schemes
Marco Carpentieri
Discrete Applied Mathematics
59
, 1995, pp. 293-298