default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Algorithms, Volume 26
Volume 26, Number 1, January 1998
- Philip D. MacKenzie, Quentin F. Stout
:
Ultafast Expected Time Parallel Algorithms. 1-33 - Sivaprakasam Sunder, Xin He:
Scheduling Interval Ordered Tasks in Parallel. 34-47 - Harold N. Gabow:
Algorithms for Graphic Polymatroids and Parametris s-Sets. 48-86 - Vincenzo Auletta, Domenico Parente, Giuseppe Persiano:
Placing Resources on a Growing Line. J. Algorithms 26(1): 87-100 (1998) - Ehab S. Elmallah, Lorna K. Stewart:
Polygon Graph Recognition. 101-140 - Sameet Agarwal, Anne Condon:
On Approximation Algorithms for Hierarchical MAX-SAT. 141-165 - Zhi-Zhong Chen:
Efficient Approximation Schemes for Maximization Problems on K3,3-free or K5-free Graphs. 166-187 - Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Gregory B. Sorkin:
Constructing Computer Virus Phylogenies. 188-208
Volume 26, Number 2, February 1998
- Claudio Mirolo:
Convex Minimization on a Grid and Applications. 209-237 - Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns:
NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs. 238-274 - Matthew B. Squire:
Generating the Acyclic Orientations of a Graph. 275-290 - Kazuhisa Makino, Toshihide Ibaraki:
A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions. 291-305 - Brendan D. McKay:
Isomorph-Free Exhaustive Generation. 306-324 - Lata Narayanan, Naomi Nishimura:
Interval Routing on k-Trees. 325-369 - Weimin Chen:
More Efficient Algorithm for Ordered Tree Inclusion. 370-385 - James Aspnes, William Hurwood:
Spreading Rumors Rapidly Despite an Adversary. 386-411
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 2024-10-31 20:19 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:
