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=58
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On finding approximate optimal paths in weighted regions
Zheng Sun
,
John H. Reif
Journal of Algorithms
58
(1), 2006, pp. 1-32
A wide-range algorithm for minimal triangulation from an arbitrary ordering
Anne Berry
,
Jean-Paul Bordat
,
Pinar Heggernes
,
Geneviève Simonet
,
Yngve Villanger
Journal of Algorithms
58
(1), 2006, pp. 33-66
Polynomial time recognition of unit circular-arc graphs
Guillermo Durán
,
Agustín Gravano
,
Ross M. McConnell
,
Jeremy Spinrad
,
Alan Tucker
Journal of Algorithms
58
(1), 2006, pp. 67-78
Partial alphabetic trees
Arye Barkan
,
Haim Kaplan
Journal of Algorithms
58
(2), 2006, pp. 81-103
External selection
Jop F. Sibeyn
Journal of Algorithms
58
(2), 2006, pp. 104-117
A new kind of graph coloring
Igor E. Zverovich
Journal of Algorithms
58
(2), 2006, pp. 118-133
Refinements of Miller's algorithm for computing the Weil/Tate pairing
Ian F. Blake
,
V. Kumar Murty
,
Guangwu Xu
Journal of Algorithms
58
(2), 2006, pp. 134-149
Posted price profit maximization for multicast by approximating fixed points
Aranyak Mehta
,
Scott Shenker
,
Vijay V. Vazirani
Journal of Algorithms
58
(2), 2006, pp. 150-164