@article{Borowiecki-Grytczuk-Pilsniak/12,
AUTHOR = {Borowiecki, Mieczys{\l}aw and Grytczuk, Jaros{\l}aw and Pil{\'s}niak, Monika},
TITLE = {Coloring chip configurations on graphs and digraphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {1-2},
PAGES = {1-4},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, graph algorithms, graph coloring},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011002602},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Xiao-Nagamochi/12,
AUTHOR = {Xiao, Mingyu and Nagamochi, Hiroshi},
TITLE = {An FPT algorithm for edge subset feedback edge set},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {1-2},
PAGES = {5-9},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, feedback set, edge feedback set, fixed-parameter tractable},
URL = {http://www.sciencedirect.com/science/article/pii/S002001901100278X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Sviridenko/12,
AUTHOR = {Sviridenko, Maxim},
TITLE = {A note on the Kenyon-Remila strip-packing algorithm},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {1-2},
PAGES = {10-12},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {bin packing, approximation algorithms, strip packing},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011002742},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Sergey-Clarke/12,
AUTHOR = {Sergey, Ilya and Clarke, Dave},
TITLE = {A correspondence between type checking via reduction and type checking via evaluation},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {1-2},
PAGES = {13-20},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal semantics, functional programming, compositional evaluators, type checkers, continuation-passing style, defunctionalization, refunctionalization},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011002791},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhang-Chin-Ting-Chan-Han-Lam/12,
AUTHOR = {Zhang, Yong and Chin, Francis Y.L. and Ting, Hing-Fung and Chan, Joseph Wun-Tat and Han, Xin and Lam, Ka-Cheong},
TITLE = {Online call control in cellular networks revisited},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {1-2},
PAGES = {21-25},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {on-line algorithms, call control problem, cellular networks},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011002766},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jamison-Narayan/12,
AUTHOR = {Jamison, Robert E. and Narayan, Darren A.},
TITLE = {Max-optimal and sum-optimal labelings of graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {1-2},
PAGES = {26-31},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, rank number, vertex coloring},
URL = {http://www.sciencedirect.com/science/article/pii/S002001901100247X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Doerr-Winzen/12,
AUTHOR = {Doerr, Benjamin and Winzen, Carola},
TITLE = {Memory-restricted black-box complexity of OneMax},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {1-2},
PAGES = {32-34},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, black-box complexity, query complexity, bounded memory},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011002754},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Akutsu-Melkman-Tamura/12,
AUTHOR = {Akutsu, Tatsuya and Melkman, Avraham A. and Tamura, Takeyuki},
TITLE = {Singleton and 2-periodic attractors of sign-definite Boolean networks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {1-2},
PAGES = {35-38},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, boolean network, singleton attractor, 2-periodic attractor, sign-definite function},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011002675},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Izsak-Nutov/12,
AUTHOR = {Izsak, Rani and Nutov, Zeev},
TITLE = {A note on labeling schemes for graph connectivity},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {1-2},
PAGES = {39-43},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {data structures, graph connectivity, labeling scheme},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011002663},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Barrus/12,
AUTHOR = {Barrus, Michael D.},
TITLE = {Havel-Hakimi residues of unigraphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {1-2},
PAGES = {44-48},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {havel-hakimi algorithm, residue, unigraph, independence number, canonical decomposition, combinatorial problems},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011002821},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Awasthi-Blum-Sheffet/12,
AUTHOR = {Awasthi, Pranjal and Blum, Avrim and Sheffet, Or},
TITLE = {Center-based clustering under perturbation stability},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {1-2},
PAGES = {49-54},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, clustering, k-median, k-means, stability conditions},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011002778},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Yu-Wong/12,
AUTHOR = {Yu, Sheng and Wong, Prudence W.H.},
TITLE = {A note on ``An optimal online algorithm for single machine scheduling to minimize total general completion time''},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {1-2},
PAGES = {55-58},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {online algorithms, scheduling, total general completion time, delayed shortest processing time, competitive analysis},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011002638},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Takehara-Hachimori-Shigeno/12,
AUTHOR = {Takehara, Reiko and Hachimori, Masahiro and Shigeno, Maiko},
TITLE = {A comment on pure-strategy Nash equilibria in competitive diffusion games},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {3},
PAGES = {59-60},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, algorithmic game theory, nash equilibria},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011002869},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chen/12a,
AUTHOR = {Chen, Xie-Bin},
TITLE = {Paired many-to-many disjoint path covers of hypercubes with faulty edges},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {3},
PAGES = {61-66},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {hypercube, hamiltonian path, vertex-disjoint paths, cover, fault tolerance, interconnection networks},
URL = {http://www.sciencedirect.com/science/article/pii/S002001901100281X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Brandstadt-Giakoumakis/12,
AUTHOR = {Brandst{\"a}dt, Andreas and Giakoumakis, Vassilis},
TITLE = {Maximum Weight Independent Sets in hole- and co-chair-free graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {3},
PAGES = {67-71},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, maximum weight independent set problem, graph decomposition, clique separator decomposition, modular decomposition, hole-free graphs, perfect graphs},
URL = {http://www.sciencedirect.com/science/article/pii/S002001901100264X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gafarov-Lazarev-Werner/12,
AUTHOR = {Gafarov, Evgeny R. and Lazarev, Alexander A. and Werner, Frank},
TITLE = {A note on a single machine scheduling problem with generalized total tardiness objective function},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {3},
PAGES = {72-76},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {scheduling, single machine, total tardiness, number of tardy jobs, total late work, pseudo-polynomial algorithm, graphical algorithm},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011002845},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kolaitis-Pema/12,
AUTHOR = {Kolaitis, Phokion G. and Pema, Enela},
TITLE = {A dichotomy in the complexity of consistent query answering for queries with two atoms},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {3},
PAGES = {77-85},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {databases, key constraints, database repairs, consistent query answering},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011002997},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kalinich/12,
AUTHOR = {Kalinich, Adam O.},
TITLE = {Flipping the winner of a poset game},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {3},
PAGES = {86-89},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {poset games, computational complexity, combinatorial game theory},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011002651},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Choi/12,
AUTHOR = {Choi, Jin-Ghoo},
TITLE = {Analysis of total average queue length in multi-hop wireless networks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {3},
PAGES = {90-94},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {performance evaluation, multi-hop wireless network, link scheduling, delay, linear programming},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011002808},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wang-Zhang-Lin/12,
AUTHOR = {Wang, Shiying and Zhang, Lei and Lin, Shangwei},
TITLE = {A neighborhood condition for graphs to be maximally $k$-restricted edge connected},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {3},
PAGES = {95-97},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {interconnection networks, k-restricted edge connectivity, $\lambda$ k -optimality, neighborhood},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011002833},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Mennink/12,
AUTHOR = {Mennink, Bart},
TITLE = {Increasing the flexibility of the herding attack},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {3},
PAGES = {98-105},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, hash functions, chosen-target-forced-prefix, generalized herding attack, hypergraphs},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011002857},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Houston-White-Amos/12,
AUTHOR = {Houston, Robin and White, Joseph and Amos, Martyn},
TITLE = {Zen Puzzle Garden is NP-complete},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {3},
PAGES = {106-108},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, np-completeness, puzzle},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011002870},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ahadi-Dehghan-Kazemi-Mollaahmadi/12,
AUTHOR = {Ahadi, A. and Dehghan, A. and Kazemi, M. and Mollaahmadi, E.},
TITLE = {Computation of lucky number of planar graphs is NP-hard},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {4},
PAGES = {109-112},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {lucky labeling, computational complexity, graph coloring},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011003048},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dybizbanski-Nenca/12,
AUTHOR = {Dybizba{\'n}ski, Janusz and Nenca, Anna},
TITLE = {Oriented chromatic number of grids is greater than 7},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {4},
PAGES = {113-117},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graphs, oriented coloring, grids, combinatorial problem},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011003000},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ehsani-Ghodsi-Khajenezhad-Mahini-Nikzad/12,
AUTHOR = {Ehsani, Shayan and Ghodsi, Mohammad and Khajenezhad, Ahmad and Mahini, Hamid and Nikzad, Afshin},
TITLE = {Optimal online pricing with network externalities},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {4},
PAGES = {118-123},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {social networks, pricing, approximation algorithm, online algorithm, market},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011003061},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wang-Lin/12,
AUTHOR = {Wang, Feng and Lin, Wensong},
TITLE = {Group path covering and $L(j,k)$-labelings of diameter two graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {4},
PAGES = {124-128},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011003073},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Yang-Wang-Yang/12,
AUTHOR = {Yang, Xiaofan and Wang, Lei and Yang, Luxing},
TITLE = {Optimal broadcasting for locally twisted cubes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {4},
PAGES = {129-134},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {interconnection networks, locally twisted cubes, broadcast algorithm, optimal broadcast tree},
URL = {http://www.sciencedirect.com/science/article/pii/S002001901100305X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kotrbcik/12,
AUTHOR = {Kotrb{\v{c}}{\'{i}}k, Michal},
TITLE = {A note on disjoint cycles},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {4},
PAGES = {135-137},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, vertex-disjoint cycles, maximum genus},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011003097},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhang-Liu/12,
AUTHOR = {Zhang, Xin and Liu, Guizhen},
TITLE = {On edge colorings of 1-planar graphs without adjacent triangles},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {4},
PAGES = {138-142},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {1-planar graphs, edge coloring, combinatorial problems},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011003024},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Li/12a,
AUTHOR = {Li, Jiyou},
TITLE = {On the average sensitivity of the weighted sum function},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {4},
PAGES = {143-148},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {boolean function, computational complexity, average sensitivity, subset sum, weight},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011003036},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Csirmaz/12,
AUTHOR = {Csirmaz, Laszlo},
TITLE = {Complexity of universal access structures},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {4},
PAGES = {149-152},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, secret sharing, complexity, entropy method, harmonic series},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011003085},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Guttmann-Beck-Hassin/12,
AUTHOR = {Guttmann-Beck, Nili and Hassin, Refael},
TITLE = {Series-parallel orientations preserving the cycle-radius},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {4},
PAGES = {153-160},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, design of algorithms, graph orientation, series parallel graphs},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011003012},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Abrego-Cetina-Leanos-Salazar/12,
AUTHOR = {{\'A}brego, B.M. and Cetina, M. and Lea{\~n}os, J. and Salazar, G.},
TITLE = {Visibility-preserving convexifications using single-vertex moves},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {5},
PAGES = {161-163},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational geometry, convexification, visibility, visibility-maintaining, visibility-preserving, polygon, single-vertex moves},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011003164},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Matsuki/12,
AUTHOR = {Matsuki, Norichika},
TITLE = {An analytic criterion for CSAT},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {5},
PAGES = {164-165},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {csat, multiple integral, theory of computation},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011003152},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hirsch-Itsykson/12,
AUTHOR = {Hirsch, Edward A. and Itsykson, Dmitry},
TITLE = {On an optimal randomized acceptor for graph nonisomorphism},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {5},
PAGES = {166-171},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, optimal algorithm, graph isomorphism},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011003176},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Rueda-Sendra/12,
AUTHOR = {Rueda, Sonia L. and Sendra, Juana},
TITLE = {On the performance of the approximate parametrization algorithm for curves},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {5},
PAGES = {172-178},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {performance evaluation, rational curves, approximate parametrization, hausdorff distance},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011003127},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gueron/12,
AUTHOR = {Gueron, Shay},
TITLE = {Speeding up CRC32C computations with Intel CRC32 instruction},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {5},
PAGES = {179-185},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, software design and implementation, crc, iscsi},
URL = {http://www.sciencedirect.com/science/article/pii/S002001901100319X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Baumeister-Rothe/12,
AUTHOR = {Baumeister, Dorothea and Rothe, J{\"o}rg},
TITLE = {Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {5},
PAGES = {186-190},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, computational social choice, possible winner problem, np-completeness, dichotomy},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011003218},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Skowronek-Kaziow/12,
AUTHOR = {Skowronek-Kazi{\'o}w, Joanna},
TITLE = {Multiplicative vertex-colouring weightings of graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {5},
PAGES = {191-194},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, edge-weighting, total weighting, vertex-colouring},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011003139},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Tian-Liu/12,
AUTHOR = {Tian, Fang and Liu, Zi-Long},
TITLE = {Probabilistic single obnoxious facility location with fixed budget},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {5},
PAGES = {195-199},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {design of algorithms, obnoxious facility location, expropriation, maximin, quantile location problem},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011002365},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kochol-Skrekovski/12,
AUTHOR = {Kochol, Martin and {\v{S}}krekovski, Riste},
TITLE = {Brooks' Theorem for generalized dart graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {5},
PAGES = {200-204},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {( k , s ) -dart graph, graph algorithms, np-complete problem, ( k , s ) -diamond, brooks' theorem},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011003140},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Guo-Zhu-Jin-Yang-Chen-Yi-Liu/12,
AUTHOR = {Guo, Deke and Zhu, Guiming and Jin, Hai and Yang, Panlong and Chen, Yingwen and Yi, Xianqing and Liu, Junxian},
TITLE = {M{\"o}bius-deBruijn: The product of M{\"o}bius cube and deBruijn digraph},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {5},
PAGES = {205-211},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {interconnection networks, product graph, m{\"o}bius cube, debruijn digraph},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011003103},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Valmari/12,
AUTHOR = {Valmari, Antti},
TITLE = {Fast brief practical DFA minimization},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {6},
PAGES = {213-217},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, formal languages, data structures, deterministic finite automata, partition refinement},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011003267},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Golynski-Lopez-Ortiz/12,
AUTHOR = {Golynski, Alexander and L{\'o}pez-Ortiz, Alejandro},
TITLE = {Optimal strategies for the list update problem under the MRM alternative cost model},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {6},
PAGES = {218-222},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {online algorithms, list update, dynamic programming},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011003231},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Alon-Weinstein/12,
AUTHOR = {Alon, Noga and Weinstein, Amit},
TITLE = {Local correction of juntas},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {6},
PAGES = {223-226},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {randomized algorithms, local correction, locally correctable codes},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011003279},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hwang-Kim-Kim/12,
AUTHOR = {Hwang, Jinsoo and Kim, Jeankyung and Kim, Kichang},
TITLE = {Analysis of the false-positive error rate of tagged fragment marking scheme},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {6},
PAGES = {227-232},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {safety/security in digital systems, denial-of-service, network security, probabilistic packet marking, ip traceback, tagged fragment marking},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011003346},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Du-Klapper-Chen/12,
AUTHOR = {Du, Xiaoni and Klapper, Andrew and Chen, Zhixiong},
TITLE = {Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {6},
PAGES = {233-237},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, fermat quotients, polynomial quotients, finite fields, pseudorandom sequences, linear complexity},
URL = {http://www.sciencedirect.com/science/article/pii/S002001901100322X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Moll-Tazari-Thurley/12,
AUTHOR = {Moll, Lukas and Tazari, Siamak and Thurley, Marc},
TITLE = {Computing hypergraph width measures exactly},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {6},
PAGES = {238-242},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {design of algorithms, graph algorithms, generalized hypertree-width, fractional hypertree-width, exact exponential algorithms},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011003243},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Aman-Ciobanu/12,
AUTHOR = {Aman, Bogdan and Ciobanu, Gabriel},
TITLE = {Properties of enhanced mobile membranes via coloured Petri nets},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {6},
PAGES = {243-248},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {concurrency, enhanced mobile membranes, coloured petri nets, behaviour properties},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011003255},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Crowston-Gutin-Jones-Yeo/12a,
AUTHOR = {Crowston, R. and Gutin, G. and Jones, M. and Yeo, A.},
TITLE = {Parameterized Eulerian strong component arc deletion problem on tournaments},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {6},
PAGES = {249-251},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {design of algorithms, graph algorithms, eulerian digraphs, fixed-parameter tractability, tournaments},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011003188},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Yu-Yang-Yang-Zhang/12,
AUTHOR = {Yu, Cui and Yang, Xiaofan and Yang, LuXing and Zhang, Jing},
TITLE = {Routing and wavelength assignment for 3-ary $n$-cube in array-based optical network},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {6},
PAGES = {252-256},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {wdm optical network, routing and wavelength assignment, linear array, 3-ary n-cube, congestion, algorithms},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011003206},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Meir/12,
AUTHOR = {Meir, Or},
TITLE = {On the rectangle method in proofs of robustness of tensor products},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {6},
PAGES = {257-260},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {theory of computation, locally testable codes, ltc, robustness, robust, tensor product, product code},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011003115},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chakrabarti/12,
AUTHOR = {Chakrabarti, Amit},
TITLE = {A note on randomized streaming space bounds for the longest increasing subsequence problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {7},
PAGES = {261-263},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {communication complexity, data streams, longest increasing subsequence, lower bounds},
URL = {http://www.sciencedirect.com/science/article/pii/S002001901100336X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Deng-Zhang/12,
AUTHOR = {Deng, Yun-Ping and Zhang, Xiao-Dong},
TITLE = {Automorphism groups of the Pancake graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {7},
PAGES = {264-266},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {interconnection networks, pancake graph, efficient dominating sets, automorphism group},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011003383},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Podolskii/12,
AUTHOR = {Podolskii, Vladimir V.},
TITLE = {Exponential lower bound for bounded depth circuits with few threshold gates},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {7},
PAGES = {267-271},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, boolean circuit complexity, threshold circuits, threshold functions, bounded depth circuits, lower bounds},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011003504},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Blin-Bonizzoni-Dondi-Sikora/12,
AUTHOR = {Blin, Guillaume and Bonizzoni, Paola and Dondi, Riccardo and Sikora, Florian},
TITLE = {On the parameterized complexity of the repetition free longest common subsequence problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {7},
PAGES = {272-276},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, combinatorial problems, repetition free longest common subsequence, longest common subsequence, parameterized complexity},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011003371},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Pagh-Tsourakakis/12,
AUTHOR = {Pagh, Rasmus and Tsourakakis, Charalampos E.},
TITLE = {Colorful triangle counting and a {\sc MapReduce} implementation},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {7},
PAGES = {277-281},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, randomized algorithms, concentration of measure, parallel algorithms},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011003358},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhu-Guo-Liang-Yang/12,
AUTHOR = {Zhu, Xiaomin and Guo, Hao and Liang, Shaoshuai and Yang, Xiaoling},
TITLE = {An improved security-aware packet scheduling algorithm in real-time wireless networks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {7},
PAGES = {282-288},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, packet scheduling, real-time, security-aware, wireless networks},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011003498},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ambainis-Yakarylmaz/12,
AUTHOR = {Ambainis, Andris and Yakary{\i}lmaz, Abuzer},
TITLE = {Superiority of exact quantum automata for promise problems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {7},
PAGES = {289-291},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, exact quantum computation, promise problems, succinctness, quantum finite automaton, classical finite automaton},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012000087},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Li-Zhang-Yang/12,
AUTHOR = {Li, Wenhua and Zhang, Zhenkun and Yang, Sufang},
TITLE = {Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {7},
PAGES = {292-297},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {scheduling, online algorithms, parallel batch, lookahead, competitive ratio},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012000191},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hwang-Yevtushenko-Cavalli/12,
AUTHOR = {Hwang, Iksoon and Yevtushenko, Nina and Cavalli, Ana},
TITLE = {Tight bound on the length of distinguishing sequences for non-observable nondeterministic Finite-State Machines with a polynomial number of inputs and outputs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {7},
PAGES = {298-301},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {software engineering, nondeterministic finite-state machine, non-observable machine, distinguishing sequence},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011003516},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhang-Wu-Wang-Liang/12,
AUTHOR = {Zhang, Liting and Wu, Wenling and Wang, Peng and Liang, Bo},
TITLE = {TrCBC: Another look at CBC-MAC},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {7},
PAGES = {302-307},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {mac, block cipher, provable security, safety/security in digital systems, cryptography},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012000221},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Aspnes-Yin/12,
AUTHOR = {Aspnes, James and Yin, Yitong},
TITLE = {Randomized load balancing by joining and splitting bins},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {8-9},
PAGES = {309-313},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {randomized algorithms, load balancing},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012000208},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Botelho-Wormald-Ziviani/12,
AUTHOR = {Botelho, Fabiano C. and Wormald, Nicholas and Ziviani, Nivio},
TITLE = {Cores of random $r$-partite hypergraphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {8-9},
PAGES = {314-319},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, randomized algorithms, minimal perfect hashing, cores of hypergraphs},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019011002985},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dubslaff-Baier-Berg/12,
AUTHOR = {Dubslaff, Clemens and Baier, Christel and Berg, Manuela},
TITLE = {Model checking probabilistic systems against pushdown specifications},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {8-9},
PAGES = {320-328},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal methods, probabilistic model checking, pushdown systems, context-free specifications, markov chains},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012000233},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Couturier-Kratsch/12,
AUTHOR = {Couturier, Jean-Fran{\c{c}}ois and Kratsch, Dieter},
TITLE = {Bicolored independent sets and bicliques},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {8-9},
PAGES = {329-334},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, exact exponential algorithms, independent set, biclique},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012000270},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Clark-Hierons/12,
AUTHOR = {Clark, David and Hierons, Robert M.},
TITLE = {Squeeziness: An information theoretic measure for avoiding fault masking},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {8-9},
PAGES = {335-340},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {software engineering, formal methods, software testing, fault masking},
URL = {http://www.sciencedirect.com/science/article/pii/S002001901200021X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Schmidt-Schauss-Schnitger/12,
AUTHOR = {Schmidt-Schau{\ss}, Manfred and Schnitger, Georg},
TITLE = {Fast equality test for straight-line compressed strings},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {8-9},
PAGES = {341-345},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {randomized algorithms, straight-line programs, grammar-based compression},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012000257},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{van_Garderen-Liotta-Meijer/12,
AUTHOR = {van Garderen, Mereke and Liotta, Giuseppe and Meijer, Henk},
TITLE = {Universal point sets for 2-coloured trees},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {8-9},
PAGES = {346-350},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph drawing, universal point sets, coloured simultaneous embeddability, computational geometry},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012000269},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Goldreich-Meir/12,
AUTHOR = {Goldreich, Oded and Meir, Or},
TITLE = {The tensor product of two good codes is not necessarily robustly testable},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {8-9},
PAGES = {351-355},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {theory of computation, locally testable codes, robust, robustness, tensor product, product code},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012000245},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jordan/12,
AUTHOR = {Jord{\'a}n, Tibor},
TITLE = {Highly connected molecular graphs are rigid in three dimensions},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {8-9},
PAGES = {356-359},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational geometry, vertex connectivity, rigid graphs, molecular graphs, combinatorial rigidity},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012000397},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Li-Xu-Du-Xiu/12,
AUTHOR = {Li, Yu and Xu, Dachuan and Du, Donglei and Xiu, Naihua},
TITLE = {Improved approximation algorithms for the robust fault-tolerant facility location problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {10},
PAGES = {361-364},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {facility location, approximation algorithm, fault tolerance},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012000452},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kumamoto-Miyano/12,
AUTHOR = {Kumamoto, Masao and Miyano, Eiji},
TITLE = {Optimal distortion embedding of complete binary trees into lines},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {10},
PAGES = {365-370},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {line embedding, distortion, complete binary tree, optimal bound, combinatorial problems},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012000440},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Barany-Bojanczyk/12,
AUTHOR = {B{\'a}r{\'a}ny, Vince and Boja{\'n}czyk, Miko{\l}aj},
TITLE = {Finite satisfiability for guarded fixpoint logic},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {10},
PAGES = {371-375},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal methods, guarded fragment, guarded fixpoint logic, finite satisfiability},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012000543},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fung-Poon-Yung/12,
AUTHOR = {Fung, Stanley P.Y. and Poon, Chung Keung and Yung, Duncan K.W.},
TITLE = {On-line scheduling of equal-length intervals on parallel machines},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {10},
PAGES = {376-379},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {interval scheduling, parallel scheduling, on-line algorithm, competitive analysis},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012000415},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Barreto-Veiga-Ferreira/12,
AUTHOR = {Barreto, Jo{\~a}o and Veiga, Lu{\'{i}}s and Ferreira, Paulo},
TITLE = {Hash challenges: Stretching the limits of compare-by-hash in distributed data deduplication},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {10},
PAGES = {380-385},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {distributed systems, data deduplication, compare-by-hash, distributed file systems},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012000385},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Thomas/12,
AUTHOR = {Thomas, Michael},
TITLE = {On the applicability of Post's lattice},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {10},
PAGES = {386-391},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, post's lattice},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012000439},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ma-Wu-Zhang/12,
AUTHOR = {Ma, Beibei and Wu, Baoyindureng and Zhang, Wanping},
TITLE = {Proximity and average eccentricity of a graph},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {10},
PAGES = {392-395},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, proximity, eccentricity, average eccentricity},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012000427},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wang-Wang-Shan/12,
AUTHOR = {Wang, Gaocai and Wang, Guojun and Shan, Zhiguang},
TITLE = {Fault tolerance analysis of mesh networks with uniform versus nonuniform node failure probability},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {10},
PAGES = {396-401},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {fault tolerance, mesh network, k-submesh, node failure probability, connectivity probability},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012000373},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wang-Shan-Wang/12,
AUTHOR = {Wang, Hechao and Shan, Erfang and Wang, Wei},
TITLE = {On the super connectivity of Kronecker products of graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {10},
PAGES = {402-405},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, super connectivity, kronecker product},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012000348},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{He-Liang/12,
AUTHOR = {He, Jing and Liang, Hongyu},
TITLE = {On rainbow-$k$-connectivity of random graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {10},
PAGES = {406-410},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {rainbow connectivity, random graph, graph algorithms, sharp threshold function, probabilistic method},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012000403},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Shrestha-Tayu-Ueno/12,
AUTHOR = {Shrestha, Anish Man Singh and Tayu, Satoshi and Ueno, Shuichi},
TITLE = {Bandwidth of convex bipartite graphs and related graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {11},
PAGES = {411-417},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, bandwidth problem, (bi)convex bipartite graphs, 2-directional orthogonal ray graphs},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012000610},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Binucci-Brandes-Di_Battista-Didimo-Gaertler-Palladino-Patrignani-Symvonis-Zweig/12,
AUTHOR = {Binucci, Carla and Brandes, Ulrik and Di Battista, Giuseppe and Didimo, Walter and Gaertler, Marco and Palladino, Pietro and Patrignani, Maurizio and Symvonis, Antonios and Zweig, Katharina},
TITLE = {Drawing trees in a streaming model},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {11},
PAGES = {418-422},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {design of algorithms, graph algorithms, online algorithms, graph drawing, streaming, large graphs},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012000609},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Deorowicz/12,
AUTHOR = {Deorowicz, Sebastian},
TITLE = {Quadratic-time algorithm for a string constrained LCS problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {11},
PAGES = {423-426},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, sequence similarity, longest common subsequence, constrained longest common subsequence},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012000567},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wang-Bogdanov/12,
AUTHOR = {Wang, Qingju and Bogdanov, Andrey},
TITLE = {The provable constructive effect of diffusion switching mechanism in CLEVIA-type block ciphers},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {11},
PAGES = {427-432},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, block ciphers, generalized feistel networks, clefia, diffusion switching mechanism, substitution diffusion networks, linear cryptanalysis, efficiency},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012000555},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Salmela/12,
AUTHOR = {Salmela, Leena},
TITLE = {Average complexity of backward $q$-gram string matching algorithms},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {11},
PAGES = {433-437},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, string matching, average case complexity},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012000592},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Montanaro/12,
AUTHOR = {Montanaro, Ashley},
TITLE = {The quantum query complexity of learning multilinear polynomials},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {11},
PAGES = {438-442},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, quantum query complexity, reed-muller codes},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012000701},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhang-Cao/12,
AUTHOR = {Zhang, Zongyang and Cao, Zhenfu},
TITLE = {Concurrent non-malleable statistically hiding commitment},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {11},
PAGES = {443-448},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, concurrent non-malleability with respect to opening, statistically hiding commitment, concurrent non-malleable zero-knowledge},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012000713},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cheng-Chen-Xu-Wang/12,
AUTHOR = {Cheng, Qiang and Chen, Feng and Xu, Wenli and Wang, Song},
TITLE = {Recursive sum-product algorithm for generalized outer-planar graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {11},
PAGES = {449-456},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graphical models, inference algorithm, approximation algorithms, generalized outer-planar graph, recursive sum-product algorithm},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012000695},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hrubes/12,
AUTHOR = {Hrube{\v{s}}, Pavel},
TITLE = {On the nonnegative rank of distance matrices},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {11},
PAGES = {457-461},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, nonnegative rank, euclidean distance, boolean formula},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012000580},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lin-Zhang/12,
AUTHOR = {Lin, Qiping and Zhang, Fangguo},
TITLE = {Efficient precomputation schemes of $kP+lQ$},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {11},
PAGES = {462-466},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, elliptic curve, multiple scalar multiplication, co-z addition, conjugate addition},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012000786},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dieudonne-Pelc/12,
AUTHOR = {Dieudonn{\'e}, Yoann and Pelc, Andrzej},
TITLE = {Deterministic network exploration by a single agent with Byzantine tokens},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {12},
PAGES = {467-470},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, deterministic algorithm, exploration, mobile agent, network, graph},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012000853},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Xavier/12,
AUTHOR = {Xavier, Eduardo C.},
TITLE = {A note on a maximum $k$-subset intersection problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {12},
PAGES = {471-472},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, combinatorial problems, subset intersection},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012000750},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wang-Xu-Zhu-Gao-Xu/12,
AUTHOR = {Wang, Jian and Xu, Xirong and Zhu, Dejun and Gao, Liqing and Xu, Jun-Ming},
TITLE = {On the bounds of feedback numbers of $(n,k)$-star graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {12},
PAGES = {473-478},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, graph theory, feedback set, feedback number, ( n , k ) -star graphs, cycles, acyclic subgraph, networks},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012000828},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kuo-Yang/12,
AUTHOR = {Kuo, Wen-Hung and Yang, Dar-Li},
TITLE = {A short note on ``Proportionate flowshops with general position-dependent processing times''},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {12},
PAGES = {479-480},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {scheduling, proportionate flowshop, makespan, position-dependent processing time},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012000622},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Goldberg-Eckstein/12,
AUTHOR = {Goldberg, Noam and Eckstein, Jonathan},
TITLE = {Sparse weighted voting classifier selection and its linear programming relaxations},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {12},
PAGES = {481-486},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {machine learning, computational complexity, weighted voting classification, sparsity, integrality gap, hardness of approximation},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012000725},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Elmasry/12,
AUTHOR = {Elmasry, Amr},
TITLE = {On the size of the subset partial order},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {12},
PAGES = {487-489},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, extremal combinatorics, counting arguments, subset graph, partial order},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012000737},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Krajicek/12,
AUTHOR = {Kraj{\'{i}}{\v{c}}ek, Jan},
TITLE = {A note on SAT algorithms and proof complexity},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {12},
PAGES = {490-493},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012000774},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Yuan-Guo-Kan/12,
AUTHOR = {Yuan, Chen and Guo, Qian and Kan, Haibin},
TITLE = {A novel elementary construction of matching vectors},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {12},
PAGES = {494-496},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {error-correcting codes, locally decodable codes, matching vectors, computational complexity},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012000762},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Su-Fan/12,
AUTHOR = {Su, Chen and Fan, Haining},
TITLE = {Impact of Intel's new instruction sets on software implementation of multiplication $GF(2)[x]$},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {12},
PAGES = {497-502},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, gf ( 2 ) [ x ] multiplication, karatsuba algorithm, sse, avx, pclmulqdq},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012000804},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Li-Zhang-Liu-Yuan/12,
AUTHOR = {Li, Wenjie and Zhang, Zhenkun and Liu, Hailing and Yuan, Jinjiang},
TITLE = {Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {12},
PAGES = {503-508},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {scheduling, preemption with restart, incompatible families, batch machines},
URL = {http://www.sciencedirect.com/science/article/pii/S002001901200083X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Rajasingh-Rajan-Rajan/12,
AUTHOR = {Rajasingh, Indra and Rajan, Bharati and Rajan, R. Sundara},
TITLE = {Embedding of hypercubes into necklace, windmill and snake graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {12},
PAGES = {509-515},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {interconnection networks, embedding, congestion, wirelength, edge isoperimetric problem, hypercubes},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012000749},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chang-Chao/12,
AUTHOR = {Chang, Chia-Jung and Chao, Kun-Mao},
TITLE = {Efficient algorithms for local ranking},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {13},
PAGES = {517-522},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {data structures, ordinal ranking, segment trees, fractional cascading, string matching},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012000798},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Krumke-Thielen/12,
AUTHOR = {Krumke, Sven O. and Thielen, Clemens},
TITLE = {Erratum to ``Minimum cost flows with minimum quantities''},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {13},
PAGES = {523-524},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {minimum cost flow, computational complexity, approximation scheme},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012000841},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
NOTE = {Originally in Inf.~Process.~Lett., Vol. 111, 2011, No. 11, 533-537},
}
@article{Shi/12,
AUTHOR = {Shi, Zhengnan},
TITLE = {A self-stabilizing algorithm to maximal 2-packing with improved complexity},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {13},
PAGES = {525-531},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {self-stabilization, 2-packing, distributed computing, fault tolerance, graph algorithms},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012000968},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bereg/12,
AUTHOR = {Bereg, Sergey},
TITLE = {Computing generalized ham-sandwich cuts},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {13},
PAGES = {532-534},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational geometry, ham-sandwich theorem},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012000816},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kutzkov/12,
AUTHOR = {Kutzkov, Konstantin},
TITLE = {An exact exponential time algorithm for counting bipartite cliques},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {13},
PAGES = {535-539},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, exact exponential time algorithms, counting bipartite cliques},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001032},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dorrigiv-Lopez-Ortiz/12,
AUTHOR = {Dorrigiv, Reza and L{\'o}pez-Ortiz, Alejandro},
TITLE = {List update with probabilistic locality of reference},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {13},
PAGES = {540-543},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {on-line algorithms, analysis of algorithms, data structures, list update, locality of reference},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001044},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Turetsky/12,
AUTHOR = {Turetsky, Daniel},
TITLE = {A $K$-trivial set which is not jump traceable at certain orders},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {13},
PAGES = {544-547},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithmic randomness, k-triviality, jump traceability, theory of computation},
URL = {http://www.sciencedirect.com/science/article/pii/S002001901200107X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Yang-Zhang-Zhang-Xu/12,
AUTHOR = {Yang, Xingyu and Zhang, Weiguo and Zhang, Yong and Xu, Weijun},
TITLE = {Optimal randomized algorithm for a generalized ski-rental with interest rate},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {13},
PAGES = {548-551},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {ski-rental, competitive analysis, on-line algorithms, randomized algorithms, interest rate},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001081},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Panda-Goel/12,
AUTHOR = {Panda, B.S. and Goel, Preeti},
TITLE = {$L(2, 1)$-labeling of dually chordal graphs and strongly orderable graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {13},
PAGES = {552-556},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {l ( 2 , 1 ) -labeling, strongly orderable graphs, dually chordal graphs, chordal bipartite graphs, graph algorithms, approximation algorithms},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001056},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fiedorowicz-Haluszczak/12,
AUTHOR = {Fiedorowicz, Anna and Ha{\l}uszczak, Mariusz},
TITLE = {Acyclic chromatic indices of fully subdivided graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {13},
PAGES = {557-561},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, acyclic edge colouring, graph subdivision, graph algorithms},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001068},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Farhana-Rahman/12,
AUTHOR = {Farhana, Effat and Rahman, M. Sohel},
TITLE = {Doubly-constrained LCS and hybrid-constrained LCS problems revisited},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {13},
PAGES = {562-565},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {finite automata, longest common subsequence, algorithms, combinatorial problems},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001093},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Sparl-Witkowski-Zerovnik/12a,
AUTHOR = {{\v{S}}parl, Petra and Witkowski, Rafa{\l} and {\v{Z}}erovnik, Janez},
TITLE = {A linear time algorithm for 7-[3]coloring triangle-free hexagonal graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {14-15},
PAGES = {567-571},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithm, approximation algorithm, multicoloring, frequency planning, hexagonal graph},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012000579},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Reidenbach-Schmid/12,
AUTHOR = {Reidenbach, Daniel and Schmid, Markus L.},
TITLE = {On multi-head automata with restricted nondeterminism},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {14-15},
PAGES = {572-577},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal languages, multi-head automata, restricted nondeterminism},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001111},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Isaak-Loding/12,
AUTHOR = {Isaak, Dimitri and L{\"o}ding, Christof},
TITLE = {Efficient inclusion testing for simple classes of unambiguous $\omega$-automata},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {14-15},
PAGES = {578-582},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal languages, automata theory, $\omega$-automata, unambiguous automata, inclusion},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001184},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Rajasingh-Arockiaraj-Rajan-Manuel/12,
AUTHOR = {Rajasingh, Indra and Arockiaraj, Micheal and Rajan, Bharati and Manuel, Paul},
TITLE = {Minimum wirelength of hypercubes into $n$-dimensional grid networks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {14-15},
PAGES = {583-586},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {embedding, congestion, wirelength, parallel processing},
URL = {http://www.sciencedirect.com/science/article/pii/S002001901200110X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Xie-Wang/12,
AUTHOR = {Xie, Min and Wang, Libin},
TITLE = {One-round identity-based key exchange with Perfect Forward Security},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {14-15},
PAGES = {587-591},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, identity-based authenticated key exchange, perfect forward security},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001196},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Akshay-Genest-Helouet-Yang/12,
AUTHOR = {Akshay, S. and Genest, Blaise and H{\'e}lou{\"e}t, Lo{\"{i}}c and Yang, Shaofa},
TITLE = {Regular set of representatives for time-constrained MSC graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {14-15},
PAGES = {592-598},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {formal languages, formal methods, specification languages, timed automata, partial order languages, msc graphs, set of representatives},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001202},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dong-Zhou-Fu-Yang/12,
AUTHOR = {Dong, Qiang and Zhou, Junlin and Fu, Yan and Yang, Xiaofan},
TITLE = {Embedding a mesh of trees in the crossed cube},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {14-15},
PAGES = {599-603},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {interconnection networks, graph embedding, crossed cube, mesh of trees, parallel computing},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001251},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Du-Chen-Hu/12,
AUTHOR = {Du, Xiaoni and Chen, Zhixiong and Hu, Lei},
TITLE = {Linear complexity of binary sequences derived from Euler quotients with prime-power modulus},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {14-15},
PAGES = {604-609},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {euler quotients, fermat quotients, pseudorandom binary sequences, linear complexity, cryptography},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001226},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Pudlak/12,
AUTHOR = {Pudl{\'a}k, Pavel},
TITLE = {A lower bound on the size of resolution proofs of the Ramsey theorem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {14-15},
PAGES = {610-611},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, ramsey theorem, resolution proofs},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001275},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Srivathsan-Walukiewicz/12,
AUTHOR = {Srivathsan, B. and Walukiewicz, Igor},
TITLE = {An alternate proof of Statman's finite completeness theorem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {14-15},
PAGES = {612-616},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {simply typed lambda calculus, formal semantics, theory of computation},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001263},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Duris/12,
AUTHOR = {Duris, David},
TITLE = {Some characterizations of $\gamma$ and $\beta$-acyclicity of hypergraphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {16},
PAGES = {617-620},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {hypergraph acyclicity, combinatorial problems, graph algorithms},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001287},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hedetniemi-Hedetniemi-Jiang-Kennedy-McRae/12,
AUTHOR = {Hedetniemi, Sandra M. and Hedetniemi, Stephen T. and Jiang, Hao and Kennedy, K.E. and McRae, Alice A.},
TITLE = {A self-stabilizing algorithm for optimally efficient sets in graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {16},
PAGES = {621-623},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {self-stabilizing algorithms, graph algorithms, optimally efficient set},
URL = {http://www.sciencedirect.com/science/article/pii/S002001901200124X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Minier-Naya-Plasencia/12,
AUTHOR = {Minier, Marine and Naya-Plasencia, Mar{\'{i}}a},
TITLE = {A related key impossible differential attack against 22 rounds of the lightweight block cipher LBLOCK},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {16},
PAGES = {624-629},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, cryptography, attack, block cipher, differential cryptanalysis},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001238},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Didimo-Kaufmann-Liotta-Okamoto-Spillner/12,
AUTHOR = {Didimo, Walter and Kaufmann, Michael and Liotta, Giuseppe and Okamoto, Yoshio and Spillner, Andreas},
TITLE = {Vertex angle and crossing angle resolution of leveled tree drawings},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {16},
PAGES = {630-635},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, graph drawing, angle resolution, leveled tree},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001299},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Yoshinaka-Kawahara-Denzumi-Arimura-Minato/12,
AUTHOR = {Yoshinaka, Ryo and Kawahara, Jun and Denzumi, Shuhei and Arimura, Hiroki and Minato, Shin-ichi},
TITLE = {Counterexamples to the long-standing conjecture on the complexity of BDD binary operations},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {16},
PAGES = {636-640},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, binary decision diagram, data structures},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001305},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wang-Benko-Chen-Dosa-Guo-Han-Lanyi/12,
AUTHOR = {Wang, Yuxin and Benko, Attila and Chen, Xin and D{\'o}sa, Gy{\"o}rgy and Guo, He and Han, Xin and Lanyi, Cecilia Sik},
TITLE = {Online scheduling with one rearrangement at the end: Revisited},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {16},
PAGES = {641-645},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {scheduling problems, competitive ratio, online algorithms},
URL = {http://www.sciencedirect.com/science/article/pii/S002001901200138X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ke-Zhang/12,
AUTHOR = {Ke, Pinhui and Zhang, Shengyuan},
TITLE = {New classes of quaternary cyclotomic sequence of length $2p^m$ with high linear complexity},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {16},
PAGES = {646-650},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, linear complexity, quaternary sequence, generalized cyclotomic sequence},
URL = {http://www.sciencedirect.com/science/article/pii/S002001901200141X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dietrich-McCartin-Semple/12,
AUTHOR = {Dietrich, Max and McCartin, Catherine and Semple, Charles},
TITLE = {Bounding the maximum size of a minimal definitive set of quartets},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {16},
PAGES = {651-655},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, phylogenetic tree, quartets, definitiveness},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001408},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Canete-Valdeon/12,
AUTHOR = {Ca{\~n}ete-Valde{\'o}n, Jos{\'e} M.},
TITLE = {Annotating problem diagrams with architectural tactics for reasoning on quality requirements},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {16},
PAGES = {656-661},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {software engineering, requirements, architectures, architectural tactics, problem frames, problem analysis, argumentation},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001421},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Mathieu-Ohrimenko/12,
AUTHOR = {Mathieu, Claire and Ohrimenko, Olga},
TITLE = {Lower bounds for randomized algorithms for online chain partitioning},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {17-18},
PAGES = {663-666},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {poset, chain partition, online, randomized algorithms},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001391},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Farras-Gracia-Martin-Padro/12,
AUTHOR = {Farr{\`a}s, Oriol and Gracia, Ignacio and Mart{\'{i}}n, Sebasti{\`a} and Padr{\'o}, Carles},
TITLE = {Linear threshold multisecret sharing schemes},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {17-18},
PAGES = {667-673},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, information-theoretic security, multisecret sharing schemes, threshold access structures},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001378},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cheng-Liptak-Qiu-Shen/12,
AUTHOR = {Cheng, E. and Lipt{\'a}k, L. and Qiu, K. and Shen, Z.},
TITLE = {On deriving conditional diagnosability of interconnection networks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {17-18},
PAGES = {674-677},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {fault tolerance, interconnection networks, parallel processing, fault diagnosis, self-diagnosable system, comparison diagnosis model, conditional diagnosability, ( n , k ) -star graph},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001597},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Feng-Lin/12,
AUTHOR = {Feng, Yun and Lin, Wensong},
TITLE = {A proof of a conjecture on multiset coloring the powers of cycles},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {17-18},
PAGES = {678-682},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, multiset coloring, multiset chromatic number, the powers of cycles, neighbor-distinguishing coloring, frobenius number},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001445},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lai-Xiao-Li-Yang/12,
AUTHOR = {Lai, Hong and Xiao, Jinghua and Li, Lixiang and Yang, Yixian},
TITLE = {Recursive hiding of biometrics-based secret sharing scheme using adversary structure},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {17-18},
PAGES = {683-687},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, adversary structure, recursive, biometrics verification, stolen share attack, spoofing attack},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001573},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhang-Yin/12,
AUTHOR = {Zhang, Tongquan and Yin, Ying},
TITLE = {The minimum spanning tree problem with non-terminal set},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {17-18},
PAGES = {688-690},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {minimum spanning tree problem, non-terminal set, np-completeness, approximation algorithms},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001639},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Xu/12a,
AUTHOR = {Xu, Ning},
TITLE = {Complexity of minimum corridor guarding problems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {17-18},
PAGES = {691-696},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, computational geometry, corridor guarding, np-complete},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001433},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Baudon-Przybylo-Wozniak/12,
AUTHOR = {Baudon, Olivier and Przyby{\l}o, Jakub and Wo{\'z}niak, Mariusz},
TITLE = {On minimal arbitrarily partitionable graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {17-18},
PAGES = {697-700},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {minimal arbitrarily partitionable graph, arbitrary vertex decomposable graph, interconnection networks},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001615},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chen-Liu-Meng/12,
AUTHOR = {Chen, Xing and Liu, Juan and Meng, Jixiang},
TITLE = {$\lambda^{\prime}$-optimality of bipartite digraphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {17-18},
PAGES = {701-705},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {fault tolerance, $\lambda$ ' -optimal, restricted arc-connectivity, bipartite digraph},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001214},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Mathew-Sunitha/12,
AUTHOR = {Mathew, Sunil and Sunitha, M.S.},
TITLE = {A characterization of partial blocks in weighted graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {17-18},
PAGES = {706-710},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {interconnection networks, weighted graph, partial cut vertex, partial block, strong cycle, strongest strong cycle},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001664},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bannai-Gagie-Tomohiro-Inenaga-Landau-Lewenstein/12,
AUTHOR = {Bannai, Hideo and Gagie, Travis and Tomohiro I and Inenaga, Shunsuke and Landau, Gad M. and Lewenstein, Moshe},
TITLE = {An efficient algorithm to test square-freeness of strings compressed by straight-line programs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {19},
PAGES = {711-714},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, string processing, repetitions in strings, text compression, straight-line programs},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001688},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{van_Breugel/12,
AUTHOR = {van Breugel, Franck},
TITLE = {On behavioural pseudometrics and closure ordinals},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {19},
PAGES = {715-718},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {concurrency, formal semantics, behavioural pseudometric, least fixed point, closure ordinal},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001706},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Januszewski/12,
AUTHOR = {Januszewski, Janusz},
TITLE = {On-line algorithms for 2-space bounded 2-dimensional bin packing},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {19},
PAGES = {719-722},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {on-line algorithms},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001676},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Shieh-Tsai-Yang/12,
AUTHOR = {Shieh, Min-Zheng and Tsai, Shi-Chun and Yang, Ming-Chuan},
TITLE = {On the inapproximability of maximum intersection problems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {19},
PAGES = {723-727},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithm, theory of computation, inapproximability, maximum intersection, disclosure control},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001652},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhu/12,
AUTHOR = {Zhu, Hongli},
TITLE = {A two stage scheduling with transportation and batching},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {19},
PAGES = {728-731},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {scheduling, transportation, np-hard, fully polynomial time approximation scheme},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001640},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Xie-Tang-Tang-Huang/12,
AUTHOR = {Xie, Y. and Tang, S. and Tang, C. and Huang, X.},
TITLE = {An efficient algorithm for parameterizing HsMM with Gaussian and Gamma distributions},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {19},
PAGES = {732-737},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithm, parametric hsmm, gaussian, gamma},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001561},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Della_Croce-Koulamas/12,
AUTHOR = {Della Croce, F. and Koulamas, C.},
TITLE = {A note on minimizing the sum of quadratic completion times on two identical parallel machines},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {19},
PAGES = {738-742},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {parallel machines, scheduling, quadratic completion times},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001627},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gerstl-Mosheiov/12,
AUTHOR = {Gerstl, Enrique and Mosheiov, Gur},
TITLE = {Scheduling on parallel identical machines with job-rejection and position-dependent processing times},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {19},
PAGES = {743-747},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {scheduling, parallel machines, flow-time, job-rejection, position-dependent processing times},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001603},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Korman/12,
AUTHOR = {Korman, Matias},
TITLE = {Minimizing interference in ad hoc networks with bounded communication radius},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {19},
PAGES = {748-752},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, ad hoc networks, interference, minimum spanning tree, bucketing},
URL = {http://www.sciencedirect.com/science/article/pii/S002001901200172X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Meshram-Meshram-Zhang/12,
AUTHOR = {Meshram, Chandrashekhar and Meshram, Suchitra A. and Zhang, Mingwu},
TITLE = {An ID-based cryptographic mechanisms based on GDLP and IFP},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {19},
PAGES = {753-758},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, public key cryptosystem, identity-based cryptosystem, discrete logarithm problem, generalized discrete logarithm problem, integer factorization problem (ifp)},
URL = {http://www.sciencedirect.com/science/article/pii/S002001901200169X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Guo-Li-Li-Xu/12,
AUTHOR = {Guo, Qiaoping and Li, Shengjia and Li, Ruijuan and Xu, Gaokui},
TITLE = {Pancyclic out-arcs of a vertex in oriented graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {20},
PAGES = {759-761},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, oriented graphs, cycles, out-arcs, pancyclicity},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001810},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Mor-Mosheiov/12,
AUTHOR = {Mor, Baruch and Mosheiov, Gur},
TITLE = {Batch scheduling of identical jobs on parallel identical machines},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {20},
PAGES = {762-766},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {scheduling, batch scheduling, parallel identical machines, flowtime, setup times},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001718},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chen-Qi/12,
AUTHOR = {Chen, Hong-Yu and Qi, Jian-Ming},
TITLE = {The linear arboricity of planar graphs with maximum degree at least 5},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {20},
PAGES = {767-771},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, planar graph, linear arboricity, cycle},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001585},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jukna/12,
AUTHOR = {Jukna, Stasys},
TITLE = {Clique problem, cutting plane proofs and communication complexity},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {20},
PAGES = {772-777},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational complexity, communication complexity, clique problem, cutting plane proof},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001913},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Iwerks-Mitchell/12,
AUTHOR = {Iwerks, Justin and Mitchell, Joseph S.B.},
TITLE = {The art gallery theorem for simple polygons in terms of the number of reflex and convex vertices},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {20},
PAGES = {778-782},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {computational geometry, art gallery theorem, visibility coverage, guard number},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001937},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lee-Kim-Cho-Chung-Park/12,
AUTHOR = {Lee, Jaeheung and Kim, Seokhyun and Cho, Yookun and Chung, Yoojin and Park, Yongsu},
TITLE = {HORSIC: An efficient one-time signature scheme for wireless sensor networks},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {20},
PAGES = {783-787},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, broadcast authentication, one-time signature, wireless sensor network},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001950},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ci-Zhang-Zuo-Wu-Yang/12,
AUTHOR = {Ci, Yi-Wei and Zhang, Zhan and Zuo, De-Cheng and Wu, Zhi-Bo and Yang, Xiao-Zong},
TITLE = {A multi-cycle checkpointing protocol that ensures strict 1-rollback},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {20},
PAGES = {788-793},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {rollback control, fault tolerance, multi-cycle checkpointing},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001962},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Choi-Wee/12,
AUTHOR = {Choi, Seung Geol and Wee, Hoeteck},
TITLE = {Lossy trapdoor functions from homomorphic reproducible encryption},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {20},
PAGES = {794-798},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, public-key encryption, lossy trapdoor functions},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012002001},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Malekesmaeili-Chauve-Stephen/12,
AUTHOR = {Malekesmaeili, Mehrnoush and Chauve, Cedric and Stephen, Tamon},
TITLE = {A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {20},
PAGES = {799-803},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, consecutive ones property, tucker patterns, certifying algorithm, incompatibility graph},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001925},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Mihaljevic-Gangopadhyay-Paul-Imai/12,
AUTHOR = {Mihaljevi{\'c}, Miodrag J. and Gangopadhyay, Sugata and Paul, Goutam and Imai, Hideki},
TITLE = {Internal state recovery of keystream generator LILI-128 based on a novel weakness of the employed Boolean function},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {21},
PAGES = {805-810},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, boolean functions, stream ciphers, internal state recovery, lili-128 keystream generator},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012002013},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Pasalic-Zhang/12,
AUTHOR = {Pasalic, E. and Zhang, W.G.},
TITLE = {On multiple output bent functions},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {21},
PAGES = {811-815},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, boolean functions, bent functions, multiple output, monomial trace functions},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001974},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Pradhan/12,
AUTHOR = {Pradhan, D.},
TITLE = {Algorithmic aspects of $k$-tuple total domination in graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {21},
PAGES = {816-822},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, domination, total domination, k-tuple total domination, np-complete, apx-complete},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001986},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wang-Chen-Zhang-Zhou/12,
AUTHOR = {Wang, GuiPing and Chen, ShuYu and Zhang, XiaoQin and Zhou, Zhen},
TITLE = {Topological ordering algorithm for LDAG},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {21},
PAGES = {823-828},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {dag, topological order, level, ldag, computational complexity},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012002098},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bravo-Klein-Nogueira-Protti-Sampaio/12,
AUTHOR = {Bravo, Raquel S.F. and Klein, Sulamita and Nogueira, Loana T. and Protti, F{\'a}bio and Sampaio, Rudini M.},
TITLE = {Partitioning extended $P_4$-laden graphs into cliques and stable sets},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {21},
PAGES = {829-834},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, graph partition, ( k , $l$ ) -graphs, p 4 -laden graphs, ( k , $l$ ) -cocoloring},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001998},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Liu-Zheng-Chu-Xu/12,
AUTHOR = {Liu, Ming and Zheng, Feifeng and Chu, Chengbin and Xu, Yinfeng},
TITLE = {Single-machine scheduling with past-sequence-dependent delivery times and release times},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {21},
PAGES = {835-838},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {scheduling, past-sequence-dependent delivery time, single-machine, release time},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001901},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Su-Shih-Kao/12,
AUTHOR = {Su, Hsun and Shih, Yuan-Kang and Kao, Shin-Shin},
TITLE = {On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {21},
PAGES = {839-843},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, degree, ore's theorem, hamiltonian, 1-fault hamiltonian},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012002025},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Sliva/12,
AUTHOR = {Sl{\'{i}}va, Radek},
TITLE = {Antimagic labeling graphs with a regular dominating subgraph},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {21},
PAGES = {844-847},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, antimagic labeling, antimagic graphs, dominating subgraph},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012002116},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Picard/12,
AUTHOR = {Picard, Willy},
TITLE = {Membership(s) and compliance(s) with class-based graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {22},
PAGES = {849-855},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {data structures, object-based graph, class-based graph, class membership, compliance},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012002165},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Agrawal/12,
AUTHOR = {Agrawal, Shashank},
TITLE = {Verifiable secret sharing in a total of three rounds},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {22},
PAGES = {856-859},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, unconditional security, secret sharing, byzantine adversary, round optimality},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012002141},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lin/12a,
AUTHOR = {Lin, Jyhjong},
TITLE = {Enhancing customer relationships by semantic consumer support systems},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {22},
PAGES = {860-868},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {specification language, customer relationship management, semantic consumer support system, ontology, dynamic service provision},
URL = {http://www.sciencedirect.com/science/article/pii/S002001901200213X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wang-Tan/12,
AUTHOR = {Wang, Qichun and Tan, Chik How},
TITLE = {A note on the algebraic immunity of the Maiorana-McFarland class of bent functions},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {22},
PAGES = {869-871},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, bent function, algebraic immunity, nonlinearity},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012002153},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zheng-Qi-Tian/12,
AUTHOR = {Zheng, Qunxiong and Qi, Wenfeng and Tian, Tian},
TITLE = {On the distinctness of modular reductions of primitive sequences modulo square-free odd integers},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {22},
PAGES = {872-875},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, integer residue rings, linear recurring sequences, primitive polynomials, primitive sequences, modular reductions},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012001949},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Sun-Huai-Li/12,
AUTHOR = {Sun, Da-Zhi and Huai, Jin-Peng and Li, Jian-Xin},
TITLE = {A note on asynchronous multi-exponentiation algorithm using binary representation},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {22},
PAGES = {876-879},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, multi-exponentiation, algorithm analysis, markov chain},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012002177},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cai-Xie-Yang/12,
AUTHOR = {Cai, Chunli and Xie, Dezheng and Yang, Wenjuan},
TITLE = {A result on linear coloring of planar graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {22},
PAGES = {880-884},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {planar graph, linear coloring, linear chromatic number, combinatorial problems},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012002104},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Das-Adhikari/12,
AUTHOR = {Das, Angsuman and Adhikari, Avishek},
TITLE = {An efficient IND-CCA2 secure Paillier-based cryptosystem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {22},
PAGES = {885-888},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {cryptography, paillier cryptosystem, chosen ciphertext attack, random oracle model},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012002189},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Koutis/12,
AUTHOR = {Koutis, Ioannis},
TITLE = {Constrained multilinear detection for faster functional motif discovery},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {22},
PAGES = {889-892},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, randomized algorithm, parameterized algorithms},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012002190},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Pettie/12,
AUTHOR = {Pettie, S.},
TITLE = {A simple reduction from maximum weight matching to maximum cardinality matching},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {23},
PAGES = {893-898},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, maximum matching},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012002293},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Szymanska/12,
AUTHOR = {Szyma{\'n}ska, Edyta},
TITLE = {$H$-colorings of dense hypergraphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {23},
PAGES = {899-902},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, hypergraph homomorphism (h-coloring), dense hypergraph},
URL = {http://www.sciencedirect.com/science/article/pii/S002001901200230X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Olsen-Bakgaard-Tambo/12,
AUTHOR = {Olsen, Martin and B{\ae}kgaard, Lars and Tambo, Torben},
TITLE = {On non-trivial Nash stable partitions in additive hedonic games with symmetric 0/1-utilities},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {23},
PAGES = {903-907},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {graph algorithms, additive hedonic games, nash stable partitions, computational complexity},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012002438},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bao-Liu/12,
AUTHOR = {Bao, Xiaoguang and Liu, Zhaohui},
TITLE = {An improved approximation algorithm for the clustered Traveling Salesman Problem},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {23},
PAGES = {908-910},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {traveling salesman problem, clustered traveling salesman problem, approximation algorithm},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012002475},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fujiwara-Sekiguchi/12,
AUTHOR = {Fujiwara, Hiroshi and Sekiguchi, Yoshiyuki},
TITLE = {An improved analysis of SRPT scheduling algorithm on the basis of functional optimization},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {23},
PAGES = {911-915},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {analysis of algorithms, on-line algorithms, scheduling, competitive analysis, functional analysis},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012002281},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Yu-Huang-Liu-Chen/12,
AUTHOR = {Yu, Shiwei and Huang, T.-Z. and Liu, Xiaoyun and Chen, Wufan},
TITLE = {Information measures based on fractional calculus},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {23},
PAGES = {916-921},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {randomized algorithms, entropy, mutual information, fractional calculus},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012002463},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Nakade-Biswas/12,
AUTHOR = {Nakade, Apurv and Biswas, Somenath},
TITLE = {Effect of increasing the energy gap between the two lowest energy states on the mixing time of the Metropolis algorithm},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {23},
PAGES = {922-927},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {metropolis algorithm, markov chain mixing time, protein folding, randomized algorithms},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012002311},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Berwanger-Serre/12,
AUTHOR = {Berwanger, Dietmar and Serre, Olivier},
TITLE = {Parity games on undirected graphs},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {23},
PAGES = {928-932},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {algorithms, parity games, graph structure complexity},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012002487},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Diochnos-Sloan-Turan/12,
AUTHOR = {Diochnos, D.I. and Sloan, R.H. and Tur{\'a}n, Gy.},
TITLE = {On multiple-instance learning of halfspaces},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {23},
PAGES = {933-936},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {machine learning, halfspaces, multiple-instance learning, cyclic polytopes, pac learning, vc-dimension, combinatorial problems},
URL = {http://www.sciencedirect.com/science/article/pii/S002001901200244X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chawachat-Fakcharoenphol-Jindaluang/12,
AUTHOR = {Chawachat, Jakarin and Fakcharoenphol, Jittat and Jindaluang, Wattana},
TITLE = {The non-uniform Bounded Degree Minimum Diameter Spanning Tree problem with an application in P2P networking},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {24},
PAGES = {937-941},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {approximation algorithms, graph theory, degree bounds, spanning trees},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012002347},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kochol/12,
AUTHOR = {Kochol, Martin},
TITLE = {Non-extendible Latin parallelepipeds},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {24},
PAGES = {942-943},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {latin square, non-extendible latin parallelepiped, combinatorial problems, codes},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012002335},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dankelmann-Erwin-Goddard-Mukwembi-Swart/12,
AUTHOR = {Dankelmann, Peter and Erwin, David and Goddard, Wayne and Mukwembi, Simon and Swart, Henda C.},
TITLE = {Eccentric counts, connectivity and chordality},
JOURNAL = {Inf.~Process.~Lett.},
VOLUME = {112},
NUMBER = {24},
PAGES = {944-947},
YEAR = {2012},
EDITOR = {Tarlecki, A.},
KEYWORDS = {combinatorial problems, graphs, eccentricity, connectivity, chordal graph},
URL = {http://www.sciencedirect.com/science/article/pii/S0020019012002499},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}