Digital Library
Close Browse articles from a journal
     Journal description
       All volumes of the corresponding journal
         All issues of the corresponding volume
                                       All articles of the corresponding issues
 
                             54 results found
no title author magazine year volume issue page(s) type
1 ( a , b ) -codes in Z / n Z Gravier, Sylvain
2013
31-40 4-5 p. 612-617
6 p.
article
2 A generalization of Hungarian method and Hall’s theorem with applications in wireless sensor networks Bokal, Drago
2012
31-40 4-5 p. 460-470
11 p.
article
3 An algorithm for finding the vertices of the k -additive monotone core Miranda, Pedro
2012
31-40 4-5 p. 628-639
12 p.
article
4 An independent set approach for the communication network of the GPS III system Brinkmann, Gunnar
2013
31-40 4-5 p. 573-579
7 p.
article
5 An integer optimization approach for reverse engineering of gene regulatory networks Cordone, Roberto
2013
31-40 4-5 p. 580-592
13 p.
article
6 A recursive formula for weights of Boolean rotation symmetric functions Cusick, Thomas W.
2012
31-40 4-5 p. 391-397
7 p.
article
7 A survey of Nordhaus–Gaddum type relations Aouchiche, Mustapha
2013
31-40 4-5 p. 466-546
81 p.
article
8 At least three minimal quasi-kernels Bowser, Stephen
2012
31-40 4-5 p. 673-675
3 p.
article
9 Bandwidth and distortion revisited Cygan, Marek
2012
31-40 4-5 p. 494-504
11 p.
article
10 b-colouring the Cartesian product of trees and some other graphs Maffray, Frédéric
2013
31-40 4-5 p. 650-669
20 p.
article
11 Boolean functions optimizing most of the cryptographic criteria Tu, Ziran
2012
31-40 4-5 p. 427-435
9 p.
article
12 Boolean functions with a simple certificate for CNF complexity Čepek, Ondřej
2012
31-40 4-5 p. 365-382
18 p.
article
13 Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences Brandstädt, Andreas
2012
31-40 4-5 p. 471-478
8 p.
article
14 Combinatorics of Boolean automata circuits dynamics Demongeot, Jacques
2012
31-40 4-5 p. 398-415
18 p.
article
15 Computing convex quadrangulations Schiffer, T.
2012
31-40 4-5 p. 648-656
9 p.
article
16 Connected graphs of fixed order and size with maximal Q -index: Some spectral bounds Anđelić, Milica
2012
31-40 4-5 p. 448-459
12 p.
article
17 Constructing connected bicritical graphs with edge-connectivity 2 Chen, Xue-gang
2012
31-40 4-5 p. 488-493
6 p.
article
18 Contents 2012
31-40 4-5 p. v-vi
nvt p.
article
19 Edge fault tolerance of graphs with respect to super edge connectivity Hong, Yanmei
2012
31-40 4-5 p. 579-587
9 p.
article
20 Editorial Board 2013
31-40 4-5 p. v-vi
nvt p.
article
21 Exact λ -numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips Adams, Sarah Spence
2012
31-40 4-5 p. 436-447
12 p.
article
22 Fast algorithms for min independent dominating set Bourgeois, N.
2013
31-40 4-5 p. 558-572
15 p.
article
23 Finding and listing induced paths and cycles Hoàng, Chính T.
2013
31-40 4-5 p. 633-641
9 p.
article
24 Generalized roof duality and bisubmodular functions Kolmogorov, Vladimir
2012
31-40 4-5 p. 416-426
11 p.
article
25 Geodesic pancyclicity and balanced pancyclicity of the generalized base- b hypercube Fang, Jywe-Fei
2012
31-40 4-5 p. 548-559
12 p.
article
26 Global defensive alliances of trees and Cartesian product of paths and cycles Chang, Chan-Wei
2012
31-40 4-5 p. 479-487
9 p.
article
27 GO VII Meeting, Ovronnaz (CH), June 13–17, 2010 Demange, Marc
2013
31-40 4-5 p. 453-
1 p.
article
28 Independence polynomials of some compound graphs Song, Lanzhen
2012
31-40 4-5 p. 657-663
7 p.
article
29 Kirchhoff index in line, subdivision and total graphs of a regular graph Gao, Xing
2012
31-40 4-5 p. 560-565
6 p.
article
30 Linear coloring of sparse graphs Wang, Yingqian
2012
31-40 4-5 p. 664-672
9 p.
article
31 Minimum average-case queries of q + 1 -ary search game with small sets Meng, Kun
2012
31-40 4-5 p. 618-627
10 p.
article
32 On minimally rainbow k -connected graphs Schiermeyer, Ingo
2013
31-40 4-5 p. 702-705
4 p.
article
33 On the approximation of minimum cost homomorphism to bipartite graphs Mastrolilli, Monaldo
2013
31-40 4-5 p. 670-676
7 p.
article
34 On the O ( n 3 ) algorithm for checking the strong robustness of interval fuzzy matrices Plavka, Ján
2012
31-40 4-5 p. 640-647
8 p.
article
35 On 3- γ t -vertex critical graphs of diameter three Chellali, Mustapha
2012
31-40 4-5 p. 676-681
6 p.
article
36 Optimal solutions for routing problems with profits Archetti, C.
2013
31-40 4-5 p. 547-557
11 p.
article
37 Packing chromatic number of distance graphs Ekstein, Jan
2012
31-40 4-5 p. 518-524
7 p.
article
38 1-planarity of complete multipartite graphs Czap, Július
2012
31-40 4-5 p. 505-512
8 p.
article
39 Randomized algorithms and upper bounds for multiple domination in graphs and networks Gagarin, Andrei
2013
31-40 4-5 p. 604-611
8 p.
article
40 Record statistics in a random composition Knopfmacher, Arnold
2012
31-40 4-5 p. 593-603
11 p.
article
41 Resilience and optimization of identifiable bipartite graphs Fritzilas, Epameinondas
2013
31-40 4-5 p. 593-603
11 p.
article
42 Robust cutpoints in the logical analysis of numerical data Anthony, Martin
2012
31-40 4-5 p. 355-364
10 p.
article
43 Set graphs. I. Hereditarily finite sets and extensional acyclic orientations Milanič, Martin
2013
31-40 4-5 p. 677-690
14 p.
article
44 Sperner’s lemma and zero point theorems on a discrete simplex and a discrete simplotope Iimura, Takuya
2012
31-40 4-5 p. 588-592
5 p.
article
45 Sturmian graphs and integer representations over numeration systems Epifanio, C.
2012
31-40 4-5 p. 536-547
12 p.
article
46 The arity gap of order-preserving functions and extensions of pseudo-Boolean functions Couceiro, Miguel
2012
31-40 4-5 p. 383-390
8 p.
article
47 The complexity of two graph orientation problems Eggemann, Nicole
2012
31-40 4-5 p. 513-517
5 p.
article
48 The ordered anti-median problem with distances derived from a strictly convex norm Lozano, Antonio J.
2013
31-40 4-5 p. 642-649
8 p.
article
49 The periodic capacitated arc routing problem with irregular services Monroy, I.M.
2013
31-40 4-5 p. 691-701
11 p.
article
50 The uncapacitated swapping problem on a line and on a circle Anily, Shoshana
2013
31-40 4-5 p. 454-465
12 p.
article
51 The universality of iterated hashing over variable-length strings Lemire, Daniel
2012
31-40 4-5 p. 604-617
14 p.
article
52 Tight compact models and comparative analysis for the prize collecting Steiner tree problem Haouari, Mohamed
2013
31-40 4-5 p. 618-632
15 p.
article
53 Treewidth of Erdős–Rényi random graphs, random intersection graphs, and scale-free random graphs Gao, Yong
2012
31-40 4-5 p. 566-578
13 p.
article
54 Using well-solvable quadratic assignment problems for VLSI interconnect applications Emanuel, Ben
2012
31-40 4-5 p. 525-535
11 p.
article
                             54 results found
 
 Koninklijke Bibliotheek - National Library of the Netherlands