default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Algorithms, Volume 58
Volume 58, Number 1, January 2006
- Zheng Sun, John H. Reif:
On finding approximate optimal paths in weighted regions. 1-32 - Anne Berry, Jean Paul Bordat, Pinar Heggernes
, Geneviève Simonet, Yngve Villanger:
A wide-range algorithm for minimal triangulation from an arbitrary ordering. 33-66 - Guillermo Durán, Agustín Gravano, Ross M. McConnell, Jeremy P. Spinrad, Alan Tucker:
Polynomial time recognition of unit circular-arc graphs. 67-78
Volume 58, Number 2, February 2006
- Arye Barkan, Haim Kaplan:
Partial alphabetic trees. 81-103 - Jop F. Sibeyn:
External selection. 104-117 - Igor E. Zverovich:
A new kind of graph coloring. 118-133 - Ian F. Blake, V. Kumar Murty, Guangwu Xu:
Refinements of Miller's algorithm for computing the Weil/Tate pairing. 134-149 - Aranyak Mehta, Scott Shenker, Vijay V. Vazirani:
Posted price profit maximization for multicast by approximating fixed points. 150-164
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-09 23:40 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
