nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Editorial Board
|
|
|
2011 |
111 |
20 |
p. IFC- 1 p. |
artikel |
2 |
Extending H 1 -clauses with disequalities
|
Seidl, Helmut |
|
2011 |
111 |
20 |
p. 1007-1013 7 p. |
artikel |
3 |
Finding multiple induced disjoint paths in general graphs
|
Zhang, Kejia |
|
2011 |
111 |
20 |
p. 1022-1026 5 p. |
artikel |
4 |
How many oblivious robots can explore a line
|
Flocchini, Paola |
|
2011 |
111 |
20 |
p. 1027-1031 5 p. |
artikel |
5 |
Low-level dichotomy for quantified constraint satisfaction problems
|
Martin, Barnaby |
|
2011 |
111 |
20 |
p. 999-1003 5 p. |
artikel |
6 |
Modular instantiation schemes
|
Echenim, Mnacho |
|
2011 |
111 |
20 |
p. 989-993 5 p. |
artikel |
7 |
On edge covering colorings of graphs
|
Zhang, Xia |
|
2011 |
111 |
20 |
p. 1004-1006 3 p. |
artikel |
8 |
Some results on Parametric Temporal Logic
|
Dixit, Manoj G. |
|
2011 |
111 |
20 |
p. 994-998 5 p. |
artikel |
9 |
The minimum bandwidth required at each time slot of the fast broadcasting scheme
|
Wu, Chih-Jen |
|
2011 |
111 |
20 |
p. 1014-1018 5 p. |
artikel |
10 |
Threshold behaviors of a random constraint satisfaction problem with exact phase transitions
|
Zhao, Chunyan |
|
2011 |
111 |
20 |
p. 985-988 4 p. |
artikel |
11 |
Total coloring of planar graphs with maximum degree 7
|
Wang, Bing |
|
2011 |
111 |
20 |
p. 1019-1021 3 p. |
artikel |