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=SIAM J. Comput. AND Volume=26
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Randomized
\tilde{O}(M(|V|))
algorithms for problems in matching theory
Joseph Cheriyan
SIAM Journal on Computing
26
(6), 1997, pp. 1635-1655
Maximum agreement subtree in a set of evolutionary trees: Metrics and efficient algorithms
Amihood Amir
,
Dmitry Keselman
SIAM Journal on Computing
26
(6), 1997, pp. 1656-1669
The union of convex polyhedra in three dimensions
Boris Aronov
,
Micha Sharir
,
Boaz Tagansky
SIAM Journal on Computing
26
(6), 1997, pp. 1670-1688
Star unfolding of a polytope with applications
Pankaj K. Agarwal
,
Boris Aronov
,
Joseph O'Rourke
,
Catherine A. Schevon
SIAM Journal on Computing
26
(6), 1997, pp. 1689-1713
Computing envelopes in four dimensions with applications
Pankaj K. Agarwal
,
Boris Aronov
,
Micha Sharir
SIAM Journal on Computing
26
(6), 1997, pp. 1714-1732
A spectral technique for coloring random 3-colorable graphs
Noga Alon
,
Nabil Kahale
SIAM Journal on Computing
26
(6), 1997, pp. 1733-1748
A fast algorithm for the computation and enumeration of perfect phylogenies
Sampath Kannan
,
Tandy Warnow
SIAM Journal on Computing
26
(6), 1997, pp. 1749-1763
Fault-tolerant meshes with small degree
Jehoshua Bruck
,
Robert Cypher
,
Ching-Tien Ho
SIAM Journal on Computing
26
(6), 1997, pp. 1764-1784
On translational motion planning of a convex polyhedron in 3-space
Boris Aronov
,
Micha Sharir
SIAM Journal on Computing
26
(6), 1997, pp. 1785-1803
Seiten
<
1
2
3
4