History
1
so:se00003114
428


Please fill in your query. A complete syntax description you will find on the General Help page.
first | previous | 1 21 41 61 81 101 | next | last

Result 1 to 20 of 428 total

Near optimal algorithm for the shortest descending path on the surface of a convex terrain. (English)
J. Discrete Algorithms 15, 63-70 (2012).
WorldCat.org
1
PDF XML AMS-TeX TEXT BIBTeX DOI
On the parameterized complexity of coloring graphs in the absence of a linear forest. (English)
J. Discrete Algorithms 15, 56-62 (2012).
WorldCat.org
2
PDF XML AMS-TeX TEXT BIBTeX DOI
An exact exponential-time algorithm for the directed maximum leaf spanning tree problem. (English)
J. Discrete Algorithms 15, 43-55 (2012).
WorldCat.org
3
PDF XML AMS-TeX TEXT BIBTeX DOI
Efficient total domination in digraphs. (English)
J. Discrete Algorithms 15, 32-42 (2012).
WorldCat.org
4
PDF XML AMS-TeX TEXT BIBTeX DOI
On bounded degree plane strong geometric spanners. (English)
J. Discrete Algorithms 15, 16-31 (2012).
WorldCat.org
5
PDF XML AMS-TeX TEXT BIBTeX DOI
Approximate one-to-one point pattern matching. (English)
J. Discrete Algorithms 15, 1-15 (2012).
WorldCat.org
6
PDF XML AMS-TeX TEXT BIBTeX DOI
Path-based supports for hypergraphs. (English)
J. Discrete Algorithms 14, 248-261 (2012).
WorldCat.org
7
PDF XML AMS-TeX TEXT BIBTeX DOI
Distributed colorings for collision-free routing in sink-centric sensor networks. (English)
J. Discrete Algorithms 14, 232-247 (2012).
WorldCat.org
8
PDF XML AMS-TeX TEXT BIBTeX DOI
Testing connectivity of faulty networks in sublinear time. (English)
J. Discrete Algorithms 14, 223-231 (2012).
WorldCat.org
9
PDF XML AMS-TeX TEXT BIBTeX DOI
Approximation complexity of metric dimension problem. (English)
J. Discrete Algorithms 14, 214-222 (2012).
WorldCat.org
10
PDF XML AMS-TeX TEXT BIBTeX DOI
Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number. (English)
J. Discrete Algorithms 14, 207-213 (2012).
WorldCat.org
11
PDF XML AMS-TeX TEXT BIBTeX DOI
A tight upper bound on the ($2,1$)-total labeling number of outerplanar graphs. (English)
J. Discrete Algorithms 14, 189-206 (2012).
WorldCat.org
12
PDF XML AMS-TeX TEXT BIBTeX DOI
Computing role assignments of proper interval graphs in polynomial time. (English)
J. Discrete Algorithms 14, 173-188 (2012).
WorldCat.org
13
PDF XML AMS-TeX TEXT BIBTeX DOI
Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph. (English)
J. Discrete Algorithms 14, 150-172 (2012).
WorldCat.org
14
PDF XML AMS-TeX TEXT BIBTeX DOI
The complexity of finding uniform sparsest cuts in various graph classes. (English)
J. Discrete Algorithms 14, 136-149 (2012).
WorldCat.org
15
PDF XML AMS-TeX TEXT BIBTeX DOI
Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism. (English)
J. Discrete Algorithms 14, 119-135 (2012).
WorldCat.org
16
PDF XML AMS-TeX TEXT BIBTeX DOI
Efficient chaining of seeds in ordered trees. (English)
J. Discrete Algorithms 14, 107-118 (2012).
WorldCat.org
17
PDF XML AMS-TeX TEXT BIBTeX DOI
Worst-case efficient single and multiple string matching on packed texts in the word-RAM model. (English)
J. Discrete Algorithms 14, 91-106 (2012).
WorldCat.org
18
PDF XML AMS-TeX TEXT BIBTeX DOI
Dictionary-symbolwise flexible parsing. (English)
J. Discrete Algorithms 14, 74-90 (2012).
WorldCat.org
19
PDF XML AMS-TeX TEXT BIBTeX DOI
Number of holes in unavoidable sets of partial words. II. (English)
J. Discrete Algorithms 14, 65-73 (2012).
WorldCat.org
20
PDF XML AMS-TeX TEXT BIBTeX DOI
first | previous | 1 21 41 61 81 101 | next | last

Result 1 to 20 of 428 total

Valid XHTML 1.0 Transitional Valid CSS!