nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
About equivalent interval colorings of weighted graphs
|
Bouchard, Mathieu |
|
2009 |
31-40 |
17 |
p. 3615-3624 10 p. |
artikel |
2 |
A clique-difference encoding scheme for labelled k -path graphs
|
Pereira, P.R.C. |
|
2008 |
31-40 |
17 |
p. 3216-3222 7 p. |
artikel |
3 |
A factorization of the symmetric Pascal matrix involving the Fibonacci matrix
|
Zhang, Zhizheng |
|
2007 |
31-40 |
17 |
p. 2371-2376 6 p. |
artikel |
4 |
A fast algorithm for multiplying min-sum permutations
|
Sakai, Yoshifumi |
|
2011 |
31-40 |
17 |
p. 2175-2183 9 p. |
artikel |
5 |
A generic approach to proving NP-hardness of partition type problems
|
Kovalyov, Mikhail Y. |
|
2010 |
31-40 |
17 |
p. 1908-1912 5 p. |
artikel |
6 |
A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints
|
Giaro, K. |
|
2009 |
31-40 |
17 |
p. 3625-3630 6 p. |
artikel |
7 |
An analysis of the redundancy of graph invariants used in chemoinformatics
|
Hollas, Boris |
|
2006 |
31-40 |
17 |
p. 2484-2498 15 p. |
artikel |
8 |
An axiomatic study of Majority-rule (+ ) and associated consensus functions on hierarchies
|
Dong, Jianrong |
|
2011 |
31-40 |
17 |
p. 2038-2044 7 p. |
artikel |
9 |
An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths
|
Kamiyama, Naoyuki |
|
2009 |
31-40 |
17 |
p. 3665-3677 13 p. |
artikel |
10 |
An efficient algorithm for the three-guard problem
|
Tan, Xuehou |
|
2008 |
31-40 |
17 |
p. 3312-3324 13 p. |
artikel |
11 |
A new characterization of dual bases in finite fields and its applications
|
Cao, Wei |
|
2007 |
31-40 |
17 |
p. 2236-2241 6 p. |
artikel |
12 |
A new formulation for the Traveling Deliveryman Problem
|
Méndez-Díaz, Isabel |
|
2008 |
31-40 |
17 |
p. 3223-3237 15 p. |
artikel |
13 |
A new neighborhood and tabu search for the Blocking Job Shop
|
Gröflin, Heinz |
|
2009 |
31-40 |
17 |
p. 3643-3655 13 p. |
artikel |
14 |
Approximating maximum edge 2-coloring in simple graphs
|
Chen, Zhi-Zhong |
|
2010 |
31-40 |
17 |
p. 1894-1901 8 p. |
artikel |
15 |
Approximating the fixed linear crossing number
|
Cimikowski, Robert |
|
2007 |
31-40 |
17 |
p. 2202-2210 9 p. |
artikel |
16 |
Approximating the maximum 2- and 3-edge-colorable subgraph problems
|
Kosowski, Adrian |
|
2009 |
31-40 |
17 |
p. 3593-3600 8 p. |
artikel |
17 |
Approximation algorithms for group prize-collecting and location-routing problems
|
Glicksman, Hagai |
|
2008 |
31-40 |
17 |
p. 3238-3247 10 p. |
artikel |
18 |
Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms
|
Bourgeois, Nicolas |
|
2011 |
31-40 |
17 |
p. 1954-1970 17 p. |
artikel |
19 |
A sufficient condition for boundedness of tolerance graphs
|
Eisermann, Birk |
|
2011 |
31-40 |
17 |
p. 2165-2169 5 p. |
artikel |
20 |
Axiomatic characterizations of the symmetric coalitional binomial semivalues
|
Alonso-Meijide, José María |
|
2007 |
31-40 |
17 |
p. 2282-2293 12 p. |
artikel |
21 |
Bicolored graph partitioning, or: gerrymandering at its worst
|
Apollonio, N. |
|
2009 |
31-40 |
17 |
p. 3601-3614 14 p. |
artikel |
22 |
Cancellation properties of products of graphs
|
Imrich, Wilfried |
|
2007 |
31-40 |
17 |
p. 2362-2364 3 p. |
artikel |
23 |
Claw-free graphs with strongly perfect complements. Fractional and integral version. Part I. Basic graphs
|
Chudnovsky, Maria |
|
2011 |
31-40 |
17 |
p. 1971-1995 25 p. |
artikel |
24 |
Claw-free graphs with strongly perfect complements. Fractional and integral version, Part II: Nontrivial strip-structures
|
Chudnovsky, Maria |
|
2011 |
31-40 |
17 |
p. 1996-2029 34 p. |
artikel |
25 |
λ -Coloring matrogenic graphs
|
Calamoneri, Tiziana |
|
2006 |
31-40 |
17 |
p. 2445-2457 13 p. |
artikel |
26 |
Consecutive edge-coloring of the generalized θ -graph
|
Feng, Yongde |
|
2007 |
31-40 |
17 |
p. 2321-2327 7 p. |
artikel |
27 |
Constructions for normal graphs and some consequences
|
Wagler, Annegret |
|
2008 |
31-40 |
17 |
p. 3329-3338 10 p. |
artikel |
28 |
Constructive extensions of two results on graphic sequences
|
Garg, Ankit |
|
2011 |
31-40 |
17 |
p. 2170-2174 5 p. |
artikel |
29 |
Contents
|
|
|
2009 |
31-40 |
17 |
p. vii-viii nvt p. |
artikel |
30 |
Contents
|
|
|
2010 |
31-40 |
17 |
p. v- 1 p. |
artikel |
31 |
Contents
|
|
|
2006 |
31-40 |
17 |
p. vii- 1 p. |
artikel |
32 |
Contents
|
|
|
2007 |
31-40 |
17 |
p. vii-viii nvt p. |
artikel |
33 |
Contents
|
|
|
2008 |
31-40 |
17 |
p. v-vi nvt p. |
artikel |
34 |
Contents
|
|
|
2011 |
31-40 |
17 |
p. v-vi nvt p. |
artikel |
35 |
Corrections of proofs for Hansen and Mélot's two theorems
|
Li, Xueliang |
|
2007 |
31-40 |
17 |
p. 2365-2370 6 p. |
artikel |
36 |
Counting preimages of TCP reordering patterns
|
Hansson, Anders |
|
2008 |
31-40 |
17 |
p. 3187-3193 7 p. |
artikel |
37 |
Covering line graphs with equivalence relations
|
Esperet, Louis |
|
2010 |
31-40 |
17 |
p. 1902-1907 6 p. |
artikel |
38 |
Detecting induced subgraphs
|
Lévêque, Benjamin |
|
2009 |
31-40 |
17 |
p. 3540-3551 12 p. |
artikel |
39 |
Digraph matrix partitions and trigraph homomorphisms
|
Feder, Tomás |
|
2006 |
31-40 |
17 |
p. 2458-2469 12 p. |
artikel |
40 |
Discrete approximations to real-valued leaf sequencing problems in radiation therapy
|
Gunawardena, Athula |
|
2008 |
31-40 |
17 |
p. 3178-3186 9 p. |
artikel |
41 |
Disjoint paths in sparse graphs
|
Bentz, Cédric |
|
2009 |
31-40 |
17 |
p. 3558-3568 11 p. |
artikel |
42 |
Dynamic list coloring of bipartite graphs
|
Esperet, Louis |
|
2010 |
31-40 |
17 |
p. 1963-1965 3 p. |
artikel |
43 |
Editorial Board
|
|
|
2009 |
31-40 |
17 |
p. v-vi nvt p. |
artikel |
44 |
Editorial Board
|
|
|
2006 |
31-40 |
17 |
p. v-vi nvt p. |
artikel |
45 |
Editorial Board
|
|
|
2007 |
31-40 |
17 |
p. v-vi nvt p. |
artikel |
46 |
Efficiency in exponential time for domination-type problems
|
Schiermeyer, Ingo |
|
2008 |
31-40 |
17 |
p. 3291-3297 7 p. |
artikel |
47 |
Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
|
Manuel, Paul |
|
2011 |
31-40 |
17 |
p. 2109-2116 8 p. |
artikel |
48 |
Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees
|
Katoh, Naoki |
|
2009 |
31-40 |
17 |
p. 3569-3585 17 p. |
artikel |
49 |
Enumerating ( 2 + 2 ) -free posets by the number of minimal elements and other statistics
|
Kitaev, Sergey |
|
2011 |
31-40 |
17 |
p. 2098-2108 11 p. |
artikel |
50 |
Equivalences and the complete hierarchy of intersection graphs of paths in a tree
|
Golumbic, Martin Charles |
|
2008 |
31-40 |
17 |
p. 3203-3215 13 p. |
artikel |
51 |
Exact algorithms for dominating set
|
van Rooij, Johan M.M. |
|
2011 |
31-40 |
17 |
p. 2147-2164 18 p. |
artikel |
52 |
Exact values of e x ( ν ; { C 3 , C 4 , … , C n } )
|
Abajo, E. |
|
2010 |
31-40 |
17 |
p. 1869-1878 10 p. |
artikel |
53 |
Extremal double hexagonal chains with respect to k-matchings and k-independent sets
|
Ren, Haizhen |
|
2007 |
31-40 |
17 |
p. 2269-2281 13 p. |
artikel |
54 |
Finding a minimum path cover of a distance-hereditary graph in polynomial time
|
Hung, Ruo-Wei |
|
2007 |
31-40 |
17 |
p. 2242-2256 15 p. |
artikel |
55 |
Finding induced trees
|
Derhy, N. |
|
2009 |
31-40 |
17 |
p. 3552-3557 6 p. |
artikel |
56 |
Fire containment in grids of dimension three and higher
|
Develin, Mike |
|
2007 |
31-40 |
17 |
p. 2257-2268 12 p. |
artikel |
57 |
Foreword
|
Gambardella, Luca Maria |
|
2009 |
31-40 |
17 |
p. 3495-3496 2 p. |
artikel |
58 |
Generalized sequences and k -independent sets in graphs
|
Włoch, Iwona |
|
2010 |
31-40 |
17 |
p. 1966-1970 5 p. |
artikel |
59 |
Geometric automorphism groups of graphs
|
Abelson, David |
|
2007 |
31-40 |
17 |
p. 2211-2226 16 p. |
artikel |
60 |
Graph reductions, binary rank, and pivots in gene assembly
|
Pflueger, Nathan |
|
2011 |
31-40 |
17 |
p. 2117-2134 18 p. |
artikel |
61 |
Guide for authors
|
|
|
2006 |
31-40 |
17 |
p. I-V nvt p. |
artikel |
62 |
Hamiltonicity and colorings of arrangement graphs
|
Felsner, Stefan |
|
2006 |
31-40 |
17 |
p. 2470-2483 14 p. |
artikel |
63 |
Hamiltonicity of 6-connected line graphs
|
Zhan, Mingquan |
|
2010 |
31-40 |
17 |
p. 1971-1975 5 p. |
artikel |
64 |
Hamiltonicity of regular graphs and blocks of consecutive ones in symmetric matrices
|
Wang, Rui |
|
2007 |
31-40 |
17 |
p. 2312-2320 9 p. |
artikel |
65 |
( k , j ) -coloring of sparse graphs
|
Borodin, O.V. |
|
2011 |
31-40 |
17 |
p. 1947-1953 7 p. |
artikel |
66 |
Lit-only σ -game on pseudo-trees
|
Wang, Xinmao |
|
2010 |
31-40 |
17 |
p. 1945-1952 8 p. |
artikel |
67 |
Nested hierarchies in planar graphs
|
Song, Won-Min |
|
2011 |
31-40 |
17 |
p. 2135-2146 12 p. |
artikel |
68 |
On a group testing problem: Characterization of graphs with 2-complexity c 2 and maximum number of edges
|
Gerzen, Tatjana |
|
2011 |
31-40 |
17 |
p. 2058-2068 11 p. |
artikel |
69 |
On a relation between the domination number and a strongly connected bidirection of an undirected graph
|
Lätsch, Martin |
|
2008 |
31-40 |
17 |
p. 3194-3202 9 p. |
artikel |
70 |
On bent functions with some symmetric properties
|
Zhao, Ying |
|
2006 |
31-40 |
17 |
p. 2537-2543 7 p. |
artikel |
71 |
On finding a large number of 3D points with a small diameter
|
Jiang, Minghui |
|
2007 |
31-40 |
17 |
p. 2355-2361 7 p. |
artikel |
72 |
On maximizing the profit of a satellite launcher: Selecting and scheduling tasks with time windows and setups
|
Meng-Gérard, J. |
|
2009 |
31-40 |
17 |
p. 3656-3664 9 p. |
artikel |
73 |
On mean distance and girth
|
Bekkai, Siham |
|
2010 |
31-40 |
17 |
p. 1888-1893 6 p. |
artikel |
74 |
On minimally b-imperfect graphs
|
Hoàng, Chính T. |
|
2009 |
31-40 |
17 |
p. 3519-3530 12 p. |
artikel |
75 |
On robust identification in the square and king grids
|
Laihonen, Tero |
|
2006 |
31-40 |
17 |
p. 2499-2510 12 p. |
artikel |
76 |
On self-duality of branchwidth in graphs of bounded genus
|
Sau, Ignasi |
|
2011 |
31-40 |
17 |
p. 2184-2186 3 p. |
artikel |
77 |
On the approximability of the Simplified Partial Digest Problem
|
Blazewicz, Jacek |
|
2009 |
31-40 |
17 |
p. 3586-3592 7 p. |
artikel |
78 |
On the complexity of some subgraph problems
|
Scozzari, Andrea |
|
2009 |
31-40 |
17 |
p. 3531-3539 9 p. |
artikel |
79 |
On the coverings of the d -cube for d ≤ 6
|
Emamy-K, M.R. |
|
2008 |
31-40 |
17 |
p. 3156-3165 10 p. |
artikel |
80 |
On the first geometric–arithmetic index of graphs
|
Das, K.Ch. |
|
2011 |
31-40 |
17 |
p. 2030-2037 8 p. |
artikel |
81 |
On the hole index of L(2,1)-labelings of r-regular graphs
|
Adams, Sarah Spence |
|
2007 |
31-40 |
17 |
p. 2391-2393 3 p. |
artikel |
82 |
On the least size of a graph with a given degree set
|
Tripathi, Amitabha |
|
2006 |
31-40 |
17 |
p. 2530-2536 7 p. |
artikel |
83 |
On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
|
Brešar, Boštjan |
|
2007 |
31-40 |
17 |
p. 2303-2311 9 p. |
artikel |
84 |
On the 2-rainbow domination in graphs
|
Brešar, Boštjan |
|
2007 |
31-40 |
17 |
p. 2394-2400 7 p. |
artikel |
85 |
Parameterized algorithmics for linear arrangement problems
|
Fernau, Henning |
|
2008 |
31-40 |
17 |
p. 3166-3177 12 p. |
artikel |
86 |
Pareto optima for total weighted completion time and maximum lateness on a single machine
|
Steiner, George |
|
2007 |
31-40 |
17 |
p. 2341-2354 14 p. |
artikel |
87 |
Partial characterizations of clique-perfect and coordinated graphs: Superclasses of triangle-free graphs
|
Bonomo, Flavia |
|
2009 |
31-40 |
17 |
p. 3511-3518 8 p. |
artikel |
88 |
Permuting operations on strings and their relation to prime numbers
|
Asveld, Peter R.J. |
|
2011 |
31-40 |
17 |
p. 1915-1932 18 p. |
artikel |
89 |
Preemptive scheduling and antichain polyhedra
|
Quilliot, Alain |
|
2008 |
31-40 |
17 |
p. 3267-3275 9 p. |
artikel |
90 |
Preface for CTW2005 special issue
|
Faigle, Ulrich |
|
2008 |
31-40 |
17 |
p. 3155- 1 p. |
artikel |
91 |
Randomized strategies for the plurality problem
|
Král’, Daniel |
|
2008 |
31-40 |
17 |
p. 3305-3311 7 p. |
artikel |
92 |
Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs
|
Otachi, Yota |
|
2007 |
31-40 |
17 |
p. 2383-2390 8 p. |
artikel |
93 |
Reoptimizing the 0–1 knapsack problem
|
Archetti, Claudia |
|
2010 |
31-40 |
17 |
p. 1879-1887 9 p. |
artikel |
94 |
Resistance distances and the Kirchhoff index in Cayley graphs
|
Gao, Xing |
|
2011 |
31-40 |
17 |
p. 2050-2057 8 p. |
artikel |
95 |
Semi-preemptive routing on trees
|
Krumke, Sven O. |
|
2008 |
31-40 |
17 |
p. 3298-3304 7 p. |
artikel |
96 |
Sharp bounds for the Zagreb indices of bicyclic graphs with k -pendant vertices
|
Zhao, Qin |
|
2010 |
31-40 |
17 |
p. 1953-1962 10 p. |
artikel |
97 |
Simplifying maximum flow computations: The effect of shrinking and good initial flows
|
Liers, F. |
|
2011 |
31-40 |
17 |
p. 2187-2203 17 p. |
artikel |
98 |
Some properties for a class of interchange graphs
|
Jin, Jingjing |
|
2011 |
31-40 |
17 |
p. 2069-2077 9 p. |
artikel |
99 |
The butterfly decomposition of plane trees
|
Chen, William Y.C. |
|
2007 |
31-40 |
17 |
p. 2187-2201 15 p. |
artikel |
100 |
The connectivity of a graph and its complement
|
Hellwig, Angelika |
|
2008 |
31-40 |
17 |
p. 3325-3328 4 p. |
artikel |
101 |
The first order definability of graphs: Upper bounds for quantifier depth
|
Pikhurko, Oleg |
|
2006 |
31-40 |
17 |
p. 2511-2529 19 p. |
artikel |
102 |
The fractional weak discrepancy of a partially ordered set
|
Shuchat, Alan |
|
2007 |
31-40 |
17 |
p. 2227-2235 9 p. |
artikel |
103 |
The harmonious coloring problem is NP-complete for interval and permutation graphs
|
Asdre, Katerina |
|
2007 |
31-40 |
17 |
p. 2377-2382 6 p. |
artikel |
104 |
The most vital nodes with respect to independent set and vertex cover
|
Bazgan, Cristina |
|
2011 |
31-40 |
17 |
p. 1933-1946 14 p. |
artikel |
105 |
The project scheduling problem with production and consumption of resources: A list-scheduling based algorithm
|
Carlier, Jacques |
|
2009 |
31-40 |
17 |
p. 3631-3642 12 p. |
artikel |
106 |
The stack loading and unloading problem
|
Malucelli, Federico |
|
2008 |
31-40 |
17 |
p. 3248-3266 19 p. |
artikel |
107 |
Thue choosability of trees
|
Fiorenzi, Francesca |
|
2011 |
31-40 |
17 |
p. 2045-2049 5 p. |
artikel |
108 |
Topological sweep of the complete graph
|
Rafalin, Eynat |
|
2008 |
31-40 |
17 |
p. 3276-3290 15 p. |
artikel |
109 |
Total restrained domination in claw-free graphs with minimum degree at least two
|
Joubert, Ernst J. |
|
2011 |
31-40 |
17 |
p. 2078-2097 20 p. |
artikel |
110 |
Tree 3-spanners in 2-sep chordal graphs: Characterization and algorithms
|
Panda, B.S. |
|
2010 |
31-40 |
17 |
p. 1913-1935 23 p. |
artikel |
111 |
Use of the Szeged index and the revised Szeged index for measuring network bipartivity
|
Pisanski, Tomaž |
|
2010 |
31-40 |
17 |
p. 1936-1944 9 p. |
artikel |
112 |
Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance
|
Aouchiche, Mustapha |
|
2009 |
31-40 |
17 |
p. 3497-3510 14 p. |
artikel |
113 |
Vertex-minor reductions can simulate edge contractions
|
Kanté, Mamadou Moustapha |
|
2007 |
31-40 |
17 |
p. 2328-2340 13 p. |
artikel |
114 |
Vertex-weightings for distance moments and thorny graphs
|
Klein, Douglas J. |
|
2007 |
31-40 |
17 |
p. 2294-2302 9 p. |
artikel |