| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A multi-cycle checkpointing protocol that ensures strict 1-rollback
|
Ci, Yi-Wei
|
|
2012
|
112 |
20 |
p. 788-793
6 p.
|
article
|
| 2 |
A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix
|
Malekesmaeili, Mehrnoush
|
|
2012
|
112 |
20 |
p. 799-803
5 p.
|
article
|
| 3 |
Batch scheduling of identical jobs on parallel identical machines
|
Mor, Baruch
|
|
2012
|
112 |
20 |
p. 762-766
5 p.
|
article
|
| 4 |
Clique problem, cutting plane proofs and communication complexity
|
Jukna, Stasys
|
|
2012
|
112 |
20 |
p. 772-777
6 p.
|
article
|
| 5 |
Editorial Board
|
|
|
2012
|
112 |
20 |
p. IFC-
1 p.
|
article
|
| 6 |
HORSIC: An efficient one-time signature scheme for wireless sensor networks
|
Lee, Jaeheung
|
|
2012
|
112 |
20 |
p. 783-787
5 p.
|
article
|
| 7 |
Lossy trapdoor functions from homomorphic reproducible encryption
|
Choi, Seung Geol
|
|
2012
|
112 |
20 |
p. 794-798
5 p.
|
article
|
| 8 |
Pancyclic out-arcs of a vertex in oriented graphs
|
Guo, Qiaoping
|
|
2012
|
112 |
20 |
p. 759-761
3 p.
|
article
|
| 9 |
The art gallery theorem for simple polygons in terms of the number of reflex and convex vertices
|
Iwerks, Justin
|
|
2012
|
112 |
20 |
p. 778-782
5 p.
|
article
|
| 10 |
The linear arboricity of planar graphs with maximum degree at least 5
|
Chen, Hong-Yu
|
|
2012
|
112 |
20 |
p. 767-771
5 p.
|
article
|
Journal description