@article{Doerr/13,
AUTHOR = {Doerr, Benjamin},
TITLE = {Improved approximation algorithms for the Min-Max Selecting Items problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {113},
NUMBER = {19-21},
PAGES = {747-749},
YEAR = {2013},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithm, randomized rounding, derandomization, robust optimization},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019013002007},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kutzkov/07,
AUTHOR = {Kutzkov, Konstantin},
TITLE = {New upper bound for the \#3-SAT problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {105},
NUMBER = {1},
PAGES = {1-5},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, satisfiability, counting solutions},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4P718R7-1/1/790b3af97bbfce824c15af3039a12ba7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Shan-Cheng-Kang/07,
AUTHOR = {Shan, Erfang and Cheng, T.C.E. and Kang, Liying},
TITLE = {Absorbant of generalized de Bruijn digraphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {105},
NUMBER = {1},
PAGES = {6-11},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {absorbant, generalized de bruijn digraph, interconnection networks},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4P6M65S-1/1/3203f27381d25aa085a504a28ba7aab0},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Liu-Huang-Wang-Lee/07,
AUTHOR = {Liu, J.J. and Huang, G.S. and Wang, Y.L. and Lee, R.C.T.},
TITLE = {Edit distance for a run-length-encoded string and an uncompressed string},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {105},
NUMBER = {1},
PAGES = {12-16},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {edit distance, run-length-encoding, string compression, algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4P61NBM-1/1/f8a77a65baa8d0f4e0d8c83b3a35bb13},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Worah-Sen/07,
AUTHOR = {Worah, Pratik and Sen, Sandeep},
TITLE = {A linear time deterministic algorithm to find a small subset that approximates the centroid},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {105},
NUMBER = {1},
PAGES = {17-19},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational geometry, clustering, derandomization},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PB6W65-1/1/e349a3ebfe1770327141ac5351eff3da},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Shih-Tan-Hsu/07,
AUTHOR = {Shih, Lun-Min and Tan, Jimmy J.M. and Hsu, Lih-Hsing},
TITLE = {Edge-bipancyclicity of conditional faulty hypercubes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {105},
NUMBER = {1},
PAGES = {20-25},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cycles, pancyclic, conditional fault, hypercube, fault-tolerant, interconnection networks},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PBDR3K-1/1/ba4992a6dbc85df102c142047cdc2f0b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Asano/07,
AUTHOR = {Asano, Tetsuo},
TITLE = {Aspect-ratio Voronoi diagram and its complexity bounds},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {105},
NUMBER = {1},
PAGES = {26-31},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, combinatorial problems, computational geometry},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PC3SK4-1/1/8eb1d599e73debd98eb08d39b29aff0c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Petersen/07,
AUTHOR = {Petersen, Holger},
TITLE = {String matching with simple devices},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {105},
NUMBER = {1},
PAGES = {32-34},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, string matching, theory of computation},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PC3SK4-2/1/8db0318ae74f5f8dda90172151851a0d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hong/07,
AUTHOR = {Hong, Dawei},
TITLE = {Analysis of noise-induced phase synchronization in nervous systems: From algorithmic perspective},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {105},
NUMBER = {1},
PAGES = {35-39},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, neuronal oscillations, noise-induced phase synchronization, stochastic integration},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PDSBSR-1/1/36d34550f1425cecf3076aad783e9ef8},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bu-Deng-Qi/07,
AUTHOR = {Bu, Tian-Ming and Deng, Xiaotie and Qi, Qi},
TITLE = {Forward looking Nash equilibrium for keyword auction},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {105},
NUMBER = {2},
PAGES = {41-46},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {distributed systems, keyword auction, nash equilibrium},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4P61NBM-2/1/4dcf6e7e85b57187819f48d7a113565d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Scot_Drysdale-Mukhopadhyay/07,
AUTHOR = {Scot Drysdale, R.L. and Mukhopadhyay, Asish},
TITLE = {An $O(n \log n)$ algorithm for the all-farthest-segments problem for a planar set of points},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {105},
NUMBER = {2},
PAGES = {47-51},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational geometry, farthest-segment voronoi diagram},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PF1WJW-1/1/ccb83fcdf94a58e2a289197575492b01},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Breitbart-Gobjuka/07,
AUTHOR = {Breitbart, Yuri and Gobjuka, Hassan},
TITLE = {Characterization of layer-2 unique topologies},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {105},
NUMBER = {2},
PAGES = {52-57},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {interconnection networks, layer-2 topology discovery, ethernet lans, snmp mib},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PDSBSR-3/1/0defeab58fd0439c94e96f4642279be1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Mukhopadhyay-Kumar-Greene-Bhattacharya/07,
AUTHOR = {Mukhopadhyay, Asish and Kumar, Chanchal and Greene, Eugene and Bhattacharya, Binay},
TITLE = {On intersecting a set of parallel line segments with a convex polygon of minimum area},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {105},
NUMBER = {2},
PAGES = {58-64},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, computational geometry, geometric optimization, geometric intersection},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PN05WD-1/1/d429790e15a871d4045e09a6260f0c50},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fertin-Raspaud/07,
AUTHOR = {Fertin, Guillaume and Raspaud, Andr{\'e}},
TITLE = {Acyclic coloring of graphs of maximum degree five: Nine colors are enough},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {105},
NUMBER = {2},
PAGES = {65-72},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {acyclic chromatic number, acyclic coloring algorithm, maximum degree 5, graph algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PJCYH4-1/1/e0d2baeb783f259db16b894d03959d8d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cabello-Giannopoulos-Knauer/07,
AUTHOR = {Cabello, Sergio and Giannopoulos, Panos and Knauer, Christian},
TITLE = {On the parameterized complexity of $d$-dimensional point set pattern matching},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {105},
NUMBER = {2},
PAGES = {73-77},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, computational geometry, fixed parameter tractability, geometric point set matching, congruence, unbounded dimension},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PDSBSR-2/1/c8818334c850a7551f917d3f6f09f3e8},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Sasatte/07,
AUTHOR = {Sasatte, Prashant},
TITLE = {Improved FPT algorithm for feedback vertex set problem in bipartite tournament},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {105},
NUMBER = {3},
PAGES = {79-82},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, parameterized complexity, feedback set problem, bipartite tournament},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PHJTSB-1/1/2cfa613d6b5fd6553cb3c5dbacdc68c0},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Afshani-Hatami/07,
AUTHOR = {Afshani, Peyman and Hatami, Hamed},
TITLE = {Approximation and inapproximability results for maximum clique of disc graphs in high dimensions},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {105},
NUMBER = {3},
PAGES = {83-87},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, computational geometry, disc graphs, diameter},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PFW6FX-1/1/442e84a65869da1d7e45bdd11444fb2f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Attiratanasunthron-Fakcharoenphol/07,
AUTHOR = {Attiratanasunthron, Nattapat and Fakcharoenphol, Jittat},
TITLE = {A running time analysis of an Ant Colony Optimization algorithm for shortest paths in directed acyclic graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {105},
NUMBER = {3},
PAGES = {88-92},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, graph algorithms, ant colony optimization, shortest paths},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PGGP7R-1/1/253f15725fb772183018907f78bfa243},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Nielsen-Nock/07,
AUTHOR = {Nielsen, Frank and Nock, Richard},
TITLE = {On the smallest enclosing information disk},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {105},
NUMBER = {3},
PAGES = {93-97},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational information geometry, smallest enclosing ball, divergence, algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PFW6FX-2/1/4641f4f6203e9b9e013cea304c3e576b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Araujo-Balogh-Fabila-Salazar-Urrutia/07,
AUTHOR = {Araujo, G. and Balogh, J. and Fabila, R. and Salazar, G. and Urrutia, J.},
TITLE = {A note on harmonic subgraphs in labelled geometric graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {105},
NUMBER = {3},
PAGES = {98-102},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational geometry, graceful labellings, harmonic subgraphs},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PJ050D-2/1/948b7cea7f8651eaedfc0e94951b83e7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zarrabi-Zadeh/07,
AUTHOR = {Zarrabi-Zadeh, Hamid},
TITLE = {Flying over a polyhedral terrain},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {105},
NUMBER = {3},
PAGES = {103-107},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, computational geometry, shortest path, polyhedral terrain},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PFW6FX-3/1/b062081bbe102d9095cf2bbd6f65a1e4},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Rostamabadi-Sadeghi-Ghodsi-Khosravi/07,
AUTHOR = {Rostamabadi, Farshad and Sadeghi, Iman and Ghodsi, Mohammad and Khosravi, Ramtin},
TITLE = {Optimal point removal in closed-2PM labeling},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {105},
NUMBER = {3},
PAGES = {108-113},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, map labeling},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PRRBRT-1/1/4a78a4b53a605219ce8a654efc54b6e1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Han/07,
AUTHOR = {Han, Yijie},
TITLE = {A note of an $O(n^3/\log n)$ time algorithm for all pairs shortest paths},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {105},
NUMBER = {3},
PAGES = {114-116},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, complexity, graph algorithms, shortest path},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PJ050D-1/1/08bed31ad21c3ccbc7c797c14c4f4538},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Yeh/07,
AUTHOR = {Yeh, Jyh-haw},
TITLE = {A secure time-bound hierarchical key assignment scheme based on RSA public key cryptosystem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {105},
NUMBER = {4},
PAGES = {117-120},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, hierarchical access control, safety/security in digital systems},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PJ050D-3/1/cca7cd85a6a053ed7bdbb8796b979865},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dietel-Hecker-Spillner/07,
AUTHOR = {Dietel, Jana and Hecker, Hans-Dietrich and Spillner, Andreas},
TITLE = {A note on optimal floodlight illumination of stages},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {105},
NUMBER = {4},
PAGES = {121-123},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational geometry, illumination, floodlight},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PFW6FX-6/1/74c5c7d4d8f6f647776479681cfdfa57},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Farr-Schmidt/07,
AUTHOR = {Farr, Graham and Schmidt, Johannes},
TITLE = {On the number of Go positions on lattice graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {105},
NUMBER = {4},
PAGES = {124-130},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, combinatorial enumeration, lattice graphs, games, go, transfer matrices},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PJ050D-4/1/995cd89bfba723d6a30728ab6e3d5ea9},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kooshesh-Ravikumar/07,
AUTHOR = {Kooshesh, A. and Ravikumar, B.},
TITLE = {Efficient implementation of algorithms for approximate exponentiation},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {105},
NUMBER = {4},
PAGES = {131-137},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, software design and implementation},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PFW6FX-4/1/67a5cd8e845f35305c4cd56915ae0bbc},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lipsky-Porat/07,
AUTHOR = {Lipsky, Ohad and Porat, Ely},
TITLE = {Approximate matching in the $L_\infty$ metric},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {105},
NUMBER = {4},
PAGES = {138-140},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, pattern matching, time series analysis, analysis of algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PG8739-1/1/d1acb2cbef5b8772aa92c8406b53e2f7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lipsky-Porat/07a,
AUTHOR = {Lipsky, Ohad and Porat, Ely},
TITLE = {$L_1$ pattern matching lower bound},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {105},
NUMBER = {4},
PAGES = {141-143},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {lower bound, pattern matching, analysis of algorithms, time series analysis},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PG8739-2/1/6c10800746bc5f3d7d1ea6bc1d120fa2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gortz/07,
AUTHOR = {G{\o}rtz, Inge Li},
TITLE = {Asymmetric $k$-center with minimum coverage},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {105},
NUMBER = {4},
PAGES = {144-149},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, design of algorithms, clustering, asymmetry},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PFW6FX-5/1/f61185164df4c215174ddbf8ee303cf2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gupta/07,
AUTHOR = {Gupta, Sushmita},
TITLE = {Feedback arc set problem in bipartite tournaments},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {105},
NUMBER = {4},
PAGES = {150-154},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, feedback arc set, bipartite tournaments},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PJM9RV-1/1/d5e732afee2b05e4e21926fa07c8fd32},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hamilton-Rau-Chaplin/07,
AUTHOR = {Hamilton, Chris H. and Rau-Chaplin, Andrew},
TITLE = {Compact Hilbert indices: Space-filling curves for domains with unequal side lengths},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {105},
NUMBER = {5},
PAGES = {155-163},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4RK0K08-1/1/9a58c9255476896a372808fc7ac1c727},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Salamon-Wiener/07,
AUTHOR = {Salamon, G{\'a}bor and Wiener, G{\'a}bor},
TITLE = {On finding spanning trees with few leaves},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {105},
NUMBER = {5},
PAGES = {164-169},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, graph algorithms, spanning trees},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PNFV9W-1/1/0d13d158ca934d7f96a2026731056c39},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gurski/07,
AUTHOR = {Gurski, Frank},
TITLE = {Polynomial algorithms for protein similarity search for restricted mRNA structures},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {105},
NUMBER = {5},
PAGES = {170-176},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, computational complexity, computational biology, protein similarity search, mrna structure},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PJ6GMY-3/1/a829328c6c8e4b6475a44acb88763930},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lai-Chang-Lih/07,
AUTHOR = {Lai, Hsin-Hao and Chang, Gerard J. and Lih, Ko-Wei},
TITLE = {On fully orientability of 2-degenerate graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {105},
NUMBER = {5},
PAGES = {177-181},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {acyclic orientation, dependent arc, 2-degenerate graph, cover graph, triangle-free graph, graph algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PJ6GMY-1/1/1e6b72c3e390fc5091e4aaa206aa3943},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Grabowski-Fredriksson/07,
AUTHOR = {Grabowski, Szymon and Fredriksson, Kimmo},
TITLE = {Bit-parallel string matching under Hamming distance in $O(n \lceil m/w \rceil)$ worst case time},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {105},
NUMBER = {5},
PAGES = {182-187},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, approximate string matching, bit-parallelism, hamming distance},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PJ6GMY-2/1/51ddceb67ac732cde2ebd29925f308aa},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Huang-Yang-Tseng-Ann-Peng/07,
AUTHOR = {Huang, Kuo-Si and Yang, Chang-Biau and Tseng, Kuo-Tsung and Ann, Hsing-Yen and Peng, Yung-Hsing},
TITLE = {Efficient algorithms for finding interleaving relationship between sequences},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {105},
NUMBER = {5},
PAGES = {188-193},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {design of algorithms, bioinformatics, dynamic programming, longest common subsequence, merged sequence},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PN05WD-2/1/93387b306cf14a43e6acb0b5e208603b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Blaser-Heynen-Manthey/07,
AUTHOR = {Bl{\"a}ser, Markus and Heynen, Thomas and Manthey, Bodo},
TITLE = {Adding cardinality constraints to integer programs with applications to maximum satisfiability},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {105},
NUMBER = {5},
PAGES = {194-198},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, randomized algorithms, satisfiability, cardinality constraints},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PMT31J-1/1/9148e8b9eb011b99142e7b486f929a94},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Efraimidis/07,
AUTHOR = {Efraimidis, Pavlos S.},
TITLE = {The complexity of linear programming in $(\gamma,\kappa)$-form},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {105},
NUMBER = {5},
PAGES = {199-201},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, approximation algorithms, analysis of algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PMT31J-5/1/4de4dc80759732aaca1c3e468fbf58b9},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hsieh-Cheng/07,
AUTHOR = {Hsieh, Sun-Yuan and Cheng, Chih-Sheng},
TITLE = {Finding a maximum-density path in a tree under the weight and length constraints},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {105},
NUMBER = {5},
PAGES = {202-205},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, design and analysis of algorithms, trees, paths, subgraph optimization problems, network design},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PNFV9W-2/1/53dbe3e66931c82cdd96c2e4d6cf01e6},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wang-Lu-Chen/07,
AUTHOR = {Wang, Yingqian and Lu, Huajing and Chen, Ming},
TITLE = {A note on 3-choosability of planar graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {105},
NUMBER = {5},
PAGES = {206-211},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, planar graph, cycle, choosability},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PMT31J-2/1/e0b439a58ded2b8c3af79a24db003d81},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Crespi_Reghizzi-Pradella/07,
AUTHOR = {Crespi Reghizzi, Stefano and Pradella, Matteo},
TITLE = {A CKY parser for picture grammars},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {105},
NUMBER = {6},
PAGES = {213-217},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal languages, picture languages, 2d languages, context-free picture grammars, cky parsing, kolam array grammars, matrix grammars, siromoney grammars},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PMT31J-6/1/19b44095ab534abed0fa561471b71914},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Iliopoulos-Rahman/07,
AUTHOR = {Iliopoulos, Costas S. and Rahman, M. Sohel},
TITLE = {Faster index for property matching},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {105},
NUMBER = {6},
PAGES = {218-223},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, combinatorial problems, data structures, pattern matching},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PMT31J-3/1/6bb3da5ddfffd24425ce05b155c8fa8a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
NOTE = {see Erratum in Inf.~Process.~Lett., Vol. 109, 2009, No. 18, 1027-1029},
}
@article{Aiger-Kedem/07,
AUTHOR = {Aiger, Dror and Kedem, Klara},
TITLE = {Applying graphics hardware to achieve extremely fast geometric pattern matching in two and three dimensional transformation space},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {105},
NUMBER = {6},
PAGES = {224-230},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, approximation algorithms, randomized algorithms, geometric pattern matching},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PMT31J-4/1/493a076f40fe82daef281a85d8f7edac},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cai-Cui-Zeng-Tan/07,
AUTHOR = {Cai, Xingjuan and Cui, Zhihua and Zeng, Jianchao and Tan, Ying},
TITLE = {Dispersed particle swarm optimization},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {105},
NUMBER = {6},
PAGES = {231-235},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {particle swarm optimization, social coefficient setting, dispersed control, centralized control, adaptation},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PMT31J-7/1/e87c8bdcb37704a185093cf2d8f149bf},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kuhn/07,
AUTHOR = {K{\"u}hn, Ulrich},
TITLE = {Breaking the Shin-Shin-Rhee remotely keyed encryption schemes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {105},
NUMBER = {6},
PAGES = {236-240},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, remotely keyed encryption, cryptanalysis},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PMJK4D-1/1/c3785251cfc1c4a945cf41fd640342a5},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Glen-Lauve-Saliola/07,
AUTHOR = {Glen, Amy and Lauve, Aaron and Saliola, Franco V.},
TITLE = {A note on the Markoff condition and central words},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {105},
NUMBER = {6},
PAGES = {241-244},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, markoff condition, balanced words, central words, christoffel words, palindromes},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PP2CYN-1/1/ae1041c9dc48928021d39251976ca36a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kenkre-Vishwanathan/07,
AUTHOR = {Kenkre, Sreyash and Vishwanathan, Sundar},
TITLE = {The common prefix problem on trees},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {105},
NUMBER = {6},
PAGES = {245-248},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, common prefix, database query optimization, maximum edge biclique},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PPMXSN-1/1/e02544a1db966e135cddc68294680a76},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Alvarez-Arevalo-Cholvi-Fernandez-Jimenez/07,
AUTHOR = {{\'A}lvarez, A. and Ar{\'e}valo, S. and Cholvi, V. and Fern{\'a}ndez, A. and Jim{\'e}nez, E.},
TITLE = {On the interconnection of message passing systems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {105},
NUMBER = {6},
PAGES = {249-254},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {distributed systems, interconnection networks, formal methods, design of algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4PPF6D5-1/1/5689fd52147937407d4ddc8c59013811},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@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},
}
@article{Irving/07,
AUTHOR = {Irving, Robert W.},
TITLE = {The cycle roommates problem: A hard case of kidney exchange},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {103},
NUMBER = {1},
PAGES = {1-4},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, combinatorial problems, computational complexity, matching, stability},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4N2KTJX-2/2/448ddbb6acd920f150c958c73ffdf536},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Aiguier-Diaconescu/07,
AUTHOR = {Aiguier, Marc and Diaconescu, R{\u{a}}azvan},
TITLE = {Stratified institutions and elementary homomorphisms},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {103},
NUMBER = {1},
PAGES = {5-13},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {institutions, elementary homomorphisms, elementary colimit theorem, formal methods},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4N2KTJX-1/2/f15d18bb61261b92d0c8c23e229fb257},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cheng-Wang/07,
AUTHOR = {Cheng, Hai-Lung and Wang, Biing-Feng},
TITLE = {On Chen and Chen's new tree inclusion algorithm},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {103},
NUMBER = {1},
PAGES = {14-18},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {trees, tree inclusion, algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4N2KTJX-3/2/46a27e050a4b3c2ee6aa1aaff98e4a32},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kim-Paeng-Cho/07,
AUTHOR = {Kim, Seok Woo and Paeng, Seong-Hun and Cho, Hee Je},
TITLE = {Approximately $n$-secting an angle},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {103},
NUMBER = {1},
PAGES = {19-23},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational geometry, approximation algorithms, n-secting, regular n-gon},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4N49VR7-1/2/50889ed4f964d1b22776622bae44d171},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Akin-Siap/07,
AUTHOR = {Akin, Hasan and Siap, Irfan},
TITLE = {On cellular automata over Galois rings},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {103},
NUMBER = {1},
PAGES = {24-27},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cellular automata, topological entropy, galois rings, computational complexity},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4N2D2X5-2/2/b4fe13b5582a1127c44f74260d616a96},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Suomela/07,
AUTHOR = {Suomela, Jukka},
TITLE = {Approximability of identifying codes and locating-dominating codes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {103},
NUMBER = {1},
PAGES = {28-33},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, combinatorial problems, graph algorithms, identifying codes, locating-dominating codes},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4N2D2X5-1/2/a191aeacc9e38be7f2f1ee5481f71f0e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Vereshchagin/07,
AUTHOR = {Vereshchagin, Nikolai K.},
TITLE = {Kolmogorov complexity of enumerating finite sets},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {103},
NUMBER = {1},
PAGES = {34-39},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {kolmogorov complexity, the a priori probability, randomized algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4N2KTJX-6/2/9f3a545869cc4c740f6a32045d2b419e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lin-Szwarcfiter/07,
AUTHOR = {Lin, Min Chih and Szwarcfiter, Jayme L.},
TITLE = {Faster recognition of clique-Helly and hereditary clique-Helly graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {103},
NUMBER = {1},
PAGES = {40-43},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, clique-helly graphs, disk-helly graphs, helly property, hereditary clique-helly graphs, hereditary disk-helly graphs},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4N7XPDC-1/2/ab5df96293521284d677ea5cb78a144e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Colannino-Toussaint/07,
AUTHOR = {Colannino, Justin and Toussaint, Godfried},
TITLE = {Erratum to ''An algorithm for computing the restriction scaffold assignment problem in computational biology''},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {103},
NUMBER = {1},
PAGES = {44-44},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4NGBB89-1/2/8540a91219b9172f3dfb42cef6e4975f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
NOTE = {Originally in Inf.~Process.~Lett., Vol. 95, 2005, No. 4, 466-471},
}
@article{Lucier-Jiang-Li/07,
AUTHOR = {Lucier, Brendan and Jiang, Tao and Li, Ming},
TITLE = {Average-case analysis of QuickSort and Binary Insertion Tree height using incompressibility},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {103},
NUMBER = {2},
PAGES = {45-51},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, binary insertion trees, incompressibility, kolmogorov complexity, quicksort},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4NB2WPR-1/2/4a7a2c2328a4aa94e992deb9f8b9e510},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wang-Ma-Xu/07,
AUTHOR = {Wang, Wei-Wei and Ma, Mei-Jie and Xu, Jun-Ming},
TITLE = {Fault-tolerant pancyclicity of augmented cubes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {103},
NUMBER = {2},
PAGES = {52-56},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorics, networks, augmented cubes, pancycle, fault tolerance},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4N56BVF-2/2/48df059bc570af0bd55ce7ced615044f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Laing/07,
AUTHOR = {Laing, Kofi A.},
TITLE = {Name-independent compact routing in trees},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {103},
NUMBER = {2},
PAGES = {57-60},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {name-independent compact routing, stretch, distributed lookup tables, distributed computing, combinatorial problems},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4N7RY5W-1/2/4c80bb6d60360b923238b6014f2e11e5},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Amenta-Godwin-Postarnakevich-John/07,
AUTHOR = {Amenta, Nina and Godwin, Matthew and Postarnakevich, Nicolay and John, Katherine St.},
TITLE = {Approximating geodesic tree distance},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {103},
NUMBER = {2},
PAGES = {61-65},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, phylogeny, tree metric},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4N56BVF-1/2/c62cee890484610dbecc2cb79a5bd410},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Moshkov/07,
AUTHOR = {Moshkov, Mikhail Ju.},
TITLE = {On algorithms for construction of all irreducible partial covers},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {103},
NUMBER = {2},
PAGES = {66-70},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {irreducible partial cover, totally polynomial algorithm, computational complexity},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4N56BVF-3/2/b33525a25552a48fe11ae9495de18952},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Uehara-Valiente/07,
AUTHOR = {Uehara, Ryuhei and Valiente, Gabriel},
TITLE = {Linear structure of bipartite permutation graphs and the longest path problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {103},
NUMBER = {2},
PAGES = {71-77},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {bipartite permutation graphs, graph decomposition, linear time algorithms, graph algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4N56BVF-5/2/bf58c425cf72e38c84d7b6d1caa17ad3},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Liu-Meng-Xing/07,
AUTHOR = {Liu, Wen An and Meng, Kun and Xing, Shu Min},
TITLE = {$Q$-ary search with one lie and bi-interval queries},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {103},
NUMBER = {2},
PAGES = {78-81},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {fault tolerance, q-ary search, bi-interval queries, worst-case},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4N7SBVC-3/2/f05515a8366e0350f006ed799f61968e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Shparlinski/07,
AUTHOR = {Shparlinski, Igor E.},
TITLE = {Bounds on the Fourier coefficients of the weighted sum function},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {103},
NUMBER = {3},
PAGES = {83-87},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {boolean function, computational complexity, fourier coefficients, weighted sums},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4N56BVF-4/2/6bde469e2f7f943ee34f04002604709e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Turau/07,
AUTHOR = {Turau, Volker},
TITLE = {Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {103},
NUMBER = {3},
PAGES = {88-93},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {self-stabilizing algorithms, fault tolerance, distributed computing, graph algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4N7RWBX-2/2/e2ec4e0b726a7df5d2a8a5c5f61eb1a3},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dawar-Janin/07,
AUTHOR = {Dawar, Anuj and Janin, David},
TITLE = {The monadic theory of finite representations of infinite words},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {103},
NUMBER = {3},
PAGES = {94-101},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {automata on infinite words, descriptive complexity, logic, specification languages},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4N7RWBX-1/2/8dd23f4bfe2daad005b63b807b0e5597},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Pavan-Wang/07,
AUTHOR = {Pavan, A. and Wang, Fengming},
TITLE = {Robustness of $P$SPACE-complete sets},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {103},
NUMBER = {3},
PAGES = {102-104},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, complete sets, robustness, p-selective sets, pspace},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4NC4MCK-1/2/8357aaaed201e11f9dda5a8089e31850},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Minnameier/07,
AUTHOR = {Minnameier, Christoph},
TITLE = {Local and global deadlock-detection in component-based systems are $NP$-hard},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {103},
NUMBER = {3},
PAGES = {105-111},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, concurrency, safety/security in digital systems},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4N7SBVC-1/2/e7ac1df14653063f8c9344a5a0df10d4},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Manea-Mitrana/07,
AUTHOR = {Manea, Florin and Mitrana, Victor},
TITLE = {All $NP$-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {103},
NUMBER = {3},
PAGES = {112-118},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {theory of computation, formal languages, turing machine, np-language, evolutionary processor},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4N7SBVC-2/2/eae5b3bb0d4165d586e18b8b7a8824b5},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Leung-Li-Pinedo-Zhang/07,
AUTHOR = {Leung, Joseph Y.-T. and Li, Haibing and Pinedo, Michael and Zhang, Jiawei},
TITLE = {Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {103},
NUMBER = {3},
PAGES = {119-129},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, order scheduling, flexible machines, uniform machines, heuristics},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4N7SBVC-4/2/00de1cfc3532d05289f93e596c21abef},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Long-Servedio-Simon/07,
AUTHOR = {Long, Philip M. and Servedio, Rocco A. and Simon, Hans Ulrich},
TITLE = {Discriminative learning can succeed where generative learning fails},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {103},
NUMBER = {4},
PAGES = {131-135},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, computational learning theory, discriminative learning, generative learning, machine learning},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4N7SBVC-5/2/fa9f61e71815371154b3e42fd0094f7c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gottlob-Lee/07,
AUTHOR = {Gottlob, Georg and Lee, Stephanie Tien},
TITLE = {A logical approach to multicut problems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {103},
NUMBER = {4},
PAGES = {136-141},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {multicut, parameterized complexity, fixed-parameter tractability, graph algorithms, logic, complexity, networks},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4N7SBVC-6/2/4292491575bbbb5f5c3879bd130edeb4},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Amir-Gasieniec-Shalom/07,
AUTHOR = {Amir, Amihood and Gasieniec, Leszek and Shalom, Riva},
TITLE = {Improved approximate common interval},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {103},
NUMBER = {4},
PAGES = {142-149},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {design of algorithms, pattern matching, computational biology, hamming distance, gene evolution},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4N9DK2G-1/2/dae4eab0ed154991097d1c79c43c00aa},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Luo-Chen-Wang/07,
AUTHOR = {Luo, Xiaofang and Chen, Min and Wang, Weifan},
TITLE = {On 3-colorable planar graphs without cycles of four lengths},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {103},
NUMBER = {4},
PAGES = {150-156},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {planar graph, coloring, cycle, length},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4N9P4S4-1/2/a216d7fc047dd6942953c878e7dfa820},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ruiz-Corchuelo-Arjona/07,
AUTHOR = {Ruiz, D. and Corchuelo, R. and Arjona, J.L.},
TITLE = {Generating non-conspiratorial executions},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {103},
NUMBER = {4},
PAGES = {157-162},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {distributed systems, concurrency, conspiracies, equivalence robustness, fairness},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4NB99J4-1/2/370a257a11270bc83ab4a54a36a6329a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hagen/07,
AUTHOR = {Hagen, Matthias},
TITLE = {On the fixed-parameter tractability of the equivalence test of monotone normal forms},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {103},
NUMBER = {4},
PAGES = {163-167},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, computational complexity, equivalence test, fixed-parameter tractability, monotone normal forms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4NCSGTY-1/2/73f44037d0255240f45cd46b0c14b252},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Shi-Liang-Lee-Lu-Wang/07,
AUTHOR = {Shi, X.H. and Liang, Y.C. and Lee, H.P. and Lu, C. and Wang, Q.X.},
TITLE = {Particle swarm optimization-based algorithms for TSP and generalized TSP},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {103},
NUMBER = {5},
PAGES = {169-176},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, particle swarm optimization, traveling salesman problem, generalized traveling salesman problem, swap operator},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4NCSGTY-2/2/0e8a0d3ddac572f0172ced19d7540ad1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Leenen-Meyer-Ghose/07,
AUTHOR = {Leenen, Louise and Meyer, Thomas and Ghose, Aditya},
TITLE = {Relaxations of semiring constraint satisfaction problems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {103},
NUMBER = {5},
PAGES = {177-182},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {semiring constraint satisfaction problems, over-constrained problems, preferences and soft constraints, combinatorial problems},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4NFR5CS-1/2/81e6c377914fbf76706c6e98d9eab08e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Janiak-Rudek/07,
AUTHOR = {Janiak, Adam and Rudek, Rados{\l}aw},
TITLE = {The learning effect: Getting to the core of the problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {103},
NUMBER = {5},
PAGES = {183-187},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {scheduling, learning effect, computational complexity},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4NGRRXF-1/2/363fa865757270496c9e1a2b6989347a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Nielson-Nielson-Pilegaard/07,
AUTHOR = {Nielson, Flemming and Nielson, Hanne Riis and Pilegaard, Henrik},
TITLE = {What is a free name in a process algebra?},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {103},
NUMBER = {5},
PAGES = {188-194},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {process algebras, reaction semantics, concurrency},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4NG3TD3-1/2/8472e461299efc3613e92c43f09c3695},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Feofiloff-Fernandes-Ferreira-de_Pina/07,
AUTHOR = {Feofiloff, Paulo and Fernandes, Cristina G. and Ferreira, Carlos E. and de Pina, Jos{\'e} Coelho},
TITLE = {Primal-dual approximation algorithms for the Prize-Collecting Steiner Tree Problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {103},
NUMBER = {5},
PAGES = {195-202},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, primal-dual method, prize-collecting steiner tree},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4NGKWDK-1/2/8461330fa2253eb9db6f5d31ff471511},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Konig-Kozioura/07,
AUTHOR = {K{\"o}nig, Barbara and Kozioura, Vitali},
TITLE = {Incremental construction of coverability graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {103},
NUMBER = {5},
PAGES = {203-209},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {concurrency, formal methods, petri nets, coverability},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4NGRRXF-2/2/84e0fc8c9d61be4f8b9a798d9ab95efe},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Shparlinski-Winterhof/07,
AUTHOR = {Shparlinski, Igor E. and Winterhof, Arne},
TITLE = {Quantum period reconstruction of approximate sequences},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {103},
NUMBER = {6},
PAGES = {211-215},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {period finding, quantum algorithm, approximate sequences, autocorrelation, finite fields, algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4NDDM55-1/2/8d5247e4e4a89e33bc44b8ab0b29457f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Nakayama-Masuyama/07,
AUTHOR = {Nakayama, Shin-ichi and Masuyama, Shigeru},
TITLE = {A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {103},
NUMBER = {6},
PAGES = {216-221},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, computational complexity, combinatorial problem, minimal cut, edge ranking},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4NJ0TNJ-1/2/2d5c26f647a1787ffe01b850e342f947},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Xu-Zhu-Xu/07,
AUTHOR = {Xu, Jun-Ming and Zhu, Qiang and Xu, Min},
TITLE = {Fault-tolerant analysis of a class of networks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {103},
NUMBER = {6},
PAGES = {222-226},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, connectivity, extraconnectivity, hypercube},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4NK4G9H-1/2/6cf3c5df1c21f80cb2a31e8c14c1a5ee},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kontkanen-Myllymaki/07,
AUTHOR = {Kontkanen, Petri and Myllym{\"a}ki, Petri},
TITLE = {A linear-time algorithm for computing the multinomial stochastic complexity},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {103},
NUMBER = {6},
PAGES = {227-233},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, combinatorial problems, computational complexity},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4NJ20HW-1/2/31f23443ab6648040107659b6a517f77},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Volkmann/07,
AUTHOR = {Volkmann, Lutz},
TITLE = {Restricted arc-connectivity of digraphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {103},
NUMBER = {6},
PAGES = {234-239},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {edge-connectivity, arc-connectivity, fault tolerance, restricted edge-connectivity, restricted arc-connectivity, complexity},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4NJWNY4-1/2/05e6adaee6d252f7da24b4e2ba8322e9},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chung-Lu-Tang/07,
AUTHOR = {Chung, Yun-Sheng and Lu, Chin Lung and Tang, Chuan Yi},
TITLE = {Efficient algorithms for regular expression constrained sequence alignment},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {103},
NUMBER = {6},
PAGES = {240-246},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {constrained sequence alignment, algorithms, regular expression, dynamic programming},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4NKXWN8-3/2/64ddf12cc44c3d1192aa3e064c6b90ee},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zuhily-Burns/07,
AUTHOR = {Zuhily, Areej and Burns, Alan},
TITLE = {Optimal $(D - J$)-monotonic priority assignment},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {103},
NUMBER = {6},
PAGES = {247-250},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {real-time systems, fixed priority scheduling, priority assignment, optimality},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4NKXWN8-2/2/3c874719dcb79a27232926b2ee58cee2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hu-Yeoh-Chen-Hsu/07,
AUTHOR = {Hu, Ken S. and Yeoh, Shyun-Shyun and Chen, Chiuyuan and Hsu, Lih-Hsing},
TITLE = {Node-pancyclicity and edge-pancyclicity of hypercube variants},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {102},
NUMBER = {1},
PAGES = {1-7},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {interconnection networks, hypercube, crossed cube, mobius cube, locally twisted cube, pancyclicity},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MFCW6N-1/2/3eccda20d82383096fcc730f9a7b3b65},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jiang-Luo-Yang/07,
AUTHOR = {Jiang, M. and Luo, Y.P. and Yang, S.Y.},
TITLE = {Stochastic convergence analysis and parameter selection of the standard particle swarm optimization algorithm},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {102},
NUMBER = {1},
PAGES = {8-16},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {particle swarm optimization, analysis of algorithms, stochastic convergence analysis, stochastic optimization, parameter selection},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MC71RT-3/2/60789826953119a703f3063777446e49},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Brosenne-Damm-Homeister-Waack/07,
AUTHOR = {Brosenne, Henrik and Damm, Carsten and Homeister, Matthias and Waack, Stephan},
TITLE = {On approximation by $\bigoplus$-OBDDs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {102},
NUMBER = {1},
PAGES = {17-21},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, nondeterministic obdd, parity obdd, approximation},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MFJTJ2-1/2/2a6c422ce17fc6aaf92c072965e45fd2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kuo-Yang/07,
AUTHOR = {Kuo, Wen-Hung and Yang, Dar-Li},
TITLE = {Single machine scheduling with past-sequence-dependent setup times and learning effects},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {102},
NUMBER = {1},
PAGES = {22-26},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {scheduling, single-machine, setup times, learning effect},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MFKDC2-1/2/ee29aca666e2c5f771ade722c24d635d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Tsin/07,
AUTHOR = {Tsin, Yung H.},
TITLE = {An improved self-stabilizing algorithm for biconnectivity and bridge-connectivity},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {102},
NUMBER = {1},
PAGES = {27-34},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {self-stabilizing algorithm, fault tolerance, distributed computing, distributed algorithm, cut-vertex, biconnected component, bridge, bridge-connected component},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MGVJB9-1/2/aa97d8dc8dea66ca1d9095cc1885d735},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lin-Yin/07,
AUTHOR = {Lin, Cho-Chin and Yin, Hao-Yun},
TITLE = {Bounds on the multi-clients incremental computing for homogeneous decreasing computation sequences},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {102},
NUMBER = {1},
PAGES = {35-40},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, bound, incremental computing, computation sequence},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MFCW6N-2/2/85f90dc95a7f7b6d49d047067389e910},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ji-Cheng/07,
AUTHOR = {Ji, Min and Cheng, T.C.E.},
TITLE = {An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {102},
NUMBER = {2-3},
PAGES = {41-47},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {machine scheduling, start time-dependent processing times, makespan, approximation algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MMP2NC-2/2/f6fdcefb828cfe4e965352f222f8f158},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wu/07,
AUTHOR = {Wu, Zhilin},
TITLE = {A note on the characterization of TL[EF]},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {102},
NUMBER = {2-3},
PAGES = {48-54},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal languages, branching-time temporal logic, tree languages, ehrenfeucht-fraisse game},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MM8BN4-1/2/aca3503bdd51c33cf37bebf5aa4cec19},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chan-Chin-Ye-Zhang-Zhu/07,
AUTHOR = {Chan, Joseph Wun-Tat and Chin, Francis Y.L. and Ye, Deshi and Zhang, Yong and Zhu, Hong},
TITLE = {Greedy online frequency allocation in cellular networks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {102},
NUMBER = {2-3},
PAGES = {55-61},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {on-line algorithms, frequency allocation, competitive analysis, greedy algorithm, cellular network},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MP5KX2-1/2/a7727cf53ccea327561bf7cc52729b2c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Guo-Huffner-Moser/07,
AUTHOR = {Guo, Jiong and H{\"u}ffner, Falk and Moser, Hannes},
TITLE = {Feedback arc set in bipartite tournaments is $NP$-complete},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {102},
NUMBER = {2-3},
PAGES = {62-65},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, computational complexity, feedback set problems, bipartite tournaments},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MSHTGT-1/2/cddd669984b78f18a69b033a6576083b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Tan/07,
AUTHOR = {Tan, Xuehou},
TITLE = {Sweeping simple polygons with the minimum number of chain guards},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {102},
NUMBER = {2-3},
PAGES = {66-71},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational geometry, analysis of algorithms, sweeping polygons with chain guards, link diagrams},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MK0HY7-1/2/56e0643e4887cfb49343e33435a246f3},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Van_Roy/07,
AUTHOR = {Van Roy, Benjamin},
TITLE = {A short proof of optimality for the MIN cache replacement algorithm},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {102},
NUMBER = {2-3},
PAGES = {72-73},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, on-line algorithms, caching, paging},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MJBTT3-4/2/1108f51858e4a655cdc98aa8b6ba04e3},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Rampersad/07,
AUTHOR = {Rampersad, Narad},
TITLE = {On the context-freeness of the set of words containing overlaps},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {102},
NUMBER = {2-3},
PAGES = {74-78},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal languages, overlap-free words, thue-morse word},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MJJCBB-1/2/89b358db091ecb014ae77e085b7f28e5},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Nagamochi-Kamidoi/07,
AUTHOR = {Nagamochi, Hiroshi and Kamidoi, Yoko},
TITLE = {Minimum cost subpartitions in graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {102},
NUMBER = {2-3},
PAGES = {79-84},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, extreme vertex sets, clustering, cut, graph, k-way cut, partition},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MR7DD1-1/2/c80c7c3045fd11c5b36bf7435fe2c1ed},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Xiaofang/07,
AUTHOR = {Xiaofang, Luo},
TITLE = {The 4-choosability of toroidal graphs without intersecting triangles},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {102},
NUMBER = {2-3},
PAGES = {85-91},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {toroidal graph, choosability, list coloring, cycle, combinatorial problems},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MG6PFK-3/2/79890aa27a26317ef0370d68c2cc75a4},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Honkala-Laihonen/07a,
AUTHOR = {Honkala, Iiro and Laihonen, Tero},
TITLE = {On a new class of identifying codes in graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {102},
NUMBER = {2-3},
PAGES = {92-98},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {fault tolerance, parallel processing, identification, optimal code},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MJBTT3-3/2/058adb953f0c5e2e273ac1fbdd2b4846},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Huang-Yang-Tseng-Peng-Ann/07,
AUTHOR = {Huang, Kuo-Si and Yang, Chang-Biau and Tseng, Kuo-Tsung and Peng, Yung-Hsing and Ann, Hsing-Yen},
TITLE = {Dynamic programming algorithms for the mosaic longest common subsequence problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {102},
NUMBER = {2-3},
PAGES = {99-103},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {dynamic programming, bioinformatics, longest common subsequence, mosaic sequence, design of algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MJBTT3-2/2/144f851ea5d133ab49ab8841e5811730},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Sherstov/07,
AUTHOR = {Sherstov, Alexander A.},
TITLE = {Powering requires threshold depth 3},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {102},
NUMBER = {2-3},
PAGES = {104-107},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, threshold circuits, circuit lower bounds, complexity of arithmetic operations},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MGVJB9-2/2/cc5182bb3ce06f496cb4c70b7aeb3980},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Mehedy-Hasan-Kaykobad/07,
AUTHOR = {Mehedy, Lenin and Hasan, M. Kamrul and Kaykobad, Mohammad},
TITLE = {An improved degree based condition for Hamiltonian cycles},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {102},
NUMBER = {2-3},
PAGES = {108-112},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {hamiltonian cycle, hamiltonian path, graphs, combinatorial problems},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MNHY66-1/2/c7d137a5be81c259f1675bc350767ce6},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gagie/07,
AUTHOR = {Gagie, Travis},
TITLE = {Dynamic Shannon coding},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {102},
NUMBER = {2-3},
PAGES = {113-117},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {data compression, on-line algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MG6PFK-1/2/790a3e4441a06df779068574f26594b8},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Yi-Choi-Kim-Kim/07,
AUTHOR = {Yi, Kwangkeun and Choi, Hosik and Kim, Jaehwang and Kim, Yongdai},
TITLE = {An empirical study on classification methods for alarms from a bug-finding static C analyzer},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {102},
NUMBER = {2-3},
PAGES = {118-123},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {static analysis, abstract interpretation, statistical post analysis, classification methods, program correctness},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MG6PFK-2/2/34364d3fd2ec2e8aa6d634a318c58d1b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Costa-Haeusler-Laber-Nogueira/07,
AUTHOR = {Costa, Vaston and Haeusler, Edward and Laber, Eduardo S. and Nogueira, Loana},
TITLE = {A note on the size of minimal covers},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {102},
NUMBER = {2-3},
PAGES = {124-126},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {finite combinatorial problems, theory of computation, computational complexity, graphs, boolean functions, vertex cover},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MGVJB9-3/2/84b8ede7625ec2460fa8acf240de9c9c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Laguillaumie-Vergnaud/07,
AUTHOR = {Laguillaumie, Fabien and Vergnaud, Damien},
TITLE = {Multi-designated verifiers signatures: Anonymity without encryption},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {102},
NUMBER = {2-3},
PAGES = {127-132},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, designated verifier signature, anonymity},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MM7TF8-1/2/67bbb8d117b8a5386106928f7d58ca57},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Marti-Farre/07,
AUTHOR = {Mart{\'{i}}-Farr{\'e}, Jaume},
TITLE = {A note on secret sharing schemes with three homogeneous access structure},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {102},
NUMBER = {4},
PAGES = {133-137},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, secret sharing schemes, information rate},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MM7TF8-4/2/6f9304d5cc69427f7ed155065cf5da5f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Avoine-Vaudenay/07,
AUTHOR = {Avoine, Gildas and Vaudenay, Serge},
TITLE = {How to safely close a discussion},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {102},
NUMBER = {4},
PAGES = {138-142},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {safe termination, synchronization, secure communication, safety/security in digital systems, cryptography},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MM7TF8-3/2/d363bd9fe7952efd4a0268e21222c2a7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lin/07a,
AUTHOR = {Lin, Min-Sheng},
TITLE = {Fast and simple algorithms to count the number of vertex covers in an interval graph},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {102},
NUMBER = {4},
PAGES = {143-146},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, interval graph, vertex cover, independent set, counting},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MM7TF8-2/2/819ad6194ee833e0346ad768201d35ae},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Sidorowicz/07,
AUTHOR = {Sidorowicz, El{\.z}bieta},
TITLE = {The game chromatic number and the game colouring number of cactuses},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {102},
NUMBER = {4},
PAGES = {147-151},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, competitive algorithms, game colouring number, game chromatic number},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MM1P58-1/2/eb367262444ece46ca25acde996a2c0f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Brass/07,
AUTHOR = {Brass, Peter},
TITLE = {Multidimensional heaps and complementary range searching},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {102},
NUMBER = {4},
PAGES = {152-155},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {data structures},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MMWHM2-1/2/7d27a4ba825aff7463b852b2b0991a0c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Deo-Cami/07,
AUTHOR = {Deo, Narsingh and Cami, Aurel},
TITLE = {Preferential deletion in dynamic models of web-like networks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {102},
NUMBER = {4},
PAGES = {156-162},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {web-like networks, interconnection networks, dynamic random graph modeling, preferential node deletion, scale-free, power-law degree distribution},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MSHY2T-2/2/269074bcccc8cb6f19bbc14cda599d83},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Goswami-Das-Nandy/07,
AUTHOR = {Goswami, Partha P. and Das, Sandip and Nandy, Subhas C.},
TITLE = {Chromatic distribution of $k$-nearest neighbors of a line segment in a planar colored point set},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {102},
NUMBER = {4},
PAGES = {163-168},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MSHY2T-1/2/a10cee5c4440d739a3ba21e49d38a372},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Vahrenhold/07,
AUTHOR = {Vahrenhold, Jan},
TITLE = {An in-place algorithm for Klee's measure problem in two dimensions},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {102},
NUMBER = {4},
PAGES = {169-174},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, computational geometry},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MM1P58-2/2/2132b655f2d07b28046b8cd9e2e27762},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Luccio-Enriquez-Pagli/07,
AUTHOR = {Luccio, Fabrizio and Enriquez, Antonio Mesa and Pagli, Linda},
TITLE = {$k$-restricted rotation distance between binary trees},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {102},
NUMBER = {5},
PAGES = {175-180},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {rotation distance, binary tree, data structures, design of algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MMPNN9-1/2/5d69354de49ce89c6b2050272db72310},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hesselink/07a,
AUTHOR = {Hesselink, Wim H.},
TITLE = {A linear-time algorithm for Euclidean feature transform sets},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {102},
NUMBER = {5},
PAGES = {181-186},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, distance transform, feature transform, image processing, computational geometry},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MM1P58-4/2/669115d82b25a3a9c86e3dbacf998459},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chlebus-Brazier/07,
AUTHOR = {Chlebus, Edward and Brazier, Jordy},
TITLE = {Nonstationary Poisson modeling of web browsing session arrivals},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {102},
NUMBER = {5},
PAGES = {187-190},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {internet, web traffic, performance evaluation, nonstationary poisson process},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4N6Y5PR-1/2/db8c7cc52b63af740c77edc014330734},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kowalik/07,
AUTHOR = {Kowalik, {\L}ukasz},
TITLE = {Adjacency queries in dynamic sparse graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {102},
NUMBER = {5},
PAGES = {191-195},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {data structures, graph algorithms, adjacency, orientation, dynamic},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MM1P58-3/2/b5b573a3d24ef5043473b6e1165cd734},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Latifi/07,
AUTHOR = {Latifi, Shahram},
TITLE = {A study of fault tolerance in star graph},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {102},
NUMBER = {5},
PAGES = {196-200},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {fault tolerance, interconnection networks, permutation, star graph},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MV0MC7-1/2/7b7ad21a47f054d03f86cea37fea3d62},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ayala-Rincon-de_Abreu-de_Siqueira/07,
AUTHOR = {Ayala-Rinc{\'o}n, Mauricio and de Abreu, Bruno T. and de Siqueira, Jos{\'e}},
TITLE = {A variant of the Ford-Johnson algorithm that is more space efficient},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {102},
NUMBER = {5},
PAGES = {201-207},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, analysis of algorithms, optimal sorting},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MM1P58-5/2/517ae83536062507d83d367ac6d19b3d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Doyen/07,
AUTHOR = {Doyen, Laurent},
TITLE = {Robust parametric reachability for timed automata},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {102},
NUMBER = {5},
PAGES = {208-213},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {parametric timed automata, real-time systems, formal methods, model checking, theory of computation, robustness, verification},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MMWHM2-2/2/92fdb2c5f4041c69a08c6f786460b4bb},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hammack/07,
AUTHOR = {Hammack, Richard},
TITLE = {Minimum cycle bases of direct products of complete graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {102},
NUMBER = {5},
PAGES = {214-218},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, minimum cycle basis, graph direct product},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MV0MC7-2/2/cae28a9db6dd354a90065b042cb00841},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ben-Zwi-Lachish-Newman/07,
AUTHOR = {Ben-Zwi, Oren and Lachish, Oded and Newman, Ilan},
TITLE = {Lower bounds for testing Euclidean Minimum Spanning trees},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {102},
NUMBER = {6},
PAGES = {219-225},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, computational geometry, randomized algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MVN13X-1/2/05ee449018dbe9b88f8b3ebb5136bb72},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Xu-Yang/07,
AUTHOR = {Xu, Jun-Ming and Yang, Chao},
TITLE = {Fault diameter of product graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {102},
NUMBER = {6},
PAGES = {226-228},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorics, diameter, fault diameter, product graphs, cartesian graphs, cartesian graph bundles, permutation graphs},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MV7581-1/2/15da78a07b22460938b9d23e58c36e8d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lecroq/07,
AUTHOR = {Lecroq, Thierry},
TITLE = {Fast exact string matching algorithms},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {102},
NUMBER = {6},
PAGES = {229-235},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {string matching, hashing, design of algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MX56KX-1/2/7fc8e3e794b5077ba1c2a7d9e5946b50},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Laroussinie-Sproston/07,
AUTHOR = {Laroussinie, Fran{\c{c}}ois and Sproston, Jeremy},
TITLE = {State explosion in almost-sure probabilistic reachability},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {102},
NUMBER = {6},
PAGES = {236-241},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {probabilistic systems, model checking, computational complexity, formal methods, timed automata},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MXBFC9-1/2/970b97155dc0c21ff5f8244b2669b601},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Tsai/07,
AUTHOR = {Tsai, Chang-Hsiung},
TITLE = {Cycles embedding in hypercubes with node failures},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {102},
NUMBER = {6},
PAGES = {242-246},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {interconnection network, hypercube, hamiltonian, fault-tolerant, cycle embedding},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4N0HJHG-1/2/f7d5d241a3687db71592b546e81cdccf},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Sedjelmaci/07,
AUTHOR = {Sedjelmaci, Sidi Mohamed},
TITLE = {Jebelean-Weber's algorithm without spurious factors},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {102},
NUMBER = {6},
PAGES = {247-252},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {integer greatest common divisor (gcd), parallel gcd algorithm, extended gcd algorithm, algorithms, analysis of algorithms, number theory},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4N0HJHG-2/2/5025332896973421e752f14ac250181c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Obradovic-Peters-Ruzic/07,
AUTHOR = {Obradovi{\'c}, Nenad and Peters, Joseph and Ru{\v{z}}i{\'c}, Goran},
TITLE = {Efficient domination in circulant graphs with two chord lengths},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {102},
NUMBER = {6},
PAGES = {253-258},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {circulant graph, efficient domination, combinatorial problems},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4N2KTJX-4/2/f44a58cf902daf7e589c2fd3e00d7cbb},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ye-Zhang/07,
AUTHOR = {Ye, Deshi and Zhang, Guochuan},
TITLE = {Maximizing the throughput of parallel jobs on hypercubes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {102},
NUMBER = {6},
PAGES = {259-263},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, parallel jobs, hypercubes},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4N2KTJX-5/2/bff89d74b2a643fa5b1722b93e5ba2ff},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Engelfriet-Gelsema/07,
AUTHOR = {Engelfriet, Joost and Gelsema, Tjalling},
TITLE = {An exercise in structural congruence},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {101},
NUMBER = {1},
PAGES = {1-5},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {concurrency, pi-calculus, petri net, commutative semigroup},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4KST3R9-1/2/09937fa006a75082c039dc5ca1d2bad3},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Alborzi-Samet/07,
AUTHOR = {Alborzi, Houman and Samet, Hanan},
TITLE = {Execution time analysis of a top-down $R$-tree construction algorithm},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {101},
NUMBER = {1},
PAGES = {6-12},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {spatial databases, r-trees, bulk loading, packing, data structures},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4KV8TJP-1/2/4b67a4c04687eb55c286a7a01bdef4b6},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Mc_Dermid-Cheng-Suzuki/07,
AUTHOR = {Mc Dermid, Eric and Cheng, Christine and Suzuki, Ichiro},
TITLE = {Hardness results on the man-exchange stable marriage problem with short preference lists},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {101},
NUMBER = {1},
PAGES = {13-19},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {stable marriage, man-exchange stable, np-complete, combinatorial problems},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4KR3JGT-2/2/d7afac2e0a7ed5fa8a9d2d2efad14b74},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wang/07,
AUTHOR = {Wang, Junhu},
TITLE = {Binary equality implication constraints, normal forms and data redundancy},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {101},
NUMBER = {1},
PAGES = {20-25},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {databases, data dependency, normal form, data redundancy},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4KPP4H7-1/2/b1b2e7622ba12fe3eff7928b635c8c01},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Feige-Lee/07,
AUTHOR = {Feige, Uriel and Lee, James R.},
TITLE = {An improved approximation ratio for the minimum linear arrangement problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {101},
NUMBER = {1},
PAGES = {26-29},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4KV3Y2C-1/2/c416c44577e8a9e2347ac10670d07cff},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Melkonian/07,
AUTHOR = {Melkonian, Vardges},
TITLE = {Flows in dynamic networks with aggregate arc capacities},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {101},
NUMBER = {1},
PAGES = {30-35},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {networks flows, computational complexity, np-completeness, linear programming},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4KPNB2X-1/2/fd2879e45c06361db044626cb1657285},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Abu-Khzam-Langston/07,
AUTHOR = {Abu-Khzam, Faisal N. and Langston, Michael A.},
TITLE = {Linear-time algorithms for problems on planar graphs with fixed disk dimension},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {101},
NUMBER = {1},
PAGES = {36-40},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, design of algorithms, disk dimension, outerplanar graphs, pathwidth, planar graphs},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4M1D09T-1/2/0cc47a8ec5a3c59ccd236fec02d08f49},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bird-Sadnicki/07,
AUTHOR = {Bird, Richard S. and Sadnicki, Stefan},
TITLE = {Minimal on-line labelling},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {101},
NUMBER = {1},
PAGES = {41-45},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, analysis of algorithms, combinatorial problems},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4KV2YB8-1/2/e941a0e1fbc85f0b1a4f79d3da6ef701},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kawabe-Mano-Sakurada-Tsukada/07,
AUTHOR = {Kawabe, Yoshinobu and Mano, Ken and Sakurada, Hideki and Tsukada, Yasuyuki},
TITLE = {Theorem-proving anonymity of infinite-state systems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {101},
NUMBER = {1},
PAGES = {46-51},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {anonymity, verification, infinite-state system, i/o-automaton, theorem proving, formal methods, safety/security in digital systems},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4KPX904-2/2/0464ece15e458acdd7e082b030bcaea9},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Clifford-Clifford/07,
AUTHOR = {Clifford, Peter and Clifford, Rapha{\"e}l},
TITLE = {Simple deterministic wildcard matching},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {101},
NUMBER = {2},
PAGES = {53-54},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, string matching, wildcards},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4KST3R9-2/2/ef63aed56c3a7107e2662bb9cd0e0329},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Albert-Atkinson-Nussbaum-Sack-Santoro/07,
AUTHOR = {Albert, M.H. and Atkinson, M.D. and Nussbaum, Doron and Sack, J{\"o}rg-R{\"u}diger and Santoro, Nicola},
TITLE = {On the longest increasing subsequence of a circular list},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {101},
NUMBER = {2},
PAGES = {55-59},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, randomized algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4KV2YB8-2/2/1df20b7096f1212781fba31a14c02a29},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Abraham-Chockler-Keidar-Malkhi/07,
AUTHOR = {Abraham, Ittai and Chockler, Gregory and Keidar, Idit and Malkhi, Dahlia},
TITLE = {Wait-free regular storage from Byzantine components},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {101},
NUMBER = {2},
PAGES = {60-65},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {distributed computing},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4KV8TJP-2/2/e3f2f0217bbf84bbebe65b565c00ed1f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Sawitzki/07,
AUTHOR = {Sawitzki, Daniel},
TITLE = {Lower bounds on the OBDD size of two fundamental functions' graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {101},
NUMBER = {2},
PAGES = {66-71},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, computational complexity, data structures, theory of computation},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4KXVD3P-1/2/c7bb601785d693be21b1f89c4379483a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Tanaka-Kawai-Shibata/07,
AUTHOR = {Tanaka, Yuuki and Kawai, Hiroyuki and Shibata, Yukio},
TITLE = {Isomorphic factorization, the Kronecker product and the line digraph},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {101},
NUMBER = {2},
PAGES = {72-77},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {interconnection network, isomorphic factorization, kronecker product, line digraph},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4M4TNX4-1/2/c917243657b88f6a8a482a86edaa8998},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Song-Park-Kong-Lee/07,
AUTHOR = {Song, Moon Bae and Park, Kwang Jin and Kong, Ki-Sik and Lee, Sang Keun},
TITLE = {Bottom-up nearest neighbor search for $R$-trees},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {101},
NUMBER = {2},
PAGES = {78-85},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {r-trees, nearest neighbor search, bottom-up search, databases},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4KXDWNB-1/2/782895462e25d91ed3865262fc302203},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bach/07,
AUTHOR = {Bach, Eric},
TITLE = {Bounds for the expected duration of the monopolist game},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {101},
NUMBER = {2},
PAGES = {86-92},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, martingales, ruin problems},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4M5WJ32-1/2/6e29df45253be83a1e968dea7ea847c5},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Tsai-Jiang/07,
AUTHOR = {Tsai, Chang-Hsiung and Jiang, Shu-Yun},
TITLE = {Path bipancyclicity of hypercubes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {101},
NUMBER = {3},
PAGES = {93-97},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {hypercube, hamiltonian, vertex-bipancyclic, edge-bipancyclic, path-bipancyclic, interconnection networks},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4M21T55-1/2/d61839de890d4900749b40ff8e7f1200},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Reyzin-Srivastava/07,
AUTHOR = {Reyzin, Lev and Srivastava, Nikhil},
TITLE = {On the longest path algorithm for reconstructing trees from distance matrices},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {101},
NUMBER = {3},
PAGES = {98-100},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, graph algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4M2WP81-2/2/58aba7e9eb2b9aaa2701ea92bb3d44b9},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Riege-Rothe-Spakowski-Yamamoto/07,
AUTHOR = {Riege, Tobias and Rothe, J{\"o}rg and Spakowski, Holger and Yamamoto, Masaki},
TITLE = {An improved exact algorithm for the domatic number problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {101},
NUMBER = {3},
PAGES = {101-106},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, exact algorithms, randomized algorithms, domatic number problem},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4M21T55-2/2/bbc4e2b5ab78e24665c67ce99611bcd1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ultes-Nitsche/07,
AUTHOR = {Ultes-Nitsche, Ulrich},
TITLE = {A power-set construction for reducing B{\"u}chi automata to non-determinism degree two},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {101},
NUMBER = {3},
PAGES = {107-111},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal languages, buchi automata, non-determinism, regular [omega]-languages},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4M645DM-1/2/d97a6e8602f212aba86f7c191410957e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ron-Rosenfeld-Vadhan/07,
AUTHOR = {Ron, Dana and Rosenfeld, Amir and Vadhan, Salil},
TITLE = {The hardness of the Expected Decision Depth problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {101},
NUMBER = {3},
PAGES = {112-118},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, decision trees},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4M2WP81-3/2/c852434329eba6be95ed5e7384e384c4},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dobson-Gutierrez-Habib-Szwarcfiter/07,
AUTHOR = {Dobson, Maria Patricia and Gutierrez, Marisa and Habib, Michel and Szwarcfiter, Jayme L.},
TITLE = {On transitive orientations with restricted covering graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {101},
NUMBER = {3},
PAGES = {119-125},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {comparability graphs, combinatorial problems, modular decomposition},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4M2WP81-1/2/4cbe1c71957b8aed2e0d5f66e1dd6314},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Peczarski/07,
AUTHOR = {Peczarski, Marcin},
TITLE = {The Ford-Johnson algorithm still unbeaten for less than 47 elements},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {101},
NUMBER = {3},
PAGES = {126-128},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, sorting, merging},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4M21T55-3/2/77cba835072bfd4dbaa63c53bf0ac4d9},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Collins-Kempe-Saia-Young/07,
AUTHOR = {Collins, Michael J. and Kempe, David and Saia, Jared and Young, Maxwell},
TITLE = {Nonnegative integral subset representations of integer sets},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {101},
NUMBER = {3},
PAGES = {129-133},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, combinatorial problems, heuristics, additive number theory, radiology},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4M0S3C6-1/2/acac9dd5a1eab267424f1ae58580e999},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chen-Raspaud-Wang/07,
AUTHOR = {Chen, Min and Raspaud, Andr{\'e} and Wang, Weifan},
TITLE = {Three-coloring planar graphs without short cycles},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {101},
NUMBER = {3},
PAGES = {134-138},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {coloring, planar graph, cycle},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4M1D09T-2/2/a3de55c7bdf53a1e51e916e0707b88e5},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Engelfriet/07,
AUTHOR = {Engelfriet, Joost},
TITLE = {A Kleene characterization of computability},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {101},
NUMBER = {4},
PAGES = {139-140},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal languages, kleene, recursive enumerable, binary relation},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4M2WP81-5/2/ae27fd9d97e5a14cb33c89355782baa9},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Erk-Niehren/07,
AUTHOR = {Erk, Katrin and Niehren, Joachim},
TITLE = {Dominance constraints in stratified context unification},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {101},
NUMBER = {4},
PAGES = {141-147},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational logics, trees, unification, formal languages},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4M645DM-2/2/af353680e456cb87c85e6d83ffaaacc8},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Khachiyan-Boros-Elbassioni-Gurvich/07,
AUTHOR = {Khachiyan, Leonid and Boros, Endre and Elbassioni, Khaled and Gurvich, Vladimir},
TITLE = {A global parallel algorithm for the hypergraph transversal problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {101},
NUMBER = {4},
PAGES = {148-155},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {bounded dimension, conformal hypergraph, dualization, global parallel algorithm, hypergraph, incremental generating, maximal independent set, minimal transversal, parallel processing},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4M2WP81-6/2/2cd8e3607d94e4370e29ac6e05e28810},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dieudonne-Petit/07,
AUTHOR = {Dieudonn{\'e}, Yoann and Petit, Franck},
TITLE = {Circle formation of weak robots and Lyndon words},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {101},
NUMBER = {4},
PAGES = {156-162},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {distributed computing, formation of geometric patterns, mobile robot networks, self-deployment},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4M5WJ32-3/2/a1d0d7760c1dde443cb68620c5516a94},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Krajicek/07,
AUTHOR = {Kraj{\'{i}}{\v{c}}ek, Jan},
TITLE = {Substitutions into propositional tautologies},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {101},
NUMBER = {4},
PAGES = {163-167},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, proof complexity, automated theorem proving},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4M2WP81-4/2/95e18035b40703a71e95ea833fe47cf2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Tzeng-Jiang-Huang/07,
AUTHOR = {Tzeng, Chi-Hung and Jiang, Jehn-Ruey and Huang, Shing-Tsaan},
TITLE = {A self-stabilizing $(\Delta+4)$-edge-coloring algorithm for planar graphs in anonymous uniform systems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {101},
NUMBER = {4},
PAGES = {168-173},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {distributed systems, edge coloring, planar graphs, self-stabilization},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4M4KR45-1/2/bec1c0609ec82764d19cd7a714f5c080},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chen-Meng/07,
AUTHOR = {Chen, Wenbin and Meng, Jiangtao},
TITLE = {An improved lower bound for approximating Shortest Integer Relation in $l _\infty$ norm $(SIR _\infty)$},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {101},
NUMBER = {4},
PAGES = {174-179},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithm, computational complexity, diophantine approximation, homogeneous linear system, integer relation, np-hard},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4M5WJ32-2/2/8086318f82398abe674f2d6ae3ee994e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Eisenstat-Angluin/07,
AUTHOR = {Eisenstat, David and Angluin, Dana},
TITLE = {The $VC$ dimension of $k$-fold union},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {101},
NUMBER = {5},
PAGES = {181-184},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, vc dimension, concept classes, unions of concepts, intersections of concepts},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MC71RT-2/2/019ee9cc3cb4c5c1dc3b7535612f4c91},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Xu-Xu/07,
AUTHOR = {Xu, Min and Xu, Jun-Ming},
TITLE = {The forwarding indices of augmented cubes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {101},
NUMBER = {5},
PAGES = {185-189},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, augmented cubes, routings, forwarding index},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4M6SBP8-1/2/7bd8fba8b92518b006cbc73c35c87fad},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Anceaume-Friedman-Gradinariu/07,
AUTHOR = {Anceaume, Emmanuelle and Friedman, Roy and Gradinariu, Maria},
TITLE = {Managed agreement: Generalizing two fundamental distributed agreement problems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {101},
NUMBER = {5},
PAGES = {190-198},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {automatic theorem proving, formal languages},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MMP2NC-1/2/f358cc2bf09681d677ee73e55a8aacc6},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Biro-Cechlarova/07,
AUTHOR = {Bir{\'o}, P{\'e}ter and Cechl{\'a}rov{\'a}, Katarina},
TITLE = {Inapproximability of the kidney exchange problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {101},
NUMBER = {5},
PAGES = {199-202},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {kidney transplantation, cooperative game, core, computational complexity, inapproximability},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4M6S02V-1/2/aecab8ee4f6954dac6122165de28538c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hu/07,
AUTHOR = {Hu, Shiyan},
TITLE = {A linear time algorithm for max-min length triangulation of a convex polygon},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {101},
NUMBER = {5},
PAGES = {203-208},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational geometry, max-min length triangulation, max-min length k-set triangulation},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MC71RT-1/2/1aff4299f2cab66badc3627813af6113},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Martin-Vide-Mitrana/07,
AUTHOR = {Mart{\'i}n-Vide, Carlos and Mitrana, Victor},
TITLE = {Remarks on arbitrary multiple pattern interpretations},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {101},
NUMBER = {5},
PAGES = {209-214},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {multiple pattern interpretation, multiple pattern description, closure properties, ambiguity, formal languages},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4M645DM-3/2/b1b756bb6168be6f65aea3abd771e688},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Esperet-Ochem/07,
AUTHOR = {Esperet, Louis and Ochem, Pascal},
TITLE = {Oriented colorings of 2-outerplanar graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {101},
NUMBER = {5},
PAGES = {215-219},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, oriented coloring, 2-outerplanar graphs},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4M5WJ32-4/2/233d5b165f0754d3ed74eabec1cdc89e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Guadalupe_Ramos-Silva-Vidal/07,
AUTHOR = {Guadalupe Ramos, J. and Silva, Josep and Vidal, Germ{\'a}n},
TITLE = {Ensuring the quasi-termination of needed narrowing computations},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {101},
NUMBER = {5},
PAGES = {220-226},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {programming languages, functional programming, formal semantics},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4M5WJ32-5/2/64e7325579be37805dadb3bfdec60a35},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hsu-Lai-Tsai/07,
AUTHOR = {Hsu, Hong-Chun and Lai, Pao-Lien and Tsai, Chang-Hsiung},
TITLE = {Geodesic pancyclicity and balanced pancyclicity of augmented cubes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {101},
NUMBER = {6},
PAGES = {227-232},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {augmented cubes, panconnected, pancyclic, geodesic pancyclic, balanced pancyclic, interconnection networks},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MJBTT3-1/2/a8772eb9387d40a7682a01b8ee3cf8db},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Melkonian/07a,
AUTHOR = {Melkonian, Vardges},
TITLE = {$LP$-based solution methods for the asymmetric TSP},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {101},
NUMBER = {6},
PAGES = {233-238},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {tsp, linear programming, network flows, approximation algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MBCBNS-1/2/c50d1f47af1cddf010c45c69ddf847b3},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Luan-Saia-Young/07,
AUTHOR = {Luan, Shuang and Saia, Jared and Young, Maxwell},
TITLE = {Approximation algorithms for minimizing segments in radiation therapy},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {101},
NUMBER = {6},
PAGES = {239-244},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, intensity modulated radiation therapy, multileaf collimator, segmentation},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MBCBNS-2/2/125455096747c07f7643c15a80a12773},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dietzfelbinger-Wunderlich/07,
AUTHOR = {Dietzfelbinger, Martin and Wunderlich, Henning},
TITLE = {A characterization of average case communication complexity},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {101},
NUMBER = {6},
PAGES = {245-249},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {theory of computation, communication complexity, distributed computing, computational complexity, average case complexity, information complexity},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MD9KD4-2/2/40815d4a2ec0845db2a1c61b758f339a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Maass/07,
AUTHOR = {Maa{\ss}, Moritz G.},
TITLE = {Computing suffix links for suffix trees and arrays},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {101},
NUMBER = {6},
PAGES = {250-254},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, pattern matching, suffix links, suffix trees, suffix arrays},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4M7VFM3-1/2/1ea73b673621e0c121e3cc92ebb014d7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Almeida-Baquero-Preguica-Hutchison/07,
AUTHOR = {Almeida, Paulo S{\'e}rgio and Baquero, Carlos and Pregui{\c{c}}a, Nuno and Hutchison, David},
TITLE = {Scalable Bloom filters},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {101},
NUMBER = {6},
PAGES = {255-261},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {data structures, bloom filters, distributed systems, randomized algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MD9KD4-3/2/fb80128548a477b72865e4e10fd64307},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Al_Namneh-Pan/07,
AUTHOR = {Al Na'mneh, Rami and Pan, W. David},
TITLE = {Five-step FFT algorithm with reduced computational complexity},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {101},
NUMBER = {6},
PAGES = {262-267},
YEAR = {2007},
EDITOR = {Tarlecki, A.},
KEYWORDS = {five-step fast fourier transform, computational complexity},
URL = {http://www.sciencedirect.com/science/article/B6V0F-4MD9KD4-1/2/6c5e4eae29733f2abe179092920d8e95},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-Jena-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}