nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A generalization of extension complexity that captures P
|
Avis, David |
|
2015 |
|
6-8 |
p. 588-593 6 p. |
artikel |
2 |
Alternative formulations for the ordered weighted averaging objective
|
Chassein, André |
|
2015 |
|
6-8 |
p. 604-608 5 p. |
artikel |
3 |
Analysis of false-reject probability in distance bounding protocols with mixed challenges over RFID noisy communication channel
|
Jannati, Hoda |
|
2015 |
|
6-8 |
p. 623-629 7 p. |
artikel |
4 |
An O ( 1 ) -approximation algorithm for the 2-dimensional geometric freeze-tag problem
|
Yazdi, Ehsan Najafi |
|
2015 |
|
6-8 |
p. 618-622 5 p. |
artikel |
5 |
A note on the longest common substring with k-mismatches problem
|
Grabowski, Szymon |
|
2015 |
|
6-8 |
p. 640-642 3 p. |
artikel |
6 |
A note on the PageRank of undirected graphs
|
Grolmusz, Vince |
|
2015 |
|
6-8 |
p. 633-634 2 p. |
artikel |
7 |
A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to P 4 -sparse graphs
|
Bonomo, Flavia |
|
2015 |
|
6-8 |
p. 600-603 4 p. |
artikel |
8 |
Approximating decision trees with value dependent testing costs
|
Saettler, Aline |
|
2015 |
|
6-8 |
p. 594-599 6 p. |
artikel |
9 |
Computing the Gromov hyperbolicity of a discrete metric space
|
Fournier, Hervé |
|
2015 |
|
6-8 |
p. 576-579 4 p. |
artikel |
10 |
Downhill domination problem in graphs
|
Chen, Xue-gang |
|
2015 |
|
6-8 |
p. 580-581 2 p. |
artikel |
11 |
Editorial Board
|
|
|
2015 |
|
6-8 |
p. IFC- 1 p. |
artikel |
12 |
Improved reconstruction of RSA private-keys from their fraction
|
Imai, Shigeyoshi |
|
2015 |
|
6-8 |
p. 630-632 3 p. |
artikel |
13 |
Longest common substrings with k mismatches
|
Flouri, Tomas |
|
2015 |
|
6-8 |
p. 643-647 5 p. |
artikel |
14 |
On Hamiltonian properties of unidirectional hypercubes
|
Hung, Chun-Nan |
|
2015 |
|
6-8 |
p. 551-555 5 p. |
artikel |
15 |
On the complexity of { k } -domination and k-tuple domination in graphs
|
Argiroffo, Gabriela |
|
2015 |
|
6-8 |
p. 556-561 6 p. |
artikel |
16 |
Packing items into several bins facilitates approximating the separable assignment problem
|
Bender, Marco |
|
2015 |
|
6-8 |
p. 570-575 6 p. |
artikel |
17 |
Polynomial-time local-improvement algorithm for Consecutive Block Minimization
|
Haddadi, S. |
|
2015 |
|
6-8 |
p. 612-617 6 p. |
artikel |
18 |
Self-stabilizing distributed algorithm for local mutual inclusion
|
Kakugawa, Hirotsugu |
|
2015 |
|
6-8 |
p. 562-569 8 p. |
artikel |
19 |
Sequence annotation with HMMs: New problems and their complexity
|
Nánási, Michal |
|
2015 |
|
6-8 |
p. 635-639 5 p. |
artikel |
20 |
The Eternal Dominating Set problem for proper interval graphs
|
Braga, Andrei |
|
2015 |
|
6-8 |
p. 582-587 6 p. |
artikel |
21 |
The exact complexity of the infinite Post Correspondence Problem
|
Finkel, Olivier |
|
2015 |
|
6-8 |
p. 609-611 3 p. |
artikel |