Digitale Bibliotheek
Sluiten Bladeren door artikelen uit een tijdschrift
     Tijdschrift beschrijving
       Alle jaargangen van het bijbehorende tijdschrift
         Alle afleveringen van het bijbehorende jaargang
                                       Alle artikelen van de bijbehorende aflevering
 
                             125 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 A Branch-and-Cut algorithm for graph coloring Méndez-Díaz, Isabel
2006
41-50 5 p. 826-847
22 p.
artikel
2 A class of graph-geodetic distances generalizing the shortest-path and the resistance distances Chebotarev, Pavel
2011
41-50 5 p. 295-302
8 p.
artikel
3 Additive edge labelings Dickenstein, Alicia
2010
41-50 5 p. 444-452
9 p.
artikel
4 A flexible model and efficient solution strategies for discrete location problems Marín, Alfredo
2009
41-50 5 p. 1128-1145
18 p.
artikel
5 A generalization of Lucas polynomial sequence Cheon, Gi-Sang
2009
41-50 5 p. 920-927
8 p.
artikel
6 A generalization of the firefighter problem on z × z Ng, K.L.
2008
41-50 5 p. 730-745
16 p.
artikel
7 A generalization of the Lee distance and error correcting codes Nishimura, S.
2008
41-50 5 p. 588-595
8 p.
artikel
8 A Lagrangian heuristic algorithm for a real-world train timetabling problem Caprara, Alberto
2006
41-50 5 p. 738-753
16 p.
artikel
9 A min–max theorem for plane bipartite graphs Abeledo, Hernán
2010
41-50 5 p. 375-378
4 p.
artikel
10 A new approximation algorithm for the multilevel facility location problem Gabor, Adriana F.
2010
41-50 5 p. 453-460
8 p.
artikel
11 A note on scheduling identical coupled tasks in logarithmic time Baptiste, Philippe
2010
41-50 5 p. 583-587
5 p.
artikel
12 An upper bound on the independence number of benzenoid systems Pepper, Ryan
2008
41-50 5 p. 607-619
13 p.
artikel
13 A polyhedral approach to the stability of a family of coalitions Aguilera, Néstor E.
2010
41-50 5 p. 379-396
18 p.
artikel
14 Approximation algorithms for problems in scheduling with set-ups Divakaran, Srikrishnan
2008
41-50 5 p. 719-729
11 p.
artikel
15 A result on the total colouring of powers of cycles Campos, C.N.
2007
41-50 5 p. 585-597
13 p.
artikel
16 A short proof of a theorem on degree sets of graphs Tripathi, Amitabha
2007
41-50 5 p. 670-671
2 p.
artikel
17 A study of 3-arc graphs Knor, Martin
2011
41-50 5 p. 344-353
10 p.
artikel
18 A tournament of order 14 with disjoint Banks and Slater sets Östergård, Patric R.J.
2010
41-50 5 p. 588-591
4 p.
artikel
19 Average distances and distance domination numbers Tian, Fang
2009
41-50 5 p. 1113-1127
15 p.
artikel
20 Average stretch analysis of compact routing schemes Eilam, Tamar
2007
41-50 5 p. 598-610
13 p.
artikel
21 Backbone colorings of graphs with bounded degree Miškuf, Jozef
2010
41-50 5 p. 534-542
9 p.
artikel
22 Batch processing with interval graph compatibilities between tasks Finke, Gerd
2008
41-50 5 p. 556-568
13 p.
artikel
23 Bi-cycle extendable through a given set in balanced bipartite graphs Li, Hao
2009
41-50 5 p. 1009-1015
7 p.
artikel
24 Bounds for short covering codes and reactive tabu search Mendes, Carlos
2010
41-50 5 p. 522-533
12 p.
artikel
25 Bounds on a graph's security number Dutton, Ronald D.
2008
41-50 5 p. 695-704
10 p.
artikel
26 Characterization and representation problems for intersection betweennesses Rautenbach, Dieter
2011
41-50 5 p. 389-395
7 p.
artikel
27 Complexity of two coloring problems in cubic planar bipartite mixed graphs Ries, B.
2010
41-50 5 p. 592-596
5 p.
artikel
28 Complexity results for minimum sum edge coloring Marx, Dániel
2009
41-50 5 p. 1034-1045
12 p.
artikel
29 Computational complexity of isothermic DNA sequencing by hybridization Blazewicz, Jacek
2006
41-50 5 p. 718-729
12 p.
artikel
30 Computational complexity of some restricted instances of 3-SAT Berman, Piotr
2007
41-50 5 p. 649-653
5 p.
artikel
31 Computing sharp bounds for hard clustering problems on trees Lari, Isabella
2009
41-50 5 p. 991-1008
18 p.
artikel
32 Contents 2009
41-50 5 p. vii-viii
nvt p.
artikel
33 Contents 2010
41-50 5 p. vii-viii
nvt p.
artikel
34 Contents 2011
41-50 5 p. v-vi
nvt p.
artikel
35 Contents 2006
41-50 5 p. vii-viii
nvt p.
artikel
36 Contents 2007
41-50 5 p. vii-
1 p.
artikel
37 Contents 2008
41-50 5 p. vii-viii
nvt p.
artikel
38 Degree-bounded minimum spanning trees Jothi, Raja
2009
41-50 5 p. 960-970
11 p.
artikel
39 Domain extender for collision resistant hash functions: Improving upon Merkle–Damgård iteration Sarkar, Palash
2009
41-50 5 p. 1086-1097
12 p.
artikel
40 Editorial Board 2009
41-50 5 p. v-vi
nvt p.
artikel
41 Editorial Board 2010
41-50 5 p. v-vi
nvt p.
artikel
42 Editorial Board 2006
41-50 5 p. v-vi
nvt p.
artikel
43 Editorial Board 2007
41-50 5 p. v-vi
nvt p.
artikel
44 Editorial Board 2008
41-50 5 p. v-vi
nvt p.
artikel
45 Efficient algorithms for wavelength assignment on trees of rings Bian, Zhengbing
2009
41-50 5 p. 875-889
15 p.
artikel
46 Enumeration of 2-regular circulant graphs and directed double networks Mamut, Aygul
2009
41-50 5 p. 1024-1033
10 p.
artikel
47 Expected rank and randomness in rooted graphs Eisenstat, David
2008
41-50 5 p. 746-756
11 p.
artikel
48 Exploring the missing link among d-separable, d ¯ -separable and d-disjunct matrices Chen, Hong-Bin
2007
41-50 5 p. 662-664
3 p.
artikel
49 Extensive facility location problems on networks with equity measures Puerto, Justo
2009
41-50 5 p. 1069-1085
17 p.
artikel
50 1-factor covers of regular graphs belcastro, sarah-marie
2011
41-50 5 p. 281-287
7 p.
artikel
51 First vs. best improvement: An empirical study Hansen, Pierre
2006
41-50 5 p. 802-817
16 p.
artikel
52 Forcing matching numbers of fullerene graphs Zhang, Heping
2010
41-50 5 p. 573-582
10 p.
artikel
53 Graph layering by promotion of nodes Nikolov, Nikola S.
2006
41-50 5 p. 848-860
13 p.
artikel
54 Greedy approaches for a class of nonlinear Generalized Assignment Problems Sharkey, Thomas C.
2010
41-50 5 p. 559-572
14 p.
artikel
55 Guest editor 2006
41-50 5 p. 694-
1 p.
artikel
56 Guide for authors 2006
41-50 5 p. I-IV
nvt p.
artikel
57 Hamiltonian connectedness in 3-connected line graphs Lai, Hong-Jian
2009
41-50 5 p. 982-990
9 p.
artikel
58 Hypergraph decomposition and secret sharing Di Crescenzo, Giovanni
2009
41-50 5 p. 928-946
19 p.
artikel
59 Identification in Z 2 using Euclidean balls Junnila, Ville
2011
41-50 5 p. 335-343
9 p.
artikel
60 Inducing regulation of any digraphs Górska, Joanna
2009
41-50 5 p. 947-952
6 p.
artikel
61 Kernels by monochromatic paths in m -colored unions of quasi-transitive digraphs Galeana-Sánchez, Hortensia
2010
41-50 5 p. 461-466
6 p.
artikel
62 Learning random monotone DNF Jackson, Jeffrey C.
2011
41-50 5 p. 259-271
13 p.
artikel
63 Linear CNF formulas and satisfiability Porschen, Stefan
2009
41-50 5 p. 1046-1068
23 p.
artikel
64 Linear codes for high payload steganography Khatirinejad, Mahdad
2009
41-50 5 p. 971-981
11 p.
artikel
65 Locating a minisum circle in the plane Brimberg, Jack
2009
41-50 5 p. 901-912
12 p.
artikel
66 Lower bounds on the pathwidth of some grid-like graphs Ellis, John
2008
41-50 5 p. 545-555
11 p.
artikel
67 Maintaining dynamic minimum spanning trees: An experimental study Cattaneo, G.
2010
41-50 5 p. 404-425
22 p.
artikel
68 Maximum weight edge-constrained matchings Rusu, Irena
2008
41-50 5 p. 662-672
11 p.
artikel
69 Messy broadcasting — Decentralized broadcast schemes with limited knowledge Harutyunyan, Hovhannes A.
2011
41-50 5 p. 322-327
6 p.
artikel
70 Minimal comparability completions of arbitrary graphs Heggernes, Pinar
2008
41-50 5 p. 705-718
14 p.
artikel
71 Minimum average congestion of enhanced and augmented hypercubes into complete binary trees Manuel, Paul
2011
41-50 5 p. 360-366
7 p.
artikel
72 Minimum sum set coloring of trees and line graphs of trees Bonomo, Flavia
2011
41-50 5 p. 288-294
7 p.
artikel
73 Multiprocessor scheduling under precedence constraints: Polyhedral results Coll, Pablo E.
2006
41-50 5 p. 770-801
32 p.
artikel
74 Mutual exclusion scheduling with interval graphs or related classes. Part II Gardi, Frédéric
2008
41-50 5 p. 794-812
19 p.
artikel
75 Noising methods for a clique partitioning problem Charon, Irène
2006
41-50 5 p. 754-769
16 p.
artikel
76 On end-vertices of Lexicographic Breadth First Searches Corneil, Derek G.
2010
41-50 5 p. 434-443
10 p.
artikel
77 On exact blockers and anti-blockers, Δ -conjecture, and related problems Gurvich, Vladimir
2011
41-50 5 p. 311-321
11 p.
artikel
78 On highly palindromic words Holub, Štěpán
2009
41-50 5 p. 953-959
7 p.
artikel
79 On irreversibility of von Neumann additive cellular automata on grids Soma, N.Y.
2006
41-50 5 p. 861-866
6 p.
artikel
80 On the behavior of the N + -operator under blocker duality Bianchi, Silvia M.
2011
41-50 5 p. 396-399
4 p.
artikel
81 On the connectivity and superconnected graphs with small diameter Balbuena, C.
2010
41-50 5 p. 397-403
7 p.
artikel
82 On the degree of homogeneous bent functions Meng, Qingshu
2007
41-50 5 p. 665-669
5 p.
artikel
83 On the distribution of distances between specified nodes in increasing trees Kuba, Markus
2010
41-50 5 p. 489-506
18 p.
artikel
84 On the minimal energy of unicyclic Hückel molecular graphs possessing Kekulé structures Cao, Yinmei
2009
41-50 5 p. 913-919
7 p.
artikel
85 On the λ -robustness of matrices over fuzzy algebra Plavka, Ján
2011
41-50 5 p. 381-388
8 p.
artikel
86 On the stable b -matching problem in multigraphs Borbel’ová, Viera
2008
41-50 5 p. 673-684
12 p.
artikel
87 On the suppression of variables in Boolean equations Brown, Frank Markham
2011
41-50 5 p. 255-258
4 p.
artikel
88 Optimal radio labellings of complete m -ary trees Li, Xiangwen
2010
41-50 5 p. 507-515
9 p.
artikel
89 Parallel cleaning of a network with brushes Gaspers, Serge
2010
41-50 5 p. 467-478
12 p.
artikel
90 P 3 -equicoverable graphs—Research on H -equicoverable graphs Zhang, Yuqin
2008
41-50 5 p. 647-661
15 p.
artikel
91 Preface Ribeiro, Celso C.
2006
41-50 5 p. 693-
1 p.
artikel
92 Proper generating trees and their internal path length Merlini, Donatella
2008
41-50 5 p. 627-646
20 p.
artikel
93 Properties of optimal schedules in preemptive shop scheduling Baptiste, Ph.
2011
41-50 5 p. 272-280
9 p.
artikel
94 Real-time data gathering in sensor networks Revah, Yoram
2010
41-50 5 p. 543-550
8 p.
artikel
95 Resistance distance and the normalized Laplacian spectrum Chen, Haiyan
2007
41-50 5 p. 654-661
8 p.
artikel
96 Review of combinatorial problems induced by spatial forest harvesting planning Weintraub, Andres
2006
41-50 5 p. 867-879
13 p.
artikel
97 Robust network optimization under polyhedral demand uncertainty is N P -hard Minoux, M.
2010
41-50 5 p. 597-603
7 p.
artikel
98 Scheduling malleable tasks with interdependent processing rates: Comments and observations Burke, Edmund K.
2008
41-50 5 p. 620-626
7 p.
artikel
99 Scheduling workover rigs for onshore oil production Aloise, Dario J.
2006
41-50 5 p. 695-702
8 p.
artikel
100 Simple image set of linear mappings in a max–min algebra Gavalec, Martin
2007
41-50 5 p. 611-622
12 p.
artikel
101 Some complexity problems on single input double output controllers Hangos, K.M.
2009
41-50 5 p. 1146-1158
13 p.
artikel
102 Spanning forests and the golden ratio Chebotarev, Pavel
2008
41-50 5 p. 813-821
9 p.
artikel
103 Star-critical Ramsey numbers Hook, Jonelle
2011
41-50 5 p. 328-334
7 p.
artikel
104 Structure of the eigenspace of a Monge matrix in max-plus algebra Gavalec, Martin
2008
41-50 5 p. 596-606
11 p.
artikel
105 Subclasses of k-trees: Characterization and recognition Markenzon, L.
2006
41-50 5 p. 818-825
8 p.
artikel
106 Super-simple Steiner pentagon systems Abel, R.J.R.
2008
41-50 5 p. 780-793
14 p.
artikel
107 Tenacity of a graph with maximum connectivity Moazzami, Dara
2011
41-50 5 p. 367-380
14 p.
artikel
108 The crossing numbers of generalized Petersen graphs with small order Lin, Xiaohui
2009
41-50 5 p. 1016-1023
8 p.
artikel
109 The existence and upper bound for two types of restricted connectivity Liu, Qinghai
2010
41-50 5 p. 516-521
6 p.
artikel
110 The forcing hull and forcing geodetic numbers of graphs Tong, Li-Da
2009
41-50 5 p. 1159-1163
5 p.
artikel
111 The independence polynomial of rooted products of graphs Rosenfeld, Vladimir R.
2010
41-50 5 p. 551-558
8 p.
artikel
112 The induced path function, monotonicity and betweenness Changat, Manoj
2010
41-50 5 p. 426-433
8 p.
artikel
113 The lattice of embedded subsets Grabisch, Michel
2010
41-50 5 p. 479-488
10 p.
artikel
114 The quadratic knapsack problem—a survey Pisinger, David
2007
41-50 5 p. 623-648
26 p.
artikel
115 The six classes of trees with the largest algebraic connectivity Yuan, Xi-Ying
2008
41-50 5 p. 757-769
13 p.
artikel
116 The zoo of tree spanner problems Liebchen, Christian
2008
41-50 5 p. 569-587
19 p.
artikel
117 Three Hoppy path problems and ternary paths Deng, Eva Y.P.
2008
41-50 5 p. 770-779
10 p.
artikel
118 Unbordered partial words Blanchet-Sadri, F.
2009
41-50 5 p. 890-900
11 p.
artikel
119 Upper bounds on the upper signed total domination number of graphs Shan, Erfang
2009
41-50 5 p. 1098-1103
6 p.
artikel
120 Using a similarity measure for credible classification Subasi, M.
2009
41-50 5 p. 1104-1112
9 p.
artikel
121 Using Lagrangian dual information to generate degree constrained spanning trees Andrade, Rafael
2006
41-50 5 p. 703-717
15 p.
artikel
122 Weak sense of direction labelings and graph embeddings Cheng, Christine T.
2011
41-50 5 p. 303-310
8 p.
artikel
123 Weighted lattice polynomials of independent random variables Marichal, Jean-Luc
2008
41-50 5 p. 685-694
10 p.
artikel
124 Weighted well-covered graphs without C 4 , C 5 , C 6 , C 7 Levit, Vadim E.
2011
41-50 5 p. 354-359
6 p.
artikel
125 Worst-case performance of Wong's Steiner tree heuristic Candia-Véjar, Alfredo
2006
41-50 5 p. 730-737
8 p.
artikel
                             125 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland