Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Algorithms, Volume 15
Volume 15, Number 1, July 1993
- János Csirik:
The Parametric Behavior of the First-Fit Decreasing Bin Packing Algorithm. 1-28 - Greg N. Frederickson, D. J. Guan:
Nonpreemptive Ensemble Motion Planning on a Tree. 29-60 - Carsten Thomassen:
The Even Cycle Problem for Planar Digraphs. 61-75 - Russel Schaffer, Robert Sedgewick:
The Analysis of Heapsort. 76-100 - Bjorn Poonen:
The Worst Case in Shellsort and Related Algorithms. 101-124 - David Hartvigsen:
Minimum Path Bases. 125-142 - Shietung Peng, A. B. Stephens, Yelena Yesha:
Algorithms for a Core and k-Tree Core of a Tree. 143-159 - Hans L. Bodlaender
, Ton Kloks:
A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs. 160-172 - David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery R. Westbrook, Moti Yung:
Corrigendum: Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph. 173
Volume 15, Number 2, September 1993
- Ingo Althöfer:
A Parallel Game Tree Search Algorithm with a Linear Speedup. 175-198 - Eric Bach, James R. Driscoll, Jeffrey O. Shallit:
Factor Refinement. 199-222 - Jim Joichi, Dennis Stanton:
An Algorithmic Involution for p(n). 223-228 - Pankaj K. Agarwal, Marc J. van Kreveld, Mark H. Overmars:
Intersection Queries in Curved Objects. 229-266 - Michael Formann, Dorothea Wagner, Frank Wagner:
Routing through a Dense Channel with Minimum Total Wire Length. 267-283 - Xin He:
Parallel Algorithm for Cograph Recognition with Applications. 284-313 - Pankaj K. Agarwal, Alon Efrat, Micha Sharir, Sivan Toledo:
Computing a Segment Center for a Planar Point Set. 314-323 - Yasunori Koda, Frank Ruskey:
A Gray Code for the Ideals of a Forest Poset. 324-340
Volume 15, Number 3, November 1993
- Joan M. Lucas, Dominique Roelants van Baronaigien, Frank Ruskey:
On Rotations and the Generation of Binary Trees. 343-366 - Elias Dahlhaus, Péter Hajnal, Marek Karpinski:
On the Parallel Complexity of Hamiltonian Cycle and Matching Problem on Dense Graphs. 367-384 - Judit Bar-Ilan, Guy Kortsarz, David Peleg:
How to Allocate Network Centers. 385-415 - Heather Booth, Robert Endre Tarjan:
Finding the Minimum-Cost Maximum Flow in a Series-Parallel Network. 416-446 - Lucas Chi Kwong Hui, Charles U. Martel:
Unsuccessful Search in Self-Adjusting Data Structures. 447-481 - Bojan Mohar:
Projective Planarity in Linear Time. 482-502
a service of 
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-05-13 20:15 CEST 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:
