no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
1 |
An Improved Algorithm for the Traveler′s Problem
|
Aggarwal, A. |
|
1995 |
19 |
2 |
p. 318-330 13 p. |
article |
2 |
Coloring Random and Semi-Random k-Colorable Graphs
|
Blum, A. |
|
1995 |
19 |
2 |
p. 204-234 31 p. |
article |
3 |
Counting the Integers Factorable via Cyclotomic Methods
|
Pomerance, C. |
|
1995 |
19 |
2 |
p. 250-265 16 p. |
article |
4 |
Fractional Cascading Revisited
|
Sen, S.D. |
|
1995 |
19 |
2 |
p. 161-172 12 p. |
article |
5 |
Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
|
Gupta, P. |
|
1995 |
19 |
2 |
p. 282-317 36 p. |
article |
6 |
Independent Sets in Circular-Arc Graphs
|
Hsu, W.L. |
|
1995 |
19 |
2 |
p. 145-160 16 p. |
article |
7 |
N C -Algorithms for Minimum Link Path and Related Problems
|
Chandru, V. |
|
1995 |
19 |
2 |
p. 173-203 31 p. |
article |
8 |
Optimal Partitioning of Sequences
|
Manne, F. |
|
1995 |
19 |
2 |
p. 235-249 15 p. |
article |
9 |
Treewidth of Chordal Bipartite Graphs
|
Kloks, T. |
|
1995 |
19 |
2 |
p. 266-281 16 p. |
article |