@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},
}