@article{Horn/07,
AUTHOR = {Horn, Florian},
TITLE = {Dicing on the Streett},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {104},
NUMBER = {1},
PAGES = {1-9},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, games, memory, randomness},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4NR18J4-1/2/d2ac2ba65d1d563a797ea21af864d43e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Narayanaswamy-Belkale-Chandran-Sivadasan/07,
AUTHOR = {Narayanaswamy, N.S. and Belkale, N. and Chandran, L.S. and Sivadasan, N.},
TITLE = {A note on the Hadwiger number of circular arc graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {104},
NUMBER = {1},
PAGES = {10-13},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {circular arc, hadwiger's conjecture, minor, graph coloring, combinatorial problems},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4NKXWN8-1/2/17fb920af38a60978e9674008a9753ac},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jean-Nikolski/07,
AUTHOR = {Jean, G{\'e}raldine and Nikolski, Macha},
TITLE = {Genome rearrangements: A correct algorithm for optimal capping},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {104},
NUMBER = {1},
PAGES = {14-20},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, genome rearrangements, breakpoint graph, genomic distance, optimal capping},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4NRK4MG-1/2/f35519d1c9959ed8a50a82e0c1103e8d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Levin/07,
AUTHOR = {Levin, Asaf},
TITLE = {The finite horizon investor problem with a budget constraint},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {104},
NUMBER = {1},
PAGES = {21-28},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, dynamic programming with a budget constraint},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4NN6TMB-1/2/7b84815d36ad83543bd7fcb6115a26c0},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Masopust-Meduna/07,
AUTHOR = {Masopust, Tom{\'a}{\v{s}} and Meduna, Alexander},
TITLE = {Descriptional complexity of semi-conditional grammars},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {104},
NUMBER = {1},
PAGES = {29-31},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal languages, semi-conditional grammars, descriptional complexity},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4NRK4MG-2/2/3db90f6e59b1599aa9997b18729b5ed6},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Minkevicius/07,
AUTHOR = {Minkevi{\v{c}}ius, Saulius},
TITLE = {The impact of overload conditions on computer network reliability},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {104},
NUMBER = {1},
PAGES = {32-35},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {performance evaluation, reliability theory, queueing theory, open queueing network, the probability limit theorem, queue length of customers},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4NSX06C-1/2/39378a0a2962c5abe4144c1edac5edb8},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ravelomanana/07,
AUTHOR = {Ravelomanana, Vlady},
TITLE = {Another proof of Wright's inequalities},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {104},
NUMBER = {1},
PAGES = {36-39},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4NRK4MG-3/2/ac612523a63f1005ee444e0bfd1c1d80},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hasunuma-Hirota/07,
AUTHOR = {Hasunuma, Toru and Hirota, Misa},
TITLE = {An improved upper bound on the queuenumber of the hypercube},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {104},
NUMBER = {2},
PAGES = {41-44},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, queue layout, hypercube, interconnection networks},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4NS0KXG-1/2/e7efa97a11762516a1a75939e4b6f476},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wan-Leung-Pinedo/07,
AUTHOR = {Wan, Guohua and Leung, Joseph Y.-T. and Pinedo, Michael L.},
TITLE = {Scheduling imprecise computation tasks on uniform processors},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {104},
NUMBER = {2},
PAGES = {45-52},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {preemptive scheduling, uniform processors, imprecise computation task, polynomial time algorithms, algorithms, analysis of algorithms, combinatorial problems},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4NS0KXG-3/2/3ec10186e08b846cc7b94166653edc25},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Razgon/07,
AUTHOR = {Razgon, Igor},
TITLE = {A $2^{(O(k)}$poly$(n)$ algorithm for the parameterized Convex Recoloring problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {104},
NUMBER = {2},
PAGES = {53-58},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, convex recoloring, parameterized complexity},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4NTBFMK-1/2/5f3e4c74aa4429b97a0a59e39e68c8dd},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Akl-Islam-Meijer/07,
AUTHOR = {Akl, Selim G. and Islam, Md. Kamrul and Meijer, Henk},
TITLE = {On planar path transformation},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {104},
NUMBER = {2},
PAGES = {59-64},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {flip, hamiltonian planar path, directed path, enumeration, computational geometry},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4NT84VK-1/2/f81147fe8a0084e4289723358721e7ad},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Raman-Saurabh/07,
AUTHOR = {Raman, Venkatesh and Saurabh, Saket},
TITLE = {Improved fixed parameter tractable algorithms for two ``edge'' problems: MAXCUT and MAXDAG},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {104},
NUMBER = {2},
PAGES = {65-72},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {directed feedback arc set, max-cut, parameterized complexity, exact algorithm, graph algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4P481XH-1/2/64a62a2359f53b32f20c401af745896d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Liu-Tanaka/07,
AUTHOR = {Liu, ChenGuang and Tanaka, Kazuyuki},
TITLE = {Eigen-distribution on random assignments for game trees},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {104},
NUMBER = {2},
PAGES = {73-77},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {eigen-distribution, game tree, computational complexity, distributional complexity, randomized algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4NTBFMK-2/2/49809b98618dc4e7d073b83714dad14e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Raman-Sikdar/07,
AUTHOR = {Raman, Venkatesh and Sikdar, Somnath},
TITLE = {Parameterized complexity of the induced subgraph problem in directed graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {104},
NUMBER = {3},
PAGES = {79-85},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, combinatorial problems, parameterized complexity, directed graphs, induced subgraph, hereditary properties},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4NS0KXG-2/2/779b9dbfc9a2275d76c8bd9b5179e2e0},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Araki/07,
AUTHOR = {Araki, Toru},
TITLE = {On the $k$-tuple domination of {de Bruijn} and Kautz digraphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {104},
NUMBER = {3},
PAGES = {86-90},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {k-tuple domination, de bruijn digraph, kautz digraph, interconnection networks},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4NVH80H-1/2/35b680eb05c0e32c0495dd9bf801ffa1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bojanczyk/07,
AUTHOR = {Boja{\'n}czyk, Miko{\l}aj},
TITLE = {A new algorithm for testing if a regular language is locally threshold testable},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {104},
NUMBER = {3},
PAGES = {91-94},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal languages},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4NYSXPX-1/2/a82217f1c859998c3d222d7751596f7e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Nebel/07,
AUTHOR = {Nebel, Markus E.},
TITLE = {On the lexicographical generation of compressed codes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {104},
NUMBER = {3},
PAGES = {95-100},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, combinatorial problems, lexicographical generation},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4NWCDG1-1/2/4ed6fe99fd40b1b705f3fa95bb683d07},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Duquesne/07,
AUTHOR = {Duquesne, Sylvain},
TITLE = {Improving the arithmetic of elliptic curves in the Jacobi tmodel},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {104},
NUMBER = {3},
PAGES = {101-105},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, elliptic curves, side-channel attacks, unified addition formulae},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4NWWWJF-1/2/d4fbc42f09aaa18f7290b116d58d54bf},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zelke/07,
AUTHOR = {Zelke, Mariano},
TITLE = {Optimal per-edge processing times in the semi-streaming model},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {104},
NUMBER = {3},
PAGES = {106-112},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, streaming algorithms, per-edge processing time},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4P00867-1/2/05d7e6132f2a1cc4196341157ecbdb15},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ghodsi-Mahini-Mirjalali-Gharan-R-Zadimoghaddam/07,
AUTHOR = {Ghodsi, Mohammad and Mahini, Hamid and Mirjalali, Kian and Gharan, Shayan Oveis and R., Amin S. Sayedi and Zadimoghaddam, Morteza},
TITLE = {Spanning trees with minimum weighted degrees},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {104},
NUMBER = {3},
PAGES = {113-116},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, graph algorithms, spanning trees},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4P1G9RD-1/2/538d92ab6f86e9ed189afb92bdf702e8},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhou-He/07,
AUTHOR = {Zhou, Yuren and He, Jun},
TITLE = {Convergence analysis of a self-adaptive multi-objective evolutionary algorithm based on grids},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {104},
NUMBER = {4},
PAGES = {117-122},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, multi-objective optimization, evolutionary algorithms, convergence},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4NWWWJF-2/2/9277789d53e16913cf81cb1bad10393d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bein-Larmore-Noga/07,
AUTHOR = {Bein, Wolfgang and Larmore, Lawrence L. and Noga, John},
TITLE = {Uniform metrical task systems with a limited number of states},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {104},
NUMBER = {4},
PAGES = {123-128},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {design of algorithms, online algorithms, randomized algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4P00867-4/2/be14651323793277fbbd26088df686bd},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chatain-Khomenko/07,
AUTHOR = {Chatain, Thomas and Khomenko, Victor},
TITLE = {On the well-foundedness of adequate orders used for construction of complete unfolding prefixes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {104},
NUMBER = {4},
PAGES = {129-136},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {adequate order, unfolding prefix, petri net, well-foundedness, concurrency},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4P00867-2/2/3c6c828563ec93775f50a88aab9953a0},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Berman-DasGupta-Kao-Wang/07,
AUTHOR = {Berman, Piotr and DasGupta, Bhaskar and Kao, Ming-Yang and Wang, Jie},
TITLE = {On constructing an optimal consensus clustering from multiple clusterings},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {104},
NUMBER = {4},
PAGES = {137-145},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, approximation algorithms, consensus clustering},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4P12J6D-1/2/c1b56b4aafc727fea15033dfec024f88},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Shen-Wang/07,
AUTHOR = {Shen, Liang and Wang, Yingqian},
TITLE = {A sufficient condition for a planar graph to be 3-choosable},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {104},
NUMBER = {4},
PAGES = {146-151},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, planar graph, cycle, choosability},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4P00867-3/2/fbdb85200fc7c1541f9a0b801643d113},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ying-Chen-Feng-Duan/07,
AUTHOR = {Ying, Mingsheng and Chen, Jianxin and Feng, Yuan and Duan, Runyao},
TITLE = {Commutativity of quantum weakest preconditions},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {104},
NUMBER = {4},
PAGES = {152-158},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal semantics, quantum program, hermitian matrix, super-operator, weakest precondition},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4P00867-5/2/532a58246f03c7734e3e646896af35dc},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hvam-Reinhardt-Winter-Zachariasen/07,
AUTHOR = {Hvam, K. and Reinhardt, L. and Winter, P. and Zachariasen, M.},
TITLE = {Bounding component sizes of two-connected Steiner networks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {104},
NUMBER = {5},
PAGES = {159-163},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational geometry, interconnection networks, 2-connected steiner networks},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4P12J6D-2/2/92553f5f04178aa1f6b15cc2be87e997},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jancar-Sawa/07,
AUTHOR = {Jan{\v{c}}ar, Petr and Sawa, Zden{\v{e}}k},
TITLE = {A note on emptiness for alternating finite automata with a one-letter alphabet},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {104},
NUMBER = {5},
PAGES = {164-167},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, alternating finite automaton, emptiness},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4P12J6D-3/2/7752b9f14da6d9d25b2951413e0b5797},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Roy-Bagchi/07,
AUTHOR = {Roy, Rahul and Bagchi, Amitava},
TITLE = {On estimating the time taken to rectify faults in a software package during the system testing phase},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {104},
NUMBER = {5},
PAGES = {168-172},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {software engineering, software reliability, basic model},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4P12J6D-4/2/5f1fc34433a16d6558d8bd6d8c6eaf5f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Nagamochi-Okada/07,
AUTHOR = {Nagamochi, Hiroshi and Okada, Kohei},
TITLE = {Approximating the minmax rooted-tree cover in a tree},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {104},
NUMBER = {5},
PAGES = {173-178},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, graph algorithms, tree partitioning, tree covers, combinatorial problems, design of algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4P1G9RD-2/2/c263dd8e9a6dc8f7366ea7dadc0b294a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ghodosi/07,
AUTHOR = {Ghodosi, Hossein},
TITLE = {On insecurity of Naor-Pinkas' distributed oblivious transfer},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {104},
NUMBER = {5},
PAGES = {179-182},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {oblivious transfer, threshold cryptography, distributed computing, distributed systems, security in digital systems},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4P1G9RD-3/2/16e37d3df9484dcf27871ee3b052fbd6},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Sung-Hong-Hong/07,
AUTHOR = {Sung, Jaechul and Hong, Deukjo and Hong, Seokhie},
TITLE = {Cryptanalysis of an involutional block cipher using cellular automata},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {104},
NUMBER = {5},
PAGES = {183-185},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, block cipher, cellular automata, involution},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4P192N0-1/2/097e585d14a37eee5944cd1c4d28fdba},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Elkin-Liebchen-Rizzi/07,
AUTHOR = {Elkin, Michael and Liebchen, Christian and Rizzi, Romeo},
TITLE = {New length bounds for cycle bases},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {104},
NUMBER = {5},
PAGES = {186-193},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, approximation algorithms, cycle bases, metric approximation},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4P2YWTY-1/2/b744fe07ccb2ba4415e6db623ba8f008},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bertsch-Nederhof/07,
AUTHOR = {Bertsch, E. and Nederhof, M.-J.},
TITLE = {Some observations on $LR$-like parsing with delayed reduction},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {104},
NUMBER = {6},
PAGES = {195-199},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal languages, grammars, parsing, lr(k)},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4P4FV7V-1/2/bb07f9527dd7f62e5a8867a7cfb9987c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Itai-Katriel/07,
AUTHOR = {Itai, Alon and Katriel, Irit},
TITLE = {Canonical density control},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {104},
NUMBER = {6},
PAGES = {200-204},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, data structures},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4P429DS-2/2/7a123ecc0ad103029f82f2358cc824ea},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gronau-Moran/07,
AUTHOR = {Gronau, Ilan and Moran, Shlomo},
TITLE = {Optimal implementations of UPGMA and other common clustering algorithms},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {104},
NUMBER = {6},
PAGES = {205-210},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {hierarchical clustering, upgma, design of algorithms, input-output specification, computational complexity},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4P429DS-3/2/e86c448547c4a983ba03141c5180ac57},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chen/07,
AUTHOR = {Chen, Xie-Bin},
TITLE = {Cycles passing through prescribed edges in a hypercube with some faulty edges},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {104},
NUMBER = {6},
PAGES = {211-215},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {hypercube, cycle, embedding, edge fault tolerance, fault tolerance, interconnection networks},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4P429DS-1/2/6d808610031404a872163bcb8b89181a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Meer/07,
AUTHOR = {Meer, Klaus},
TITLE = {Simulated annealing versus metropolis for a TSP instance},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {104},
NUMBER = {6},
PAGES = {216-219},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, simulated annealing, metropolis algorithm, 2-opt heuristic for tsp},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4P4FV7V-2/2/8ec4d990f30a36d91b6580a395d8c628},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lingas-Wasylewicz-Zylinski/07,
AUTHOR = {Lingas, Andrzej and Wasylewicz, Agnieszka and {\.Z}yli{\'n}ski, Pawe{\l}},
TITLE = {Note on covering monotone orthogonal polygons with star-shaped polygons},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {104},
NUMBER = {6},
PAGES = {220-227},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational geometry, covering polygons, orthogonal polygon},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4P4FV7V-3/2/1da2af17f944c6e496fa156160b62050},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
NOTE = {see Corrigendum in Inf.~Process.~Lett., Vol. 114, 2014, No. 11, 646-654},
}
@article{Enright-Stewart/07,
AUTHOR = {Enright, Jessica and Stewart, Lorna},
TITLE = {Subtree filament graphs are subtree overlap graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {104},
NUMBER = {6},
PAGES = {228-232},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {overlap graph, subtree filament graph, subtree overlap graph, combinatorial problems, graph algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4P5NX7J-1/2/4a4a6927324294a38aafb3a91b0eb201},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}