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
[1]
Hilfe
Suche: Journal=Discrete Appl.~Math. AND YEAR=1997
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On paths avoiding forbidden pairs of vertices in a graph
Hananya Yinnone
Discrete Applied Mathematics
74
(1), 1997, pp. 85-92
Irreducible polynomials and linear recurring arrays
Mulan Liu
,
Gary L. Mullen
Discrete Applied Mathematics
74
(1), 1997, pp. 93-99
Long cycles and long paths in the Kronecker product of a cycle and a tree
Pranava K. Jha
,
Naveen Agnihotri
,
Rajesh Kumar
Discrete Applied Mathematics
74
(2), 1997, pp. 101-121
VC-dimensions of finite automata and commutative finite automata with
k
letters and
n
states
Yoshiyasu Ishigami
,
Sei'ichi Tani
Discrete Applied Mathematics
74
(2), 1997, pp. 123-134
A lower bound for a constrained quadratic 0-1 minimization problem
Alain Billionnet
,
Alain Faye
Discrete Applied Mathematics
74
(2), 1997, pp. 135-146
Regular coronoid systems
Chen Rong-si
,
Zhang Fu-ji
Discrete Applied Mathematics
74
(2), 1997, pp. 147-158
k
-edge subgraph problems
Olivier Goldschmidt
,
Dorit S. Hochbaum
Discrete Applied Mathematics
74
(2), 1997, pp. 159-169
Bounds on the number of knight's tours
Olaf Kyek
,
Ian Parberry
,
Ingo Wegener
Discrete Applied Mathematics
74
(2), 1997, pp. 171-181
How to cut a cake fairly using a minimal number of cuts
William A. Webb
Discrete Applied Mathematics
74
(2), 1997, pp. 183-190
Hamilton paths in
Z
-transformation graphs of perfect matchings of hexagonal systems
Chen Rong-si
,
Zhang Fu-ji
Discrete Applied Mathematics
74
(2), 1997, pp. 191-196
On complexity of minimizing weighted number of late jobs in unit time open shops
A.A. Gladky
Discrete Applied Mathematics
74
(2), 1997, pp. 197-201
On spanning 2-trees in a graph
Leizhen Cai
Discrete Applied Mathematics
74
(3), 1997, pp. 203-216
Graph domination, tabu search and the football pool problem
Rowan Davies
,
Gordon F. Royle
Discrete Applied Mathematics
74
(3), 1997, pp. 217-228
VC-dimensions of finite automata and commutative finite automata with
k
letters and
n
states
Yoshiyasu Ishigami
,
Sei'ichi Tani
Discrete Applied Mathematics
74
(3), 1997, pp. 229-240
Parallel algorithms for the domination problems in trapezoid graphs
Y. Daniel Liang
Discrete Applied Mathematics
74
(3), 1997, pp. 241-249
Positive and Horn decomposability of partially defined Boolean functions
Kazuhisa Makino
,
Kojin Yano
,
Toshihide Ibaraki
Discrete Applied Mathematics
74
(3), 1997, pp. 251-274
Generalized exponents of primitive symmetric digraphs
Richard A. Brualdi
,
Jia-yu Shao
Discrete Applied Mathematics
74
(3), 1997, pp. 275-293
A proof of Jean de Rumeur's conjecture
Stéphanie Perennes
Discrete Applied Mathematics
74
(3), 1997, pp. 295-299
A decision method for Parikh slenderness of context-free languages
Juha Honkala
Discrete Applied Mathematics
73
(1), 1997, pp. 1-4
The rotation graphs of perfect matchings of plane bipartite graphs
Haping Zhang
,
Fuji Zhang
Discrete Applied Mathematics
73
(1), 1997, pp. 5-12
Preserving approximation in the Min-Weighted Set Cover Problem
Giorgio Gambosi
,
Marco Protasi
,
Maurizio Talamo
Discrete Applied Mathematics
73
(1), 1997, pp. 13-22
A note on approximate inclusion-exclusion
Avraham A. Melkman
,
Solomon E. Shimony
Discrete Applied Mathematics
73
(1), 1997, pp. 23-26
A linear-time algorithm for computing the intersection of all odd cycles in a graph
Leizhen Cai
,
Baruch Schieber
Discrete Applied Mathematics
73
(1), 1997, pp. 27-34
Directed rectangle-visibility graphs have unbounded dimension
Kathleen Romanik
Discrete Applied Mathematics
73
(1), 1997, pp. 35-39
Nondegenerate functions and permutations
Luke O'Connor
Discrete Applied Mathematics
73
(1), 1997, pp. 41-57
Seiten
<
1
2
3
4
5
6
7
8
>