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=60
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On pseudomodular matroids and adjoints
M. Alfter
,
W. Hochstättler
Discrete Applied Mathematics
60
, 1995, pp. 3-11
Work-preserving emulations of shuffle-exchange networks: An analysis of the complex plane diagram
Fred Annexstein
,
John Franco
Discrete Applied Mathematics
60
, 1995, pp. 13-23
2-satisfiability and diagnosing faulty processors in massively parallel computing systems
Ansuman Bagchi
,
Brigitte Servatius
,
Weigeng Shi
Discrete Applied Mathematics
60
, 1995, pp. 25-37
The reversing number of a digraph
Jean-Pierre Barthélemy
,
Olivier Hudry
,
Garth Isaak
,
Fred S. Roberts
,
Barry Tesman
Discrete Applied Mathematics
60
, 1995, pp. 39-76
Unique satisfiability of Horn sets can be solved in nearly linear time
Kenneth A. Berman
,
John Franco
,
John S. Schlipf
Discrete Applied Mathematics
60
, 1995, pp. 77-91
Interval orders based on weak orders
Kenneth P. Bogart
,
Joseph Bonin
,
Jutta Mitas
Discrete Applied Mathematics
60
, 1995, pp. 93-98
Proper and unit tolerance graphs
Kenneth P. Bogart
,
Peter C. Fishburn
,
Garth Isaak
,
Larry Langley
Discrete Applied Mathematics
60
, 1995, pp. 99-117
A new approach to solving three combinatorial enumeration problems on planar graphs
Charles J. Colbourn
,
J. Scott Provan
,
Dirk Vertigan
Discrete Applied Mathematics
60
, 1995, pp. 119-129
On component-size bounded Steiner trees
Ding-Zhu Du
Discrete Applied Mathematics
60
, 1995, pp. 131-140
Multiplicities of interpoint distances in finite planar sets
Paul Erdös
,
Peter C. Fishburn
Discrete Applied Mathematics
60
, 1995, pp. 141-147
Intervertex distances in convex polygons
Paul Erdös
,
Peter Fishburn
Discrete Applied Mathematics
60
, 1995, pp. 149-158
A new algorithm for the propositional satisfiability problem
G. Gallo
,
Pretolani
Discrete Applied Mathematics
60
, 1995, pp. 159-179
Boole's conditions of possible experience and reasoning under uncertainty
Pierre Hansen
,
Brigitte Jaumard
,
Marcus Poggi de Aragão
Discrete Applied Mathematics
60
, 1995, pp. 181-193
Polynomially solvable cases for the maximum stable set problem
Alain Hertz
Discrete Applied Mathematics
60
, 1995, pp. 195-210
Extending shelling orders and a hierarchy of functions of unimodal simple polytopes
Kathy Hoke
Discrete Applied Mathematics
60
, 1995, pp. 211-217
The time complexity of deterministic broadcast radio networks
F.K. Hwang
Discrete Applied Mathematics
60
, 1995, pp. 219-222
Permuting matrices to avoid forbidden submatrices
Bettina Klinz
,
Rüdiger Rudolf
,
Gerhard J. Woeginger
Discrete Applied Mathematics
60
, 1995, pp. 223-248
On the essential test sets of discrete matrices
Alexander Kogan
Discrete Applied Mathematics
60
, 1995, pp. 249-255
A recognition algorithm for orders of interval dimension two
Larry J. Langley
Discrete Applied Mathematics
60
, 1995, pp. 257-266
Irreflexive and reflexive dimension
Larry J. Langley
Discrete Applied Mathematics
60
, 1995, pp. 267-273
Explicit construction of graphs with an arbitrary large girth and of large size
Felix Lazebnik
,
Vasiliy A. Ustimenko
Discrete Applied Mathematics
60
, 1995, pp. 275-284
A note on biased and non-biased games
Xiaoyun Lu
Discrete Applied Mathematics
60
, 1995, pp. 285-291
On the integral dicycle packings and covers and the linear ordering polytope
Zeev Nutov
,
Michal Penn
Discrete Applied Mathematics
60
, 1995, pp. 293-309
Enumeration of difference graphs
Uri N. Peled
,
Feng Sun
Discrete Applied Mathematics
60
, 1995, pp. 311-318
On-line algorithms for ordered sets and comparability graphs
Stephen G. Penrice
Discrete Applied Mathematics
60
, 1995, pp. 319-329
Seiten 1
2
>