nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A new three-machine shop scheduling: complexity and approximation algorithm
|
Dong, Jianming |
|
2012 |
26 |
4 |
p. 799-810 |
artikel |
2 |
A note on anti-coordination and social interactions
|
Cao, Zhigang |
|
2012 |
26 |
4 |
p. 811-818 |
artikel |
3 |
(1+ε)-competitive algorithm for online OVSF code assignment with resource augmentation
|
Asahiro, Yuichi |
|
2012 |
26 |
4 |
p. 687-708 |
artikel |
4 |
Finding paths with minimum shared edges
|
Omran, Masoud T. |
|
2012 |
26 |
4 |
p. 709-722 |
artikel |
5 |
Flipping triangles and rectangles
|
Jiang, Minghui |
|
2012 |
26 |
4 |
p. 755-769 |
artikel |
6 |
Largest area convex hull of imprecise data based on axis-aligned squares
|
Ju, Wenqi |
|
2012 |
26 |
4 |
p. 832-859 |
artikel |
7 |
L(d,1)-labelings of the edge-path-replacement of a graph
|
Lü, Damei |
|
2012 |
26 |
4 |
p. 819-831 |
artikel |
8 |
Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs
|
Panda, B. S. |
|
2012 |
26 |
4 |
p. 770-785 |
artikel |
9 |
On the cores of games arising from integer edge covering functions of graphs
|
Park, Boram |
|
2012 |
26 |
4 |
p. 786-798 |
artikel |
10 |
Optimal strategies for the one-round discrete Voronoi game on a line
|
Banik, Aritra |
|
2012 |
26 |
4 |
p. 655-669 |
artikel |
11 |
Property testing for cyclic groups and beyond
|
Le Gall, François |
|
2012 |
26 |
4 |
p. 636-654 |
artikel |
12 |
The density maximization problem in graphs
|
Kao, Mong-Jen |
|
2012 |
26 |
4 |
p. 723-754 |
artikel |
13 |
The topology aware file distribution problem
|
O’Neil, Shawn T. |
|
2011 |
26 |
4 |
p. 621-635 |
artikel |
14 |
Unavoidable regularities in long words with bounded number of symbol occurrences
|
Kortelainen, Juha |
|
2012 |
26 |
4 |
p. 670-686 |
artikel |