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
 
                             111 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 Acute triangulations of trapezoids Yuan, Liping
2010
190-191 10 p. 1121-1125
5 p.
artikel
2 A lower bound on independence in terms of degrees Harant, Jochen
2011
190-191 10 p. 966-970
5 p.
artikel
3 A mathematical program to refine gene regulatory networks Lulli, Guglielmo
2009
190-191 10 p. 2469-2482
14 p.
artikel
4 An algorithm for the difference between set covers Franzblau, D.S.
2008
190-191 10 p. 1623-1632
10 p.
artikel
5 A new constraint-based description of the steady-state flux cone of metabolic networks Larhlimi, Abdelhalim
2009
190-191 10 p. 2257-2266
10 p.
artikel
6 A new imputation method for incomplete binary data Subasi, Munevver Mine
2011
190-191 10 p. 1040-1047
8 p.
artikel
7 An extremal problem for total domination stable graphs upon edge removal Desormeaux, Wyatt J.
2011
190-191 10 p. 1048-1052
5 p.
artikel
8 An improvement on the complexity of factoring read-once Boolean functions Golumbic, Martin Charles
2008
190-191 10 p. 1633-1636
4 p.
artikel
9 An introduction to the perplex number system Chandler, Jerry L.R.
2009
190-191 10 p. 2296-2309
14 p.
artikel
10 A note on fundamental, non-fundamental, and robust cycle bases Klemm, Konstantin
2009
190-191 10 p. 2432-2438
7 p.
artikel
11 A note on the acyclic 3-choosability of some planar graphs Hocquard, Hervé
2010
190-191 10 p. 1104-1110
7 p.
artikel
12 A note on the relationship between the graphical traveling salesman polyhedron, the Symmetric Traveling Salesman Polytope, and the metric cone Theis, Dirk Oliver
2010
190-191 10 p. 1118-1120
3 p.
artikel
13 A refinement of the common cause principle Ay, Nihat
2009
190-191 10 p. 2439-2457
19 p.
artikel
14 A scale-free graph model based on bipartite graphs Birmelé, Etienne
2009
190-191 10 p. 2267-2284
18 p.
artikel
15 A sharp lower bound of the Randić index of cacti with r pendants Lin, Anhua
2008
190-191 10 p. 1725-1735
11 p.
artikel
16 A subexponential algorithm for the coloured tree partition problem Cordone, Roberto
2007
190-191 10 p. 1326-1335
10 p.
artikel
17 A transform property of Kloosterman sums Blake, Ian F.
2010
190-191 10 p. 1064-1072
9 p.
artikel
18 Better upper bounds on the QOBDD size of integer multiplication Amano, Kazuyuki
2007
190-191 10 p. 1224-1232
9 p.
artikel
19 Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments Shabtay, Dvir
2010
190-191 10 p. 1090-1103
14 p.
artikel
20 Characterization of reducible hexagons and fast decomposition of elementary benzenoid graphs Taranenko, Andrej
2008
190-191 10 p. 1711-1724
14 p.
artikel
21 Comparing Zagreb indices for connected graphs Horoldagva, Batmend
2010
190-191 10 p. 1073-1078
6 p.
artikel
22 Computing the bipartite edge frustration of fullerene graphs Došlić, Tomislav
2007
190-191 10 p. 1294-1301
8 p.
artikel
23 Consistency of the QNet algorithm for generating planar split networks from weighted quartets Grünewald, S.
2009
190-191 10 p. 2325-2334
10 p.
artikel
24 Contents 2009
190-191 10 p. v-vi
nvt p.
artikel
25 Contents 2010
190-191 10 p. v-
1 p.
artikel
26 Contents 2006
190-191 10 p. vii-
1 p.
artikel
27 Contents 2007
190-191 10 p. vii-viii
nvt p.
artikel
28 Contents 2008
190-191 10 p. vii-viii
nvt p.
artikel
29 Contents 2011
190-191 10 p. v-
1 p.
artikel
30 Cost thresholds for dynamic resource location Jacob Wildstrom, D.
2008
190-191 10 p. 1846-1855
10 p.
artikel
31 Digraph searching, directed vertex separation and directed pathwidth Yang, Boting
2008
190-191 10 p. 1822-1837
16 p.
artikel
32 Discovering cis-regulatory modules by optimizing barbecues Mosig, Axel
2009
190-191 10 p. 2458-2468
11 p.
artikel
33 Edge-bipancyclicity of a hypercube with faulty vertices and edges Hsieh, Sun-Yuan
2008
190-191 10 p. 1802-1808
7 p.
artikel
34 Editorial Board 2006
190-191 10 p. v-vi
nvt p.
artikel
35 Editorial Board 2007
190-191 10 p. v-vi
nvt p.
artikel
36 Editorial Board 2008
190-191 10 p. v-vi
nvt p.
artikel
37 Efficient automatic simulation of parallel computation on networks of workstations Kaklamanis, Christos
2006
190-191 10 p. 1500-1509
10 p.
artikel
38 Erratum to: Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution [Discrete Appl. Math. 157 (2009) 3133–3151] Yaman, Hande
2011
190-191 10 p. 1058-
1 p.
artikel
39 Extremal problems on consecutive L ( 2 , 1 ) -labelling Lu, Changhong
2007
190-191 10 p. 1302-1313
12 p.
artikel
40 Facet defining inequalities among graph invariants: The system GraPHedron Mélot, Hadrien
2008
190-191 10 p. 1875-1891
17 p.
artikel
41 Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial k-trees Golumbic, Martin Charles
2006
190-191 10 p. 1465-1477
13 p.
artikel
42 Feedback vertex set on AT-free graphs Kratsch, Dieter
2008
190-191 10 p. 1936-1947
12 p.
artikel
43 Formulas for approximating pseudo-Boolean random variables Ding, Guoli
2008
190-191 10 p. 1581-1597
17 p.
artikel
44 Generalization of matching extensions in graphs (II) Jin, Zemin
2007
190-191 10 p. 1267-1274
8 p.
artikel
45 Generating non-jumping numbers recursively Peng, Yuejian
2008
190-191 10 p. 1856-1864
9 p.
artikel
46 Genetic relationship between Kangal, Akbash and other dog populations Koban, Evren
2009
190-191 10 p. 2335-2340
6 p.
artikel
47 Graph parameters measuring neighbourhoods in graphs—Bounds and applications Gurski, Frank
2008
190-191 10 p. 1865-1874
10 p.
artikel
48 Graphs, partitions and Fibonacci numbers Knopfmacher, Arnold
2007
190-191 10 p. 1175-1187
13 p.
artikel
49 Graph spectra as a systematic tool in computational biology Banerjee, Anirban
2009
190-191 10 p. 2425-2431
7 p.
artikel
50 Graphs with given number of cut vertices and extremal Merrifield–Simmons index Hua, Hongbo
2011
190-191 10 p. 971-980
10 p.
artikel
51 Guide for authors 2006
190-191 10 p. I-IV
nvt p.
artikel
52 Haplotype inferring via galled-tree networks using a hypergraph covering problem for special genotype matrices Gupta, Arvind
2009
190-191 10 p. 2310-2324
15 p.
artikel
53 Inference of an oscillating model for the yeast cell cycle Radde, Nicole
2009
190-191 10 p. 2285-2295
11 p.
artikel
54 Integral trees of diameter 6 Wang, Ligong
2007
190-191 10 p. 1254-1266
13 p.
artikel
55 Integration of topological measures for eliminating non-specific interactions in protein interaction networks Bayir, Murat Ali
2009
190-191 10 p. 2416-2424
9 p.
artikel
56 Large gaps in one-dimensional cutting stock problems Rietz, J.
2008
190-191 10 p. 1929-1935
7 p.
artikel
57 L ( 2 , 1 ) -labelings of Cartesian products of two cycles Schwarz, Christopher
2006
190-191 10 p. 1522-1540
19 p.
artikel
58 Modeling and simulation of metabolic networks for estimation of biomass accumulation parameters Kaplan, U.
2009
190-191 10 p. 2483-2493
11 p.
artikel
59 Modeling and simulation of nitrogen regulation in Corynebacterium glutamicum Gebert, Jutta
2009
190-191 10 p. 2232-2243
12 p.
artikel
60 Modeling the process of human body iron homeostasis using a variant of timed Petri nets Blazewicz, Jacek
2009
190-191 10 p. 2221-2231
11 p.
artikel
61 Models and quantifier elimination for quantified Horn formulas Bubeck, Uwe
2008
190-191 10 p. 1606-1622
17 p.
artikel
62 Monadic second-order model-checking on decomposable matroids Strozecki, Yann
2011
190-191 10 p. 1022-1039
18 p.
artikel
63 New upper bounds on Lee codes Quistorff, Jörn
2006
190-191 10 p. 1510-1521
12 p.
artikel
64 Observable graphs Jungers, Raphaël M.
2011
190-191 10 p. 981-989
9 p.
artikel
65 On acyclicity of games with cycles Andersson, Daniel
2010
190-191 10 p. 1049-1063
15 p.
artikel
66 On cyclic edge-connectivity of fullerenes Kutnar, Klavdija
2008
190-191 10 p. 1661-1669
9 p.
artikel
67 On dimensional rigidity of bar-and-joint frameworks Alfakih, Abdo Y.
2007
190-191 10 p. 1244-1253
10 p.
artikel
68 On homogeneous rotation symmetric bent functions Meng, Qiang
2010
190-191 10 p. 1111-1117
7 p.
artikel
69 On optimization, dynamics and uncertainty: A tutorial for gene-environment networks Weber, G.-W.
2009
190-191 10 p. 2494-2513
20 p.
artikel
70 On the complexity of the multicut problem in bounded tree-width graphs and digraphs Bentz, Cédric
2008
190-191 10 p. 1908-1917
10 p.
artikel
71 On the crossing numbers of K m □ C n and K m , l □ P n Wenping, Zheng
2008
190-191 10 p. 1892-1907
16 p.
artikel
72 On the distance distribution of trees Dankelmann, Peter
2011
190-191 10 p. 945-952
8 p.
artikel
73 On the existence of sports schedules with multiple venues Ikebe, Yoshiko T.
2008
190-191 10 p. 1694-1710
17 p.
artikel
74 On the uniform edge-partition of a tree Wu, Bang Ye
2007
190-191 10 p. 1213-1223
11 p.
artikel
75 Optimal interleaving schemes for correcting two-dimensional cluster errors Xu, Wen-Qing
2007
190-191 10 p. 1200-1212
13 p.
artikel
76 Ordering graphs with index in the interval ( 2 , 2 + 5 ) Belardo, Francesco
2008
190-191 10 p. 1670-1682
13 p.
artikel
77 Parametric modeling of protein–DNA binding kinetics: A discrete event based simulation approach Ghosh, Preetam
2009
190-191 10 p. 2395-2415
21 p.
artikel
78 Path finding approaches and metabolic pathways Planes, F.J.
2009
190-191 10 p. 2244-2256
13 p.
artikel
79 Pattern analysis for the prediction of fungal pro-peptide cleavage sites Özöğür-Akyüz, S.
2009
190-191 10 p. 2388-2394
7 p.
artikel
80 Permutations of separable preference orders Hodge, Jonathan K.
2006
190-191 10 p. 1478-1499
22 p.
artikel
81 Phylogenetic graph models beyond trees Brandes, Ulrik
2009
190-191 10 p. 2361-2369
9 p.
artikel
82 Polar cographs Ekim, T.
2008
190-191 10 p. 1652-1660
9 p.
artikel
83 Preface Dress, Andreas
2009
190-191 10 p. 2217-2220
4 p.
artikel
84 Prokaryote clustering based on DNA curvature distributions Kozobay-Avraham, L.
2009
190-191 10 p. 2378-2387
10 p.
artikel
85 Recolouring-resistant colourings Pedersen, Anders Sune
2011
190-191 10 p. 1013-1021
9 p.
artikel
86 Relations between Clar structures, Clar covers, and the sextet-rotation tree of a hexagonal system Zhou, Shan
2008
190-191 10 p. 1809-1821
13 p.
artikel
87 Restricted power domination and fault-tolerant power domination on grids Pai, Kung-Jui
2010
190-191 10 p. 1079-1089
11 p.
artikel
88 Rotation symmetric Boolean functions—Count and cryptographic properties Stănică, Pantelimon
2008
190-191 10 p. 1567-1580
14 p.
artikel
89 Self-duality of bounded monotone boolean functions and related problems Ram Gaur, Daya
2008
190-191 10 p. 1598-1605
8 p.
artikel
90 Some special minimum k -geodetically connected graphs Lan, Yingjie
2011
190-191 10 p. 1002-1012
11 p.
artikel
91 Split decomposition over an abelian group, Part 2: Group-valued split systems with weakly compatible support Dress, Andreas
2009
190-191 10 p. 2349-2360
12 p.
artikel
92 Strategies of loop recombination in ciliates Brijder, Robert
2008
190-191 10 p. 1736-1753
18 p.
artikel
93 Sums of squares based approximation algorithms for MAX-SAT van Maaren, H.
2008
190-191 10 p. 1754-1779
26 p.
artikel
94 Super-connected edge transitive graphs Zhang, Zhao
2008
190-191 10 p. 1948-1953
6 p.
artikel
95 The Asian contribution to the Turkish population with respect to the Balkans: Y-chromosome perspective Caner Berkman, Ceren
2009
190-191 10 p. 2341-2348
8 p.
artikel
96 The clustering coefficient of a scale-free random graph Eggemann, N.
2011
190-191 10 p. 953-965
13 p.
artikel
97 The convexity spectra of graphs Tong, Li-Da
2008
190-191 10 p. 1838-1845
8 p.
artikel
98 The delay of circuits whose inputs have specified arrival times Rautenbach, Dieter
2007
190-191 10 p. 1233-1243
11 p.
artikel
99 The extent to which triangular sub-patterns explain minimum rank Johnson, Charles R.
2008
190-191 10 p. 1637-1651
15 p.
artikel
100 The general σ all-ones problem for trees Li, Xueliang
2008
190-191 10 p. 1790-1801
12 p.
artikel
101 The minimum span of L(2,1)-labelings of certain generalized Petersen graphs Adams, Sarah Spence
2007
190-191 10 p. 1314-1325
12 p.
artikel
102 The multiple originator broadcasting problem in graphs Chia, Ma-Lian
2007
190-191 10 p. 1188-1199
12 p.
artikel
103 Total domination dot-stable graphs Rickett, Stephanie A.
2011
190-191 10 p. 1053-1057
5 p.
artikel
104 Tree-edges deletion problems with bounded diameter obstruction sets Tsur, Dekel
2007
190-191 10 p. 1275-1293
19 p.
artikel
105 Tutte sets in graphs II: The complexity of finding maximum Tutte sets Bauer, D.
2007
190-191 10 p. 1336-1343
8 p.
artikel
106 Two classes of edge domination in graphs Xu, Baogen
2006
190-191 10 p. 1541-1546
6 p.
artikel
107 Using solution properties within an enumerative search to solve a sports league scheduling problem Hamiez, J.-P.
2008
190-191 10 p. 1683-1693
11 p.
artikel
108 Valuations and closure operators on finite lattices Kwuida, Léonard
2011
190-191 10 p. 990-1001
12 p.
artikel
109 Vertex and edge PI indices of Cartesian product graphs Khalifeh, M.H.
2008
190-191 10 p. 1780-1789
10 p.
artikel
110 Vertex coloring acyclic digraphs and their corresponding hypergraphs Agnarsson, Geir
2008
190-191 10 p. 1918-1928
11 p.
artikel
111 Whole-genome prokaryotic clustering based on gene lengths Bolshoy, A.
2009
190-191 10 p. 2370-2377
8 p.
artikel
                             111 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland