| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A characterization of complete bipartite RAC graphs
|
Didimo, Walter
|
|
2010
|
110 |
16 |
p. 687-691
5 p.
|
artikel
|
| 2 |
A Fan-type result on k-ordered graphs
|
Li, Ruijuan
|
|
2010
|
110 |
16 |
p. 651-654
4 p.
|
artikel
|
| 3 |
An improved kernelization algorithm for r-Set Packing
|
Abu-Khzam, Faisal N.
|
|
2010
|
110 |
16 |
p. 621-624
4 p.
|
artikel
|
| 4 |
A note on robustness tolerances for combinatorial optimization problems
|
Libura, Marek
|
|
2010
|
110 |
16 |
p. 725-729
5 p.
|
artikel
|
| 5 |
An output sensitive algorithm for computing a maximum independent set of a circle graph
|
Nash, Nicholas
|
|
2010
|
110 |
16 |
p. 630-634
5 p.
|
artikel
|
| 6 |
Armstrong axioms and Boyce–Codd–Heath Normal Form under bag semantics
|
Koehler, Henning
|
|
2010
|
110 |
16 |
p. 717-724
8 p.
|
artikel
|
| 7 |
A visual word weighting scheme based on emerging itemsets for video annotation
|
Ding, Guiguang
|
|
2010
|
110 |
16 |
p. 692-696
5 p.
|
artikel
|
| 8 |
Concise: Compressed ‘n’ Composable Integer Set
|
Colantonio, Alessandro
|
|
2010
|
110 |
16 |
p. 644-650
7 p.
|
artikel
|
| 9 |
Constant factor approximation algorithms for the densest k-subgraph problem on proper interval graphs and bipartite permutation graphs
|
Backer, Jonathan
|
|
2010
|
110 |
16 |
p. 635-638
4 p.
|
artikel
|
| 10 |
Cycles passing through a prescribed path in a hypercube with faulty edges
|
Chen, Xie-Bin
|
|
2010
|
110 |
16 |
p. 625-629
5 p.
|
artikel
|
| 11 |
Editorial Board
|
|
|
2010
|
110 |
16 |
p. IFC-
1 p.
|
artikel
|
| 12 |
Efficient indexing algorithms for one-dimensional discretely-scaled strings
|
Peng, Yung-Hsing
|
|
2010
|
110 |
16 |
p. 730-734
5 p.
|
artikel
|
| 13 |
Normal eulerian clique-covering and hamiltonicity
|
Vallée, Thierry
|
|
2010
|
110 |
16 |
p. 697-701
5 p.
|
artikel
|
| 14 |
On exact solutions to the Euclidean bottleneck Steiner tree problem
|
Bae, Sang Won
|
|
2010
|
110 |
16 |
p. 672-678
7 p.
|
artikel
|
| 15 |
Optimal global alignment of signals by maximization of Pearson correlation
|
Di Lena, Pietro
|
|
2010
|
110 |
16 |
p. 679-686
8 p.
|
artikel
|
| 16 |
Optimizing the Region Algebra is PSPACE-complete
|
Gelade, Wouter
|
|
2010
|
110 |
16 |
p. 639-643
5 p.
|
artikel
|
| 17 |
Parameterized algorithm for eternal vertex cover
|
Fomin, Fedor V.
|
|
2010
|
110 |
16 |
p. 702-706
5 p.
|
artikel
|
| 18 |
Ranking numbers of graphs
|
Chang, Chan-Wei
|
|
2010
|
110 |
16 |
p. 711-716
6 p.
|
artikel
|
| 19 |
Refining abstract interpretations
|
Gulavani, Bhargav S.
|
|
2010
|
110 |
16 |
p. 666-671
6 p.
|
artikel
|
| 20 |
Super connectivity of Kronecker products of graphs
|
Guo, Litao
|
|
2010
|
110 |
16 |
p. 659-661
3 p.
|
artikel
|
| 21 |
The longest almost-increasing subsequence
|
Elmasry, Amr
|
|
2010
|
110 |
16 |
p. 655-658
4 p.
|
artikel
|
| 22 |
There is no EPTAS for two-dimensional knapsack
|
Kulik, Ariel
|
|
2010
|
110 |
16 |
p. 707-710
4 p.
|
artikel
|
| 23 |
Upper signed k-domination in a general graph
|
Delić, Dejan
|
|
2010
|
110 |
16 |
p. 662-665
4 p.
|
artikel
|
Tijdschrift beschrijving