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=12
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions
A. Billionnet
,
M. Minoux
Discrete Applied Mathematics
12
, 1985, pp. 1-11
The base of the intersection of two free submonoids
Ronald Book
Discrete Applied Mathematics
12
, 1985, pp. 13-20
Probabilistic asymptotic properties of some combinatorial optimization problems
Rainer E. Burkard
,
Ulrich Fincke
Discrete Applied Mathematics
12
, 1985, pp. 21-29
Votes and a half-binomial
J.S. Frame
,
Dennis C. Gilliland
Discrete Applied Mathematics
12
, 1985, pp. 31-40
Classes of regular and context-free languages over countably infinite alphabets
Friedrich Otto
Discrete Applied Mathematics
12
, 1985, pp. 41-56
Polynomial-time algorithms for regular set-covering and threshold synthesis
Uri N. Peled
,
Bruno Simeone
Discrete Applied Mathematics
12
, 1985, pp. 57-69
Efficient implementation of a shifting algorithm
Yehoshua Perl
,
Uzi Vishkin
Discrete Applied Mathematics
12
, 1985, pp. 71-80
On dimer coverings of rectangles of fixed width
Richard P. Stanley
Discrete Applied Mathematics
12
, 1985, pp. 81-87
Worst case analysis of a graph coloring algorithm
Jeremy P. Spinrad
,
Gopalakrishnan Vijayan
Discrete Applied Mathematics
12
, 1985, pp. 89-92
Test sets for morphisms with bounded delay
Christian Choffrut
,
Juhani Karhumäki
Discrete Applied Mathematics
12
, 1985, pp. 93-101
An improvement of the Griesmer bound for some small minimum distances
S.M. Dodunekov
,
N.L. Manev
Discrete Applied Mathematics
12
, 1985, pp. 103-114
A morphic representation of E0L languages and other ET0L languages
A. Ehrenfeucht
,
G. Rozenberg
,
K. Ruohonen
Discrete Applied Mathematics
12
, 1985, pp. 115-122
A polynomial time algorithm for finding the prime factors of cartesian-product graphs
Joan Feigenbaum
,
John Hershberger
,
Alejandro A. Schäffer
Discrete Applied Mathematics
12
, 1985, pp. 123-138
Crosscorrelation of M-sequences and GMW-sequences with the same primitive polynomial
Richard A. Games
Discrete Applied Mathematics
12
, 1985, pp. 139-146
Uniquely solvable quadratic boolean equations
Pierre Hansen
,
Brigitte Jaumard
Discrete Applied Mathematics
12
, 1985, pp. 147-154
On signed digraphs with all cycles negative
Frank Harary
,
J. Richard Lundgren
,
John S. Maybee
Discrete Applied Mathematics
12
, 1985, pp. 155-164
Remarks on strategies in combinatorial games
A. Pultr
,
J. Úlehla
Discrete Applied Mathematics
12
, 1985, pp. 165-173
On erasing in E0L forms
G. Rozenberg
,
R. Verraedt
Discrete Applied Mathematics
12
, 1985, pp. 175-189
A characterization of uniquely representable interval graphs
Peter C. Fishburn
Discrete Applied Mathematics
12
, 1985, pp. 191-194
A polynomial feasibility test for preemptive periodic scheduling of unrelated processors
Alan A. Bertossi
,
Maurizio A. Bonuccelli
Discrete Applied Mathematics
12
, 1985, pp. 195-201
Dominating sets and domatic number of circular arc graphs
Maurizio A. Bonuccelli
Discrete Applied Mathematics
12
, 1985, pp. 203-213
Parcours dans les graphes: Un outil pour l'algorithmique des ensembles ordonnés
J.P. Bordat
Discrete Applied Mathematics
12
, 1985, pp. 215-231
The complexity of generalized clique packing
D.G. Corneil
Discrete Applied Mathematics
12
, 1985, pp. 233-239
On the reduction method for integer linear programs, II
A.A. Elimam
,
S.E. Elmaghraby
Discrete Applied Mathematics
12
, 1985, pp. 241-260
Decreasing energy functions as a tool for studying threshold networks
Eric Goles-Chacc
,
Françoise Fogelman-Soulié
,
Didier Pellegrin
Discrete Applied Mathematics
12
, 1985, pp. 261-277
Seiten 1
2
>