default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 103
Volume 103, Number 1, June 2007
- Robert W. Irving:
The cycle roommates problem: a hard case of kidney exchange. 1-4 - Marc Aiguier, Razvan Diaconescu:
Stratified institutions and elementary homomorphisms. 5-13 - Hai-Lung Cheng, Biing-Feng Wang:
On Chen and Chen's new tree inclusion algorithm. 14-18 - Seok Woo Kim, Seong-Hun Paeng, Hee Je Cho:
Approximately n-secting an angle. 19-23 - Hasan Akin
, Irfan Siap:
On cellular automata over Galois rings. 24-27 - Jukka Suomela:
Approximability of identifying codes and locating-dominating codes. 28-33 - Nikolai K. Vereshchagin:
Kolmogorov complexity of enumerating finite sets. 34-39 - Min Chih Lin, Jayme Luiz Szwarcfiter:
Faster recognition of clique-Helly and hereditary clique-Helly graphs. 40-43 - Justin Colannino, Godfried T. Toussaint:
Corrigendum to "An algorithm for computing the restriction Scaffold assignment problem in computational biology" [Inform Process Lett 95 (4) (2005) 466-471]. 44
Volume 103, Number 2, July 2007
- Weiwei Wang, Meijie Ma, Jun-Ming Xu:
Fault-tolerant pancyclicity of augmented cubes. 52-56 - Kofi A. Laing:
Name-independent compact routing in trees. 57-60 - Nina Amenta, Matthew Godwin, Nicolay Postarnakevich, Katherine St. John:
Approximating geodesic tree distance. 61-65 - Mikhail Ju. Moshkov:
On algorithms for construction of all irreducible partial covers. 66-70 - Ryuhei Uehara, Gabriel Valiente:
Linear structure of bipartite permutation graphs and the longest path problem. 71-77 - Wen An Liu, Kun Meng, Shu Min Xing:
Q-ary search with one lie and bi-interval queries. 78-81 - Brendan Lucier, Tao Jiang, Ming Li:
Average-case analysis of QuickSort and Binary Insertion Tree height using incompressibility. 45-51
Volume 103, Number 3, July 2007
- Igor E. Shparlinski:
Bounds on the Fourier coefficients of the weighted sum function. 83-87 - Volker Turau:
Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler. 88-93 - Anuj Dawar, David Janin:
The monadic theory of finite representations of infinite words. 94-101 - Aduri Pavan, Fengming Wang:
Robustness of PSPACE-complete sets. 102-104 - Christoph Minnameier:
Local and global deadlock-detection in component-based systems are NP-hard. 105-111 - Florin Manea, Victor Mitrana:
All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size. 112-118 - Joseph Y.-T. Leung, Haibing Li, Michael L. Pinedo, Jiawei Zhang:
Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines. 119-129
Volume 103, Number 4, August 2007
- Philip M. Long, Rocco A. Servedio, Hans Ulrich Simon:
Discriminative learning can succeed where generative learning fails. 131-135 - Georg Gottlob, Stephanie Tien Lee:
A logical approach to multicut problems. 136-141 - Amihood Amir, Leszek Gasieniec, B. Riva Shalom:
Improved approximate common interval. 142-149 - Xiaofang Luo, Min Chen, Weifan Wang:
On 3-colorable planar graphs without cycles of four lengths. 150-156 - David Ruiz, Rafael Corchuelo, José Luis Arjona:
Generating non-conspiratorial executions. 157-162 - Matthias Hagen:
On the fixed-parameter tractability of the equivalence test of monotone normal forms. 163-167
Volume 103, Number 5, August 2007
- Xiaohu Shi, Yanchun Liang, H. P. Lee, C. Lu, Q. X. Wang:
Particle swarm optimization-based algorithms for TSP and generalized TSP. 169-176 - Louise Leenen, Thomas Andreas Meyer, Aditya Ghose:
Relaxations of semiring constraint satisfaction problems. 177-182 - Adam Janiak, Radoslaw Rudek:
The learning effect: Getting to the core of the problem. 183-187 - Flemming Nielson, Hanne Riis Nielson, Henrik Pilegaard:
What is a free name in a process algebra? 188-194 - Paulo Feofiloff, Cristina G. Fernandes, Carlos Eduardo Ferreira, José Coelho de Pina:
Primal-dual approximation algorithms for the Prize-Collecting Steiner Tree Problem. 195-202 - Barbara König, Vitali Kozioura:
Incremental construction of coverability graphs. 203-209
Volume 103, Number 6, September 2007
- Igor E. Shparlinski, Arne Winterhof:
Quantum period reconstruction of approximate sequences. 211-215 - Shin-ichi Nakayama, Shigeru Masuyama:
A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs. 216-221 - Jun-Ming Xu, Qiang Zhu, Min Xu:
Fault-tolerant analysis of a class of networks. 222-226 - Petri Kontkanen, Petri Myllymäki:
A linear-time algorithm for computing the multinomial stochastic complexity. 227-233 - Lutz Volkmann:
Restricted arc-connectivity of digraphs. 234-239 - Yun Sheng Chung, Chin Lung Lu, Chuan Yi Tang:
Efficient algorithms for regular expression constrained sequence alignment. 240-246 - Areej Zuhily, Alan Burns:
Optimal (D-J)-monotonic priority assignment. 247-250
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-05-17 00:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
