Latest Issue of Information Processing Letters
http://www.ingentaconnect.com/content/els/00200190/latest
RSS feed of the most recently published issue of Information Processing LettersRSS feed of the most recently published issue of Information Processing LettersLatest Issue of Information Processing Letters RSS Feed2014-12-25T13:16:48Zdaily22004-01-01T07:00+00:00ElsevierCopyright 2001 Elsevier B.V., Amsterdam. All rights reserved.Information Processing Lettersingentaconnect30 April 20030020-0190
http://www.ingentaconnect.com/content/els/00200190/2003/00000086/00000002/art00244
Board of EditorsBoard of Editorsapplication/pdf862CO2CO2
http://www.ingentaconnect.com/content/els/00200190/2003/00000086/00000002/art00480
Flaw and modification of the iKP electronic payment protocolsFlaw and modification of the iKP electronic payment protocolsapplication/pdfOgata, K.Futatsugi, K.K.OgataOgata, K.K.FutatsugiFutatsugi, K.8625762
http://www.ingentaconnect.com/content/els/00200190/2003/00000086/00000002/art00476
A linear time 53-approximation for the minimum strongly-connected spanning subgraph problemA linear time 53-approximation for the minimum strongly-connected spanning subgraph problemapplication/pdfZhao, L.Nagamochi, H.Ibaraki, T.L.ZhaoZhao, L.H.NagamochiNagamochi, H.T.IbarakiIbaraki, T.8626370
http://www.ingentaconnect.com/content/els/00200190/2003/00000086/00000002/art00482
On the spectrum of projective norm-graphsOn the spectrum of projective norm-graphsapplication/pdfSzabo, T.T.SzaboSzabo, T.8627174
http://www.ingentaconnect.com/content/els/00200190/2003/00000086/00000002/art00475
A lower bound for the hitting set size for combinatorial rectangles and an applicationA lower bound for the hitting set size for combinatorial rectangles and an applicationapplication/pdfChandran, L.S.L.S.ChandranChandran, L.S.8627578
http://www.ingentaconnect.com/content/els/00200190/2003/00000086/00000002/art00479
On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphsOn the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphsapplication/pdfKikuchi, Y.Shibata, Y.Y.KikuchiKikuchi, Y.Y.ShibataShibata, Y.8627985
http://www.ingentaconnect.com/content/els/00200190/2003/00000086/00000002/art00474
A 53-approximation algorithm for scheduling vehicles on a path with release and handling timesA 53-approximation algorithm for scheduling vehicles on a path with release and handling timesapplication/pdfGaur, D.R.Gupta, A.Krishnamurti, R.D.R.GaurGaur, D.R.A.GuptaGupta, A.R.KrishnamurtiKrishnamurti, R.8628791
http://www.ingentaconnect.com/content/els/00200190/2003/00000086/00000002/art00477
Fault-tolerant wormhole routing for hypercube networksFault-tolerant wormhole routing for hypercube networksapplication/pdfShih, J.J.ShihShih, J.86293100
http://www.ingentaconnect.com/content/els/00200190/2003/00000086/00000002/art00478
On the complexity of digraph packingsOn the complexity of digraph packingsapplication/pdfBrewster, R.C.Rizzi, R.R.C.BrewsterBrewster, R.C.R.RizziRizzi, R.862101106
http://www.ingentaconnect.com/content/els/00200190/2003/00000086/00000002/art00481
A CAT algorithm for generating permutations with a fixed number of inversionsA CAT algorithm for generating permutations with a fixed number of inversionsapplication/pdfEffler, S.Ruskey, F.S.EfflerEffler, S.F.RuskeyRuskey, F.862107112