Volume 71; Issue 1

Algorithmica

Volume 71; Issue 1
1

An Algorithmic Characterization of Polynomial Functions over\({\mathbb{Z}}_{p^{n}} \)

Year:
2015
Language:
english
File:
PDF, 609 KB
english, 2015
2

Colored Hypergraph Isomorphism is Fixed Parameter Tractable

Year:
2015
Language:
english
File:
PDF, 652 KB
english, 2015
3

Polynomial Time Algorithm for Min-Ranks of Graphs with Simple Tree Structures

Year:
2015
Language:
english
File:
PDF, 1.06 MB
english, 2015
4

On Tree-Constrained Matchings and Generalizations

Year:
2015
Language:
english
File:
PDF, 763 KB
english, 2015
5

A Quadratic Vertex Kernel for Feedback Arc Set in Bipartite Tournaments

Year:
2015
Language:
english
File:
PDF, 440 KB
english, 2015
6

The Euclidean Bottleneck Full Steiner Tree Problem

Year:
2015
Language:
english
File:
PDF, 555 KB
english, 2015
7

Generalisedk-Steiner Tree Problems in Normed Planes

Year:
2015
Language:
english
File:
PDF, 742 KB
english, 2015
8

Sparse Fault-Tolerant Spanners for Doubling Metrics with Bounded Hop-Diameter or Degree

Year:
2015
Language:
english
File:
PDF, 508 KB
english, 2015
10

Minimum Fill-in of Sparse Graphs: Kernelization and Approximation

Year:
2015
Language:
english
File:
PDF, 757 KB
english, 2015
11

List Coloring in the Absence of a Linear Forest

Year:
2015
Language:
english
File:
PDF, 588 KB
english, 2015
12

Metrical Service Systems with Multiple Servers

Year:
2015
Language:
english
File:
PDF, 250 KB
english, 2015
13

An\(O(n^4)\)Time Algorithm to Compute the Bisection Width of Solid Grid Graphs

Year:
2015
Language:
english
File:
PDF, 485 KB
english, 2015