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=Algorithmica AND YEAR=1996
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Drawing planar graphs using the canonical ordering
G. Kant
Algorithmica
16
(1), 1996, pp. 4-32
Maximum planar subgraphs and nice embeddings: Practical layout tools
M. Jünger
,
P. Mutzel
Algorithmica
16
(1), 1996, pp. 33-59
The realization problem for Euclidean minimum spanning trees is
NP
-hard
P. Eades
,
S. Whitesides
Algorithmica
16
(1), 1996, pp. 60-82
Characterizing proximity trees
P. Bose
,
W. Lenhart
,
G. Liotta
Algorithmica
16
(1), 1996, pp. 83-110
Applications of the crossing number
J. Pach
,
F. Shahrokhi
,
M. Szegedy
Algorithmica
16
(1), 1996, pp. 111-117
Drawings of graphs on surfaces with few crossings
F. Shahrokhi
,
L.A. Székely
,
O. Sýkora
,
I. Virt'o
Algorithmica
16
(1), 1996, pp. 118-131
Competitive distributed decision-making
Xiaotie Deng
,
C.H. Papadimitriou
Algorithmica
16
, 1996, pp. 133-150
Fast stable in-place sorting with
O(n)
data moves
J.I. Munro
,
V. Raman
Algorithmica
16
, 1996, pp. 151-160
A new combinatorial approach to optimal embeddings of rectangles
Shou-Hsuan S. Huang
,
Hongfei Liu
,
Rakesh M. Verma
Algorithmica
16
, 1996, pp. 161-180
Blocking for external graph searching
M.H. Nodine
,
M.T. Goodrich
,
J.S. Vitter
Algorithmica
16
, 1996, pp. 181-214
Efficiently extendible mappings for balanced data distribution
D.M. Choy
,
R. Fagin
,
L. Stockmeyer
Algorithmica
16
, 1996, pp. 215-232
On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm
K. Mehlhorn
,
P. Mutzel
Algorithmica
16
, 1996, pp. 233-242
An
NC
algorithm for finding a minimum weighted completion time schedule on series parallel graphs
S. Sunder
,
Xin He
Algorithmica
16
, 1996, pp. 243-262
Decremental 2- and 3-connectivity on planar graphs
D. Giammarresi
,
G.F. Italiano
Algorithmica
16
, 1996, pp. 263-287
Covering a string
C.S. Iliopoulos
,
D.W.G. Moore
,
K. Park
Algorithmica
16
, 1996, pp. 288-297
Communication complexity in a 3-computer model
A. Ambainis
Algorithmica
16
, 1996, pp. 298-301
Approximation algorithms for tree alignment with a given phylogeny
Lusheng Wang
,
Tao Jiang
,
E.L. Lawler
Algorithmica
16
, 1996, pp. 302-315
Equispreading tree in Manhattan distanace
M. Edahiro
Algorithmica
16
, 1996, pp. 316-338
Shortest noncrossing paths in plane graphs
Jun-ya Takahashi
,
Hitoshi Suzuki
,
Takao Nishizeki
Algorithmica
16
, 1996, pp. 339-357
Introduction to special issue on randomized and derandomized algorithms
M. Luby
Algorithmica
16
, 1996, pp. 359-366
Simulating BPP using a general weak random source
D. Zuckerman
Algorithmica
16
, 1996, pp. 367-391
A mildly exponential approximation algorithm for the permanent
M. Jerrum
,
U. Vazirani
Algorithmica
16
, 1996, pp. 392-401
On the number of Eulerian orientations of a graph
M. Mihail
,
P. Winkler
Algorithmica
16
, 1996, pp. 402-414
On deterministic approximation of DNF
M. Luby
,
B. Velic̑ković
Algorithmica
16
, 1996, pp. 415-433
Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
N. Alon
,
M. Naor
Algorithmica
16
, 1996, pp. 434-449
Seiten 1
2
3
>