nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Adjusted Interval Digraphs
|
Feder, Tomás |
|
2009 |
32 |
C |
p. 83-91 9 p. |
artikel |
2 |
A new representation of proper interval graphs with an application to clique-width
|
Heggernes, Pinar |
|
2009 |
32 |
C |
p. 27-34 8 p. |
artikel |
3 |
A Polynomial-time Algorithm for the Dominating Induced Matching Problem in the Class of Convex Graphs
|
Korpelainen, Nicholas |
|
2009 |
32 |
C |
p. 133-140 8 p. |
artikel |
4 |
Asteroids in rooted and directed path graphs
|
Cameron, Kathie |
|
2009 |
32 |
C |
p. 67-74 8 p. |
artikel |
5 |
Collective Tree Spanners for Unit Disk Graphs with Applications
|
Dragan, Feodor F. |
|
2009 |
32 |
C |
p. 117-124 8 p. |
artikel |
6 |
DIMAP Workshop on Algorithmic Graph Theory
|
Koster, Arie |
|
2009 |
32 |
C |
p. 1- 1 p. |
artikel |
7 |
Finding good tree decompositions by local search
|
van Hoesel, Stan |
|
2009 |
32 |
C |
p. 43-50 8 p. |
artikel |
8 |
Linear Algorithms for Chordal Graphs of Bounded Directed Vertex Leafage
|
Habib, Michel |
|
2009 |
32 |
C |
p. 99-108 10 p. |
artikel |
9 |
Min-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio
|
Deineko, Vladimir |
|
2009 |
32 |
C |
p. 19-26 8 p. |
artikel |
10 |
On Generating Triangle-Free Graphs
|
Brügmann, Daniel |
|
2009 |
32 |
C |
p. 51-58 8 p. |
artikel |
11 |
On planar graphs with large tree-width and small grid minors
|
Grigoriev, Alexander |
|
2009 |
32 |
C |
p. 35-42 8 p. |
artikel |
12 |
On Rerouting Connection Requests in Networks with Shared Bandwidth
|
Coudert, David |
|
2009 |
32 |
C |
p. 109-116 8 p. |
artikel |
13 |
On some simplicial elimination schemes for chordal graphs
|
Habib, Michel |
|
2009 |
32 |
C |
p. 125-132 8 p. |
artikel |
14 |
On the Convexity of Paths of Length Two in Undirected Graphs
|
Centeno, Carmen C. |
|
2009 |
32 |
C |
p. 11-18 8 p. |
artikel |
15 |
Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems
|
Gutin, Gregory |
|
2009 |
32 |
C |
p. 75-82 8 p. |
artikel |
16 |
Spectral upper bounds on the size of k-regular induced subgraphs
|
Cardoso, Domingos M. |
|
2009 |
32 |
C |
p. 3-10 8 p. |
artikel |
17 |
Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs
|
Sau, Ignasi |
|
2009 |
32 |
C |
p. 59-66 8 p. |
artikel |
18 |
Tree-width of graphs and surface duality
|
Mazoit, Frédéric |
|
2009 |
32 |
C |
p. 93-97 5 p. |
artikel |