default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Algorithms, Volume 21
Volume 21, Number 1, July 1996
- Goos Kant:
Augmenting Outerplanar Graphs. 1-25 - Sampath Kannan, Eugene L. Lawler, Tandy J. Warnow:
Determining the Evolutionary Tree Using Experiments. 26-50 - Anna Galluccio, Martin Loebl
:
Cycles of Prescribed Modularity in Planar Digraphs. 51-70 - Artur Czumaj:
Very Fast Approximation of the Matrix Chain Product Problem. 71-79 - Marco Pellegrini:
Repetitive Hidden Surface Removal for Polyhedra. 80-101 - Dusan Hvalica:
Best First Search Algorithm in AND/OR Graphs with Cycles. 102-110 - David Eu, Eric Guévremont, Godfried T. Toussaint:
On Envelopes of Arrangements of Lines. 111-148 - Jirí Sgall:
Randomized On-Line Scheduling of Parallel Jobs. 149-175 - Alan M. Frieze, Mark Jerrum, Michael Molloy, Robert W. Robinson, Nicholas C. Wormald:
Generating and Counting Hamilton Cycles in Random Regular Graphs. 176-198
Volume 21, Number 2, September 1996
- Roberto Tamassia:
On-Line Planar Graph Embedding. 201-239 - Paul Tseng, Zhi-Quan Luo:
On Computing the Nested Sums and Infimal Convolutions of Convex Piecewise-Linear Functions. 240-266 - G. Ramalingam, Thomas W. Reps:
An Incremental Algorithm for a Generalization of the Shortest-Path Problem. 267-305 - H. Narayanan, Subir K. Roy, Sachin B. Patkar:
Approximation Algorithms for Min-k-Overlap Problems Using the Principal Lattice of Partitions Approach. 306-330 - Edith Cohen:
Efficient Parallel Shortest-Paths in Digraphs with a Separator Decomposition. 331-357 - Hans L. Bodlaender, Ton Kloks:
Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs. 358-402 - Dorit S. Hochbaum, Joseph Naor:
Approximation Algorithms for Network Design Problems on Bounded Subsets. 403-414 - Han Hoogeveen:
Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria. 415-433 - Samir Khuller, Balaji Raghavachari:
Improved Approximation Algorithms for Uniform Connectivity Problems. 434-450
Volume 21, Number 3, November 1996
- John Hershberger, Subhash Suri:
Off-Line Maintenance of Planar Configurations. 453-475 - Colin McDiarmid, Ryan Hayward:
Large Deviations for Quicksort. 476-507 - Pankaj K. Agarwal, Micha Sharir:
Ray Shooting Amidst Convex Polygons in 2D. 508-519 - Bruno Becker, Paolo Giulio Franciosa, Stephan Gschwind, Stefano Leonardi, Thomas Ohler, Peter Widmayer:
Enclosing a Set of Objects by Two Minimum Area Rectangles. 520-541 - Luitpold Babel, Ilia N. Ponomarenko, Gottfried Tinhofer:
The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs. 542-564 - Michael Kaib, Claus-Peter Schnorr:
The Generalized Gauss Reduction Algorithm. 565-578 - Bernard Chazelle, Jirí Matousek:
On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension. 579-597 - Xiao Zhou, Shin-Ichi Nakano, Takao Nishizeki:
Edge-Coloring Partial k-Trees. 598-617 - Michael L. Fredman, Leonid Khachiyan:
On the Complexity of Dualization of Monotone Disjunctive Normal Forms. 618-628 - Mark H. Overmars, A. Frank van der Stappen:
Range Searching and Point Location among Fat Objects. 629-656 - Subir Kumar Ghosh:
Corrigendum: A Note on Computing the Visibility Polygon from a Convex Chain. 657-662
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-01-08 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:
