Goswami, D.; Mall, R. An efficient method for computing dynamic program slices. (English) Zbl 1032.68064 Inf. Process. Lett. 81, No. 2, 111-117 (2002). MSC: 68N99 PDFBibTeX XMLCite \textit{D. Goswami} and \textit{R. Mall}, Inf. Process. Lett. 81, No. 2, 111--117 (2002; Zbl 1032.68064) Full Text: DOI
Lai, Wei; Eades, Peter Removing edge-node intersections in drawings of graphs. (English) Zbl 1032.68991 Inf. Process. Lett. 81, No. 2, 105-110 (2002). MSC: 68W05 68R10 PDFBibTeX XMLCite \textit{W. Lai} and \textit{P. Eades}, Inf. Process. Lett. 81, No. 2, 105--110 (2002; Zbl 1032.68991) Full Text: DOI
Chung, Tae-Sun; Kim, Hyoung-Joo Extracting indexing information from XML DTDs. (English) Zbl 1032.68648 Inf. Process. Lett. 81, No. 2, 97-103 (2002). MSC: 68P15 68P05 PDFBibTeX XMLCite \textit{T.-S. Chung} and \textit{H.-J. Kim}, Inf. Process. Lett. 81, No. 2, 97--103 (2002; Zbl 1032.68648) Full Text: DOI
Bulterman, R. W.; van der Sommen, F. W.; Zwaan, G.; Verhoeff, T. On computing a longest path in a tree. (English) Zbl 1032.68671 Inf. Process. Lett. 81, No. 2, 93-96 (2002). MSC: 68R10 68N99 PDFBibTeX XMLCite \textit{R. W. Bulterman} et al., Inf. Process. Lett. 81, No. 2, 93--96 (2002; Zbl 1032.68671) Full Text: DOI
Kobayashi, Noritaka; Tsuchiya, Tatsuhiro; Kikuno, Tohru A new method for constructing pair-wise covering designs for software testing. (English) Zbl 1032.68583 Inf. Process. Lett. 81, No. 2, 85-91 (2002). MSC: 68N99 PDFBibTeX XMLCite \textit{N. Kobayashi} et al., Inf. Process. Lett. 81, No. 2, 85--91 (2002; Zbl 1032.68583) Full Text: DOI
Bachman, Aleksander; Janiak, Adam; Kovalyov, Mikhail Y. Minimizing the total weighted completion time of deteriorating jobs. (English) Zbl 1032.68019 Inf. Process. Lett. 81, No. 2, 81-84 (2002). MSC: 68M20 PDFBibTeX XMLCite \textit{A. Bachman} et al., Inf. Process. Lett. 81, No. 2, 81--84 (2002; Zbl 1032.68019) Full Text: DOI
Petersen, Holger Bounds for the Element Distinctness Problem on one-tape Turing machines. (English) Zbl 1032.68077 Inf. Process. Lett. 81, No. 2, 75-79 (2002). MSC: 68Q05 68Q25 PDFBibTeX XMLCite \textit{H. Petersen}, Inf. Process. Lett. 81, No. 2, 75--79 (2002; Zbl 1032.68077) Full Text: DOI
Noga, John; Seiden, Steve; Woeginger, Gerhard J. A faster off-line algorithm for the TCP acknowledgement problem. (English) Zbl 1050.68012 Inf. Process. Lett. 81, No. 2, 71-73 (2002). MSC: 68M12 68M10 PDFBibTeX XMLCite \textit{J. Noga} et al., Inf. Process. Lett. 81, No. 2, 71--73 (2002; Zbl 1050.68012) Full Text: DOI
Koiran, Pascal Transfer theorems via sign conditions. (English) Zbl 1032.68086 Inf. Process. Lett. 81, No. 2, 65-69 (2002). MSC: 68Q25 PDFBibTeX XMLCite \textit{P. Koiran}, Inf. Process. Lett. 81, No. 2, 65--69 (2002; Zbl 1032.68086) Full Text: DOI
Branke, Jürgen; Leppert, Stefan; Middendorf, Martin; Eades, Peter Width-restricted layering of acyclic digraphs with consideration of dummy nodes. (English) Zbl 1032.68117 Inf. Process. Lett. 81, No. 2, 59-63 (2002). MSC: 68R10 68Q25 PDFBibTeX XMLCite \textit{J. Branke} et al., Inf. Process. Lett. 81, No. 2, 59--63 (2002; Zbl 1032.68117) Full Text: DOI