On self-reducibility and weak P-selectivityKER-I KO.Journal of computer and system sciences (Print). 1983, Vol 26, Num 2, pp 209-221, issn 0022-0000Article

Efficient algorithms for computing the maximum distance between two finite planar setsBHATTACHARYA, B. K; TOUSSAINT, G. T.Journal of algorithms (Print). 1983, Vol 4, Num 2, pp 121-136, issn 0196-6774Article

Optimal enclosing regions in planar graphsBIENSTOCK, D; MONMA, C. L.Networks (New York, NY). 1989, Vol 19, Num 1, pp 79-94, issn 0028-3045, 16 p.Article

Lower bounds for the cycle detection problemFICH, F. E.Journal of computer and system sciences (Print). 1983, Vol 26, Num 3, pp 392-409, issn 0022-0000Article

New directions and new challenges in algorithm design and complexity, parameterizedFELLOWS, Michael R.Lecture notes in computer science. 2003, pp 505-519, issn 0302-9743, isbn 3-540-40545-3, 15 p.Conference Paper

The complexity of incremental convex hull algorithms in R^dKALLAY, M.Information processing letters. 1984, Vol 19, Num 4, issn 0020-0190, 197Article

Finding hamiltonian circuits in proper interval graphsBERTOSSI, A. A.Information processing letters. 1983, Vol 17, Num 2, pp 97-101, issn 0020-0190Article

Revisiting a result of KoCINTIOLI, P; SILVESTRI, R.Information processing letters. 1997, Vol 61, Num 4, pp 189-194, issn 0020-0190Article

A note on the complexity of an algorithm for Chebyshev approximationGOLDSTEIN, A. A.BIT (Nordisk Tidskrift for Informationsbehandling). 1984, Vol 24, Num 4, pp 503-509, issn 0006-3835Article

The NP-completeness column: an ongoing guideJOHNSON, D. S.Journal of algorithms (Print). 1983, Vol 4, Num 3, pp 286-300, issn 0196-6774Article

O(n²) algorithms for graph planarizationJAYAKUMAR, R; THULASIRAMAN, K; SWAMY, M. N. S et al.IEEE transactions on computer-aided design of integrated circuits and systems. 1989, Vol 8, Num 3, pp 257-267, issn 0278-0070, 11 p.Article

Incremental condition estimationBISCHOF, C. H.SIAM journal on matrix analysis and applications. 1990, Vol 11, Num 2, pp 312-322, issn 0895-4798, 11 p.Article

Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fieldsFITCHAS, N; GALLIGO, A; MORGENSTERN, J et al.Journal of pure and applied algebra. 1990, Vol 67, Num 1, pp 1-14, issn 0022-4049, 14 p.Article

Parallel algorithms for cographs and parity graphs wirth applicationsADHAR, G. S; PENG, S.Journal of algorithms (Print). 1990, Vol 11, Num 2, pp 252-284, issn 0196-6774, 33 p.Article

Computing a segment center for a planar point setAGARWAL, P. K; EFRAT, A; SHARIR, M et al.Journal of algorithms (Print). 1993, Vol 15, Num 2, pp 314-323, issn 0196-6774Article

On the distribution of comparisons in sorting algorithmsRICHARDS, D; PRAVIN VAIDYA.BIT (Nordisk Tidskrift for Informationsbehandling). 1988, Vol 28, Num 4, pp 764-774, issn 0006-3835Article

The complexity of generalized clique coveringCORNELL, D. G; FONLUPT, J.Discrete applied mathematics. 1988, Vol 22, Num 2, pp 109-118, issn 0166-218XArticle

A class of sorting algorithms based on quicksortWAINWRIGHT, R. L.Communications of the ACM. 1985, Vol 28, Num 4, pp 396-402, issn 0001-0782Article

Efficient implementation of a shifting algorithmPERL, Y; VISHKIN, U.Discrete applied mathematics. 1985, Vol 12, Num 1, pp 71-80, issn 0166-218XArticle

On the efficiency of subsumption algorithmsGOTTLOB, G; LEITSCH, A.Journal of the Association for Computing Machinery. 1985, Vol 32, Num 2, pp 280-295, issn 0004-5411Article

Backtrack: an O(1) expected time algorithm for the graph coloring problemWILF, H. S.Information processing letters. 1984, Vol 18, Num 3, pp 119-121, issn 0020-0190Article

Optimal binary split treesSHOU-HSUAN STEPHEN HUANG; WONG, C. K.Journal of algorithms (Print). 1984, Vol 5, Num 1, pp 67-79, issn 0196-6774Article

Fast evaluation of logarithms in fields of characteristic twoCOPPERSMITH, D.IEEE transactions on information theory. 1984, Vol 30, Num 4, pp 587-594, issn 0018-9448Article

The complexity of finding generalized paths in tournamentsHELL, P; ROSENFELD, M.Journal of algorithms (Print). 1983, Vol 4, Num 4, pp 303-309, issn 0196-6774Article

Lower bounds for ShellsortPLAXTON, C. G; SUEL, T.Journal of algorithms (Print). 1997, Vol 23, Num 2, pp 221-240, issn 0196-6774Article