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 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 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
Volume 109,
Number 6,
February 2009
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
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 Zivny:
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 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 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
- George I. Davida, Bruce E. Litow, Guangwu Xu:
Fast arithmetics using Chinese remaindering.
660-662
- Cong Tian, Zhenhua Duan:
A note on stutter-invariant PLTL.
663-667
- Tommaso Bolognesi:
A pseudo-random network mobile automaton with linear growth.
668-674
- Michael T. Goodrich:
On the algorithmic complexity of the Mastermind game with black-peg results.
675-678
- Arturo Carpi, Valerio D'Alonzo:
On a word avoiding near repeats.
679-682
- Yingzhi Tian, Jixiang Meng:
lambdac-Optimally half vertex transitive graphs with regularity k.
683-686
- Mohamed Abdo:
Efficient generation of the ideals of a poset in Gray code order.
687-689
- Elad Horev, Matthew J. Katz, Roi Krakovski, Maarten Löffler:
Polychromatic 4-coloring of guillotine subdivisions.
690-694
- Qi-yan Zhou, San-Yang Liu, Qiang Zhu:
Local diagnosability of generic star-pyramid graph.
695-699
- Gilles Bertrand, Michel Couprie, Nicolas Passat:
A note on 3-D simple points and simple-equivalence.
700-704
- Brian Alspach, Matthew Dean:
Honeycomb toroidal graphs are Cayley graphs.
705-708
- Mohammadreza Jooyandeh, Ali Mohades, Maryam Mirzakhah:
Uncertain Voronoi diagram.
709-712
- Hue-Ling Chen, Ye-In Chang:
Spatial joins based on NA-trees.
713-718
- Manuel Abellanas, Santiago Canales, Gregorio Hernández-Peñalver:
An "Art Gallery Theorem" for pyramids.
719-721
- Michael Orlov:
Optimized random number generation in an interval.
722-725
- Wolfgang Mulzer:
A note on predecessor searching in the pointer machine model.
726-729
- Xuan Cai:
Linear kernelizations for restricted 3-Hitting Set problems.
730-738
- Gösta Grahne, Alex Thomo:
Bounded regular path queries in view-based data integration.
739-744
- Sang-il Oum:
Computing rank-width exactly.
745-748
- Mustapha Arfi, Bedine Ould M. Lemine, Carla Selmi:
Strategical languages of infinite words.
749-753
- Alin Bostan, Éric Schost:
A simple and fast algorithm for computing exponentials of power series.
754-756
- James K. Lan, Victor W. Liu, Chiuyuan Chen:
Improved upper and lower bounds on the optimization of mixed chordal ring networks.
757-762
Volume 109,
Number 14,
June 2009
- Volker Turau, Bernd Hauck:
A self-stabilizing algorithm for constructing weakly connected minimal dominating sets.
763-767
- Manuel Abellanas, António Leslie Bajuelos, Inês Matos:
2-Covered paths by a set of antennas with minimum power transmission range.
768-773
- Tomás Feder, Rajeev Motwani:
On the graph turnpike problem.
774-776
- Kohji Tomita, Haruhisa Kurokawa:
On the reachability of a version of graph-rewriting system.
777-782
- Wenguang Chen, Wenfei Fan, Shuai Ma:
Incorporating cardinality constraints and synonym rules into conditional functional dependencies.
783-789
- Satyajit Banerjee, Atish Datta Chowdhury, Subhas Kumar Ghosh:
Distributed approximation for maximum weight matching on bounded degree bounded integer weight graphs.
790-794
- Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff:
Sort and Search: Exact algorithms for generalized domination.
795-798
- Jean-Luc Baril:
More restrictive Gray codes for some classes of pattern avoiding permutations.
799-804
- Weifan Wang, Dong Chen:
(2, 1)-Total number of trees with maximum degree three.
805-810
- Sizhong Zhou, Qiqing Shen:
On fractional (f, n)-critical graphs.
811-815
- Dieter Rautenbach, Friedrich Regen:
On packing shortest cycles in graphs.
816-821
- J. Wu, R. Wei:
Comments on "Distributed symmetric key management for mobile ad hoc networks".
822-824
Volume 109,
Number 15,
July 2009
- Garth Isaak, Robert E. Jamison, Darren A. Narayan:
Greedy rankings and arank numbers.
825-827
- Meirun Chen, Jianguo Qian:
On f-fault tolerant arc-forwarding and optical indices of all-optical folded hypercubes.
828-831
- Byungchun Chung, Junbeom Hur, Heeyoul Kim, Seong-Min Hong, Hyunsoo Yoon:
Improved batch exponentiation.
832-837
- Jovan Dj. Golic, Guglielmo Morgari:
Optimal correlation attack on the multiplexer generator.
838-841
- Takaaki Mizuki, Takuya Sato, Hideaki Sone:
A one-round secure message broadcasting protocol through a key sharing tree.
842-845
- Fangguo Zhang, Xiaofeng Chen:
Cryptanalysis and improvement of an ID-based ad-hoc anonymous identification scheme at CT-RSA 05.
846-849
- Slawomir Lasota:
EXPSPACE lower bounds for the simulation preorder between a communication-free Petri net and a finite-state system.
850-855
- Erfang Shan, Yanxia Dong, Yukun Cheng:
The twin domination number in generalized de Bruijn digraphs.
856-860
- Markus Grassl, Rainer Steinwandt:
Cryptanalysis of an authentication scheme using truncated polynomials.
861-863
- Amihood Amir, Gonzalo Navarro:
Parameterized matching on non-linear structures.
864-867
- Okan Yilmaz, Ing-Ray Chen:
Elastic threshold-based admission control for QoS satisfaction with reward optimization for servicing multiple priority classes in wireless networks.
868-875
- Jian Li:
An O(log(n)/log(log(n))) upper bound on the price of stability for undirected Shapley network design games.
876-878
- Elvira Albert, John P. Gallagher, Miguel Gómez-Zamalloa, Germán Puebla:
Type-based homeomorphic embedding for online termination.
879-886
Volume 109,
Number 16,
July 2009
- José García-Nieto, Enrique Alba, Laetitia Jourdan, El-Ghazali Talbi:
Sensitivity and specificity based multiobjective approach for feature selection: Application to cancer diagnosis.
887-896
- Seung Geol Choi, Javier Herranz, Dennis Hofheinz, Jung Yeon Hwang, Eike Kiltz, Dong Hoon Lee, Moti Yung:
The Kurosawa-Desmedt key encapsulation is not chosen-ciphertext secure.
897-901
- Andreu Moreno, Eduardo César, Joan Sorribes, Tomàs Margalef, Emilio Luque:
Task distribution using factoring load balancing in Master-Worker applications.
902-906
- Chandan Saha, Sandip Das:
Covering a set of points in a plane using two parallel rectangles.
907-912
- Kangbok Lee, Byung-Cheon Choi, Joseph Y.-T. Leung, Michael L. Pinedo:
Approximation algorithms for multi-agent scheduling to minimize total weighted completion time.
913-917
- Sean Cleary, Katherine St. John:
Rotation distance is fixed-parameter tractable.
918-922
- Sanjay Jain:
On some open problems in monotonic and conservative learning.
923-926
- Miklós Bóna, Ryan Flynn:
The average number of block interchanges needed to sort a permutation and a recent result of Stanley.
927-931
- Sylwia Cichacz, Dalibor Froncek:
Factorization of Kn, n into (0, j)-prisms.
932-934
- Dror Aiger, Klara Kedem:
Geometric pattern matching for point sets in the plane under similarity transformations.
935-940
- Wanwei Liu, Ji Wang:
A tighter analysis of Piterman's Büchi determinization.
941-945
- Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski:
Frequency of correctness versus average polynomial time.
946-949
- Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos:
Approximation of min coloring by moderately exponential algorithms.
950-954
- Marc Mörig, Dieter Rautenbach, Michiel H. M. Smid, Jan Tusch:
An Omega(nlogn) lower bound for computing the sum of even-ranked elements.
955-956
- Marek Cygan, Lukasz Kowalik, Mateusz Wykurz:
Exponential-time approximation of weighted set cover.
957-961
- Jussi Kujala:
Assembling approximately optimal binary search trees efficiently using arithmetics.
962-966
- GuanJun Liu, Changjun Jiang:
On conditions for the liveness of weakly persistent nets.
967-970
- Peter Dankelmann, Lutz Volkmann:
Minimum size of a graph or digraph of given radius.
971-973
Volume 109,
Number 17,
August 2009
- Bang Ye Wu:
An optimal algorithm for the maximum-density path in a tree.
975-979
- Tomás Feder, Heikki Mannila, Evimaria Terzi:
Approximating the Minimum Chain Completion problem.
980-985
- Zsolt Gazdag, Szabolcs Iván, Judit Nagy-György:
Improved upper bounds on synchronizing nondeterministic automata.
986-990
- Kewen Zhao, Yue Lin, Ping Zhang:
A sufficient condition for pancyclic graphs.
991-996
- Xindong Zhang, Juan Liu, Jixiang Meng:
The bondage number in complete t-partite digraphs.
997-1000
- Ian Wehrman, C. A. R. Hoare, Peter W. O'Hearn:
Graphical models of separation logic.
1001-1004
- Jialin Zhang, Wei Chen:
Bounded cost algorithms for multivalued consensus using binary consensus instances.
1005-1009
- Anthony Widjaja To:
Unary finite automata vs. arithmetic progressions.
1010-1014
- Simona E. Rombo:
Optimal extraction of motif patterns in 2D.
1015-1020
Volume 109,
Number 18,
August 2009
- Woo Hyun Ahn, Kyungjae Lee, Jaewon Oh, Kyungsub Min, Joon Sung Hong:
A multiple-file write scheme for improving write performance of small files in Fast File System.
1021-1026
- M. T. Juan, J. J. Liu, Y. L. Wang:
Errata for "Faster index for property matching".
1027-1029
- Jakob Nordström:
A simplified way of proving trade-off results for resolution.
1030-1035
- Koki Hamada, Kazuo Iwama, Shuichi Miyazaki:
An improved approximation lower bound for finding almost stable maximum matchings.
1036-1040
- B. S. Panda, Sajal K. Das:
A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs.
1041-1046
- Mohammed Haddad, Hamamache Kheddouci:
A strict strong coloring of trees.
1047-1054
- Edgar G. Daylight, Wouter M. Koolen, Paul M. B. Vitányi:
Time-bounded incompressibility of compressible strings and sequences.
1055-1059
- Gautam K. Das, Debapriyay Mukhopadhyay, Subhas C. Nandy:
Improved algorithm for the widest empty 1-corner corridor.
1060-1065
- Joong Chae Na, Dong Kyue Kim, Jeong Seop Sim:
Finding the longest common nonsuperstring in linear time.
1066-1070
- Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer:
The complexity of propositional implication.
1071-1077
- Sebastian Czerwinski, Jaroslaw Grytczuk, Wiktor Zelazny:
Lucky labelings of graphs.
1078-1081
- Amr Elmasry:
Computing the subset partial order for dense families of sets.
1082-1086
- Jens Maßberg, Dieter Rautenbach:
Binary trees with choosable edge lengths.
1087-1092
- Xianhui Lu, Xuejia Lai, Dake He:
Improved efficiency of Kiltz07-KEM.
1093-1096
- Hai Liu, Lizhuang Ma, Xuan Cai, Zhihua Chen, Yang Shen:
A closed-form solution to video matting of natural snow.
1097-1104
- Louis Ibarra:
A simple algorithm to find Hamiltonian cycles in proper interval graphs.
1105-1108
Volume 109,
Number 19,
September 2009
Volume 109,
Number 20,
September 2009
Volume 109,
Numbers 21-22,
October 2009
- André Raspaud, Jiaojiao Wu:
Game chromatic number of toroidal grids.
1183-1186
- Min-Sheng Lin, Yung-Jui Chen:
Counting the number of vertex covers in a trapezoid graph.
1187-1192
- Hervé Hocquard, Mickaël Montassier:
Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable.
1193-1196
- Zhan-jun Xue, San-yang Liu:
An optimal result on fault-tolerant cycle-embedding in alternating group graphs.
1197-1201
- Xing Chen, Juan Liu, Jixiang Meng:
The restricted arc connectivity of Cartesian product digraphs.
1202-1205
- Ming-Chien Yang:
Edge-fault-tolerant node-pancyclicity of twisted cubes.
1206-1210
- Ji Tian, T. C. Edwin Cheng, C. T. Ng, Jinjiang Yuan:
Online scheduling on unbounded parallel-batch machines to minimize the makespan.
1211-1215
- Celina M. Herrera de Figueiredo, Guilherme Dias da Fonseca:
Enclosing weighted points with an almost-unit ball.
1216-1221
Volume 109,
Numbers 23-24,
November 2009
- Olivier Finkel, Dominique Lecomte:
Decision problems for Turing machines.
1223-1226
- Kristóf Bérczi, Satoru Fujishige, Naoyuki Kamiyama:
A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph.
1227-1231
- David Eisenstat:
k-Fold unions of low-dimensional concept classes.
1232-1234
- Frédéric Maffray:
Stable sets in k-colorable P5-free graphs.
1235-1237
- Zexuan Ji, Qiang Chen, Quan-Sen Sun, De-Shen Xia:
A moment-based nonlocal-means algorithm for image denoising.
1238-1244
- Razvan Diaconescu:
An encoding of partial algebras as total algebras.
1245-1251
- Guofeng Yan, Jianxin Wang, Weiping Wang:
An analytical model for end-to-end communication channel over PLCN based on QBDs.
1252-1259
- Woo Kwon Koo, Jung Yeon Hwang, Dong Hoon Lee:
Security vulnerability in a non-interactive ID-based proxy re-encryption scheme.
1260-1262
Last update Wed Feb 15 05:35:49 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
