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=35
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Two metrics in a graph theory modeling of organic chemistry
Vladmir Baláz̑
,
Vladimir Kvasnic̑ka
,
Jiȓí Pospíchal
Discrete Applied Mathematics
35
, 1992, pp. 1-19
Certain Boolean equations
D. Banković
Discrete Applied Mathematics
35
, 1992, pp. 21-27
Polynomial graph-colorings
Wolfgang Gutjahr
,
Emo Welzl
,
Gerhard Woeginger
Discrete Applied Mathematics
35
, 1992, pp. 29-45
Calculating growth rates and moments for additive cellular automata
Stephen J. Willson
Discrete Applied Mathematics
35
, 1992, pp. 47-65
Distances in cocomparability graphs and their powers
Peter Damaschke
Discrete Applied Mathematics
35
, 1992, pp. 67-72
A greedy reduction algorithm for setup optimization
Ulrich Faigle
,
Rainer Schrader
Discrete Applied Mathematics
35
, 1992, pp. 73-79
Linear sections of the general linear group: A geometric approach
Charles T. Ryan
Discrete Applied Mathematics
35
, 1992, pp. 81-86
Algebraic expressions for Kekulé structure counts of nonbranched cata-condensed benzenoid
Wenjie He
,
Wenchen He
,
Suling Xie
Discrete Applied Mathematics
35
, 1992, pp. 91-106
Legendre sums and codes related to QR codes
Tor Helleseth
Discrete Applied Mathematics
35
, 1992, pp. 107-113
A tree representation for
P_4
-sparse graphs
B. Jamison
,
S. Olariu
Discrete Applied Mathematics
35
, 1992, pp. 115-129
An
\varepsilon
-approximation scheme for combinatorial optimization problems with minimum variance criterion
Naoki Katoh
Discrete Applied Mathematics
35
, 1992, pp. 131-141
A fully polynomial time approximation scheme for minimum cost-reliability ratio problems
N. Katoh
Discrete Applied Mathematics
35
, 1992, pp. 143-155
An
O(n^2)
algorithm for the maximum cycle mean of an
n \times n
bivalent matrix
P. Butkovic̑
,
R.A. Cuninghame-Green
Discrete Applied Mathematics
35
, 1992, pp. 157-162
On the tree packing problem
Shigeru Masuyama
Discrete Applied Mathematics
35
, 1992, pp. 163-166
Computing independent sets in graphs with large girth
Owen J. Murphy
Discrete Applied Mathematics
35
, 1992, pp. 167-170
Modelling and solving an acyclic multi-period timetabling problem
Mirjana C̑angalović
,
Jan A.M. Schreuder
Discrete Applied Mathematics
35
, 1992, pp. 177-195
A matching algorithm for regular bipartite graphs
J. Csima
,
L. Lovász
Discrete Applied Mathematics
35
, 1992, pp. 197-203
Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource
D. de Werra
,
J. Bƚażewicz
Discrete Applied Mathematics
35
, 1992, pp. 205-219
Construction of university faculty timetables using logic programming techniques
R. Fahrion
,
G. Dollansky
Discrete Applied Mathematics
35
, 1992, pp. 221-236
Exchanges procedures for timetabling problems
Jacques A. Ferland
,
Alain Lavoie
Discrete Applied Mathematics
35
, 1992, pp. 237-253
Finding a feasible course schedule using Tabu search
Alain Hertz
Discrete Applied Mathematics
35
, 1992, pp. 255-270
Alternating Hamiltonian circuits in edge-coloured bipartite graphs
A.J.W. Hilton
Discrete Applied Mathematics
35
, 1992, pp. 271-273
Optimal strategies for some team games
Naoki Katoh
,
Junji Koyanagi
,
Masamitsu Ohnishi
,
Toshihide Ibaraki
Discrete Applied Mathematics
35
, 1992, pp. 275-291
On a class of completable partial edge-colourings
Alexander Rosa
Discrete Applied Mathematics
35
, 1992, pp. 293-299
Combinatorial aspects of construction of competition Dutch professional football leagues
Jan A.M. Schreuder
Discrete Applied Mathematics
35
, 1992, pp. 301-312
Seiten 1
2
>