| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A characterization of tree-like Resolution size
|
Beyersdorff, Olaf
|
|
2013
|
|
18 |
p. 666-671
6 p.
|
artikel
|
| 2 |
A closed-form solution to video matting of natural snow
|
Liu, Hai
|
|
2009
|
|
18 |
p. 1097-1104
8 p.
|
artikel
|
| 3 |
A concise proof for total coloring subcubic graphs
|
Feng, Yun
|
|
2013
|
|
18 |
p. 664-665
2 p.
|
artikel
|
| 4 |
A lower-variance randomized algorithm for approximate string matching
|
Atallah, Mikhail J.
|
|
2013
|
|
18 |
p. 690-692
3 p.
|
artikel
|
| 5 |
A multiple-file write scheme for improving write performance of small files in Fast File System
|
Ahn, Woo Hyun
|
|
2009
|
|
18 |
p. 1021-1026
6 p.
|
artikel
|
| 6 |
An improved approximation lower bound for finding almost stable maximum matchings
|
Hamada, Koki
|
|
2009
|
|
18 |
p. 1036-1040
5 p.
|
artikel
|
| 7 |
A note on the Cornaz–Jost transformation to solve the graph coloring problem
|
Bonomo, Flavia
|
|
2013
|
|
18 |
p. 649-652
4 p.
|
artikel
|
| 8 |
A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs
|
Panda, B.S.
|
|
2009
|
|
18 |
p. 1041-1046
6 p.
|
artikel
|
| 9 |
A simple algorithm to find Hamiltonian cycles in proper interval graphs
|
Ibarra, Louis
|
|
2009
|
|
18 |
p. 1105-1108
4 p.
|
artikel
|
| 10 |
A simplified way of proving trade-off results for resolution
|
Nordström, Jakob
|
|
2009
|
|
18 |
p. 1030-1035
6 p.
|
artikel
|
| 11 |
A strict strong coloring of trees
|
Haddad, Mohammed
|
|
2009
|
|
18 |
p. 1047-1054
8 p.
|
artikel
|
| 12 |
Binary trees with choosable edge lengths
|
Maßberg, Jens
|
|
2009
|
|
18 |
p. 1087-1092
6 p.
|
artikel
|
| 13 |
Computing the subset partial order for dense families of sets
|
Elmasry, Amr
|
|
2009
|
|
18 |
p. 1082-1086
5 p.
|
artikel
|
| 14 |
Edge-coloring almost bipartite multigraphs
|
Feder, Tomás
|
|
2013
|
|
18 |
p. 685-689
5 p.
|
artikel
|
| 15 |
Editorial Board
|
|
|
2009
|
|
18 |
p. IFC-
1 p.
|
artikel
|
| 16 |
Editorial Board
|
|
|
2013
|
|
18 |
p. IFC-
1 p.
|
artikel
|
| 17 |
Editorial Board
|
|
|
2011
|
|
18 |
p. IFC-
1 p.
|
artikel
|
| 18 |
Errata for “Faster index for property matching”
|
Juan, M.T.
|
|
2009
|
|
18 |
p. 1027-1029
3 p.
|
artikel
|
| 19 |
Erratum and addendum to “A linear time algorithm for finding all hinge vertices of a permutation graph” [Information Processing Letters 59 (2) (1996) 103–107]
|
Honma, Hirotoshi
|
|
2011
|
|
18 |
p. 891-894
4 p.
|
artikel
|
| 20 |
Finding the longest common nonsuperstring in linear time
|
Na, Joong Chae
|
|
2009
|
|
18 |
p. 1066-1070
5 p.
|
artikel
|
| 21 |
Improved algorithm for the widest empty 1-corner corridor
|
Das, Gautam K.
|
|
2009
|
|
18 |
p. 1060-1065
6 p.
|
artikel
|
| 22 |
Improved efficiency of Kiltz07-KEM
|
Lu, Xianhui
|
|
2009
|
|
18 |
p. 1093-1096
4 p.
|
artikel
|
| 23 |
Independent spanning trees in crossed cubes
|
Zhang, Yan-Hong
|
|
2013
|
|
18 |
p. 653-658
6 p.
|
artikel
|
| 24 |
Low complexity energy efficient very low bit-rate image compression scheme for wireless sensor network
|
Phamila Y, Asnath Victy
|
|
2013
|
|
18 |
p. 672-676
5 p.
|
artikel
|
| 25 |
Lower bounds for context-free grammars
|
Filmus, Yuval
|
|
2011
|
|
18 |
p. 895-898
4 p.
|
artikel
|
| 26 |
Lucky labelings of graphs
|
Czerwiński, Sebastian
|
|
2009
|
|
18 |
p. 1078-1081
4 p.
|
artikel
|
| 27 |
On constant-round concurrent non-malleable proof systems
|
Cao, Zhenfu
|
|
2011
|
|
18 |
p. 883-890
8 p.
|
artikel
|
| 28 |
One conjecture of bubble-sort graphs
|
Shi, Hai-zhong
|
|
2011
|
|
18 |
p. 926-929
4 p.
|
artikel
|
| 29 |
On edge connectivity of direct products of graphs
|
Cao, Xiang-Lan
|
|
2011
|
|
18 |
p. 899-902
4 p.
|
artikel
|
| 30 |
On extending de Bruijn sequences
|
Becher, Verónica
|
|
2011
|
|
18 |
p. 930-932
3 p.
|
artikel
|
| 31 |
Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time
|
Li, Wenhua
|
|
2011
|
|
18 |
p. 907-911
5 p.
|
artikel
|
| 32 |
Planar graphs with cycles of length neither 4 nor 6 are ( 2 , 0 , 0 ) -colorable
|
Wang, Yingqian
|
|
2013
|
|
18 |
p. 659-663
5 p.
|
artikel
|
| 33 |
Routing and wavelength assignment for 3-ary n-cube communication patterns in linear array optical networks for n communication rounds
|
Yu, Cui
|
|
2013
|
|
18 |
p. 677-680
4 p.
|
artikel
|
| 34 |
Stabilizing data-link over non-FIFO channels with optimal fault-resilience
|
Dolev, Shlomi
|
|
2011
|
|
18 |
p. 912-920
9 p.
|
artikel
|
| 35 |
The burst factor and its impact on buffer performance
|
Steyaert, Bart
|
|
2013
|
|
18 |
p. 681-684
4 p.
|
artikel
|
| 36 |
The complexity of propositional implication
|
Beyersdorff, Olaf
|
|
2009
|
|
18 |
p. 1071-1077
7 p.
|
artikel
|
| 37 |
The ski-rental problem with multiple discount options
|
Zhang, Guiqing
|
|
2011
|
|
18 |
p. 903-906
4 p.
|
artikel
|
| 38 |
Time-bounded incompressibility of compressible strings and sequences
|
Daylight, Edgar G.
|
|
2009
|
|
18 |
p. 1055-1059
5 p.
|
artikel
|
| 39 |
Wirelength of 1-fault hamiltonian graphs into wheels and fans
|
Arockiaraj, M.
|
|
2011
|
|
18 |
p. 921-925
5 p.
|
artikel
|
Tijdschrift beschrijving