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=31
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Matrice de ramification des arbres binaires
J.G. Penaud
Discrete Applied Mathematics
31
, 1991, pp. 1-21
The relationship between two algorithms for decisions via sophisticated majority voting with an agenda
K.B. Reid
Discrete Applied Mathematics
31
, 1991, pp. 23-28
Recognizing brittle graphs: Remarks on a paper of Hoàng and Khouzam
Alejandro A. Schäffer
Discrete Applied Mathematics
31
, 1991, pp. 29-35
Uniqueness of currents in infinite resistive networks
Paolo M. Soardi
,
Wolfgang Woess
Discrete Applied Mathematics
31
, 1991, pp. 37-49
The threshold order of a Boolean function
Chi Wang
,
A.C. Williams
Discrete Applied Mathematics
31
, 1991, pp. 51-69
An efficient algorithm for finding a two-pair, and its applications
Srinivasa R. Arikati
,
C. Pandu Rangan
Discrete Applied Mathematics
31
, 1991, pp. 71-74
Intersection of algebraic space curves
Shreeram S. Abhyankar
,
Srinivasan Chandrasekar
,
Vijaya Chandru
Discrete Applied Mathematics
31
, 1991, pp. 81-96
Computing external farthest neighbors for a simple polygon
Pankaj K. Agarwal
,
Alok Aggarwal
,
Boris Aronov
,
S. Rao Kosaraju
,
Baruch Schieber
,
Subhash Suri
Discrete Applied Mathematics
31
, 1991, pp. 97-111
Convex hulls of samples from spherically symmetric distributions
Rex A. Dwyer
Discrete Applied Mathematics
31
, 1991, pp. 113-132
Ordered stabbing of pairwise disjoint convex sets in linear time
Peter Egyed
,
Rephael Wenger
Discrete Applied Mathematics
31
, 1991, pp. 133-140
Combinatorial face enumeration in arrangements and oriented matroids
Komei Fukuda
,
Shigemasa Saito
,
Akihisa Tamura
Discrete Applied Mathematics
31
, 1991, pp. 141-149
Bounding the number of
k
-faces in arrangements of hyperplanes
Komei Fukuda
,
Shigemasa Saito
,
Akihisa Tamura
,
Takeshi Tokuyama
Discrete Applied Mathematics
31
, 1991, pp. 151-165
The complexity of point configurations
Jacob E. Goodman
,
Richard Pollack
Discrete Applied Mathematics
31
, 1991, pp. 167-180
Constructing the relative neighborhood graph in 3-dimensional Euclidean space
Jerzy W. Jaromczyk
,
Mirosƚaw Kowaluk
Discrete Applied Mathematics
31
, 1991, pp. 181-191
Distances in a rigid unit-distance graph in the plane
Hiroshi Maehara
Discrete Applied Mathematics
31
, 1991, pp. 193-200
Problems, problems, problems
William O.J. Moser
Discrete Applied Mathematics
31
, 1991, pp. 201-225
Tighter bound for MULTIFIT scheduling on uniform processors
Bo Chen
Discrete Applied Mathematics
31
, 1991, pp. 227-260
Splicing semigroups of dominoes and DNA
Karel Culik II
,
Tero Harju
Discrete Applied Mathematics
31
, 1991, pp. 261-277
Higher dimensional restricted lattice paths with diagonal steps
Shashidhar Kaparthi
,
H. Raghav Rao
Discrete Applied Mathematics
31
, 1991, pp. 279-289
Some aspects of the semi-perfect elimination
S. Olariu
Discrete Applied Mathematics
31
, 1991, pp. 291-298
Synthetic description of a semiorder
Marc Pirlot
Discrete Applied Mathematics
31
, 1991, pp. 299-308