| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Computing the Map of Geometric Minimal Cuts
|
Xu, Jinhui
|
|
2012
|
68 |
4 |
p. 805-834
|
artikel
|
| 2 |
Constructing Minimal Phylogenetic Networks from Softwired Clusters is Fixed Parameter Tractable
|
Kelk, Steven
|
|
2012
|
68 |
4 |
p. 886-915
|
artikel
|
| 3 |
Dominating Induced Matchings for P7-Free Graphs in Linear Time
|
Brandstädt, Andreas
|
|
2012
|
68 |
4 |
p. 998-1018
|
artikel
|
| 4 |
Fast Sequential Importance Sampling to Estimate the Graph Reliability Polynomial
|
Harris, David G.
|
|
2012
|
68 |
4 |
p. 916-939
|
artikel
|
| 5 |
Improved Approximation Algorithms for the Average-Case Tree Searching Problem
|
Cicalese, Ferdinando
|
|
2012
|
68 |
4 |
p. 1045-1074
|
artikel
|
| 6 |
2-Layer Right Angle Crossing Drawings
|
Di Giacomo, Emilio
|
|
2012
|
68 |
4 |
p. 954-997
|
artikel
|
| 7 |
On Cutwidth Parameterized by Vertex Cover
|
Cygan, Marek
|
|
2012
|
68 |
4 |
p. 940-953
|
artikel
|
| 8 |
Online Square Packing with Gravity
|
Fekete, Sándor P.
|
|
2012
|
68 |
4 |
p. 1019-1044
|
artikel
|
| 9 |
On the Complexity of Time-Dependent Shortest Paths
|
Foschini, Luca
|
|
2012
|
68 |
4 |
p. 1075-1097
|
artikel
|
| 10 |
Orthogonal Graph Drawing with Flexibility Constraints
|
Bläsius, Thomas
|
|
2012
|
68 |
4 |
p. 859-885
|
artikel
|
| 11 |
Spin-the-Bottle Sort and Annealing Sort: Oblivious Sorting via Round-Robin Random Comparisons
|
Goodrich, Michael T.
|
|
2012
|
68 |
4 |
p. 835-858
|
artikel
|
Tijdschrift beschrijving