| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
An Algorithmic Characterization of Polynomial Functions over ${\mathbb{Z}}_{p^{n}} $
|
Guha, Ashwin
|
|
2013
|
71 |
1 |
p. 201-218
|
artikel
|
| 2 |
An $$O(n^4)$$O(n4) Time Algorithm to Compute the Bisection Width of Solid Grid Graphs
|
Feldmann, Andreas Emil
|
|
2014
|
71 |
1 |
p. 181-200
|
artikel
|
| 3 |
Approximating Minimum Manhattan Networks in Higher Dimensions
|
Das, Aparna
|
|
2013
|
71 |
1 |
p. 36-52
|
artikel
|
| 4 |
A Quadratic Vertex Kernel for Feedback Arc Set in Bipartite Tournaments
|
Xiao, Mingyu
|
|
2013
|
71 |
1 |
p. 87-97
|
artikel
|
| 5 |
Colored Hypergraph Isomorphism is Fixed Parameter Tractable
|
Arvind, V.
|
|
2013
|
71 |
1 |
p. 120-138
|
artikel
|
| 6 |
Generalised k-Steiner Tree Problems in Normed Planes
|
Brazil, Marcus
|
|
2013
|
71 |
1 |
p. 66-86
|
artikel
|
| 7 |
List Coloring in the Absence of a Linear Forest
|
Couturier, Jean-François
|
|
2013
|
71 |
1 |
p. 21-35
|
artikel
|
| 8 |
Metrical Service Systems with Multiple Servers
|
Chiplunkar, Ashish
|
|
2014
|
71 |
1 |
p. 219-231
|
artikel
|
| 9 |
Minimum Fill-in of Sparse Graphs: Kernelization and Approximation
|
Fomin, Fedor V.
|
|
2013
|
71 |
1 |
p. 1-20
|
artikel
|
| 10 |
On Tree-Constrained Matchings and Generalizations
|
Canzar, Stefan
|
|
2013
|
71 |
1 |
p. 98-119
|
artikel
|
| 11 |
Polynomial Time Algorithm for Min-Ranks of Graphs with Simple Tree Structures
|
Dau, Son Hoang
|
|
2013
|
71 |
1 |
p. 152-180
|
artikel
|
| 12 |
Sparse Fault-Tolerant Spanners for Doubling Metrics with Bounded Hop-Diameter or Degree
|
Chan, T.-H. Hubert
|
|
2013
|
71 |
1 |
p. 53-65
|
artikel
|
| 13 |
The Euclidean Bottleneck Full Steiner Tree Problem
|
Abu-Affash, A. Karim
|
|
2013
|
71 |
1 |
p. 139-151
|
artikel
|
Tijdschrift beschrijving