default search action
Journal of Algorithms, Volume 32
Volume 32, Number 1, July 1999
- Nader H. Bshouty:
Lower Bounds for the Complexity of Functions in a Realistic RAM Model. 1-20 - Vincenzo Auletta, Yefim Dinitz, Zeev Nutov, Domenico Parente:
A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph. 21-30 - Yefim Dinitz, Zeev Nutov:
A 3-Approximation Algorithm for Finding Optimum 4, 5-Vertex-Connected Spanning Subgraphs. 31-40 - Ton Kloks, Dieter Kratsch, Haiko Müller:
Approximating the Bandwidth for Asteroidal Triple-Free Graphs. 41-57 - Samir Khuller, Manfred Göbel, Jochen Walter:
Bases for Polynomial Invariants of Conjugates of Permutation Groups. 58-61
Volume 32, Number 2, August 1999
- Paola Bonizzoni, Gianluca Della Vedova:
An Algorithm for the Modular Decomposition of Hypergraphs. 65-86 - J. Scott Provan, Roger C. Burk:
Two-Connected Augmentation Problems in Planar Graphs. 87-107 - Joseph Gil, Alon Itai:
How to Pack Trees. 108-132 - Nils Klarlund:
An n log n Algorithm for Online BDD Refinement. 133-154 - Ming Li, Louxin Zhang:
Twist-Rotation Transformations of Binary Trees and Arithmetic Expressions. 155-166 - Hans L. Bodlaender, Dimitrios M. Thilikos:
Graphs with Branchwidth at Most Three. 167-194 - Ruy Luiz Milidiú, Eduardo Sany Laber, Artur Alves Pessoa:
Bounding the Compression Loss of the FGK Algorithm. 195-211
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.