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
 
                             90 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 An asymptotically optimal lower bound on the OBDD size of the middle bit of multiplication for the pairwise ascending variable order Sauerhoff, Martin
2010
31-40 11 p. 1195-1204
10 p.
artikel
2 A network approach for specially structured linear programs arising in 0–1 quadratic optimization Adams, Warren P.
2008
31-40 11 p. 2142-2165
24 p.
artikel
3 An iterated local search algorithm for the vehicle routing problem with convex time penalty functions Ibaraki, Toshihide
2008
31-40 11 p. 2050-2069
20 p.
artikel
4 An iterative approach to graph irregularity strength Ferrara, Michael
2010
31-40 11 p. 1189-1194
6 p.
artikel
5 A note on the strength and minimum color sum of bipartite graphs Kosowski, Adrian
2009
31-40 11 p. 2552-2554
3 p.
artikel
6 Any 2-asummable bipartite function is weighted threshold Herranz, Javier
2011
31-40 11 p. 1079-1084
6 p.
artikel
7 A similarity transform for linear finite state machines Kagaris, Dimitri
2006
31-40 11 p. 1570-1577
8 p.
artikel
8 A structural theorem for planar graphs with some applications Sheng, Huiyu
2011
31-40 11 p. 1183-1187
5 p.
artikel
9 Atom-bond connectivity index of graphs Das, Kinkar Ch.
2010
31-40 11 p. 1181-1188
8 p.
artikel
10 Average distance and domination number revisited Rautenbach, Dieter
2011
31-40 11 p. 1180-1182
3 p.
artikel
11 Bernoulli matrix and its algebraic properties Zhang, Zhizheng
2006
31-40 11 p. 1622-1632
11 p.
artikel
12 Bisecting a 4-connected graph with three resource sets Ishii, Toshimasa
2007
31-40 11 p. 1441-1450
10 p.
artikel
13 Boundary defensive k -alliances in graphs Yero, I.G.
2010
31-40 11 p. 1205-1211
7 p.
artikel
14 Characterization of graphs and digraphs with small process numbers Coudert, David
2011
31-40 11 p. 1094-1109
16 p.
artikel
15 Competitive Boolean function evaluation: Beyond monotonicity, and the symmetric case Cicalese, Ferdinando
2011
31-40 11 p. 1070-1078
9 p.
artikel
16 Computational aspects of monotone dualization: A brief survey Eiter, Thomas
2008
31-40 11 p. 2035-2049
15 p.
artikel
17 Constructing two-weight codes with prescribed groups of automorphisms Kohnert, Axel
2007
31-40 11 p. 1451-1457
7 p.
artikel
18 Contents 2009
31-40 11 p. vii-
1 p.
artikel
19 Contents 2010
31-40 11 p. v-
1 p.
artikel
20 Contents 2011
31-40 11 p. v-
1 p.
artikel
21 Contents 2006
31-40 11 p. vii-
1 p.
artikel
22 Contents 2007
31-40 11 p. vii-viii
nvt p.
artikel
23 Contents 2008
31-40 11 p. v-vi
nvt p.
artikel
24 Counting feasible solutions of the traveling salesman problem with pickups and deliveries is # P -complete Berbeglia, Gerardo
2009
31-40 11 p. 2541-2547
7 p.
artikel
25 Covering and radius-covering arrays: Constructions and classification Colbourn, C.J.
2010
31-40 11 p. 1158-1180
23 p.
artikel
26 Cyclic games and linear programming Vorobyov, Sergei
2008
31-40 11 p. 2195-2231
37 p.
artikel
27 Dyck paths and restricted permutations Mansour, Toufik
2006
31-40 11 p. 1593-1605
13 p.
artikel
28 Editorial Board 2009
31-40 11 p. v-vi
nvt p.
artikel
29 Editorial Board 2006
31-40 11 p. v-vi
nvt p.
artikel
30 Editorial Board 2007
31-40 11 p. v-vi
nvt p.
artikel
31 Equistable graphs, general partition graphs, triangle graphs, and graph products Miklavič, Štefko
2011
31-40 11 p. 1148-1159
12 p.
artikel
32 Erratum to “Reduction of symmetric configurations n 3 ” [Discrete Appl. Math. 99 (1–3) (2000) 401 –411] Steffen, Eckhard
2006
31-40 11 p. 1645-1646
2 p.
artikel
33 Facility location problems: A parameterized view Fellows, Michael R.
2011
31-40 11 p. 1118-1130
13 p.
artikel
34 Forthcoming Special Issues 2006
31-40 11 p. 1647-1648
2 p.
artikel
35 Generating all minimal integral solutions to AND–OR systems of monotone inequalities: Conjunctions are simpler than disjunctions Khachiyan, Leonid
2008
31-40 11 p. 2020-2034
15 p.
artikel
36 Guide for authors 2006
31-40 11 p. I-IV
nvt p.
artikel
37 Improved bottleneck domination algorithms Kloks, Ton
2006
31-40 11 p. 1578-1592
15 p.
artikel
38 Induction of M-convex functions by linking systems Kobayashi, Yusuke
2007
31-40 11 p. 1471-1480
10 p.
artikel
39 k -strong spanning local tournaments in locally semicomplete digraphs Bang-Jensen, Jørgen
2009
31-40 11 p. 2536-2540
5 p.
artikel
40 Laced Boolean functions and subset sum problems in finite fields Canright, David
2011
31-40 11 p. 1059-1069
11 p.
artikel
41 Leonid Khachiyan 2008
31-40 11 p. EX1955-
1 p.
artikel
42 Local negative circuits and fixed points in non-expansive Boolean networks Richard, Adrien
2011
31-40 11 p. 1085-1093
9 p.
artikel
43 Lower and upper orientable strong radius and strong diameter of complete k-partite graphs Miao, Huifang
2006
31-40 11 p. 1606-1614
9 p.
artikel
44 Minimizing a monotone concave function with laminar covering constraints Sakashita, Mariko
2008
31-40 11 p. 2004-2019
16 p.
artikel
45 Multicommodity flows in cycle graphs Myung, Young-Soo
2006
31-40 11 p. 1615-1621
7 p.
artikel
46 New families of graphs without short cycles and large size Abajo, E.
2010
31-40 11 p. 1127-1135
9 p.
artikel
47 New results on optimizing rooted triplets consistency Byrka, Jaroslaw
2010
31-40 11 p. 1136-1147
12 p.
artikel
48 On compact and efficient routing in certain graph classes Dragan, Feodor F.
2007
31-40 11 p. 1458-1470
13 p.
artikel
49 On-line arbitrarily vertex decomposable trees Horňák, Mirko
2007
31-40 11 p. 1420-1429
10 p.
artikel
50 On perfect hashing of numbers with sparse digit representation via multiplication by a constant Monge, Maurizio
2011
31-40 11 p. 1176-1179
4 p.
artikel
51 On routing in VLSI design and communication networks Terlaky, Tamás
2008
31-40 11 p. 2178-2194
17 p.
artikel
52 On the complexity of monotone dualization and generating minimal hypergraph transversals Elbassioni, Khaled M.
2008
31-40 11 p. 2109-2123
15 p.
artikel
53 On the complexity of recognizing directed path families Apollonio, N.
2009
31-40 11 p. 2525-2535
11 p.
artikel
54 On the enumeration of certain weighted graphs Bóna, Miklós
2007
31-40 11 p. 1481-1496
16 p.
artikel
55 On the existence of maximal elements: An impossibility theorem Kukushkin, Nikolai S.
2008
31-40 11 p. 1988-1993
6 p.
artikel
56 On the maximum cardinality search lower bound for treewidth Bodlaender, Hans L.
2007
31-40 11 p. 1348-1372
25 p.
artikel
57 On the monotone likelihood ratio property for the convolution of independent binomial random variables Rukhin, Andrey
2009
31-40 11 p. 2562-2564
3 p.
artikel
58 On the number of words containing the factor ( aba ) k Tomescu, Ioan
2007
31-40 11 p. 1506-1511
6 p.
artikel
59 Orderings of uniquely colorable hypergraphs Bujtás, Csilla
2007
31-40 11 p. 1395-1407
13 p.
artikel
60 Orthogonal art galleries with interior walls Hutchinson, Joan
2006
31-40 11 p. 1563-1569
7 p.
artikel
61 Parabolic target space and primal–dual interior-point methods Nesterov, Yu.
2008
31-40 11 p. 2079-2100
22 p.
artikel
62 Peter Ladislaw Hammer 2007
31-40 11 p. 1345-1347
3 p.
artikel
63 Problems related to a de Bruijn–Erdös theorem Chen, Xiaomin
2008
31-40 11 p. 2101-2108
8 p.
artikel
64 2-rainbow domination in generalized Petersen graphs P ( n , 3 ) Xu, Guangjun
2009
31-40 11 p. 2570-2573
4 p.
artikel
65 Recalling Leo Gurvich, Vladimir
2008
31-40 11 p. 1957-1960.e1
17644 p.
artikel
66 Recognizing Helly Edge-Path-Tree graphs and their clique graphs Apollonio, Nicola
2011
31-40 11 p. 1166-1175
10 p.
artikel
67 Remembering Leo Khachiyan Chvátal, Vašek
2008
31-40 11 p. 1961-1962
2 p.
artikel
68 Restricted 123-avoiding Baxter permutations and the Padovan numbers Mansour, Toufik
2007
31-40 11 p. 1430-1440
11 p.
artikel
69 Reverse 2-median problem on trees Burkard, Rainer E.
2008
31-40 11 p. 1963-1976
14 p.
artikel
70 Routing sets in the integer lattice Hamburger, Peter
2007
31-40 11 p. 1384-1394
11 p.
artikel
71 Satisfiability of mixed Horn formulas Porschen, Stefan
2007
31-40 11 p. 1408-1419
12 p.
artikel
72 Scientific contributions of Leo Khachiyan (a short overview) Boros, Endre
2008
31-40 11 p. 2232-2240
9 p.
artikel
73 Security number of grid-like graphs Kozawa, Kyohei
2009
31-40 11 p. 2555-2561
7 p.
artikel
74 Semidefinite programming and arithmetic circuit evaluation Tarasov, Sergey P.
2008
31-40 11 p. 2070-2078
9 p.
artikel
75 Some decision and counting problems of the Duquenne–Guigues basis of implications Kuznetsov, Sergei O.
2008
31-40 11 p. 1994-2003
10 p.
artikel
76 Some results on diameters of Cayley graphs Xiao, Wenjun
2006
31-40 11 p. 1640-1644
5 p.
artikel
77 The bivariate Ising polynomial of a graph Andrén, Daniel
2009
31-40 11 p. 2515-2524
10 p.
artikel
78 The Clar formulas of a benzenoid system and the resonance graph Salem, Khaled
2009
31-40 11 p. 2565-2569
5 p.
artikel
79 The colourful feasibility problem Deza, Antoine
2008
31-40 11 p. 2166-2177
12 p.
artikel
80 The complexity of detecting fixed-density clusters Holzapfel, Klaus
2006
31-40 11 p. 1547-1562
16 p.
artikel
81 The convex dimension of a graph Halman, Nir
2007
31-40 11 p. 1373-1383
11 p.
artikel
82 The elimination procedure for the competition number is not optimal Hartke, Stephen G.
2006
31-40 11 p. 1633-1639
7 p.
artikel
83 The Newton Bracketing method for the minimization of convex functions subject to affine constraints Ben-Israel, Adi
2008
31-40 11 p. 1977-1987
11 p.
artikel
84 There are k -uniform cubefree binary morphisms for all k ≥ 0 Currie, James
2009
31-40 11 p. 2548-2551
4 p.
artikel
85 The signed star domination numbers of the Cartesian product graphs Wang, Changping
2007
31-40 11 p. 1497-1505
9 p.
artikel
86 Torsion formulas for signed graphs Chen, Beifang
2010
31-40 11 p. 1148-1157
10 p.
artikel
87 Triangular line graphs and word sense disambiguation Anand, Pranav
2011
31-40 11 p. 1160-1165
6 p.
artikel
88 Unique response Roman domination in graphs Ebrahimi Targhi, E.
2011
31-40 11 p. 1110-1117
8 p.
artikel
89 Vertex splitting and the recognition of trapezoid graphs Mertzios, George B.
2011
31-40 11 p. 1131-1147
17 p.
artikel
90 Violator spaces: Structure and algorithms Gärtner, B.
2008
31-40 11 p. 2124-2141
18 p.
artikel
                             90 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland