default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 99
Volume 99, Number 1, July 2006
- Huaming Zhang
, Xin He:
On simultaneous straight-line grid embedding of a planar graph and its dual. 1-6 - Robert E. Jamison, Gretchen L. Matthews, John Villalpando:
Acyclic colorings of products of trees. 7-12 - Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter:
Complexity aspects of generalized Helly hypergraphs. 13-18 - Yangjun Chen:
On the cost of searching signature trees. 19-26 - Christian Choffrut, Serge Grigorieff:
Separability of rational relations in A* × Nm by recognizable relations is decidable. 27-32 - Anca Muscholl, Mathias Samuelides, Luc Segoufin:
Complementing deterministic tree-walking automata. 33-39
Volume 99, Number 2, July 2006
- Angelika Hellwig, Lutz Volkmann:
Lower bounds on the vertex-connectivity of digraphs and graphs. 41-46 - Min Chen, Weifan Wang:
The 2-dipath chromatic number of Halin graphs. 47-53 - Amitabha Bagchi, Ankur Bhargava, Torsten Suel:
Approximate maximum weight branchings. 54-58 - Kathie Cameron, Chính T. Hoàng:
On the structure of certain intersection graphs. 59-63 - Chung-Ming Lin, Yin-Te Tsai, Chuan Yi Tang:
Balancing minimum spanning trees and multiple-source minimum routing cost spanning trees on metric graphs. 64-67 - Mickaël Montassier:
A note on the not 3-choosability of some families of planar graphs. 68-71 - Olga Xirotiri:
Simulation of simultaneous safe recursion over an arbitrary structure. 72-81
Volume 99, Number 3, August 2006
- Konstantinos Bletsas, Neil C. Audsley:
Optimal priority assignment in the presence of blocking. 83-86 - Adi Avidor, Ricky Rosen:
A note on Unique Games. 87-91 - Marcin Peczarski:
An improvement of the tree code construction. 92-95 - Seth Voorhies, Hyunyoung Lee, Andreas Klappenecker:
Fair service for mice in the presence of elephants. 96-101 - T. C. Edwin Cheng, C. T. Ng, Vladimir Kotov:
A new algorithm for online uniform-machine scheduling to minimize the makespan. 102-105 - Shih-Chien Chou, Yuan-Chien Chen:
Retrieving reusable components with variation points from software product lines. 106-110 - Sándor Vágvölgyi:
Descendants of a recognizable tree language for sets of linear monadic term rewrite rules. 111-118 - Stefan Hougardy, Doratha E. Drake Vinkemeier:
Approximating weighted matchings in parallel. 119-123
Volume 99, Number 4, August 2006
- Minghui Jiang:
A new approximation algorithm for labeling points with circle pairs. 125-129 - Raphael Yuster:
Finding and counting cliques and independent sets in r-uniform hypergraphs. 130-134 - Chik How Tan:
Analysis of improved signcryption scheme with key privacy. 135-138 - Guangjun Xu, Liying Kang, Erfang Shan:
Acyclic domination on bipartite permutation graphs. 139-144 - Boaz Tsaban:
Fast generators for the Diffie-Hellman key agreement protocol and malicious standards. 145-148 - Wei Huang, Yaoyun Shi, Shengyu Zhang, Yufan Zhu:
The communication complexity of the Hamming distance problem. 149-153 - Marten van Dijk, Tom A. M. Kevenaar, Geert Jan Schrijen, Pim Tuyls:
Improved constructions of secret sharing schemes by applying (lambda, omega)-decompositions. 154-157 - Olivier Danvy, Henning Korsholm Rohde:
On obtaining the Boyer-Moore string-matching algorithm by partial evaluation. 158-162 - Satoshi Ikeda, Koji Nakazawa:
Strong normalization proofs by CPS-translations. 163-170
Volume 99, Number 5, September 2006
- Yasuhiko Takenaga, Toby Walsh:
Tetravex is NP-complete. 171-174 - Alistair Moffat, Vo Ngoc Anh:
Binary codes for locally homogeneous sequences. 175-180 - Markus Kuba:
On Quickselect, partial sorting and Multiple Quickselect. 181-186 - Asaf Levin:
Real time scheduling with a budget: Parametric-search is better than binary search. 187-191 - Shisheng Li, Guangzhong Sun, Guoliang Chen:
Improved algorithm for finding next-to-shortest paths. 192-194 - Julián Mestre:
On the multi-radius cover problem. 195-198 - Philippe Janssen, Lhouari Nourine:
Minimum implicational basis for meet-semidistributive lattices. 199-202 - Yoshifumi Sakai:
A linear space algorithm for computing a longest common increasing subsequence. 203-207 - Raymond Devillers, Laurent Van Begin:
Boundedness undecidability for synchronized nets. 208-214
Volume 99, Number 6, September 2006
- André Große, Jörg Rothe, Gerd Wechsung:
On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P. 215-221 - Stavros Tripakis:
Folk theorems on the determinization and minimization of timed automata. 222-226 - C. R. Subramanian:
Analysis of a heuristic for acyclic edge colouring. 227-229 - Adrian Kosowski, Michal Malafiejski, Pawel Zylinski:
An approximation algorithm for maximum P3-packing in subcubic graphs. 230-233 - Amin Coja-Oghlan, Lars Kuhtz:
An improved algorithm for approximating the chromatic number of Gn, p. 234-238 - Felix A. Fischer, Markus Holzer, Stefan Katzenbeisser:
The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria. 239-245 - Travis Gagie:
Large alphabets and incompressibility. 246-251
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 2026-08-14 21:54 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
