| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A characterization of complete bipartite RAC graphs
|
Didimo, Walter
|
|
2010
|
|
16 |
p. 687-691
5 p.
|
artikel
|
| 2 |
A Fan-type result on k-ordered graphs
|
Li, Ruijuan
|
|
2010
|
|
16 |
p. 651-654
4 p.
|
artikel
|
| 3 |
An improved kernelization algorithm for r-Set Packing
|
Abu-Khzam, Faisal N.
|
|
2010
|
|
16 |
p. 621-624
4 p.
|
artikel
|
| 4 |
An Ω ( n log n ) lower bound for computing the sum of even-ranked elements
|
Mörig, Marc
|
|
2009
|
|
16 |
p. 955-956
2 p.
|
artikel
|
| 5 |
Annotating problem diagrams with architectural tactics for reasoning on quality requirements
|
Cañete-Valdeón, José M.
|
|
2012
|
|
16 |
p. 656-661
6 p.
|
artikel
|
| 6 |
A note on robustness tolerances for combinatorial optimization problems
|
Libura, Marek
|
|
2010
|
|
16 |
p. 725-729
5 p.
|
artikel
|
| 7 |
An output sensitive algorithm for computing a maximum independent set of a circle graph
|
Nash, Nicholas
|
|
2010
|
|
16 |
p. 630-634
5 p.
|
artikel
|
| 8 |
Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
|
Lee, Kangbok
|
|
2009
|
|
16 |
p. 913-917
5 p.
|
artikel
|
| 9 |
Approximation of min coloring by moderately exponential algorithms
|
Bourgeois, Nicolas
|
|
2009
|
|
16 |
p. 950-954
5 p.
|
artikel
|
| 10 |
A related key impossible differential attack against 22 rounds of the lightweight block cipher LBlock
|
Minier, Marine
|
|
2012
|
|
16 |
p. 624-629
6 p.
|
artikel
|
| 11 |
Armstrong axioms and Boyce–Codd–Heath Normal Form under bag semantics
|
Koehler, Henning
|
|
2010
|
|
16 |
p. 717-724
8 p.
|
artikel
|
| 12 |
A self-stabilizing algorithm for optimally efficient sets in graphs
|
Hedetniemi, Sandra M.
|
|
2012
|
|
16 |
p. 621-623
3 p.
|
artikel
|
| 13 |
Assembling approximately optimal binary search trees efficiently using arithmetics
|
Kujala, Jussi
|
|
2009
|
|
16 |
p. 962-966
5 p.
|
artikel
|
| 14 |
A tighter analysis of Piterman's Büchi determinization
|
Liu, Wanwei
|
|
2009
|
|
16 |
p. 941-945
5 p.
|
artikel
|
| 15 |
A visual word weighting scheme based on emerging itemsets for video annotation
|
Ding, Guiguang
|
|
2010
|
|
16 |
p. 692-696
5 p.
|
artikel
|
| 16 |
Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs
|
Miao, Cuixia
|
|
2011
|
|
16 |
p. 798-803
6 p.
|
artikel
|
| 17 |
Bounding the maximum size of a minimal definitive set of quartets
|
Dietrich, Max
|
|
2012
|
|
16 |
p. 651-655
5 p.
|
artikel
|
| 18 |
Concise: Compressed ‘n’ Composable Integer Set
|
Colantonio, Alessandro
|
|
2010
|
|
16 |
p. 644-650
7 p.
|
artikel
|
| 19 |
Constant factor approximation algorithms for the densest k-subgraph problem on proper interval graphs and bipartite permutation graphs
|
Backer, Jonathan
|
|
2010
|
|
16 |
p. 635-638
4 p.
|
artikel
|
| 20 |
Counterexamples to the long-standing conjecture on the complexity of BDD binary operations
|
Yoshinaka, Ryo
|
|
2012
|
|
16 |
p. 636-640
5 p.
|
artikel
|
| 21 |
Counting extensional acyclic digraphs
|
Policriti, Alberto
|
|
2011
|
|
16 |
p. 787-791
5 p.
|
artikel
|
| 22 |
Covering a set of points in a plane using two parallel rectangles
|
Saha, Chandan
|
|
2009
|
|
16 |
p. 907-912
6 p.
|
artikel
|
| 23 |
Cycles passing through a prescribed path in a hypercube with faulty edges
|
Chen, Xie-Bin
|
|
2010
|
|
16 |
p. 625-629
5 p.
|
artikel
|
| 24 |
Editorial Board
|
|
|
2009
|
|
16 |
p. IFC-
1 p.
|
artikel
|
| 25 |
Editorial Board
|
|
|
2010
|
|
16 |
p. IFC-
1 p.
|
artikel
|
| 26 |
Editorial Board
|
|
|
2011
|
|
16 |
p. IFC-
1 p.
|
artikel
|
| 27 |
Editorial Board
|
|
|
2012
|
|
16 |
p. IFC-
1 p.
|
artikel
|
| 28 |
Efficient indexing algorithms for one-dimensional discretely-scaled strings
|
Peng, Yung-Hsing
|
|
2010
|
|
16 |
p. 730-734
5 p.
|
artikel
|
| 29 |
Exponential-time approximation of weighted set cover
|
Cygan, Marek
|
|
2009
|
|
16 |
p. 957-961
5 p.
|
artikel
|
| 30 |
Factorization of K n , n into ( 0 , j ) -prisms
|
Cichacz, Sylwia
|
|
2009
|
|
16 |
p. 932-934
3 p.
|
artikel
|
| 31 |
Frequency of correctness versus average polynomial time
|
Erdélyi, Gábor
|
|
2009
|
|
16 |
p. 946-949
4 p.
|
artikel
|
| 32 |
Geometric pattern matching for point sets in the plane under similarity transformations
|
Aiger, Dror
|
|
2009
|
|
16 |
p. 935-940
6 p.
|
artikel
|
| 33 |
How strong is Nisanʼs pseudo-random generator?
|
David, Matei
|
|
2011
|
|
16 |
p. 804-808
5 p.
|
artikel
|
| 34 |
Improved approximation algorithms for the Max Edge-Coloring problem
|
Lucarelli, Giorgio
|
|
2011
|
|
16 |
p. 819-823
5 p.
|
artikel
|
| 35 |
Improved gradient-based neural networks for online solution of Lyapunov matrix equation
|
Yi, Chenfu
|
|
2011
|
|
16 |
p. 780-786
7 p.
|
artikel
|
| 36 |
Minimum size of a graph or digraph of given radius
|
Dankelmann, Peter
|
|
2009
|
|
16 |
p. 971-973
3 p.
|
artikel
|
| 37 |
New classes of quaternary cyclotomic sequence of length 2 p m with high linear complexity
|
Ke, Pinhui
|
|
2012
|
|
16 |
p. 646-650
5 p.
|
artikel
|
| 38 |
Normal eulerian clique-covering and hamiltonicity
|
Vallée, Thierry
|
|
2010
|
|
16 |
p. 697-701
5 p.
|
artikel
|
| 39 |
On conditions for the liveness of weakly persistent nets
|
Liu, GuanJun
|
|
2009
|
|
16 |
p. 967-970
4 p.
|
artikel
|
| 40 |
On exact solutions to the Euclidean bottleneck Steiner tree problem
|
Bae, Sang Won
|
|
2010
|
|
16 |
p. 672-678
7 p.
|
artikel
|
| 41 |
Online scheduling with one rearrangement at the end: Revisited
|
Wang, Yuxin
|
|
2012
|
|
16 |
p. 641-645
5 p.
|
artikel
|
| 42 |
On some open problems in monotonic and conservative learning
|
Jain, Sanjay
|
|
2009
|
|
16 |
p. 923-926
4 p.
|
artikel
|
| 43 |
Optimal global alignment of signals by maximization of Pearson correlation
|
Di Lena, Pietro
|
|
2010
|
|
16 |
p. 679-686
8 p.
|
artikel
|
| 44 |
Optimizing the Region Algebra is PSPACE-complete
|
Gelade, Wouter
|
|
2010
|
|
16 |
p. 639-643
5 p.
|
artikel
|
| 45 |
Paired-bacteria optimiser – A simple and fast algorithm
|
Li, M.S.
|
|
2011
|
|
16 |
p. 809-813
5 p.
|
artikel
|
| 46 |
Parameterized algorithm for eternal vertex cover
|
Fomin, Fedor V.
|
|
2010
|
|
16 |
p. 702-706
5 p.
|
artikel
|
| 47 |
Ranking numbers of graphs
|
Chang, Chan-Wei
|
|
2010
|
|
16 |
p. 711-716
6 p.
|
artikel
|
| 48 |
Refining abstract interpretations
|
Gulavani, Bhargav S.
|
|
2010
|
|
16 |
p. 666-671
6 p.
|
artikel
|
| 49 |
Rotation distance is fixed-parameter tractable
|
Cleary, Sean
|
|
2009
|
|
16 |
p. 918-922
5 p.
|
artikel
|
| 50 |
Sensitivity and specificity based multiobjective approach for feature selection: Application to cancer diagnosis
|
García-Nieto, J.
|
|
2009
|
|
16 |
p. 887-896
10 p.
|
artikel
|
| 51 |
Some characterizations of γ and β-acyclicity of hypergraphs
|
Duris, David
|
|
2012
|
|
16 |
p. 617-620
4 p.
|
artikel
|
| 52 |
Subexponential algorithms for partial cover problems
|
Fomin, Fedor V.
|
|
2011
|
|
16 |
p. 814-818
5 p.
|
artikel
|
| 53 |
Super connectivity of Kronecker products of graphs
|
Guo, Litao
|
|
2010
|
|
16 |
p. 659-661
3 p.
|
artikel
|
| 54 |
Task distribution using factoring load balancing in Master–Worker applications
|
Moreno, A.
|
|
2009
|
|
16 |
p. 902-906
5 p.
|
artikel
|
| 55 |
The average number of block interchanges needed to sort a permutation and a recent result of Stanley
|
Bóna, Miklós
|
|
2009
|
|
16 |
p. 927-931
5 p.
|
artikel
|
| 56 |
The Kurosawa–Desmedt key encapsulation is not chosen-ciphertext secure
|
Choi, Seung Geol
|
|
2009
|
|
16 |
p. 897-901
5 p.
|
artikel
|
| 57 |
The longest almost-increasing subsequence
|
Elmasry, Amr
|
|
2010
|
|
16 |
p. 655-658
4 p.
|
artikel
|
| 58 |
There is no EPTAS for two-dimensional knapsack
|
Kulik, Ariel
|
|
2010
|
|
16 |
p. 707-710
4 p.
|
artikel
|
| 59 |
Uniformly inserting points on square grid
|
Zhang, Yong
|
|
2011
|
|
16 |
p. 773-779
7 p.
|
artikel
|
| 60 |
Upper signed k-domination in a general graph
|
Delić, Dejan
|
|
2010
|
|
16 |
p. 662-665
4 p.
|
artikel
|
| 61 |
Varying radix numeral system based adaptive image steganography
|
Geetha, S.
|
|
2011
|
|
16 |
p. 792-797
6 p.
|
artikel
|
| 62 |
Vertex angle and crossing angle resolution of leveled tree drawings
|
Didimo, Walter
|
|
2012
|
|
16 |
p. 630-635
6 p.
|
artikel
|
Tijdschrift beschrijving