| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A case for a fast trip count predictor
|
Alves, Péricles R.O.
|
|
2015
|
115 |
2 |
p. 146-150
5 p.
|
artikel
|
| 2 |
A comment on “The domination number of exchanged hypercubes”
|
Jha, Pranava K.
|
|
2015
|
115 |
2 |
p. 343-344
2 p.
|
artikel
|
| 3 |
Addendum to: Maximum Weight Independent Sets in hole- and co-chair-free graphs
|
Brandstädt, Andreas
|
|
2015
|
115 |
2 |
p. 345-350
6 p.
|
artikel
|
| 4 |
Adjacent-vertex-distinguishing proper edge colorings of planar bipartite graphs with Δ = 9 , 10 , or 11
|
Chen, Xiang'en
|
|
2015
|
115 |
2 |
p. 263-268
6 p.
|
artikel
|
| 5 |
A fast algorithm for order-preserving pattern matching
|
Cho, Sukhyeun
|
|
2015
|
115 |
2 |
p. 397-402
6 p.
|
artikel
|
| 6 |
Affine-evasive sets modulo a prime
|
Aggarwal, Divesh
|
|
2015
|
115 |
2 |
p. 382-385
4 p.
|
artikel
|
| 7 |
A fixed-parameter algorithm for the vertex cover P 3 problem
|
Tu, Jianhua
|
|
2015
|
115 |
2 |
p. 96-99
4 p.
|
artikel
|
| 8 |
A ground-complete axiomatization of stateless bisimilarity over Linda
|
Aceto, Luca
|
|
2015
|
115 |
2 |
p. 212-220
9 p.
|
artikel
|
| 9 |
AKF: A key alternating Feistel scheme for lightweight cipher designs
|
Karakoç, F.
|
|
2015
|
115 |
2 |
p. 359-367
9 p.
|
artikel
|
| 10 |
An approximation algorithm for the cutting-sticks problem
|
M, Jagadish
|
|
2015
|
115 |
2 |
p. 170-174
5 p.
|
artikel
|
| 11 |
An efficient ID-based cryptographic encryption based on discrete logarithm problem and integer factorization problem
|
Meshram, Chandrashekhar
|
|
2015
|
115 |
2 |
p. 351-358
8 p.
|
artikel
|
| 12 |
An enumeration algorithm for all integers nonrepresentable by some positive integers
|
Matsubara, Shunichi
|
|
2015
|
115 |
2 |
p. 280-284
5 p.
|
artikel
|
| 13 |
A new lower bound for the number of perfect matchings of line graph
|
Zhou, Xue
|
|
2015
|
115 |
2 |
p. 269-274
6 p.
|
artikel
|
| 14 |
An FPT algorithm in polynomial space for the Directed Steiner Tree problem with Limited number of Diffusing nodes
|
Watel, Dimitri
|
|
2015
|
115 |
2 |
p. 275-279
5 p.
|
artikel
|
| 15 |
An ID-based signcryption scheme with compartmented secret sharing for unsigncryption
|
Enos, Graham
|
|
2015
|
115 |
2 |
p. 128-133
6 p.
|
artikel
|
| 16 |
An improved preimage attack against HAVAL-3
|
Guo, Jian
|
|
2015
|
115 |
2 |
p. 386-393
8 p.
|
artikel
|
| 17 |
An LP-rounding 2 2 -approximation for restricted maximum acyclic subgraph
|
Grandoni, Fabrizio
|
|
2015
|
115 |
2 |
p. 182-185
4 p.
|
artikel
|
| 18 |
A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop
|
Gerstl, Enrique
|
|
2015
|
115 |
2 |
p. 159-162
4 p.
|
artikel
|
| 19 |
A note: Minimizing maximum earliness on a proportionate flowshop
|
Mor, Baruch
|
|
2015
|
115 |
2 |
p. 253-255
3 p.
|
artikel
|
| 20 |
A note on envy-free cake cutting with polynomial valuations
|
Brânzei, Simina
|
|
2015
|
115 |
2 |
p. 93-95
3 p.
|
artikel
|
| 21 |
A note on local coloring of graphs
|
Li, Zepeng
|
|
2015
|
115 |
2 |
p. 302-305
4 p.
|
artikel
|
| 22 |
A note on nonexistence of vectorial bent functions with binomial trace representation in the PS − class
|
Pasalic, E.
|
|
2015
|
115 |
2 |
p. 139-140
2 p.
|
artikel
|
| 23 |
A polynomial-time algorithm for computing K-terminal residual reliability of d-trapezoid graphs
|
Lin, Min-Sheng
|
|
2015
|
115 |
2 |
p. 371-376
6 p.
|
artikel
|
| 24 |
Approximation algorithms for the arc orienteering problem
|
Gavalas, Damianos
|
|
2015
|
115 |
2 |
p. 313-315
3 p.
|
artikel
|
| 25 |
Arbitrary sequence RAMs
|
Brand, Michael
|
|
2015
|
115 |
2 |
p. 193-198
6 p.
|
artikel
|
| 26 |
A simple algorithm for computing positively weighted straight skeletons of monotone polygons
|
Biedl, Therese
|
|
2015
|
115 |
2 |
p. 243-247
5 p.
|
artikel
|
| 27 |
A sufficient condition involving implicit degree and neighborhood intersection for long cycles
|
Cai, Junqing
|
|
2015
|
115 |
2 |
p. 225-227
3 p.
|
artikel
|
| 28 |
A unified scheme for generalizing cardinality estimators to sum aggregation
|
Cohen, Reuven
|
|
2015
|
115 |
2 |
p. 336-342
7 p.
|
artikel
|
| 29 |
Circulant graphs and GCD and LCM of subsets
|
von zur Gathen, Joachim
|
|
2015
|
115 |
2 |
p. 134-138
5 p.
|
artikel
|
| 30 |
Comments on the hierarchically structured bin packing problem
|
Lambert, Thomas
|
|
2015
|
115 |
2 |
p. 306-309
4 p.
|
artikel
|
| 31 |
Completeness of context-sensitive rewriting
|
Lucas, Salvador
|
|
2015
|
115 |
2 |
p. 87-92
6 p.
|
artikel
|
| 32 |
Computing the pathwidth of directed graphs with small vertex cover
|
Kobayashi, Yasuaki
|
|
2015
|
115 |
2 |
p. 310-312
3 p.
|
artikel
|
| 33 |
Convergence of best-response dynamics in games with conflicting congestion effects
|
Feldman, Michal
|
|
2015
|
115 |
2 |
p. 112-118
7 p.
|
artikel
|
| 34 |
Credibility decay model in temporal evidence combination
|
Song, Yafei
|
|
2015
|
115 |
2 |
p. 248-252
5 p.
|
artikel
|
| 35 |
3D depth information extraction with omni-directional camera
|
Jia, Tong
|
|
2015
|
115 |
2 |
p. 285-291
7 p.
|
artikel
|
| 36 |
Detecting monomials with k distinct variables
|
Floderus, Peter
|
|
2015
|
115 |
2 |
p. 82-86
5 p.
|
artikel
|
| 37 |
Dynamic pricing of call rates: Bayesian approach
|
Dugar, Chetan
|
|
2015
|
115 |
2 |
p. 237-242
6 p.
|
artikel
|
| 38 |
Editorial Board
|
|
|
2015
|
115 |
2 |
p. IFC-
1 p.
|
artikel
|
| 39 |
Eliminability of cut in hypersequent calculi for some modal logics of linear frames
|
Indrzejczak, Andrzej
|
|
2015
|
115 |
2 |
p. 75-81
7 p.
|
artikel
|
| 40 |
Greedily computing associative aggregations on sliding windows
|
Basin, David
|
|
2015
|
115 |
2 |
p. 186-192
7 p.
|
artikel
|
| 41 |
Improved analysis of D 2 -sampling based PTAS for k-means and other clustering problems
|
Jaiswal, Ragesh
|
|
2015
|
115 |
2 |
p. 100-103
4 p.
|
artikel
|
| 42 |
k-Attribute-Anonymity is hard even for k = 2
|
Scott, Allan
|
|
2015
|
115 |
2 |
p. 368-370
3 p.
|
artikel
|
| 43 |
Minimax regret 1-sink location problem in dynamic cycle networks
|
Xu, Yinfeng
|
|
2015
|
115 |
2 |
p. 163-169
7 p.
|
artikel
|
| 44 |
Note on property M(k) of some complete multipartite graphs
|
Wang, Yanning
|
|
2015
|
115 |
2 |
p. 228-231
4 p.
|
artikel
|
| 45 |
Notes on a conjecture of Manoussakis concerning Hamilton cycles in digraphs
|
Ning, Bo
|
|
2015
|
115 |
2 |
p. 221-224
4 p.
|
artikel
|
| 46 |
On finding the longest antisymmetric path in directed acyclic graphs
|
Song, Yinglei
|
|
2015
|
115 |
2 |
p. 377-381
5 p.
|
artikel
|
| 47 |
On hypercube packings, blocking sets and a covering problem
|
Ashik Mathew, K.
|
|
2015
|
115 |
2 |
p. 141-145
5 p.
|
artikel
|
| 48 |
On packing arborescences in temporal networks
|
Kamiyama, Naoyuki
|
|
2015
|
115 |
2 |
p. 321-325
5 p.
|
artikel
|
| 49 |
On the decycling number of generalized Kautz digraphs
|
Lien, Min-Yun
|
|
2015
|
115 |
2 |
p. 209-211
3 p.
|
artikel
|
| 50 |
On the maximum acyclic subgraph problem under disjunctive constraints
|
Mapa, Sílvia Maria Santana
|
|
2015
|
115 |
2 |
p. 119-124
6 p.
|
artikel
|
| 51 |
Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs
|
Brandstädt, Andreas
|
|
2015
|
115 |
2 |
p. 256-262
7 p.
|
artikel
|
| 52 |
Reachability problems for Markov chains
|
Akshay, S.
|
|
2015
|
115 |
2 |
p. 155-158
4 p.
|
artikel
|
| 53 |
Routing and wavelength assignment for exchanged hypercubes in linear array optical networks
|
Liu, Yu-Liang
|
|
2015
|
115 |
2 |
p. 203-208
6 p.
|
artikel
|
| 54 |
The clique-transversal set problem in claw-free graphs with degree at most 4
|
Liang, Zuosong
|
|
2015
|
115 |
2 |
p. 331-335
5 p.
|
artikel
|
| 55 |
The complexity of the zero-sum 3-flows
|
Dehghan, Ali
|
|
2015
|
115 |
2 |
p. 316-320
5 p.
|
artikel
|
| 56 |
The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones
|
Janczewski, Robert
|
|
2015
|
115 |
2 |
p. 232-236
5 p.
|
artikel
|
| 57 |
The connectivity of exchanged crossed cube
|
Ning, Wantao
|
|
2015
|
115 |
2 |
p. 394-396
3 p.
|
artikel
|
| 58 |
The hamiltonicity of generalized honeycomb torus networks
|
Dong, Qiang
|
|
2015
|
115 |
2 |
p. 104-111
8 p.
|
artikel
|
| 59 |
The pessimistic diagnosability of alternating group graphs under the PMC model
|
Tsai, Chang-Hsiung
|
|
2015
|
115 |
2 |
p. 151-154
4 p.
|
artikel
|
| 60 |
The strong chromatic index of sparse graphs
|
Dębski, Michał
|
|
2015
|
115 |
2 |
p. 326-330
5 p.
|
artikel
|
| 61 |
The termination of the higher-dimensional tarai functions
|
Ishiu, Tetsuya
|
|
2015
|
115 |
2 |
p. 125-127
3 p.
|
artikel
|
| 62 |
Topological additive numbering of directed acyclic graphs
|
Marenco, Javier
|
|
2015
|
115 |
2 |
p. 199-202
4 p.
|
artikel
|
| 63 |
Topological sorts on DAGs
|
Pang, Chaoyi
|
|
2015
|
115 |
2 |
p. 298-301
4 p.
|
artikel
|
| 64 |
Trace-based schedulability analysis to enhance passive side-channel attack resilience of embedded software
|
Agosta, Giovanni
|
|
2015
|
115 |
2 |
p. 292-297
6 p.
|
artikel
|
| 65 |
Using static suffix array in dynamic application: Case of text compression by longest first substitution
|
Ristov, Strahil
|
|
2015
|
115 |
2 |
p. 175-181
7 p.
|
artikel
|
Tijdschrift beschrijving