@article{Zhang-He/06,
AUTHOR = {Zhang, Huaming and He, Xin},
TITLE = {On simultaneous straight-line grid embedding of a planar graph and its dual},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {99},
NUMBER = {1},
PAGES = {1-6},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, planar graph, simultaneous embedding},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4JHMY68-9/2/39ceb0449629f645070674f982416ef3},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jamison-Matthews-Villalpando/06,
AUTHOR = {Jamison, Robert E. and Matthews, Gretchen L. and Villalpando, John},
TITLE = {Acyclic colorings of products of trees},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {99},
NUMBER = {1},
PAGES = {7-12},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {coloring, graph products, hamming codes, interconnection networks, trees},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4JKHM9D-1/2/b71d22bb6a0874095c79b0fe7f66382b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dourado-Protti-Szwarcfiter/06,
AUTHOR = {Dourado, Mitre C. and Protti, F{\'a}bio and Szwarcfiter, Jayme L.},
TITLE = {Complexity aspects of generalized Helly hypergraphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {99},
NUMBER = {1},
PAGES = {13-18},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {helly property, helly hypergraphs, intersecting sets, computational complexity, combinatorial problems},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4JHMY68-4/2/8b5b49c7d63c5a900ca4f9877d95df6c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chen/06a,
AUTHOR = {Chen, Yangjun},
TITLE = {On the cost of searching signature trees},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {99},
NUMBER = {1},
PAGES = {19-26},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {data structures, index, signature files, signature identifiers, signature trees, probabilistic analysis, contour integration},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4JP9G22-1/2/522db3c3b71333517472181e99ae9a5d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Choffrut-Grigorieff/06,
AUTHOR = {Choffrut, Christian and Grigorieff, Serge},
TITLE = {Separability of rational relations in $A^* \times N^m$ by recognizable relations is decidable},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {99},
NUMBER = {1},
PAGES = {27-32},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {automata, recognizability, separability, formal languages},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4JKHM9D-2/2/3dba4c69dd9654bad6f73055af227b80},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Muscholl-Samuelides-Segoufin/06,
AUTHOR = {Muscholl, Anca and Samuelides, Mathias and Segoufin, Luc},
TITLE = {Complementing deterministic tree-walking automata},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {99},
NUMBER = {1},
PAGES = {33-39},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, formal languages, tree-automata},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4JHMY68-7/2/8b798a0fb59cf1cf0db3d19809efbe78},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hellwig-Volkmann/06,
AUTHOR = {Hellwig, Angelika and Volkmann, Lutz},
TITLE = {Lower bounds on the vertex-connectivity of digraphs and graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {99},
NUMBER = {2},
PAGES = {41-46},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {fault tolerance, connectivity, minimum degree, maximum degree, degree sequence},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4JRVBCG-1/2/1f99566340c1804c4323f59e65fb395b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Min-Weifan/06,
AUTHOR = {Min, Chen and Weifan, Wang},
TITLE = {The 2-dipath chromatic number of Halin graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {99},
NUMBER = {2},
PAGES = {47-53},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, oriented coloring, halin graph},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4JHMY68-D/2/9b85feec74d3ea31f11b6cbb90f9443a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bagchi-Bhargava-Suel/06,
AUTHOR = {Bagchi, Amitabha and Bhargava, Ankur and Suel, Torsten},
TITLE = {Approximate maximum weight branchings},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {99},
NUMBER = {2},
PAGES = {54-58},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, graph algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4JHMY68-B/2/7a3add72e492664d60f86f287e0b4d08},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cameron-Hoang/06,
AUTHOR = {Cameron, Kathie and Ho{\`a}ng, Ch{\'{i}}nh T.},
TITLE = {On the structure of certain intersection graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {99},
NUMBER = {2},
PAGES = {59-63},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {intersection graphs, computational geometry, chromatic number, perfect graph, polygon-circle graph, interval-filament graph, graph divisibility},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4JMVHX6-1/2/23eaccd781884349fd5f3b617372e2bd},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lin-Tsai-Tang/06,
AUTHOR = {Lin, Chung-Ming and Tsai, Yin Te and Tang, Chuan Yi},
TITLE = {Balancing minimum spanning trees and multiple-source minimum routing cost spanning trees on metric graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {99},
NUMBER = {2},
PAGES = {64-67},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4JG5FM6-2/2/f49f51e10c94675ff93a8f9572e7a153},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Montassier/06,
AUTHOR = {Montassier, Micka{\"e}l},
TITLE = {A note on the not 3-choosability of some families of planar graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {99},
NUMBER = {2},
PAGES = {68-71},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, coloring, list-coloring, choosability},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4JHMY68-8/2/06743f7e46e4c335c768a2f04c0789d5},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Xirotiri/06,
AUTHOR = {Xirotiri, Olga},
TITLE = {Simulation of simultaneous safe recursion over an arbitrary structure},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {99},
NUMBER = {2},
PAGES = {72-81},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {safe recursion, bss-machines, projective turing machines, theory of computation, computational complexity},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4JRVBCG-2/2/21d62466fb8e8537a5997c98a1d1e268},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bletsas-Audsley/06,
AUTHOR = {Bletsas, Konstantinos and Audsley, Neil},
TITLE = {Optimal priority assignment in the presence of blocking},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {99},
NUMBER = {3},
PAGES = {83-86},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {real-time systems, fixed priority scheduling, priority assignment, optimality, blocking, priority ceiling protocol},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4JN2P47-1/2/31b60e43126621dcd60f49b06f2f9522},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Avidor-Rosen/06,
AUTHOR = {Avidor, Adi and Rosen, Ricky},
TITLE = {A note on unique games},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {99},
NUMBER = {3},
PAGES = {87-91},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, analysis of algorithms, approximation algorithms, computational complexity, theory of computation},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4JT38N9-1/2/cb41a080e0094c1359a2c94394adb2f6},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Peczarski/06,
AUTHOR = {Peczarski, Marcin},
TITLE = {An improvement of the tree code construction},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {99},
NUMBER = {3},
PAGES = {92-95},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, fault tolerance, randomized algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4JRKD3C-2/2/3ff28823dfc2f63877cd980b34a70ec5},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Voorhies-Lee-Klappenecker/06,
AUTHOR = {Voorhies, Seth and Lee, Hyunyoung and Klappenecker, Andreas},
TITLE = {Fair service for mice in the presence of elephants},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {99},
NUMBER = {3},
PAGES = {96-101},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, randomized algorithms, caching, probabilistic queues},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4JRVBCG-3/2/9f5a3d4e35d3b701561448daa1fc9877},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cheng-Ng-Kotov/06,
AUTHOR = {Cheng, T.C.E. and Ng, C.T. and Kotov, Vladimir},
TITLE = {A new algorithm for online uniform-machine scheduling to minimize the makespan},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {99},
NUMBER = {3},
PAGES = {102-105},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {online algorithms, competitive ratio, multi-machine scheduling, uniform machines},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4JHMY68-C/2/89b865d151c1df6018494a0643951c40},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chou-Chen/06,
AUTHOR = {Chou, Shih-Chien and Chen, Yuan-Chien},
TITLE = {Retrieving reusable components with variation points from software product lines},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {99},
NUMBER = {3},
PAGES = {106-110},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {software product line, variation point, reuse, retrieval, feature, software engineering},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4JT38N9-2/2/bef3ecdfcbc406174886c90db741e17d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Vagvolgyi/06,
AUTHOR = {V{\'a}gv{\"o}lgyi, S{\'a}ndor},
TITLE = {Descendants of a recognizable tree language for sets of linear monadic term rewrite rules},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {99},
NUMBER = {3},
PAGES = {111-118},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {monadic term rewrite system, tree automaton, descendant of a tree language, formal languages},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4JT38N9-3/2/ad76be30a6e07b54de2babe683472171},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hougardy-Vinkemeier/06,
AUTHOR = {Hougardy, Stefan and Vinkemeier, Doratha E.},
TITLE = {Approximating weighted matchings in parallel},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {99},
NUMBER = {3},
PAGES = {119-123},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, parallel algorithms, analysis of algorithms, graph algorithms, maximum weight matching},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4JRKD3C-1/2/dc12edc52e11b89cf0ebde346f0ba724},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jiang/06a,
AUTHOR = {Jiang, Minghui},
TITLE = {A new approximation algorithm for labeling points with circle pairs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {99},
NUMBER = {4},
PAGES = {125-129},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational geometry, approximation algorithm, map labeling, circle packing},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4K1X5T1-2/2/6f819c71bc087b14cddc6e800b5a4c50},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Yuster/06,
AUTHOR = {Yuster, Raphael},
TITLE = {Finding and counting cliques and independent sets in $r$-uniform hypergraphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {99},
NUMBER = {4},
PAGES = {130-134},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, hypergraphs, fast matrix multiplication},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4K1X5T1-4/2/ab533d5eb59018cf2a57806324d6b398},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Tan/06a,
AUTHOR = {Tan, Chik How},
TITLE = {Analysis of improved signcryption scheme with key privacy},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {99},
NUMBER = {4},
PAGES = {135-138},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, signcryption},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4JYKKYB-3/2/51527ba3a8231b9128b83ea0843d6ccf},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Xu-Kang-Shan/06,
AUTHOR = {Xu, Guangjun and Kang, Liying and Shan, Erfang},
TITLE = {Acyclic domination on bipartite permutation graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {99},
NUMBER = {4},
PAGES = {139-144},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, dominating set, acyclic dominating set, bipartite permutation graph},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4JYKKYB-2/2/78fd55c2d8ce7cbc6b41e24af9288f8b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Tsaban/06,
AUTHOR = {Tsaban, Boaz},
TITLE = {Fast generators for the Diffie-Hellman key agreement protocol and malicious standards},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {99},
NUMBER = {4},
PAGES = {145-148},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {diffie-hellman problem, discrete logarithm problem, fast generators, trapdoor, cryptography},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4JXRX8G-1/2/761248ba20018e8849a976c62bd607b3},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Huang-Shi-Zhang-Zhu/06,
AUTHOR = {Huang, Wei and Shi, Yaoyun and Zhang, Shengyu and Zhu, Yufan},
TITLE = {The communication complexity of the Hamming distance problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {99},
NUMBER = {4},
PAGES = {149-153},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, communication complexity, hamming distance},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4K2SKCG-1/2/74a99533be8d3d933cc3ccfb9bd23ff3},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{van_Dijk-Kevenaar-Schrijen-Tuyls/06,
AUTHOR = {van Dijk, Marten and Kevenaar, Tom and Schrijen, Geert-Jan and Tuyls, Pim},
TITLE = {Improved constructions of secret sharing schemes by applying $(\lambda,\omega)$-decompositions},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {99},
NUMBER = {4},
PAGES = {154-157},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, secret sharing, information rate},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4JWMTB7-1/2/510d42a0cf8be76c96991fdb1857f5ab},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Danvy-Rohde/06,
AUTHOR = {Danvy, Olivier and Rohde, Henning Korsholm},
TITLE = {On obtaining the Boyer-Moore string-matching algorithm by partial evaluation},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {99},
NUMBER = {4},
PAGES = {158-162},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {partial evaluation, binding-time improvement, bounded static variation, horspool string-matching algorithm, boyer-moore string-matching algorithm, algorithms, analysis of algorithms, data structures, design of algorithms, functional programming, program correctness, program derivation, program specification, programming languages, software design and implementation, theory of computation},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4JYKKYB-1/2/522b3aa1c5f01b2235b750d0dc544751},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ikeda-Nakazawa/06,
AUTHOR = {Ikeda, Satoshi and Nakazawa, Koji},
TITLE = {Strong normalization proofs by CPS-translations},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {99},
NUMBER = {4},
PAGES = {163-170},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {programming calculi, continuation passing style translation, strong normalization, classical natural deduction, permutative conversion},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4JTRTDF-1/2/567127a2b5edd77b16d12e4bf83a6d81},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Takenaga-Walsh/06,
AUTHOR = {Takenaga, Yasuhiko and Walsh, Toby},
TITLE = {TETRAVEX is $NP$-complete},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {99},
NUMBER = {5},
PAGES = {171-174},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, np-completeness, tetravex},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4K4WN0G-1/2/0badfcb109e57d9fb25d16b6fc60e39e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Moffat-Anh/06,
AUTHOR = {Moffat, Alistair and Anh, Vo Ngoc},
TITLE = {Binary codes for locally homogeneous sequences},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {99},
NUMBER = {5},
PAGES = {175-180},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {compression, coding, elias code, huffman code, minimum-redundancy code, locally adaptive code, information retrieval, algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4K5HWP2-1/2/d627f40e87cc9328c06ae9d2362f8181},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kuba/06,
AUTHOR = {Kuba, Markus},
TITLE = {On Quickselect, partial sorting and Multiple Quickselect},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {99},
NUMBER = {5},
PAGES = {181-186},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, analysis of algorithms, selection},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4K1X5T1-1/2/161fdc33c54edf35806b3c8e7598423e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Levin/06,
AUTHOR = {Levin, Asaf},
TITLE = {Real time scheduling with a budget: Parametric-search is better than binary search},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {99},
NUMBER = {5},
PAGES = {187-191},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {parametric-search method, approximation algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4K4WN0G-5/2/82a4ae9745cd9f78d15a47eb24817f81},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Li-Sun-Chen/06,
AUTHOR = {Li, Shisheng and Sun, Guangzhong and Chen, Guoliang},
TITLE = {Improved algorithm for finding next-to-shortest paths},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {99},
NUMBER = {5},
PAGES = {192-194},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, computational complexity, shortest paths},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4K1X5T1-5/2/0670ec1d6dcd5b658db28a7d293c7ca6},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Mestre/06,
AUTHOR = {Mestre, Juli{\'a}n},
TITLE = {On the multi-radius cover problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {99},
NUMBER = {5},
PAGES = {195-198},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, covering problems},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4K5ST95-1/2/e78b9b02595bceb3c7870ee6cc212191},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Janssen-Nourine/06,
AUTHOR = {Janssen, Philippe and Nourine, Lhouari},
TITLE = {Minimum implicational basis for $\wedge$-semidistributive lattices},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {99},
NUMBER = {5},
PAGES = {199-202},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, lattice, closure system, minimum implicational basis},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4K4WN0G-3/2/b8b73383457b48b9852e4a5f830c8f71},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Sakai/06,
AUTHOR = {Sakai, Yoshifumi},
TITLE = {A linear space algorithm for computing a longest common increasing subsequence},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {99},
NUMBER = {5},
PAGES = {203-207},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, longest common subsequence, longest increasing subsequence},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4K4WN0G-2/2/3db4a4626f053b0575f5b2f7e0406be8},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Devillers-Van_Begin/06,
AUTHOR = {Devillers, Raymond and Van Begin, Laurent},
TITLE = {Boundedness undecidability for synchronized nets},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {99},
NUMBER = {5},
PAGES = {208-214},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {synchronized nets, concurrency, boundedness, decidability},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4K4WN0G-4/2/392005fed0e746a3e29fd9684c26b6f1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Grosse-Rothe-Wechsung/06,
AUTHOR = {Gro{\ss}e, Andr{\'e} and Rothe, J{\"o}rg and Wechsung, Gerd},
TITLE = {On computing the smallest four-coloring of planar graphs and non-self-reducible sets in $P$},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {99},
NUMBER = {6},
PAGES = {215-221},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, graph colorability, self-reducibility},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4K1X5T1-3/2/285aeb63673ccb631082b427979128be},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Tripakis/06,
AUTHOR = {Tripakis, Stavros},
TITLE = {Folk theorems on the determinization and minimization of timed automata},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {99},
NUMBER = {6},
PAGES = {222-226},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal methods, specification languages, timed automata, determinization, decidability},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4K1X5T1-7/2/85706df6b93c15c891ebec29241b97f2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Subramanian/06,
AUTHOR = {Subramanian, C.R.},
TITLE = {Analysis of a heuristic for acyclic edge colouring},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {99},
NUMBER = {6},
PAGES = {227-229},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, acyclic edge colouring},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4K5JBWD-1/2/afe70d91e07154f0bd661950562fa587},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kosowski-Malafiejski-Zylinski/06,
AUTHOR = {Kosowski, Adrian and Ma{\l}afiejski, Micha{\l} and {\.Z}yli{\'n}ski, Pawe{\l}},
TITLE = {An approximation algorithm for maximum $P_3$-packing in subcubic graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {99},
NUMBER = {6},
PAGES = {230-233},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, path factor, subcubic graph},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4K4WN0G-7/2/4211b3ffa86a82b74617a2181958d662},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Coja-Oghlan-Kuhtz/06,
AUTHOR = {Coja-Oghlan, Amin and Kuhtz, Lars},
TITLE = {An improved algorithm for approximating the chromatic number of $G_{n,p}$},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {99},
NUMBER = {6},
PAGES = {234-238},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, graph algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4K42BST-1/2/791e2d54e50fdc74cb6917a2ee4694ce},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fischer-Holzer-Katzenbeisser/06,
AUTHOR = {Fischer, Felix and Holzer, Markus and Katzenbeisser, Stefan},
TITLE = {The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {99},
NUMBER = {6},
PAGES = {239-245},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, game theory, pure strategy nash equilibrium},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4K4WN0G-6/2/519ca1675955e3b842f3de97502d7b7f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gagie/06a,
AUTHOR = {Gagie, Travis},
TITLE = {Large alphabets and incompressibility},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {99},
NUMBER = {6},
PAGES = {246-251},
YEAR = {2006},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, data compression, kolmogorov complexity, shannon's entropy, empirical entropy, normal numbers, de bruijn sequences, threshold phenomena, self-information, markov processes, relative entropy, birthday paradox},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4K1X5T1-6/2/3fb386021f7557586e61b85074a6c5a0},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}