History
1
so:se00001118
1772


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 121 141 161 181 201 | next | last

Result 101 to 120 of 1772 total

Faster swap edge computation in minimum diameter spanning trees. (English)
Algorithmica 62, No. 1-2, 169-191 (2012).
WorldCat.org
101
PDF XML AMS-TeX TEXT BIBTeX DOI
Stronger Lempel-Ziv based compressed text indexing. (English)
Algorithmica 62, No. 1-2, 54-101 (2012).
WorldCat.org
102
PDF XML AMS-TeX TEXT BIBTeX DOI
Pruning 2-connected graphs. (English)
Algorithmica 62, No. 1-2, 436-463 (2012).
WorldCat.org
103
PDF XML AMS-TeX TEXT BIBTeX DOI
Competitive weighted matching in transversal matroids. (English)
Algorithmica 62, No. 1-2, 333-348 (2012).
WorldCat.org
104
PDF XML AMS-TeX TEXT BIBTeX DOI
Fast arc-annotated subsequence matching in linear space. (English)
Algorithmica 62, No. 1-2, 209-223 (2012).
WorldCat.org
105
PDF XML AMS-TeX TEXT BIBTeX DOI
Mapping filtering streaming applications. (English)
Algorithmica 62, No. 1-2, 258-308 (2012).
WorldCat.org
106
PDF XML AMS-TeX TEXT BIBTeX DOI
Many distances in planar graphs. (English)
Algorithmica 62, No. 1-2, 361-381 (2012).
WorldCat.org
107
PDF XML AMS-TeX TEXT BIBTeX DOI
Biased range trees. (English)
Algorithmica 62, No. 1-2, 21-37 (2012).
WorldCat.org
108
PDF XML AMS-TeX TEXT BIBTeX DOI
Finding induced paths of given parity in claw-free graphs. (English)
Algorithmica 62, No. 1-2, 537-563 (2012).
WorldCat.org
109
PDF XML AMS-TeX TEXT BIBTeX DOI
A scheme for computing minimum covers within simple regions. (English)
Algorithmica 62, No. 1-2, 349-360 (2012).
WorldCat.org
110
PDF XML AMS-TeX TEXT BIBTeX DOI
Construction sequences and certifying 3-connectivity. (English)
Algorithmica 62, No. 1-2, 192-208 (2012).
WorldCat.org
111
PDF XML AMS-TeX TEXT BIBTeX DOI
A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives. (English)
Algorithmica 62, No. 1-2, 146-168 (2012).
WorldCat.org
112
PDF XML AMS-TeX TEXT BIBTeX DOI
Erratum to: “Linear time algorithms for generalized edge dominating set problems". (English)
Algorithmica 62, No. 1-2, 633-634 (2012).
WorldCat.org
113
PDF XML AMS-TeX TEXT BIBTeX DOI
Special issue: Theoretical informatics. Selected papers based on the presentations at the 9th Latin American theoretical informatics symposium (LATIN), Oaxaca, Mexico, April 19‒23, 2010. (English)
Algorithmica 63, No. 3, 569-730 (2012).
WorldCat.org
114
PDF XML AMS-TeX TEXT BIBTeX
An improved approximation algorithm for the traveling tournament problem. (English)
Algorithmica 61, No. 4, 1077-1091 (2011).
WorldCat.org
115
PDF XML AMS-TeX TEXT BIBTeX DOI
Another sub-exponential algorithm for the simple stochastic game. (English)
Algorithmica 61, No. 4, 1092-1104 (2011).
WorldCat.org
116
PDF XML AMS-TeX TEXT BIBTeX DOI
Faster parameterized algorithms for {\sc Minimum Fill-in}. (English)
Algorithmica 61, No. 4, 817-838 (2011).
WorldCat.org
117
PDF XML AMS-TeX TEXT BIBTeX DOI
A new algorithm for finding trees with many leaves. (English)
Algorithmica 61, No. 4, 882-897 (2011).
WorldCat.org
118
PDF XML AMS-TeX TEXT BIBTeX DOI
Exact algorithms for the bottleneck Steiner tree problem. (English)
Algorithmica 61, No. 4, 924-948 (2011).
WorldCat.org
119
PDF XML AMS-TeX TEXT BIBTeX DOI
Editing graphs into disjoint unions of dense clusters. (English)
Algorithmica 61, No. 4, 949-970 (2011).
WorldCat.org
120
PDF XML AMS-TeX TEXT BIBTeX DOI
first | previous | 1 21 41 61 81 101 121 141 161 181 201 | next | last

Result 101 to 120 of 1772 total

Valid XHTML 1.0 Transitional Valid CSS!