default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Algorithms, Volume 47
Volume 47, Number 1, April 2003
- Xiaotie Deng
, Guojun Li, Wenan Zang, Yi Zhou:
A 2-approximation algorithm for path coloring on a restricted class of trees of rings. 1-13 - Claudia Iturriaga, Anna Lubiw:
Elastic labels around the perimeter of a map. 14-39 - Konstantin Skodinis:
Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time. 40-59 - Hatem M. Bahig, Ken Nakamula:
Erratum to "Some properties of nonstar steps in addition chains and new cases where the Scholz conjecture is true": [J. Algorithms 42 (2002) 304-316]. 60-61
Volume 47, Number 2, July 2003
- Rolf Niedermeier, Peter Rossmanith:
On efficient fixed-parameter algorithms for weighted vertex cover. 63-77 - David L. J. Alexander, David W. Bulger, Graham R. Wood:
Expected search duration for finite backtracking adaptive search. 78-86 - Noga Alon, Asaf Shapira:
Testing satisfiability. 87-103 - Boaz Tsaban:
Permutation graphs, fast forward permutations, and sampling the cycle structure of a permutation. 104-121 - Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan:
Approximation algorithms for MAX-MIN tiling. 122-134
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-02-07 23:55 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:
