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=J. Algorithms AND Volume=12
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Algorithms finding tree-decompositions of graphs
Jiȓí Matous̑ek
Journal of Algorithms
12
, 1991, pp. 1-22
An improved algorithm for the planar 3-cut problem
Xin He
Journal of Algorithms
12
, 1991, pp. 23-37
Finding
k
points with minimum diameter and related problems
Alok Aggarwal
,
Hiroshi Imai
,
Naoki Katoh
,
Subhash Suri
Journal of Algorithms
12
, 1991, pp. 38-56
Efficient maintenance of the union of intervals on a line, with applications
Siu Wing Cheng
,
Ravi Janardan
Journal of Algorithms
12
, 1991, pp. 57-74
Computing the visiblity polygon from a convex set and related problems
Subir Kumar Ghosh
Journal of Algorithms
12
, 1991, pp. 75-95
Parallel algorithms for parity graphs
T. Przytycka
,
D.G. Corneil
Journal of Algorithms
12
, 1991, pp. 96-109
Transitive compaction in parallel via branchings
Phillip Gibbons
,
Richard Karp
,
Vijaya Ramachandran
,
Danny Soroker
,
Robert Tarjan
Journal of Algorithms
12
, 1991, pp. 110-125
Average case analysis of heap building by repeated insertion
Ryan Hayward
,
Colin McDiarmid
Journal of Algorithms
12
, 1991, pp. 126-153
A necessary and sufficient condition for the existence of a complete stable matching
Jimmy J.M. Tan
Journal of Algorithms
12
, 1991, pp. 154-178
Two algorithms for the sieve method
Herbert S. Wilf
Journal of Algorithms
12
, 1991, pp. 179-182
Problems
Peter van Emde Boas
Journal of Algorithms
12
, 1991, pp. 183-185
Probabilistic analysis of algorithms for dual bin packing problems
J. Csirik
,
J.B.G. Frenk
,
G. Galambos
,
H.G. Rinnooy Kan
Journal of Algorithms
12
, 1991, pp. 189-203
Better computing on the anonymous ring
Hagit Attiya
,
Marc Snir
Journal of Algorithms
12
, 1991, pp. 204-238
Monotonicity in graph searching
D. Bienstock
,
Paul Seymour
Journal of Algorithms
12
, 1991, pp. 239-245
The complexity of congestion-1 embedding in a hypercube
Young Man Kim
,
Ten-Hwang Lai
Journal of Algorithms
12
, 1991, pp. 246-280
Minimizing sums of addition chains
H. Zantema
Journal of Algorithms
12
, 1991, pp. 281-307
Easy problems for tree-decomposable graphs
Stefan Arnborg
,
Jens Lagergren
,
Detlef Seese
Journal of Algorithms
12
, 1991, pp. 308-340
Geometric clusterings
Vasilis Capoyleas
,
Günter Rote
,
Gerhard Woeginger
Journal of Algorithms
12
, 1991, pp. 341-356
Probing convex polygons with half-planes
Steven S. Skiena
Journal of Algorithms
12
, 1991, pp. 359-374
Parallel recognition of the consecutive ones property with applications
Lin Chen
,
Yaacov Yesha
Journal of Algorithms
12
, 1991, pp. 375-392
The set of minimal braids is co
NP
-complete
M.S. Paterson
,
A.A. Razborov
Journal of Algorithms
12
, 1991, pp. 393-408
Efficient parallel algorithms for series parallel graphs
Xin He
Journal of Algorithms
12
, 1991, pp. 409-430
Finding tailored partitions
John Hershberger
,
Subhash Suri
Journal of Algorithms
12
, 1991, pp. 431-463
Generalized Riemann hypothesis and factoring polynomials over finite fields
Ming-Deh A. Huang
Journal of Algorithms
12
, 1991, pp. 464-481
Factorization of polynomials over finite fields and decomposition of primes in algebraic number fields
Ming-Deh A. Huang
Journal of Algorithms
12
, 1991, pp. 482-489
Seiten 1
2
>