- Email: [email protected]
Author Index — Volume 99 (2006)
Information Processing Letters 99 (2006) 254–255 www.elsevier.com/locate/ipl
Author Index — Volume 99 (2006)
Anh, V.N., see Moffat, A. Audsley, N., see Bletsas, K. Avidor, A. and R. Rosen, A note on Unique Games Bagchi, A., A. Bhargava and T. Suel, Approximate maximum weight branchings Bhargava, A., see Bagchi, A. Bletsas, K. and N. Audsley, Optimal priority assignment in the presence of blocking Cameron, K. and C.T. Hoàng, On the structure of certain intersection graphs Chen, G., see Li, S. Chen, Y., On the cost of searching signature trees Chen, Y.-C., see Chou, S.-C. Cheng, T.C.E., C.T. Ng and V. Kotov, A new algorithm for online uniform-machine scheduling to minimize the makespan Choffrut, C. and S. Grigorieff, Separability of rational relations in A∗ × Nm by recognizable relations is decidable Chou, S.-C. and Y.-C. Chen, Retrieving reusable components with variation points from software product lines Coja-Oghlan, A. and L. Kuhtz, An improved algorithm for approximating the chromatic number of Gn, p Danvy, O. and H.K. Rohde, On obtaining the Boyer–Moore string-matching algorithm by partial evaluation Devillers, R. and L. Van Begin, Boundedness undecidability for synchronized nets Dourado, M.C., F. Protti and J.L. Szwarcfiter, Complexity aspects of generalized Helly hypergraphs Fischer, F., M. Holzer and S. Katzenbeisser, The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria Gagie, T., Large alphabets and incompressibility Grigorieff, S., see Choffrut, C. Große, A., J. Rothe and G. Wechsung, On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P 0020-0190/2006 Published by Elsevier B.V. doi:10.1016/S0020-0190(06)00190-6
99 (2006) 175 99 (2006) 83 99 (2006)
87
99 (2006) 99 (2006)
54 54
99 (2006)
83
99 (2006) 59 99 (2006) 192 99 (2006) 19 99 (2006) 106
99 (2006) 102
99 (2006)
27
99 (2006) 106
99 (2006) 234
99 (2006) 158 99 (2006) 208
99 (2006)
13
99 (2006) 239 99 (2006) 246 99 (2006) 27
99 (2006) 215
He, X., see Zhang, H. Hellwig, A. and L. Volkmann, Lower bounds on the vertex-connectivity of digraphs and graphs Hoàng, C.T., see Cameron, K. Holzer, M., see Fischer, F. Hougardy, S. and D.E. Vinkemeier, Approximating weighted matchings in parallel Huang, W., Y. Shi, S. Zhang and Y. Zhu, The communication complexity of the Hamming distance problem Ikeda, S. and K. Nakazawa, Strong normalization proofs by CPS-translations Jamison, R.E., G.L. Matthews and J. Villalpando, Acyclic colorings of products of trees Janssen, P. and L. Nourine, Minimum implicational basis for ∧-semidistributive lattices Jiang, M., A new approximation algorithm for labeling points with circle pairs Kang, L., see Xu, G. Katzenbeisser, S., see Fischer, F. Kevenaar, T., see van Dijk, M. Klappenecker, A., see Voorhies, S. ˙ nski, ´ Kosowski, A., M. Małafiejski and P. Zyli An approximation algorithm for maximum P3 packing in subcubic graphs Kotov, V., see Cheng, T.C.E. Kuba, M., On Quickselect, partial sorting and Multiple Quickselect Kuhtz, L., see Coja-Oghlan, A. Lee, H., see Voorhies, S. Levin, A., Real time scheduling with a budget: Parametric-search is better than binary search Li, S., G. Sun and G. Chen, Improved algorithm for finding next-to-shortest paths Lin, C.-M., Y.T. Tsai and C.Y. Tang, Balancing minimum spanning trees and multiple-source minimum routing cost spanning trees on metric graphs Małafiejski, M., see Kosowski, A. Matthews, G.L., see Jamison, R.E. Mestre, J., On the multi-radius cover problem
99 (2006)
1
99 (2006) 41 99 (2006) 59 99 (2006) 239 99 (2006) 119
99 (2006) 149
99 (2006) 163
99 (2006)
7
99 (2006) 199 99 (2006) 125 99 (2006) 139 99 (2006) 239 99 (2006) 154 99 (2006) 96
99 (2006) 230 99 (2006) 102 99 (2006) 181 99 (2006) 234 99 (2006)
96
99 (2006) 187 99 (2006) 192
99 (2006)
64
99 (2006) 230 99 (2006) 7 99 (2006) 195
Author Index — Volume 99 (2006)
Min, C. and W. Weifan, The 2-dipath chromatic number of Halin graphs Moffat, A. and V.N. Anh, Binary codes for locally homogeneous sequences Montassier, M., A note on the not 3-choosability of some families of planar graphs Muscholl, A., M. Samuelides and L. Segoufin, Complementing deterministic tree-walking automata
99 (2006)
47
99 (2006) 175 99 (2006)
68
99 (2006)
33
Nakazawa, K., see Ikeda, S. Ng, C.T., see Cheng, T.C.E. Nourine, L., see Janssen, P.
99 (2006) 163 99 (2006) 102 99 (2006) 199
Peczarski, M., An improvement of the tree code construction Protti, F., see Dourado, M.C.
99 (2006) 99 (2006)
Rohde, H.K., see Danvy, O. Rosen, R., see Avidor, A. Rothe, J., see Große, A.
99 (2006) 158 99 (2006) 87 99 (2006) 215
Sakai, Y., A linear space algorithm for computing a longest common increasing subsequence Samuelides, M., see Muscholl, A. Schrijen, G.-J., see van Dijk, M. Segoufin, L., see Muscholl, A. Shan, E., see Xu, G. Shi, Y., see Huang, W. Subramanian, C.R., Analysis of a heuristic for acyclic edge colouring Suel, T., see Bagchi, A. Sun, G., see Li, S. Szwarcfiter, J.L., see Dourado, M.C. Takenaga, Y. and T. Walsh, T ETRAVEX is NPcomplete Tan, C.H., Analysis of improved signcryption scheme with key privacy Tang, C.Y., see Lin, C.-M.
99 (2006) 99 (2006) 99 (2006) 99 (2006) 99 (2006) 99 (2006)
92 13
203 33 154 33 139 149
Tripakis, S., Folk theorems on the determinization and minimization of timed automata Tsaban, B., Fast generators for the Diffie–Hellman key agreement protocol and malicious standards Tsai, Y.T., see Lin, C.-M. Tuyls, P., see van Dijk, M.
255
99 (2006) 222
99 (2006) 145 99 (2006) 64 99 (2006) 154
Vágvölgyi, S., Descendants of a recognizable tree language for sets of linear monadic term rewrite rules Van Begin, L., see Devillers, R. van Dijk, M., T. Kevenaar, G.-J. Schrijen and P. Tuyls, Improved constructions of secret sharing schemes by applying (λ, ω)-decompositions Villalpando, J., see Jamison, R.E. Vinkemeier, D.E., see Hougardy, S. Volkmann, L., see Hellwig, A. Voorhies, S., H. Lee and A. Klappenecker, Fair service for mice in the presence of elephants
99 (2006)
Walsh, T., see Takenaga, Y. Wechsung, G., see Große, A. Weifan, W., see Min, C.
99 (2006) 171 99 (2006) 215 99 (2006) 47
99 (2006) 111 99 (2006) 208
99 (2006) 154 99 (2006) 7 99 (2006) 119 99 (2006) 41 96
Xirotiri, O., Simulation of simultaneous safe recursion over an arbitrary structure Xu, G., L. Kang and E. Shan, Acyclic domination on bipartite permutation graphs
99 (2006) 139
99 (2006) 227 99 (2006) 54 99 (2006) 192 99 (2006) 13
Yuster, R., Finding and counting cliques and independent sets in r-uniform hypergraphs
99 (2006) 130
99 (2006) 171
Zhang, H. and X. He, On simultaneous straightline grid embedding of a planar graph and its dual Zhang, S., see Huang, W. Zhu, Y., see Huang, W. ˙ nski, ´ Zyli P., see Kosowski, A.
99 (2006) 1 99 (2006) 149 99 (2006) 149 99 (2006) 230
99 (2006) 135 99 (2006) 64
99 (2006)
72
Author Index — Volume 99 (2006)
Anh, V.N., see Moffat, A. Audsley, N., see Bletsas, K. Avidor, A. and R. Rosen, A note on Unique Games Bagchi, A., A. Bhargava and T. Suel, Approximate maximum weight branchings Bhargava, A., see Bagchi, A. Bletsas, K. and N. Audsley, Optimal priority assignment in the presence of blocking Cameron, K. and C.T. Hoàng, On the structure of certain intersection graphs Chen, G., see Li, S. Chen, Y., On the cost of searching signature trees Chen, Y.-C., see Chou, S.-C. Cheng, T.C.E., C.T. Ng and V. Kotov, A new algorithm for online uniform-machine scheduling to minimize the makespan Choffrut, C. and S. Grigorieff, Separability of rational relations in A∗ × Nm by recognizable relations is decidable Chou, S.-C. and Y.-C. Chen, Retrieving reusable components with variation points from software product lines Coja-Oghlan, A. and L. Kuhtz, An improved algorithm for approximating the chromatic number of Gn, p Danvy, O. and H.K. Rohde, On obtaining the Boyer–Moore string-matching algorithm by partial evaluation Devillers, R. and L. Van Begin, Boundedness undecidability for synchronized nets Dourado, M.C., F. Protti and J.L. Szwarcfiter, Complexity aspects of generalized Helly hypergraphs Fischer, F., M. Holzer and S. Katzenbeisser, The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria Gagie, T., Large alphabets and incompressibility Grigorieff, S., see Choffrut, C. Große, A., J. Rothe and G. Wechsung, On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P 0020-0190/2006 Published by Elsevier B.V. doi:10.1016/S0020-0190(06)00190-6
99 (2006) 175 99 (2006) 83 99 (2006)
87
99 (2006) 99 (2006)
54 54
99 (2006)
83
99 (2006) 59 99 (2006) 192 99 (2006) 19 99 (2006) 106
99 (2006) 102
99 (2006)
27
99 (2006) 106
99 (2006) 234
99 (2006) 158 99 (2006) 208
99 (2006)
13
99 (2006) 239 99 (2006) 246 99 (2006) 27
99 (2006) 215
He, X., see Zhang, H. Hellwig, A. and L. Volkmann, Lower bounds on the vertex-connectivity of digraphs and graphs Hoàng, C.T., see Cameron, K. Holzer, M., see Fischer, F. Hougardy, S. and D.E. Vinkemeier, Approximating weighted matchings in parallel Huang, W., Y. Shi, S. Zhang and Y. Zhu, The communication complexity of the Hamming distance problem Ikeda, S. and K. Nakazawa, Strong normalization proofs by CPS-translations Jamison, R.E., G.L. Matthews and J. Villalpando, Acyclic colorings of products of trees Janssen, P. and L. Nourine, Minimum implicational basis for ∧-semidistributive lattices Jiang, M., A new approximation algorithm for labeling points with circle pairs Kang, L., see Xu, G. Katzenbeisser, S., see Fischer, F. Kevenaar, T., see van Dijk, M. Klappenecker, A., see Voorhies, S. ˙ nski, ´ Kosowski, A., M. Małafiejski and P. Zyli An approximation algorithm for maximum P3 packing in subcubic graphs Kotov, V., see Cheng, T.C.E. Kuba, M., On Quickselect, partial sorting and Multiple Quickselect Kuhtz, L., see Coja-Oghlan, A. Lee, H., see Voorhies, S. Levin, A., Real time scheduling with a budget: Parametric-search is better than binary search Li, S., G. Sun and G. Chen, Improved algorithm for finding next-to-shortest paths Lin, C.-M., Y.T. Tsai and C.Y. Tang, Balancing minimum spanning trees and multiple-source minimum routing cost spanning trees on metric graphs Małafiejski, M., see Kosowski, A. Matthews, G.L., see Jamison, R.E. Mestre, J., On the multi-radius cover problem
99 (2006)
1
99 (2006) 41 99 (2006) 59 99 (2006) 239 99 (2006) 119
99 (2006) 149
99 (2006) 163
99 (2006)
7
99 (2006) 199 99 (2006) 125 99 (2006) 139 99 (2006) 239 99 (2006) 154 99 (2006) 96
99 (2006) 230 99 (2006) 102 99 (2006) 181 99 (2006) 234 99 (2006)
96
99 (2006) 187 99 (2006) 192
99 (2006)
64
99 (2006) 230 99 (2006) 7 99 (2006) 195
Author Index — Volume 99 (2006)
Min, C. and W. Weifan, The 2-dipath chromatic number of Halin graphs Moffat, A. and V.N. Anh, Binary codes for locally homogeneous sequences Montassier, M., A note on the not 3-choosability of some families of planar graphs Muscholl, A., M. Samuelides and L. Segoufin, Complementing deterministic tree-walking automata
99 (2006)
47
99 (2006) 175 99 (2006)
68
99 (2006)
33
Nakazawa, K., see Ikeda, S. Ng, C.T., see Cheng, T.C.E. Nourine, L., see Janssen, P.
99 (2006) 163 99 (2006) 102 99 (2006) 199
Peczarski, M., An improvement of the tree code construction Protti, F., see Dourado, M.C.
99 (2006) 99 (2006)
Rohde, H.K., see Danvy, O. Rosen, R., see Avidor, A. Rothe, J., see Große, A.
99 (2006) 158 99 (2006) 87 99 (2006) 215
Sakai, Y., A linear space algorithm for computing a longest common increasing subsequence Samuelides, M., see Muscholl, A. Schrijen, G.-J., see van Dijk, M. Segoufin, L., see Muscholl, A. Shan, E., see Xu, G. Shi, Y., see Huang, W. Subramanian, C.R., Analysis of a heuristic for acyclic edge colouring Suel, T., see Bagchi, A. Sun, G., see Li, S. Szwarcfiter, J.L., see Dourado, M.C. Takenaga, Y. and T. Walsh, T ETRAVEX is NPcomplete Tan, C.H., Analysis of improved signcryption scheme with key privacy Tang, C.Y., see Lin, C.-M.
99 (2006) 99 (2006) 99 (2006) 99 (2006) 99 (2006) 99 (2006)
92 13
203 33 154 33 139 149
Tripakis, S., Folk theorems on the determinization and minimization of timed automata Tsaban, B., Fast generators for the Diffie–Hellman key agreement protocol and malicious standards Tsai, Y.T., see Lin, C.-M. Tuyls, P., see van Dijk, M.
255
99 (2006) 222
99 (2006) 145 99 (2006) 64 99 (2006) 154
Vágvölgyi, S., Descendants of a recognizable tree language for sets of linear monadic term rewrite rules Van Begin, L., see Devillers, R. van Dijk, M., T. Kevenaar, G.-J. Schrijen and P. Tuyls, Improved constructions of secret sharing schemes by applying (λ, ω)-decompositions Villalpando, J., see Jamison, R.E. Vinkemeier, D.E., see Hougardy, S. Volkmann, L., see Hellwig, A. Voorhies, S., H. Lee and A. Klappenecker, Fair service for mice in the presence of elephants
99 (2006)
Walsh, T., see Takenaga, Y. Wechsung, G., see Große, A. Weifan, W., see Min, C.
99 (2006) 171 99 (2006) 215 99 (2006) 47
99 (2006) 111 99 (2006) 208
99 (2006) 154 99 (2006) 7 99 (2006) 119 99 (2006) 41 96
Xirotiri, O., Simulation of simultaneous safe recursion over an arbitrary structure Xu, G., L. Kang and E. Shan, Acyclic domination on bipartite permutation graphs
99 (2006) 139
99 (2006) 227 99 (2006) 54 99 (2006) 192 99 (2006) 13
Yuster, R., Finding and counting cliques and independent sets in r-uniform hypergraphs
99 (2006) 130
99 (2006) 171
Zhang, H. and X. He, On simultaneous straightline grid embedding of a planar graph and its dual Zhang, S., see Huang, W. Zhu, Y., see Huang, W. ˙ nski, ´ Zyli P., see Kosowski, A.
99 (2006) 1 99 (2006) 149 99 (2006) 149 99 (2006) 230
99 (2006) 135 99 (2006) 64
99 (2006)
72