@article{Schuierer-Wood/95,
AUTHOR = {Schuierer, S. and Wood, D.},
TITLE = {Staircase visibility and computation of kernels},
JOURNAL = {Algorithmica},
VOLUME = {14},
NUMBER = {1},
PAGES = {1-26},
YEAR = {1995},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Choi-Shin-Chwa/95,
AUTHOR = {Choi, Seung-Hak and Shin, Sung Yong and Chwa, Kyung-Yong},
TITLE = {Characterizing and recognizing the visibility graph of a funnel-shaped polygon},
JOURNAL = {Algorithmica},
VOLUME = {14},
NUMBER = {1},
PAGES = {27-51},
YEAR = {1995},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chlebus-Diks-Kowaluk/95,
AUTHOR = {Chlebus, B.S. and Diks, K. and Kowaluk, M.},
TITLE = {$O(\log\log n)$-time integer geometry on the CRCW PRAM},
JOURNAL = {Algorithmica},
VOLUME = {14},
NUMBER = {1},
PAGES = {52-69},
YEAR = {1995},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Goldman-Sloan/95,
AUTHOR = {Goldman, S.A. and Sloan, R.H.},
TITLE = {Can PAC learning algorithms tolerate random attribute noise?},
JOURNAL = {Algorithmica},
VOLUME = {14},
NUMBER = {1},
PAGES = {70-84},
YEAR = {1995},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Knight-Myers/95a,
AUTHOR = {Knight, J.R. and Myers, E.W.},
TITLE = {Approximate regular expression pattern matching with concave gap penalties},
JOURNAL = {Algorithmica},
VOLUME = {14},
NUMBER = {1},
PAGES = {85-121},
YEAR = {1995},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0178-4617&volume=14&issue=1&spage=85},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Borie/95,
AUTHOR = {Borie, R.B.},
TITLE = {Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs},
JOURNAL = {Algorithmica},
VOLUME = {14},
PAGES = {123-137},
YEAR = {1995},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Cai-Corneil/95,
AUTHOR = {Cai, L. and Corneil, D.},
TITLE = {Isomorphic tree spanner problems},
JOURNAL = {Algorithmica},
VOLUME = {14},
PAGES = {138-153},
YEAR = {1995},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Dietz-Mehlhorn-Raman-Uhrig/95,
AUTHOR = {Dietz, P. and Mehlhorn, K. and Raman, R. and Uhrig, C.},
TITLE = {Lower bounds for set intersection queries},
JOURNAL = {Algorithmica},
VOLUME = {14},
PAGES = {154-168},
YEAR = {1995},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0178-4617&volume=14&spage=154},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Amato-Preparata/95,
AUTHOR = {Amato, N.M. and Preparata, F.P.},
TITLE = {A time-optimal parallel algorithm for three-dimensional convex hulls},
JOURNAL = {Algorithmica},
VOLUME = {14},
PAGES = {169-182},
YEAR = {1995},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Amato/95,
AUTHOR = {Amato, N.M.},
TITLE = {Finding a closest visible vertex pair between two polygons},
JOURNAL = {Algorithmica},
VOLUME = {14},
PAGES = {183-201},
YEAR = {1995},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chou-Woo/95,
AUTHOR = {Chou, Shuo-Yan and Woo, T.C.},
TITLE = {A linear-time algorithm for constructing a circular visibility diagram},
JOURNAL = {Algorithmica},
VOLUME = {14},
PAGES = {203-228},
YEAR = {1995},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{McConnell/95,
AUTHOR = {McConnell, R.M.},
TITLE = {An $O(n^2)$ incremental algorithm for modular decomposition of graphs and 2-structures},
JOURNAL = {Algorithmica},
VOLUME = {14},
PAGES = {229-248},
YEAR = {1995},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Ukkonen/95,
AUTHOR = {Ukkonen, E.},
TITLE = {On-line construction of suffix trees},
JOURNAL = {Algorithmica},
VOLUME = {14},
PAGES = {249-260},
YEAR = {1995},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Lingas-Maheshwari-Sack/95,
AUTHOR = {Lingas, A. and Maheshwari, A. and Sack, J.-R.},
TITLE = {Optimal parallel algorithms for rectilinear link-distance problems},
JOURNAL = {Algorithmica},
VOLUME = {14},
PAGES = {261-289},
YEAR = {1995},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Leighton-Makedon-Tollis/95,
AUTHOR = {Leighton, T. and Makedon, F. and Tollis, I.G.},
TITLE = {A $2n-2$ step algorithm for routing in an $n\times n$ array with constant-size queues},
JOURNAL = {Algorithmica},
VOLUME = {14},
PAGES = {291-304},
YEAR = {1995},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Khuller-Raghavachari-Young/95,
AUTHOR = {Khuller, S. and Raghavachari, B. and Young, N.},
TITLE = {Balancing minimum spanning trees and shortest-path trees},
JOURNAL = {Algorithmica},
VOLUME = {14},
PAGES = {305-321},
YEAR = {1995},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Subramanian-Tamassia-Vitter/95,
AUTHOR = {Subramanian, S. and Tamassia, R. and Vitter, J.S.},
TITLE = {An efficient parallel algorithm for shortest paths in planar layered digraphs},
JOURNAL = {Algorithmica},
VOLUME = {14},
PAGES = {322-339},
YEAR = {1995},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Panny-Prodinger/95,
AUTHOR = {Panny, W. and Prodinger, H.},
TITLE = {Bottom-up mergesort --- A detailed analysis},
JOURNAL = {Algorithmica},
VOLUME = {14},
PAGES = {340-354},
YEAR = {1995},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Breslauer-Galil/95,
AUTHOR = {Breslauer, D. and Galil, Z.},
TITLE = {Finding all periods and initial palindromes of a string in parallel},
JOURNAL = {Algorithmica},
VOLUME = {14},
PAGES = {355-366},
YEAR = {1995},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0178-4617&volume=14&spage=355},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chen-Ierardi/95,
AUTHOR = {Chen, Yui-Bin and Ierardi, D.J.},
TITLE = {The complexity of oblivious plans for orienting and distinguishing polygonal parts},
JOURNAL = {Algorithmica},
VOLUME = {14},
PAGES = {367-397},
YEAR = {1995},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Kao-Teng-Toyama/95,
AUTHOR = {Kao, Ming-Yang and Teng, Shang-Hua and Toyama, K.},
TITLE = {An optimal parallel algorithm for planar cycle separators},
JOURNAL = {Algorithmica},
VOLUME = {14},
PAGES = {398-408},
YEAR = {1995},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Yao/95,
AUTHOR = {Yao, A.C.-C.},
TITLE = {Minimean optimal key arrangements in hash tables},
JOURNAL = {Algorithmica},
VOLUME = {14},
PAGES = {409-428},
YEAR = {1995},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Atallah-Chen-Lee/95,
AUTHOR = {Atallah, M.J. and Chen, D.Z. and Lee, D.T.},
TITLE = {An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications},
JOURNAL = {Algorithmica},
VOLUME = {14},
PAGES = {429-441},
YEAR = {1995},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0178-4617&volume=14&spage=429},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Donald-Xavier/95,
AUTHOR = {Donald, B.R. and Xavier, P.G.},
TITLE = {Provably good approximation algorithms for optimal kinodynamic planning: Robots with decoupled dynamics bounds},
JOURNAL = {Algorithmica},
VOLUME = {14},
PAGES = {443-479},
YEAR = {1995},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Donald-Xavier/95a,
AUTHOR = {Donald, B.R. and Xavier, P.G.},
TITLE = {Provably good approximation algorithms for optimal kinodynamic planning for Cartesian robots and open-chain manipulators},
JOURNAL = {Algorithmica},
VOLUME = {14},
PAGES = {480-530},
YEAR = {1995},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Kececioglu-Myers/95,
AUTHOR = {Kececioglu, J.D. and Myers, E.W.},
TITLE = {Combinatorial algorithms for DNA sequence assembly},
JOURNAL = {Algorithmica},
VOLUME = {13},
NUMBER = {1-2},
PAGES = {7-51},
YEAR = {1995},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Alizadeh-Karp-Newberg-Weisser/95,
AUTHOR = {Alizadeh, F. and Karp, R.M. and Newberg, L.A. and Weisser, D.K.},
TITLE = {Physical mapping of chromosomes: A combinatorial problem in molecular biology},
JOURNAL = {Algorithmica},
VOLUME = {13},
NUMBER = {1-2},
PAGES = {52-76},
YEAR = {1995},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0178-4617&volume=13&issue=1-2&spage=52},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Pevzner/95,
AUTHOR = {Pevzner, P.A.},
TITLE = {DNA physical mapping and alternating Eulerian cycles in colored graphs},
JOURNAL = {Algorithmica},
VOLUME = {13},
NUMBER = {1-2},
PAGES = {77-105},
YEAR = {1995},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Chao-Miller/95,
AUTHOR = {Chao, Kun-Mao and Miller, W.},
TITLE = {Linear-space algorithms that build local alignments from fragments},
JOURNAL = {Algorithmica},
VOLUME = {13},
NUMBER = {1-2},
PAGES = {106-134},
YEAR = {1995},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Pevzner-Waterman/95,
AUTHOR = {Pevzner, P.A. and Waterman, M.S.},
TITLE = {Multiple filtration and approximate pattern matching},
JOURNAL = {Algorithmica},
VOLUME = {13},
NUMBER = {1-2},
PAGES = {135-154},
YEAR = {1995},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Farach-Kannan-Warnow/95,
AUTHOR = {Farach, M. and Kannan, S. and Warnow, T.},
TITLE = {A robust model for finding optimal evolutionary trees},
JOURNAL = {Algorithmica},
VOLUME = {13},
NUMBER = {1-2},
PAGES = {155-179},
YEAR = {1995},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Kececioglu-Sankoff/95,
AUTHOR = {Kececioglu, J. and Sankoff, D.},
TITLE = {Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement},
JOURNAL = {Algorithmica},
VOLUME = {13},
NUMBER = {1-2},
PAGES = {180-210},
YEAR = {1995},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Knight-Myers/95,
AUTHOR = {Knight, J.R. and Myers, E.W.},
TITLE = {Super-pattern matching},
JOURNAL = {Algorithmica},
VOLUME = {13},
NUMBER = {1-2},
PAGES = {211-243},
YEAR = {1995},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Cohen-Tamassia/95,
AUTHOR = {Cohen, R.F. and Tamassia, R.},
TITLE = {Dynamic expression trees},
JOURNAL = {Algorithmica},
VOLUME = {13},
PAGES = {245-265},
YEAR = {1995},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Fellows-Kratochvil-Middendorf-Pfeiffer/95,
AUTHOR = {Fellows, M.R. and Kratochv{\'{i}}l, J. and Middendorf, M. and Pfeiffer, F.},
TITLE = {The complexity of induced minors and related problems},
JOURNAL = {Algorithmica},
VOLUME = {13},
PAGES = {266-282},
YEAR = {1995},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Humenik-Matthews-Stephens-Yesha/95,
AUTHOR = {Humenik, K. and Matthews, P. and Stephens, A.B. and Yesha, Y.},
TITLE = {A lower bound on the probability of conflict under nonuniform access in database systems},
JOURNAL = {Algorithmica},
VOLUME = {13},
PAGES = {283-300},
YEAR = {1995},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Lenhof-Smid/95,
AUTHOR = {Lenhof, H.-P. and Smid, M.},
TITLE = {Maintaining the visibility map of spheres while moving the viewpoint on a circle at infinity},
JOURNAL = {Algorithmica},
VOLUME = {13},
PAGES = {301-312},
YEAR = {1995},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0178-4617&volume=13&spage=301},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Mahmoud/95,
AUTHOR = {Mahmoud, H.M.},
TITLE = {The joint distribution of the three types of nodes in uniform binary trees},
JOURNAL = {Algorithmica},
VOLUME = {13},
PAGES = {313-323},
YEAR = {1995},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Agarwal-Matousek/95,
AUTHOR = {Agarwal, P.K. and Matou{\v{s}}ek, J.},
TITLE = {Dynamic half-space range reporting and its applications},
JOURNAL = {Algorithmica},
VOLUME = {13},
PAGES = {325-345},
YEAR = {1995},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Bruschi-Ravasio/95,
AUTHOR = {Bruschi, D. and Ravasio, F.},
TITLE = {Random parallel algorithms for finding exact Branchings, perfect matchings, and cycles},
JOURNAL = {Algorithmica},
VOLUME = {13},
PAGES = {346-356},
YEAR = {1995},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Junger-Pulleyblank/95,
AUTHOR = {J{\"u}nger, M. and Pulleyblank, W.},
TITLE = {New primal and dual matching heuristics},
JOURNAL = {Algorithmica},
VOLUME = {13},
PAGES = {357-380},
YEAR = {1995},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Du/95,
AUTHOR = {Du, Ding-Zhu},
TITLE = {On greedy heuristics for Steiner minimum trees},
JOURNAL = {Algorithmica},
VOLUME = {13},
PAGES = {381-386},
YEAR = {1995},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{de_Rezende-Lee/95,
AUTHOR = {de Rezende, P.J. and Lee, D.T.},
TITLE = {Point set pattern matching in $d$-dimensions},
JOURNAL = {Algorithmica},
VOLUME = {13},
PAGES = {387-404},
YEAR = {1995},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Crochemore-Rytter/95,
AUTHOR = {Crochemore, M. and Rytter, W.},
TITLE = {Squares, cubes, and time-space efficient string searching},
JOURNAL = {Algorithmica},
VOLUME = {13},
PAGES = {405-425},
YEAR = {1995},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{McGeoch/95,
AUTHOR = {McGeoch, C.C.},
TITLE = {All-pairs shortest paths and the essential subgraph},
JOURNAL = {Algorithmica},
VOLUME = {13},
PAGES = {426-441},
YEAR = {1995},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Atkinson-Vaidya/95,
AUTHOR = {Atkinson, D.S. and Vaidya, P.M.},
TITLE = {Using geometry to solve the transportation problem in the plane},
JOURNAL = {Algorithmica},
VOLUME = {13},
PAGES = {442-461},
YEAR = {1995},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Eppstein/95,
AUTHOR = {Eppstein, D.},
TITLE = {Asymptotic speed-ups in constructive solid geometry},
JOURNAL = {Algorithmica},
VOLUME = {13},
PAGES = {462-471},
YEAR = {1995},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Lazanas-Latombe/95,
AUTHOR = {Lazanas, A. and Latombe, J.-C.},
TITLE = {Landmark-based robot navigation},
JOURNAL = {Algorithmica},
VOLUME = {13},
PAGES = {472-501},
YEAR = {1995},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Henzinger/95,
AUTHOR = {Henzinger, M.R.},
TITLE = {Fully dynamic biconnectivity in graphs},
JOURNAL = {Algorithmica},
VOLUME = {13},
PAGES = {503-538},
YEAR = {1995},
URL = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0178-4617&volume=13&spage=503},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Schweikard-Wilson/95,
AUTHOR = {Schweikard, A. and Wilson, R.H.},
TITLE = {Assembly sequences for polyhedra},
JOURNAL = {Algorithmica},
VOLUME = {13},
PAGES = {539-552},
YEAR = {1995},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{He/95,
AUTHOR = {He, Xin},
TITLE = {An efficient parallel algorithm for finding rectangular duals of plane triangular graphs},
JOURNAL = {Algorithmica},
VOLUME = {13},
PAGES = {553-572},
YEAR = {1995},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{Habib-Huchard-Spinrad/95,
AUTHOR = {Habib, M. and Huchard, M. and Spinrad, J.},
TITLE = {A linear algorithm to decompose inheritance graphs into modules},
JOURNAL = {Algorithmica},
VOLUME = {13},
PAGES = {573-591},
YEAR = {1995},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}
@article{de_la_Torre-Greenlaw-Schaffer/95,
AUTHOR = {de la Torre, P. and Greenlaw, R. and Sch{\"a}ffer, A.A.},
TITLE = {Optimal edge ranking of trees in polynomial time},
JOURNAL = {Algorithmica},
VOLUME = {13},
PAGES = {592-618},
YEAR = {1995},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
}