@article{Kant/96,
AUTHOR = {Kant, G.},
TITLE = {Drawing planar graphs using the canonical ordering},
JOURNAL = {Algorithmica},
VOLUME = {16},
NUMBER = {1},
PAGES = {4-32},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Junger-Mutzel/96,
AUTHOR = {J{\"u}nger, M. and Mutzel, P.},
TITLE = {Maximum planar subgraphs and nice embeddings: Practical layout tools},
JOURNAL = {Algorithmica},
VOLUME = {16},
NUMBER = {1},
PAGES = {33-59},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Eades-Whitesides/96,
AUTHOR = {Eades, P. and Whitesides, S.},
TITLE = {The realization problem for Euclidean minimum spanning trees is $NP$-hard},
JOURNAL = {Algorithmica},
VOLUME = {16},
NUMBER = {1},
PAGES = {60-82},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bose-Lenhart-Liotta/96,
AUTHOR = {Bose, P. and Lenhart, W. and Liotta, G.},
TITLE = {Characterizing proximity trees},
JOURNAL = {Algorithmica},
VOLUME = {16},
NUMBER = {1},
PAGES = {83-110},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Pach-Shahrokhi-Szegedy/96,
AUTHOR = {Pach, J. and Shahrokhi, F. and Szegedy, M.},
TITLE = {Applications of the crossing number},
JOURNAL = {Algorithmica},
VOLUME = {16},
NUMBER = {1},
PAGES = {111-117},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Shahrokhi-Szekely-Sykora-Virto/96,
AUTHOR = {Shahrokhi, F. and Sz{\'{e}}kely, L.A. and S{\'y}kora, O. and Virt'o, I.},
TITLE = {Drawings of graphs on surfaces with few crossings},
JOURNAL = {Algorithmica},
VOLUME = {16},
NUMBER = {1},
PAGES = {118-131},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Deng-Papadimitriou/96,
AUTHOR = {Deng, Xiaotie and Papadimitriou, C.H.},
TITLE = {Competitive distributed decision-making},
JOURNAL = {Algorithmica},
VOLUME = {16},
PAGES = {133-150},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Munro-Raman/96,
AUTHOR = {Munro, J.I. and Raman, V.},
TITLE = {Fast stable in-place sorting with $O(n)$ data moves},
JOURNAL = {Algorithmica},
VOLUME = {16},
PAGES = {151-160},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Huang-Liu-Verma/96,
AUTHOR = {Huang, Shou-Hsuan S. and Liu, Hongfei and Verma, Rakesh M.},
TITLE = {A new combinatorial approach to optimal embeddings of rectangles},
JOURNAL = {Algorithmica},
VOLUME = {16},
PAGES = {161-180},
YEAR = {1996},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0178-4617&volume=16&spage=161},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Nodine-Goodrich-Vitter/96,
AUTHOR = {Nodine, M.H. and Goodrich, M.T. and Vitter, J.S.},
TITLE = {Blocking for external graph searching},
JOURNAL = {Algorithmica},
VOLUME = {16},
PAGES = {181-214},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Choy-Fagin-Stockmeyer/96,
AUTHOR = {Choy, D.M. and Fagin, R. and Stockmeyer, L.},
TITLE = {Efficiently extendible mappings for balanced data distribution},
JOURNAL = {Algorithmica},
VOLUME = {16},
PAGES = {215-232},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Mehlhorn-Mutzel/96,
AUTHOR = {Mehlhorn, K. and Mutzel, P.},
TITLE = {On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm},
JOURNAL = {Algorithmica},
VOLUME = {16},
PAGES = {233-242},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Sunder-He/96,
AUTHOR = {Sunder, S. and He, Xin},
TITLE = {An $NC$ algorithm for finding a minimum weighted completion time schedule on series parallel graphs},
JOURNAL = {Algorithmica},
VOLUME = {16},
PAGES = {243-262},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Giammarresi-Italiano/96,
AUTHOR = {Giammarresi, D. and Italiano, G.F.},
TITLE = {Decremental 2- and 3-connectivity on planar graphs},
JOURNAL = {Algorithmica},
VOLUME = {16},
PAGES = {263-287},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Iliopoulos-Moore-Park/96,
AUTHOR = {Iliopoulos, C.S. and Moore, D.W.G. and Park, K.},
TITLE = {Covering a string},
JOURNAL = {Algorithmica},
VOLUME = {16},
PAGES = {288-297},
YEAR = {1996},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0178-4617&volume=16&spage=288},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Ambainis/96,
AUTHOR = {Ambainis, A.},
TITLE = {Communication complexity in a 3-computer model},
JOURNAL = {Algorithmica},
VOLUME = {16},
PAGES = {298-301},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Wang-Jiang-Lawler/96,
AUTHOR = {Wang, Lusheng and Jiang, Tao and Lawler, E.L.},
TITLE = {Approximation algorithms for tree alignment with a given phylogeny},
JOURNAL = {Algorithmica},
VOLUME = {16},
PAGES = {302-315},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Edahiro/96,
AUTHOR = {Edahiro, M.},
TITLE = {Equispreading tree in Manhattan distanace},
JOURNAL = {Algorithmica},
VOLUME = {16},
PAGES = {316-338},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Takahashi-Suzuki-Nishizeki/96,
AUTHOR = {Takahashi, Jun-ya and Suzuki, Hitoshi and Nishizeki, Takao},
TITLE = {Shortest noncrossing paths in plane graphs},
JOURNAL = {Algorithmica},
VOLUME = {16},
PAGES = {339-357},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Luby/96,
AUTHOR = {Luby, M.},
TITLE = {Introduction to special issue on randomized and derandomized algorithms},
JOURNAL = {Algorithmica},
VOLUME = {16},
PAGES = {359-366},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Zuckerman/96,
AUTHOR = {Zuckerman, D.},
TITLE = {Simulating BPP using a general weak random source},
JOURNAL = {Algorithmica},
VOLUME = {16},
PAGES = {367-391},
YEAR = {1996},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0178-4617&volume=16&spage=367},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Jerrum-Vazirani/96,
AUTHOR = {Jerrum, M. and Vazirani, U.},
TITLE = {A mildly exponential approximation algorithm for the permanent},
JOURNAL = {Algorithmica},
VOLUME = {16},
PAGES = {392-401},
YEAR = {1996},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0178-4617&volume=16&spage=392},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Mihail-Winkler/96,
AUTHOR = {Mihail, M. and Winkler, P.},
TITLE = {On the number of Eulerian orientations of a graph},
JOURNAL = {Algorithmica},
VOLUME = {16},
PAGES = {402-414},
YEAR = {1996},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0178-4617&volume=16&spage=402},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Luby-Velickovic/96,
AUTHOR = {Luby, M. and Veli{\v{c}}kovi{\'c}, B.},
TITLE = {On deterministic approximation of DNF},
JOURNAL = {Algorithmica},
VOLUME = {16},
PAGES = {415-433},
YEAR = {1996},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0178-4617&volume=16&spage=415},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Alon-Naor/96,
AUTHOR = {Alon, N. and Naor, M.},
TITLE = {Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions},
JOURNAL = {Algorithmica},
VOLUME = {16},
PAGES = {434-449},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Mulmuley/96,
AUTHOR = {Mulmuley, K.},
TITLE = {Randomized geometric algorithms and pseudorandom generators},
JOURNAL = {Algorithmica},
VOLUME = {16},
PAGES = {450-463},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Seidel-Aragon/96,
AUTHOR = {Seidel, R. and Aragon, C.R.},
TITLE = {Randomized search trees},
JOURNAL = {Algorithmica},
VOLUME = {16},
PAGES = {464-497},
YEAR = {1996},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0178-4617&volume=16&spage=464},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Matousek-Sharir-Welzl/96,
AUTHOR = {Matou{\v{s}}ek, J. and Sharir, M. and Welzl, E.},
TITLE = {A subexponential bound for linear programming},
JOURNAL = {Algorithmica},
VOLUME = {16},
PAGES = {498-516},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Karp-Luby-Meyer_auf_der_Heide/96,
AUTHOR = {Karp, R.M. and Luby, M. and Meyer auf der Heide, F.},
TITLE = {Efficient PRAM simulation on a distributed memory machine},
JOURNAL = {Algorithmica},
VOLUME = {16},
PAGES = {517-542},
YEAR = {1996},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0178-4617&volume=16&spage=517},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Alt-Guibas-Mehlhorn-Karp-Wigderson/96,
AUTHOR = {Alt, H. and Guibas, L. and Mehlhorn, K. and Karp, R. and Wigderson, A.},
TITLE = {A method for obtaining randomized algorithms with small tail probablities},
JOURNAL = {Algorithmica},
VOLUME = {16},
PAGES = {543-547},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Flammini-Gambosi-Salomone/96,
AUTHOR = {Flammini, M. and Gambosi, G. and Salomone, S.},
TITLE = {Interval routing schemes},
JOURNAL = {Algorithmica},
VOLUME = {16},
PAGES = {549-568},
YEAR = {1996},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0178-4617&volume=16&spage=549},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Cole-Goodrich-ODunlaing/96,
AUTHOR = {Cole, R. and Goodrich, M.T. and O'D{\'{u}}nlaing, C.},
TITLE = {A nearly optimal deterministic parallel Voronoi diagram algorithm},
JOURNAL = {Algorithmica},
VOLUME = {16},
PAGES = {569-617},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Avis/96,
AUTHOR = {Avis, D.},
TITLE = {Generating rooted triangulations without repetitions},
JOURNAL = {Algorithmica},
VOLUME = {16},
PAGES = {618-632},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Johnson-Metaxas/96,
AUTHOR = {Johnson, D.B. and Metaxas, P.},
TITLE = {Optimal algorithms for the single and multiple vertex updating problems of a minimum spanning tree},
JOURNAL = {Algorithmica},
VOLUME = {16},
PAGES = {633-648},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Weiss/96,
AUTHOR = {Weiss, M.A.},
TITLE = {Shellsort with a constant number of increments},
JOURNAL = {Algorithmica},
VOLUME = {16},
PAGES = {649-654},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Maley/96,
AUTHOR = {Maley, F.M.},
TITLE = {Testing homotopic routability under polygonal wiring rules},
JOURNAL = {Algorithmica},
VOLUME = {15},
NUMBER = {1},
PAGES = {1-16},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Srinivasa_Prasanna-Musicus/96,
AUTHOR = {Srinivasa Prasanna, G.N. and Musicus, B.R.},
TITLE = {The optimal control approach to generalized multiprocessor scheduling},
JOURNAL = {Algorithmica},
VOLUME = {15},
NUMBER = {1},
PAGES = {17-49},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Wu-Manber-Myers/96,
AUTHOR = {Wu, Sun and Manber, U. and Myers, G.},
TITLE = {A subquadratic algorithm for approximate limited expression matching},
JOURNAL = {Algorithmica},
VOLUME = {15},
NUMBER = {1},
PAGES = {50-67},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Tang-Zhang-Wu/96,
AUTHOR = {Tang, Shouwen and Zhang, Kaizhong and Wu, Xiaolin},
TITLE = {Fast algorithms for minimum matrix norm with application in computer graphics},
JOURNAL = {Algorithmica},
VOLUME = {15},
NUMBER = {1},
PAGES = {68-81},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Dillencourt-Samet/96,
AUTHOR = {Dillencourt, M.B. and Samet, H.},
TITLE = {Using topological sweep to extract the boundaries of regions in maps represented by region quadtrees},
JOURNAL = {Algorithmica},
VOLUME = {15},
NUMBER = {1},
PAGES = {82-102},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Anderson-Beame-Brisson/96,
AUTHOR = {Anderson, R. and Beame, P. and Brisson, E.},
TITLE = {Parallel algorithms for arrangements},
JOURNAL = {Algorithmica},
VOLUME = {15},
PAGES = {104-125},
YEAR = {1996},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0178-4617&volume=15&spage=104},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Goodrich-Ghouse-Bright/96,
AUTHOR = {Goodrich, M.T. and Ghouse, M.R. and Bright, J.},
TITLE = {Sweep methods for parallel computational geometry},
JOURNAL = {Algorithmica},
VOLUME = {15},
PAGES = {126-153},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Tamassia-Vitter/96,
AUTHOR = {Tamassia, R. and Vitter, J.S.},
TITLE = {Optimal cooperative search in fractional cascaded data structures},
JOURNAL = {Algorithmica},
VOLUME = {15},
PAGES = {154-171},
YEAR = {1996},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0178-4617&volume=15&spage=154},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Kirkpatrick-Przytycka/96,
AUTHOR = {Kirkpatrick, D.G. and Przytycka, T.},
TITLE = {Parallel construction of binary trees with near optimal weighted path length},
JOURNAL = {Algorithmica},
VOLUME = {15},
PAGES = {172-192},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Lisper/96,
AUTHOR = {Lisper, B.},
TITLE = {Preconditioning index set transformations for time-optimal affine scheduling},
JOURNAL = {Algorithmica},
VOLUME = {15},
PAGES = {193-203},
YEAR = {1996},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0178-4617&volume=15&spage=193},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Zhang/96,
AUTHOR = {Zhang, Kaizhong},
TITLE = {A constrained edit distance between unordered labeled trees},
JOURNAL = {Algorithmica},
VOLUME = {15},
PAGES = {205-222},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Edelsbrunner-Shah/96,
AUTHOR = {Edelsbrunner, H. and Shah, N.R.},
TITLE = {Incremental topological flipping works for regular triangulations},
JOURNAL = {Algorithmica},
VOLUME = {15},
PAGES = {223-241},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Easwarakumar-Krishnan-Pandu_Rangan-Seshadri/96,
AUTHOR = {Easwarakumar, K.S. and Krishnan, S.V. and Pandu Rangan, C. and Seshadri, S.},
TITLE = {Optimal parallel algorithm for finding $st$-ambitus of a planar biconnected graph},
JOURNAL = {Algorithmica},
VOLUME = {15},
PAGES = {242-255},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Mishra/96,
AUTHOR = {Mishra, B.},
TITLE = {Bidirectional edges problem: Part I --- A simple algorithm},
JOURNAL = {Algorithmica},
VOLUME = {15},
PAGES = {256-286},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Rubinfeld/96,
AUTHOR = {Rubinfeld, R.},
TITLE = {Designing checkers for programs that run in parallel},
JOURNAL = {Algorithmica},
VOLUME = {15},
PAGES = {287-301},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{di_Battista-Tamassia/96,
AUTHOR = {di Battista, G. and Tamassia, R.},
TITLE = {On-line maintenance of triconneted components with SPQR-trees},
JOURNAL = {Algorithmica},
VOLUME = {15},
PAGES = {302-318},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Krizanc-Narayanan-Raman/96,
AUTHOR = {Krizanc, D. and Narayanan, L. and Raman, R.},
TITLE = {Fast deterministic selection on mesh-connected processor arrays},
JOURNAL = {Algorithmica},
VOLUME = {15},
PAGES = {319-331},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Nazareth/96,
AUTHOR = {Nazareth, J.L.},
TITLE = {The implementation of linear programming algorithms based on homotopies},
JOURNAL = {Algorithmica},
VOLUME = {15},
PAGES = {332-350},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Provan-Shier/96,
AUTHOR = {Provan, J.S. and Shier, D.R.},
TITLE = {A paradigm for listing $(s,t)$-cuts in graphs},
JOURNAL = {Algorithmica},
VOLUME = {15},
PAGES = {351-372},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Kalpakis-Yesha/96,
AUTHOR = {Kalpakis, K. and Yesha, Y.},
TITLE = {Scheduling tree dags on parallel architectures},
JOURNAL = {Algorithmica},
VOLUME = {15},
PAGES = {373-396},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Balas-Xue/96,
AUTHOR = {Balas, E. and Xue, Jue},
TITLE = {Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring},
JOURNAL = {Algorithmica},
VOLUME = {15},
PAGES = {397-412},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Meyer_auf_der_Heide-Oesterdiekhoff-Wanka/96,
AUTHOR = {Meyer auf der Heide, F. and Oesterdiekhoff, B. and Wanka, R.},
TITLE = {Strongly adaptive token distribution},
JOURNAL = {Algorithmica},
VOLUME = {15},
PAGES = {413-427},
YEAR = {1996},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0178-4617&volume=15&spage=413},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chazelle-Edelsbrunner-Guibas-Sharir-Stolfi/96,
AUTHOR = {Chazelle, B. and Edelsbrunner, H. and Guibas, L.J. and Sharir, M. and Stolfi, J.},
TITLE = {Lines in space: Combinatorics and algorithms},
JOURNAL = {Algorithmica},
VOLUME = {15},
PAGES = {428-447},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Frederickson/96,
AUTHOR = {Frederickson, G.N.},
TITLE = {Searching among intervals and compact routing tables},
JOURNAL = {Algorithmica},
VOLUME = {15},
PAGES = {448-466},
YEAR = {1996},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0178-4617&volume=15&spage=448},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Sprugnoli/96,
AUTHOR = {Sprugnoli, R.},
TITLE = {Recurrence relations on heaps},
JOURNAL = {Algorithmica},
VOLUME = {15},
PAGES = {467-480},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Apostilico-Preparata/96,
AUTHOR = {Apostilico, A. and Preparata, F.P.},
TITLE = {Data structures and algorithms for the string statistics problem},
JOURNAL = {Algorithmica},
VOLUME = {15},
PAGES = {481-494},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Kuchem-Wagner-Wagner/96,
AUTHOR = {Kuchem, R. and Wagner, D. and Wagner, F.},
TITLE = {Optimizing area for three-layer knock-knee channel routing},
JOURNAL = {Algorithmica},
VOLUME = {15},
PAGES = {495-519},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Cheriyan-Mehlhorn/96,
AUTHOR = {Cheriyan, J. and Mehlhorn, K.},
TITLE = {Algorithms for dense graphs and networks on the random access computer},
JOURNAL = {Algorithmica},
VOLUME = {15},
PAGES = {521-549},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Pan-Shi-Liu/96,
AUTHOR = {Pan, Peichen and Shi, Weiping and Liu, C.L.},
TITLE = {Area minimization for hierarchical floorplans},
JOURNAL = {Algorithmica},
VOLUME = {15},
PAGES = {550-571},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Cai-Kong/96,
AUTHOR = {Cai, Yang and Kong, M.C.},
TITLE = {Nonpreemptive scheduling of periodic tasks in uni- and multiprocessor systems},
JOURNAL = {Algorithmica},
VOLUME = {15},
PAGES = {572-599},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Baruah-Cohen-Plaxton-Varvel/96,
AUTHOR = {Baruah, S.K. and Cohen, N.K. and Plaxton, C.G. and Varvel, D.A.},
TITLE = {Proportionate progress: A notion of fairness in resource allocation},
JOURNAL = {Algorithmica},
VOLUME = {15},
PAGES = {600-625},
YEAR = {1996},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0178-4617&volume=15&spage=600},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Agarwal-Kreveld/96,
AUTHOR = {Agarwal, P.K. and Kreveld, M. van},
TITLE = {Connected component and simple polygon intersection searching},
JOURNAL = {Algorithmica},
VOLUME = {15},
PAGES = {626-660},
YEAR = {1996},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}