| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
An improved reliability bound of a probabilistic parallel integer sorting algorithm
|
Gerbessiotis, Alexandros V.
|
|
2012
|
112 |
24 |
p. 976-979
4 p.
|
article
|
| 2 |
Characterization and recognition of Radon-independent sets in split graphs
|
Dourado, Mitre C.
|
|
2012
|
112 |
24 |
p. 948-952
5 p.
|
article
|
| 3 |
Computing all subtree repeats in ordered trees
|
Christou, Michalis
|
|
2012
|
112 |
24 |
p. 958-962
5 p.
|
article
|
| 4 |
Decidability of well-connectedness for distributed synthesis
|
Gastin, Paul
|
|
2012
|
112 |
24 |
p. 963-968
6 p.
|
article
|
| 5 |
Eccentric counts, connectivity and chordality
|
Dankelmann, Peter
|
|
2012
|
112 |
24 |
p. 944-947
4 p.
|
article
|
| 6 |
Editorial Board
|
|
|
2012
|
112 |
24 |
p. IFC-
1 p.
|
article
|
| 7 |
Non-extendible latin parallelepipeds
|
Kochol, Martin
|
|
2012
|
112 |
24 |
p. 942-943
2 p.
|
article
|
| 8 |
The complexity of connected dominating sets and total dominating sets with specified induced subgraphs
|
Schaudt, Oliver
|
|
2012
|
112 |
24 |
p. 953-957
5 p.
|
article
|
| 9 |
The non-uniform Bounded Degree Minimum Diameter Spanning Tree problem with an application in P2P networking
|
Chawachat, Jakarin
|
|
2012
|
112 |
24 |
p. 937-941
5 p.
|
article
|
| 10 |
Towards a tight hardness–randomness connection between permanent and arithmetic circuit identity testing
|
Jansen, Maurice
|
|
2012
|
112 |
24 |
p. 969-975
7 p.
|
article
|
Journal description