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=36
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
New clique and independent set algorithms for circle graphs
Alberto Apostolico
,
Mikhail J. Atallah
,
Susanne E. Hambrusch
Discrete Applied Mathematics
36
, 1992, pp. 1-24
An optimal algorithm for finding dominating cycles in circular-arc graphs
J. Mark Keil
,
Doug Schaefer
Discrete Applied Mathematics
36
, 1992, pp. 25-34
Some results concerning the complexity of restricted colorings of graphs
Marek Kubale
Discrete Applied Mathematics
36
, 1992, pp. 35-46
Stability number and chromatic number of tolerance graphs
Giri Narasimhan
,
Rachel Manber
Discrete Applied Mathematics
36
, 1992, pp. 47-56
Generating permutations with given ups and downs
D. Roelants van Baronaigien
,
Frank Ruskey
Discrete Applied Mathematics
36
, 1992, pp. 57-65
Generalized hexagonal systems with each hexagon being resonant
Fuji Zhang
,
Maolin Zheng
Discrete Applied Mathematics
36
, 1992, pp. 67-73
Edge colouring line graphs of unicyclic graphs
Leizhen Cai
,
John A. Ellis
Discrete Applied Mathematics
36
, 1992, pp. 75-82
A binary search problem on graphs
Reinhard Franzkeit
Discrete Applied Mathematics
36
, 1992, pp. 83-86
Narrowness, pathwidth, and their application in natural language processing
András Kornai
,
Zsolt Tuza
Discrete Applied Mathematics
36
, 1992, pp. 87-92
Sparse broadcast graphs
Jean Claude Bermond
,
Pavol Hell
,
Arthur L. Liestman
,
Joseph G. Peters
Discrete Applied Mathematics
36
, 1992, pp. 97-130
The complexity of some graph colouring problems
Keith Edwards
Discrete Applied Mathematics
36
, 1992, pp. 131-140
Indexing functions and time lower bounds for sorting on a mesh-connected computer
Yijie Han
,
Yoshihide Igarashi
,
Mirosƚaw Truszczynski
Discrete Applied Mathematics
36
, 1992, pp. 141-152
Optimal linear labelings and eigenvalues of graphs
Martin Juvan
,
Bojan Mohar
Discrete Applied Mathematics
36
, 1992, pp. 153-168
A domain monotonicity theorem for graphs and Hamiltonicity
Bojan Mohar
Discrete Applied Mathematics
36
, 1992, pp. 169-177
Negative circuits for flows and submodular flows
Uwe Zimmermann
Discrete Applied Mathematics
36
, 1992, pp. 179-189
Search problems for two irregular coins with incomplete feedback: The underweight model
L. Gargano
,
J. Körner
,
U. Vaccaro
Discrete Applied Mathematics
36
, 1992, pp. 191-197
A linear-time algorithm for finding Hamiltonian cycles in tournaments
Y. Manoussakis
Discrete Applied Mathematics
36
, 1992, pp. 199-201
An
O(n\log n)
algorithm for a maxmin location problem
C. Pandu Rangan
,
Ramesh Govindan
Discrete Applied Mathematics
36
, 1992, pp. 203-205
Scheduling with release dates on a single machine to minimize total weighted completion time
H. Belouadah
,
M.E. Posner
,
C.N. Potts
Discrete Applied Mathematics
36
, 1992, pp. 213-231
A solvable class of quadratic 0-1 programming
Srimat T. Chakradhar
,
Michael L. Bushnell
Discrete Applied Mathematics
36
, 1992, pp. 233-251
Compatible 2-factors
Jan Kratochvil
,
Svatopluk Poljak
Discrete Applied Mathematics
36
, 1992, pp. 253-266
The point-to-point delivery and connection problems: Complexity and algorithms
Chung-Lun Li
,
S. Thomas McCormick
,
David Simchi-Levi
Discrete Applied Mathematics
36
, 1992, pp. 267-292
The maximum number of complementary facets of a simplicial polytope
Walter D., Jr. Morris
Discrete Applied Mathematics
36
, 1992, pp. 293-298
An improved algorithm for quantitative group testing
L. Gargano
,
V. Montuori
,
G. Setaro
,
U. Vaccaro
Discrete Applied Mathematics
36
, 1992, pp. 299-306
Finite isomorphically complete systems
F. Gécseg
,
B. Imreh
Discrete Applied Mathematics
36
, 1992, pp. 307-311
Seiten 1
2
>