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
 
                             68 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 Acquisition-extremal graphs LeSaulnier, Timothy D.
2013
1-10 10-11 p. 1521-1529
9 p.
artikel
2 Acyclic edge colouring of plane graphs Fiedorowicz, Anna
2012
1-10 10-11 p. 1513-1523
11 p.
artikel
3 Algorithmic aspects of the k -domination problem in graphs Lan, James K.
2013
1-10 10-11 p. 1513-1520
8 p.
artikel
4 Alliance free sets in Cartesian product graphs Yero, Ismael G.
2013
1-10 10-11 p. 1618-1625
8 p.
artikel
5 An efficient algorithm for testing goal-minimality of graphs Gyürki, Štefan
2013
1-10 10-11 p. 1632-1634
3 p.
artikel
6 An explicit construction of ( 3 , t ) -existentially closed graphs Vinh, Le Anh
2013
1-10 10-11 p. 1651-1654
4 p.
artikel
7 A non-uniform birthday problem with applications to discrete logarithms Galbraith, Steven D.
2012
1-10 10-11 p. 1547-1560
14 p.
artikel
8 A note on the parameterized complexity of unordered maximum tree orientation Böcker, Sebastian
2012
1-10 10-11 p. 1634-1638
5 p.
artikel
9 Antibandwidth and cyclic antibandwidth of Hamming graphs Dobrev, Stefan
2013
1-10 10-11 p. 1402-1408
7 p.
artikel
10 A superpolynomial lower bound for strategy iteration based on snare memorization Friedmann, Oliver
2013
1-10 10-11 p. 1317-1337
21 p.
artikel
11 Balanced k -decompositions of graphs Hsu, Hsiang-Chun
2012
1-10 10-11 p. 1639-1642
4 p.
artikel
12 Complexity of the path avoiding forbidden pairs problem revisited Kováč, Jakub
2013
1-10 10-11 p. 1506-1512
7 p.
artikel
13 Computing square roots of trivially perfect and threshold graphs Milanič, Martin
2013
1-10 10-11 p. 1538-1545
8 p.
artikel
14 Connectivity of Kronecker products with complete multipartite graphs Wang, Wei
2013
1-10 10-11 p. 1655-1659
5 p.
artikel
15 Contents 2013
1-10 10-11 p. v-vii
nvt p.
artikel
16 Contents 2012
1-10 10-11 p. v-vi
nvt p.
artikel
17 Diffuse reflection diameter and radius for convex-quadrilateralizable polygons Khan, Arindam
2013
1-10 10-11 p. 1496-1505
10 p.
artikel
18 Domination game: Extremal families of graphs for 3 / 5 -conjectures Brešar, Boštjan
2013
1-10 10-11 p. 1308-1316
9 p.
artikel
19 Edge contraction and edge removal on iterated clique graphs Frías-Armenta, M.E.
2013
1-10 10-11 p. 1427-1439
13 p.
artikel
20 Fast algorithms for finding a minimum repetition representation of strings and trees Nakamura, Atsuyoshi
2013
1-10 10-11 p. 1556-1575
20 p.
artikel
21 Fork-forests in bi-colored complete bipartite graphs Axenovich, Maria
2013
1-10 10-11 p. 1363-1366
4 p.
artikel
22 Four-regular graphs with rigid vertices associated to DNA recombination Burns, Jonathan
2013
1-10 10-11 p. 1378-1394
17 p.
artikel
23 Generalization error bounds for the logical analysis of data Anthony, Martin
2012
1-10 10-11 p. 1407-1415
9 p.
artikel
24 Generalized competition indices of symmetric primitive digraphs Kim, Hwa Kyung
2012
1-10 10-11 p. 1583-1590
8 p.
artikel
25 Hamiltonian claw-free graphs involving minimum degrees Li, MingChu
2013
1-10 10-11 p. 1530-1537
8 p.
artikel
26 Homogeneously non-idling schedules of unit-time jobs on identical parallel machines Quilliot, Alain
2013
1-10 10-11 p. 1586-1597
12 p.
artikel
27 How much is it worth to know the future in online conversion problems? Mohr, Esther
2013
1-10 10-11 p. 1546-1555
10 p.
artikel
28 Inferring a graph from path frequency Akutsu, Tatsuya
2012
1-10 10-11 p. 1416-1428
13 p.
artikel
29 Information diffusion on the iterated local transitivity model of online social networks Small, Lucy
2013
1-10 10-11 p. 1338-1344
7 p.
artikel
30 Injectivity and weak ternary separation Powers, Robert C.
2013
1-10 10-11 p. 1646-1650
5 p.
artikel
31 Iterated open neighborhood graphs and generalizations Schweitzer, Pascal
2013
1-10 10-11 p. 1598-1609
12 p.
artikel
32 List injective coloring of planar graphs with girth 5, 6, 8 Bu, Yuehua
2013
1-10 10-11 p. 1367-1377
11 p.
artikel
33 Minimizing the error of linear separators on linearly inseparable data Aronov, Boris
2012
1-10 10-11 p. 1441-1452
12 p.
artikel
34 Modeling the spread of fault in majority-based network systems: Dynamic monopolies in triangular grids Adams, Sarah Spence
2012
1-10 10-11 p. 1624-1633
10 p.
artikel
35 NP-hardness of the sorting buffer problem on the uniform metric Asahiro, Yuichi
2012
1-10 10-11 p. 1453-1464
12 p.
artikel
36 Obtaining splits from cut sets of tight spans Dress, Andreas
2013
1-10 10-11 p. 1409-1420
12 p.
artikel
37 On a problem of Erdős, Herzog and Schönheim Chen, Yong-Gao
2012
1-10 10-11 p. 1501-1506
6 p.
artikel
38 On generalized zero divisor graph of a poset Joshi, Vinayak
2013
1-10 10-11 p. 1490-1495
6 p.
artikel
39 On hypercube labellings and antipodal monochromatic paths Feder, Tomás
2013
1-10 10-11 p. 1421-1426
6 p.
artikel
40 On k -domination and j -independence in graphs Hansberg, Adriana
2013
1-10 10-11 p. 1472-1480
9 p.
artikel
41 On maximum matchings in König–Egerváry graphs Levit, Vadim E.
2013
1-10 10-11 p. 1635-1638
4 p.
artikel
42 On n -step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets Kianfar, Kiavash
2012
1-10 10-11 p. 1567-1582
16 p.
artikel
43 On 4- γ t -critical graphs of diameter two Wang, Yan
2013
1-10 10-11 p. 1660-1668
9 p.
artikel
44 On the acyclic disconnection of multipartite tournaments Figueroa, A.P.
2012
1-10 10-11 p. 1524-1531
8 p.
artikel
45 On the b -chromatic number of regular graphs without 4-cycle Shaebani, Saeed
2012
1-10 10-11 p. 1610-1614
5 p.
artikel
46 On the contour of graphs Artigas, D.
2013
1-10 10-11 p. 1356-1362
7 p.
artikel
47 On the maximal Wiener index and related questions Sills, Andrew V.
2012
1-10 10-11 p. 1615-1623
9 p.
artikel
48 On the metric dimension, the upper dimension and the resolving number of graphs Garijo, Delia
2013
1-10 10-11 p. 1440-1447
8 p.
artikel
49 On the number of update digraphs and its relation with the feedback arc sets and tournaments Aracena, J.
2013
1-10 10-11 p. 1345-1355
11 p.
artikel
50 On the polygonal diameter (=  link diameter) of the interior, resp. exterior, of a simple closed polygon in the plane Perles, Micha A.
2013
1-10 10-11 p. 1576-1585
10 p.
artikel
51 On the size of identifying codes in triangle-free graphs Foucaud, Florent
2012
1-10 10-11 p. 1532-1546
15 p.
artikel
52 Radial Moore graphs of radius three Exoo, Geoffrey
2012
1-10 10-11 p. 1507-1512
6 p.
artikel
53 Rainbow domination and related problems on strongly chordal graphs Chang, Gerard J.
2013
1-10 10-11 p. 1395-1401
7 p.
artikel
54 Restricted arc-connectivity in tournaments Grüter, Steffen
2013
1-10 10-11 p. 1467-1471
5 p.
artikel
55 Signless Laplacian eigenvalues and circumference of graphs Wang, JianFeng
2013
1-10 10-11 p. 1610-1617
8 p.
artikel
56 Simple agents learn to find their way: An introduction on mapping polygons Chalopin, Jérémie
2013
1-10 10-11 p. 1287-1307
21 p.
artikel
57 Small cutsets in arc-transitive digraphs of prime degree López, S.C.
2013
1-10 10-11 p. 1639-1645
7 p.
artikel
58 The (conditional) matching preclusion for burnt pancake graphs Hu, Xiaolan
2013
1-10 10-11 p. 1481-1489
9 p.
artikel
59 The distribution of cycles in breakpoint graphs of signed permutations Grusea, Simona
2013
1-10 10-11 p. 1448-1466
19 p.
artikel
60 The Kirchhoff indexes of some composite networks Arauz, C.
2012
1-10 10-11 p. 1429-1440
12 p.
artikel
61 The parametric complexity of graph diameter augmentation Gao, Yong
2013
1-10 10-11 p. 1626-1631
6 p.
artikel
62 The solution and applications of a combinatorial problem Xu, Gaokui
2012
1-10 10-11 p. 1643-1649
7 p.
artikel
63 The Tower of Hanoi problem on Path h graphs Berend, Daniel
2012
1-10 10-11 p. 1465-1483
19 p.
artikel
64 The walk distances in graphs Chebotarev, Pavel
2012
1-10 10-11 p. 1484-1500
17 p.
artikel
65 Unimodality and log-concavity of f -vectors for cyclic and ordinary polytopes Major, László
2013
1-10 10-11 p. 1669-1672
4 p.
artikel
66 Unit and single point interval graphs Rautenbach, Dieter
2012
1-10 10-11 p. 1601-1609
9 p.
artikel
67 Vector bin packing with multiple-choice Patt-Shamir, Boaz
2012
1-10 10-11 p. 1591-1600
10 p.
artikel
68 Weakly quasi-Hamiltonian-set-connected multipartite tournaments Guo, Yubao
2012
1-10 10-11 p. 1561-1566
6 p.
artikel
                             68 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland