nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A kernelization algorithm for d-Hitting Set
|
Abu-Khzam, Faisal N. |
|
2010 |
76 |
7 |
p. 524-531 8 p. |
artikel |
2 |
Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem
|
Cohen, Nathann |
|
2010 |
76 |
7 |
p. 650-662 13 p. |
artikel |
3 |
Causal graphs and structurally restricted planning
|
Chen, Hubie |
|
2010 |
76 |
7 |
p. 579-592 14 p. |
artikel |
4 |
Comparing trees via crossing minimization
|
Fernau, Henning |
|
2010 |
76 |
7 |
p. 593-608 16 p. |
artikel |
5 |
Contents
|
|
|
2010 |
76 |
7 |
p. OBC- 1 p. |
artikel |
6 |
Counting complexity of propositional abduction
|
Hermann, Miki |
|
2010 |
76 |
7 |
p. 634-649 16 p. |
artikel |
7 |
Editorial Board
|
|
|
2010 |
76 |
7 |
p. IFC- 1 p. |
artikel |
8 |
Fuzzy relation equations and reduction of fuzzy automata
|
Ćirić, Miroslav |
|
2010 |
76 |
7 |
p. 609-633 25 p. |
artikel |
9 |
Generalized modal satisfiability
|
Hemaspaandra, Edith |
|
2010 |
76 |
7 |
p. 561-578 18 p. |
artikel |
10 |
Hashing and canonicalizing Notation 3 graphs
|
Fisteus, Jesus Arias |
|
2010 |
76 |
7 |
p. 663-685 23 p. |
artikel |
11 |
Isomorphism and canonization of tournaments and hypertournaments
|
Arvind, V. |
|
2010 |
76 |
7 |
p. 509-523 15 p. |
artikel |
12 |
Simplified proof of the blocking theorem for free-choice Petri nets
|
Wehler, Joachim |
|
2010 |
76 |
7 |
p. 532-537 6 p. |
artikel |
13 |
Thresholding random geometric graph properties motivated by ad hoc sensor networks
|
Muthukrishnan, S. |
|
2010 |
76 |
7 |
p. 686-696 11 p. |
artikel |
14 |
Trajectory databases: Data models, uncertainty and complete query languages
|
Kuijpers, Bart |
|
2010 |
76 |
7 |
p. 538-560 23 p. |
artikel |