nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A Lagrangian heuristic for a train-unit assignment problem
|
Cacchiani, Valentina |
|
2013 |
161 |
12 |
p. 1707-1718 12 p. |
artikel |
2 |
A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph
|
Panda, B.S. |
|
2013 |
161 |
12 |
p. 1776-1783 8 p. |
artikel |
3 |
Approximating independent set in perturbed graphs
|
Manthey, Bodo |
|
2013 |
161 |
12 |
p. 1761-1768 8 p. |
artikel |
4 |
Bisimplicial edges in bipartite graphs
|
Bomhoff, Matthijs |
|
2013 |
161 |
12 |
p. 1699-1706 8 p. |
artikel |
5 |
Contents
|
|
|
2013 |
161 |
12 |
p. v-vi nvt p. |
artikel |
6 |
Graph models and their efficient implementation for sparse Jacobian matrix determination
|
Hossain, Shahadat |
|
2013 |
161 |
12 |
p. 1747-1754 8 p. |
artikel |
7 |
L ( 2 , 1 ) -labeling of oriented planar graphs
|
Calamoneri, T. |
|
2013 |
161 |
12 |
p. 1719-1725 7 p. |
artikel |
8 |
Mixed fault diameter of Cartesian graph bundles
|
Erveš, Rija |
|
2013 |
161 |
12 |
p. 1726-1733 8 p. |
artikel |
9 |
Packing paths: Recycling saves time
|
Binkele-Raible, Daniel |
|
2013 |
161 |
12 |
p. 1686-1698 13 p. |
artikel |
10 |
Prescribed edges and forbidden edges for a cycle in a planar graph
|
Göring, Frank |
|
2013 |
161 |
12 |
p. 1734-1738 5 p. |
artikel |
11 |
Rainbow connection and minimum degree
|
Schiermeyer, Ingo |
|
2013 |
161 |
12 |
p. 1784-1787 4 p. |
artikel |
12 |
Rectilinear paths with minimum segment lengths
|
Maßberg, Jens |
|
2013 |
161 |
12 |
p. 1769-1775 7 p. |
artikel |
13 |
Some bounds on global alliances in trees
|
Harutyunyan, Ararat |
|
2013 |
161 |
12 |
p. 1739-1746 8 p. |
artikel |
14 |
9th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2010)
|
Faigle, Ulrich |
|
2013 |
161 |
12 |
p. 1673- 1 p. |
artikel |
15 |
The competition number of the complement of a cycle
|
Kim, Suh-Ryung |
|
2013 |
161 |
12 |
p. 1755-1760 6 p. |
artikel |
16 |
Watching systems in graphs: An extension of identifying codes
|
Auger, David |
|
2013 |
161 |
12 |
p. 1674-1685 12 p. |
artikel |