Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDInformation Processing Letters, Volume 109
Volume 109, Number 1, December 2008
- Jong-Won Roh, Byoung-Kee Yi:
Efficient indexing of interval time sequences. 1-12 - Olivier Gauwin, Joachim Niehren, Yves Roos
:
Streaming tree automata. 13-17 - Youngjoong Ko, Hongkuk An, Jungyun Seo:
Pseudo-relevance feedback and statistical query expansion for web snippet generation. 18-22 - Judit Nagy-György, Csanád Imreh:
Online hypergraph coloring. 23-26 - Sumit Ganguly, Anirban Majumder:
Deterministic K-set structure. 27-31 - Leah Epstein, Asaf Levin:
Asymptotic fully polynomial approximation schemes for variants of open-end bin packing. 32-37 - Cor A. J. Hurkens, Rudi Pendavingh, Gerhard J. Woeginger:
The Magnus-Derek game revisited. 38-40 - Beate Bollig:
A note on the size of OBDDs for the graph of integer multiplication. 41-43 - Shakhar Smorodinsky:
A note on the online First-Fit algorithm for coloring k. 44-45 - J. Andrés Montoya:
The parameterized complexity of probability amplification. 46-53 - Martin Held, Joseph S. B. Mitchell:
Triangulating input-constrained planar point sets. 54-56 - Tetsuo Asano:
Online uniformity of integer points on a line. 57-60 - Selim G. Akl, Kamrul Islam, Henk Meijer:
Planar tree transformation: Results and counterexample. 61-67 - Rodney G. Downey, Michael R. Fellows, Catherine McCartin, Frances A. Rosamond:
Parameterized approximation of dominating set problems. 68-70 - Rafael Dueire Lins:
Cyclic reference counting. 71-78 - Mikhail J. Atallah, Greg N. Frederickson, Ashish Kundu:
A tree-covering problem arising in integrity of tree-structured data. 79-82 - Luca Aceto, Anna Ingólfsdóttir:
On the expressibility of priority. 83-85
Volume 109, Number 2, December 2008
- Mark de Berg, Shripad Thite:
Cache-oblivious selection in sorted X. 87-92 - J. Mark Keil, Tzvetalin S. Vassilev:
The relative neighbourhood graph is a part of every 30degree-triangulation. 93-97 - Roberto Baldoni, François Bonnet, Alessia Milani, Michel Raynal:
Anonymous graph exploration without collision by mobile robots. 98-103 - Taolue Chen, Wan J. Fokkink, Rob J. van Glabbeek:
Ready to preorder: The case of weak process semantics. 104-111 - Ruei-Yu Wu, Gen-Huey Chen, Jung-Sheng Fu, Gerard J. Chang:
Finding cycles in hierarchical hypercube networks. 112-115 - Hwei-Jen Lin, Hung-Hsuan Wu:
Efficient geometric measure of music similarity. 116-120 - Palash Sarkar:
A general mixing strategy for the ECB-Mix-ECB mode of operation. 121-123 - Clemens Huemer, Ferran Hurtado, Julian Pfeifle:
The rotation graph of k. 124-129 - Rui Li, Jixiang Meng:
Reversals Cayley graphs of symmetric groups. 130-132 - Aravind Srinivasan:
A note on the distribution of the number of prime factors of the integers. 133-135 - Emanuele G. Fusco, Andrzej Pelc:
Acknowledged broadcasting in ad hoc radio networks. 136-141 - Bahram Sadeghi Bigham, Ali Mohades, Lidia M. Ortega:
Dynamic polar diagram. 142-146 - Chia-Jui Lai, Chang-Hsiung Tsai:
On embedding cycles into faulty dual-cubes. 147-150 - Vicent Cholvi:
Stability bounds in networks with dynamic link capacities. 151-154 - Johann L. Hurink, Tim Nieberg:
Approximating minimum independent dominating sets in wireless networks. 155-160 - Hsin-Hao Su, Chin Lung Lu, Chuan Yi Tang:
An improved algorithm for finding a length-constrained maximum-density subtree in a tree. 161-164 - Tatsuya Akutsu, Daiji Fukagawa, Atsuhiro Takasu:
Improved approximation of the largest common subtree of two unordered trees of bounded height. 165-170
Volume 109, Number 3, January 2009
- Chih-Huai Cheng, Hsiao-Fei Liu, Kun-Mao Chao:
Optimal algorithms for the average-constrained maximum-sum segment problem. 171-174 - Valentin Ziegler:
Approximating optimum branchings in linear time. 175-178 - Edo Liberty, Steven W. Zucker:
The Mailman algorithm: A note on matrix-vector multiplication. 179-182 - Mira Gonen, Yuval Shavitt:
A Theta(logn. 183-186 - Markus Bläser, Moritz Hardt, Richard J. Lipton, Nisheeth K. Vishnoi:
Deterministically testing sparse polynomial identities of unbounded degree. 187-192 - Sarah Novotny, Juan Ortiz, Darren A. Narayan:
Minimal k. 193-198 - Jing Huang, Haina Sun, Weifan Wang, Dong Chen:
(2, 1)-Total labelling of trees with sparse vertices of maximum degree. 199-203 - Xin Han, He Guo, Dawei Yin, Yong Zhang:
A note on on-line broadcast scheduling with deadlines. 204-207 - Sanjay Jain:
On some open problems in reflective inductive inference. 208-211
Volume 109, Number 4, January 2009
- Víctor Dalmau:
There are no pure relational width 2 constraint satisfaction problems. 213-218 - Esther M. Arkin, Sang Won Bae, Alon Efrat, Kazuya Okamoto, Joseph S. B. Mitchell, Valentin Polishchuk:
Geometric stable roommates. 219-224 - Holger Petersen, Szymon Grabowski:
Range mode and range median queries in constant time and sub-quadratic space. 225-228 - Pascal Schweitzer:
Using the incompressibility method to obtain local lemma results for Ramsey-type problems. 229-232 - Krzysztof Majewski, Nicholas Pippenger:
Attribute estimation and testing quasi-symmetry. 233-237 - Mukul S. Bansal, David Fernández-Baca:
Computing distances between partial rankings. 238-241 - Leszek Gasieniec, Miroslaw Kowaluk, Andrzej Lingas:
Faster multi-witnesses for Boolean matrix multiplication. 242-247 - Hongbo Hua, Yaoping Hou:
On graphs with the third largest number of maximal independent sets. 248-253 - Virginia Vassilevska:
Efficient algorithms for clique problems. 254-257
Volume 109, Number 5, February 2009
- Noam Livne:
A note on I-completeness of NP-witnessing relations. 259-261 - Adam Kasperski, Pawel Zielinski:
On the approximability of minmax (regret) network optimization problems. 262-266 - Tomás Feder, Carlos S. Subi:
Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations. 267-272 - Chaim Linhart, Ron Shamir:
Matching with don't-cares and a small number of mismatches. 273-277 - Jiuchuan Jiang, Xiaojun Xia:
Prominence convergence in the collective synchronization of situated multi-agents. 278-285 - Stasys Jukna:
A nondeterministic space-time tradeoff for linear codes. 286-289 - Ananya Das, Charles U. Martel:
Stochastic shortest path with unlimited hops. 290-295 - Yue Li, Joe Sawada:
Gray codes for reflectable languages. 296-300
Volume 109, Number 6, February 2009
- Fabrizio Frati, Markus Geyer, Michael Kaufmann:
Planar packing of trees and spider trees. 301-307 - Dariusz R. Kowalski, Michal Strojnowski:
Gossiping by processors prone to omission failures. 308-314 - Ryan Williams:
Finding paths of length k in O*(2k) time. 315-318 - Vadim V. Lozin, Raffaele Mosca:
Maximum independent sets in subclasses of P5-free graphs. 319-324 - Sebastian Dörn, Thomas Thierauf:
The quantum query complexity of the determinant. 325-328 - A. Karim Abu-Affash, Matthew J. Katz:
Improved bounds on the average distance to the Fermat-Weber center of a convex object. 329-333 - Abraham P. Punnen, Ruonan Zhang:
Bottleneck flows in unit capacity networks. 334-338
Volume 109, Number 7, March 2009
- Wenceslas Fernandez de la Vega, Zsolt Tuza:
Groupies in random graphs. 339-340 - Gerhard J. Woeginger:
A comment on parallel-machine scheduling under a grade of service provision to minimize makespan. 341-342 - Jiansheng Cai, Jianfeng Hou, Xia Zhang, Guizhen Liu:
Edge-choosability of planar graphs without non-induced 5-cycles. 343-346 - Daegun Ma, Jin Hong:
Success probability of the Hellman trade-off. 347-351 - Zvi Gotthilf, Moshe Lewenstein:
Improved algorithms for the k simple shortest paths and the replacement paths problems. 352-355 - Antti Ukkonen, Kai Puolamäki, Aristides Gionis, Heikki Mannila:
A randomized approximation algorithm for computing bucket orders. 356-359 - Christian Cachin, Idit Keidar, Alexander Shraer:
Fork sequential consistency is blocking. 360-364 - Venkatesan T. Chakaravarthy, Sambuddha Roy:
Approximating maximum weight K-colorable subgraphs in chordal graphs. 365-368 - Manzhan Gu, Xiwen Lu:
Preemptive stochastic online scheduling on two uniform machines. 369-375 - Uwe Bubeck, Hans Kleine Büning:
A new 3-CNF transformation by parallel-serial graphs. 376-379
Volume 109, Number 8, March 2009
- Panagiotis Antonellis, Christos Makris, Nikos Tsirakis:
Algorithms for clustering clickstream data. 381-385 - Shimon Abravaya, Daniel Berend:
Multi-dimensional dynamic facility location and fast computation at query points. 386-390 - Joachim Spoerhase, Hans-Christoph Wirth:
An O(n(logn)2/loglogn) algorithm for the single maximum coverage location or the (1, Xp)-medianoid problem on trees. 391-394 - Xie-Bin Chen:
Some results on topological properties of folded hypercubes. 395-399 - Zhengbing Bian, Qian-Ping Gu:
1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings. 400-404 - Takayuki Nagoya:
New differential approximation algorithm for k-customer vehicle routing problem. 405-408 - Jou-Ming Chang, Ro-Yu Wu:
On the diameter of geometric path graphs of points in convex position. 409-413 - Chuan-Min Lee, Maw-Shang Chang:
Signed and minus clique-transversal functions on graphs. 414-417
Volume 109, Number 9, April 2009
- Sanjeev Saxena:
Dominance made simple. 419-421 - Dariusz Dereniowski:
Maximum vertex occupation time and inert fugitive: Recontamination does help. 422-426 - Yufeng Wu:
An analytical upper bound on the minimum number of recombinations in the history of SNP sequences in populations. 427-431 - L. Sunil Chandran, Anita Das, Naveen Sivadasan:
On the cubicity of bipartite graphs. 432-435 - Etienne Birmelé, François Delbot, Christian Laforest:
Mean analysis of an online algorithm for the vertex cover problem. 436-439 - Sergio Cabello, Marta Fort, Joan Antoni Sellarès:
Higher-order Voronoi diagrams on triangulated surfaces. 440-445 - Yilun Shang:
Connectivity in a random interval graph with access points. 446-449 - Chi-Jung Kuo, Chiun-Chieh Hsu, Hon-Ren Lin, Kung-Kuei Lin:
An efficient algorithm for minimum feedback vertex sets in rotator graphs. 450-453 - Eunsang Kim, Kunsoo Park:
Improving multikey Quicksort for sorting strings with many equal elements. 454-459
Volume 109, Number 10, April 2009
- Peter Brass:
Universal hash functions for an infinite universe and hash trees. 461-462 - Serge Gaspers, Margaret-Ellen Messinger, Richard J. Nowakowski, Pawel Pralat:
Clean the graph before you draw it! 463-467 - Mark A. Iwen, Craig V. Spencer:
A note on compressed sensing and the complexity of matrix multiplication. 468-471 - Wei Chen, Wenhui Zhang:
A direct construction of polynomial-size OBDD proof of pigeon hole problem. 472-477 - Sasanka Roy, Subhasis Bhattacharjee, Sandip Das, Subhas C. Nandy:
A new fast heuristic for labeling points. 478-484 - Ippei Koura, Takao Ono, Tomio Hirata:
A note on the Greedy algorithm for finding independent sets of Ck-free graphs. 485-489 - Ryo Yoshinaka:
An elementary proof of a generalization of double Greibach normal form. 490-492 - Andrzej Lingas, Eva-Marta Lundell:
Efficient approximation algorithms for shortest cycles in undirected graphs. 493-498 - Beate Bollig:
On the size of (generalized) OBDDs for threshold functions. 499-503 - Joong Chae Na, Namhee Kim, Jeong Seop Sim, Dong Kyue Kim:
Improving on-line construction of two-dimensional suffix trees for square matrices. 504-508 - Balder ten Cate:
A note on the expressibility problem for modal logics and star-free regular expressions. 509-513 - Jean Marcel Pallo:
Weak associativity and restricted rotation. 514-517 - Chi-Hung Tzeng, Jehn-Ruey Jiang, Shing-Tsaan Huang:
A self-stabilizing algorithm for the maximum planarization problem in complete bipartite networks. 518-522
Volume 109, Number 11, May 2009
- Vanesa Daza, Javier Herranz, Germán Sáez:
Flaws in some self-healing key distribution schemes with revocation. 523-526 - Yanli Ren, Dawu Gu:
Fully CCA2 secure identity based broadcast encryption without random oracles. 527-533 - Bruno Zanuttini, Stanislav Zivný:
A note on some collapse results of valued constraints. 534-538 - Erik Saule, Denis Trystram:
Analyzing scheduling with transient failures. 539-542 - Artur Jez, Jakub Lopuszanski:
On the two-dimensional cow search problem. 543-547 - Milan R. Rapaic, Zeljko Kanovic:
Time-varying PSO - convergence analysis, convergence-related parameterization and new parameter adjustment schemes. 548-552 - Liuling Dai:
An aggressive algorithm for multiple string matching. 553-559 - K. Viswanathan Iyer, S. Prasanna:
A linear time algorithm for finding an optimal degree-bounded subtree of an edge-weighted tree. 560-562 - Irene Fink, Sven Oliver Krumke, Stephan Westphal:
New lower bounds for online k-server routing problems. 563-567 - Fabrizio Luccio, Linda Pagli:
The Fermat star of binary trees. 568-571 - Manuel Bodirsky, Gustav Nordh, Timo von Oertzen:
Integer programming with 2-variable equations and 1-variable inequalities. 572-575 - Christos Nomikos, Panos Rondogiannis, William W. Wadge:
Strong equivalence of logic programs under the infinite-valued semantics. 576-581 - Paolo Detti:
A polynomial algorithm for the multiple knapsack problem with divisible item sizes. 582-584
Volume 109, Number 12, May 2009
- Tung-Yang Ho, Yuan-Kang Shih, Jimmy J. M. Tan, Lih-Hsing Hsu:
Conditional fault hamiltonian connectivity of the complete graph. 585-588 - Damien Imbs, Michel Raynal:
A note on atomicity: Boosting Test&Set to solve consensus. 589-591 - Meijie Ma, Xuegong Tan, Jun-Ming Xu, Guizhen Liu:
A note on "The super connectivity of augmented cubes". 592-593 - Xie-Bin Chen:
On path bipancyclicity of hypercubes. 594-598 - Meirun Chen, Xiaofeng Guo:
Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes. 599-602 - Cheng He, Yixun Lin, Jinjiang Yuan:
A DP algorithm for minimizing makespan and total completion time on a series-batching machine. 603-607 - Kangbok Lee, Joseph Y.-T. Leung, Michael L. Pinedo:
A note on "An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs". 608-610 - Thomas Studer:
Common knowledge does not have the Beth property. 611-614 - Joanna Bauer, Dag Haugland, Di Yuan:
New results on the time complexity and approximation ratio of the Broadcast Incremental Power algorithm. 615-619 - Henk Meijer, Yurai Núñez Rodríguez, David Rappaport:
An algorithm for computing simple k-factors. 620-625 - Rebecca Smith, Vincent Vatter:
The enumeration of permutations sortable by pop stacks in parallel. 626-629 - Sebastian Deorowicz:
An algorithm for solving the longest increasing circular subsequence problem. 630-634 - Gerold Jäger, Marcin Peczarski:
The number of pessimistic guesses in Generalized Mastermind. 635-641 - Valentin Polishchuk, Jukka Suomela:
A simple local 3-approximation algorithm for vertex cover. 642-645
Volume 109, Number 13, June 2009
- Hadas Shachnai, Lisa Zhang, Tomomi Matsui:
A note on generalized rank aggregation. 647-651 - Alina Carmen Cojocaru, Igor E. Shparlinski:
On the embedding degree of reductions of an elliptic curve. 652-654 - Juan Liu, Xing Chen, Jixiang Meng:
Super restricted edge connected Cartesian product graphs. 655-659