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 YEAR=1993
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The parametric behavior of the first-fit decreasing bin packing algorithm
J. Csirik
Journal of Algorithms
15
(1), 1993, pp. 1-28
Nonpreemptive ensemble motion planning on a tree
Greg N. Frederickson
,
D.J. Guan
Journal of Algorithms
15
(1), 1993, pp. 29-60
The even cycle problem for planar digraphs
Carsten Thomassen
Journal of Algorithms
15
(1), 1993, pp. 61-75
The analysis of heapsort
Russel Schaffer
,
Robert Sedgewick
Journal of Algorithms
15
(1), 1993, pp. 76-100
The worst case in Shellsort and related algorithms
Bjorn Poonen
Journal of Algorithms
15
(1), 1993, pp. 101-124
Minimum path bases
David Hartvigsen
Journal of Algorithms
15
(1), 1993, pp. 125-142
Algorithms for a core and
k
-tree core of a tree
Shietung Peng
,
A.B. Stephens
,
Yelena Yesha
Journal of Algorithms
15
(1), 1993, pp. 143-159
A simple linear time algorithm for triangulating three-colored graphs
Hans Bodlaender
,
Ton Kloks
Journal of Algorithms
15
(1), 1993, pp. 160-172
A parallel game tree search algorithm with a linear speedup
Ingo Althöfer
Journal of Algorithms
15
(2), 1993, pp. 175-198
Factor refinement
Eric Bach
,
James Driscoll
,
Jeffrey Shallit
Journal of Algorithms
15
(2), 1993, pp. 199-222
An algorithmic involution for
p(n)
Jim Joichi
,
Dennis Stanton
Journal of Algorithms
15
(2), 1993, pp. 223-228
Intersection queries in curved objects
Pankaj K. Agarwal
,
Marc van Kreveld
,
Mark Overmars
Journal of Algorithms
15
(2), 1993, pp. 229-266
Routing through a dense channel with minimum total wire length
Michael Formann
,
Dorothea Wagner
,
Frank Wagner
Journal of Algorithms
15
(2), 1993, pp. 267-283
Parallel algorithm for cograph recognition with applications
Xin He
Journal of Algorithms
15
(2), 1993, pp. 284-313
Computing a segment center for a planar point set
Pankaj K. Agarwal
,
Alon Efrat
,
Micha Sharir
,
Sivan Toledo
Journal of Algorithms
15
(2), 1993, pp. 314-323
A Gray code for the ideals of a forest poset
Yasunori Koda
,
Frank Ruskey
Journal of Algorithms
15
(2), 1993, pp. 324-340
On rotations and the generation of binary trees
Joan M. Lucas
,
D. Roelants van Baronaigien
,
Frank Ruskey
Journal of Algorithms
15
(3), 1993, pp. 343-366
On the parallel complexity of Hamiltonian cycle and matching problem on dense graphs
Elias Dahlhaus
,
Péter Hajnal
,
Marek Karpinski
Journal of Algorithms
15
(3), 1993, pp. 367-384
How to allocate network centers
Judit Bar-Ilan
,
Guy Kortsarz
,
David Peleg
Journal of Algorithms
15
(3), 1993, pp. 385-415
Finding the minimum-cost maximum flow in a series-parallel network
Heather Booth
,
Robert E. Tarjan
Journal of Algorithms
15
(3), 1993, pp. 416-446
Unsuccessful search in self-adjusting data structures
Charles Martel
,
Lucas Chi Kwong Hui
Journal of Algorithms
15
(3), 1993, pp. 447-481
Projective planarity in linear time
Bojan Mohar
Journal of Algorithms
15
(3), 1993, pp. 482-502
On linear time minor tests with depth-first search
Hans L. Bodlaender
Journal of Algorithms
14
(1), 1993, pp. 1-23
Minimizing mean flow time in two-machine open shops and flow shops
Jianzhong Du
,
Joseph Y.-T. Leung
Journal of Algorithms
14
(1), 1993, pp. 24-44
Minimizing mean flow time with release time and deadline constraints
Jianzhong Du
,
Joseph Y.-T. Leung
Journal of Algorithms
14
(1), 1993, pp. 45-68
Seiten 1
2
>