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
 
                             68 results found
no title author magazine year volume issue page(s) type
1 A d -step approach to the maximum number of distinct squares and runs in strings Deza, Antoine
2014
31-40 P3 p. 268-274
7 p.
article
2 Algorithms for computing Abelian periods of words Fici, Gabriele
2014
31-40 P3 p. 287-297
11 p.
article
3 A linear kernel for planar red–blue dominating set Garnero, Valentin
2017
31-40 P3 p. 536-547
12 p.
article
4 A new generalization of kernels in digraphs Ramoul, Amina
2017
31-40 P3 p. 673-684
12 p.
article
5 A new property of the Lovász number and duality relations between graph parameters Acín, Antonio
2017
31-40 P3 p. 489-501
13 p.
article
6 An intersection theorem for systems of finite sets Bey, Christian
2017
31-40 P3 p. 524-528
5 p.
article
7 A note on an induced subgraph characterization of domination perfect graphs Camby, Eglantine
2017
31-40 P3 p. 711-717
7 p.
article
8 A note on α -total domination in cubic graphs Chen, Xue-gang
2017
31-40 P3 p. 718-721
4 p.
article
9 Around the Complete Intersection Theorem Katona, Gyula O.H.
2017
31-40 P3 p. 618-621
4 p.
article
10 A strong connectivity property of the generalized exchanged hypercube Cheng, Eddie
2017
31-40 P3 p. 529-536
8 p.
article
11 A subspace covering problem in the n -cube Aydinian, Harout
2017
31-40 P3 p. 513-517
5 p.
article
12 A survey and classification of Sierpiński-type graphs Hinz, Andreas M.
2017
31-40 P3 p. 565-600
36 p.
article
13 AVD-total-chromatic number of some families of graphs with Δ ( G ) = 3 Luiz, Atílio G.
2017
31-40 P3 p. 628-638
11 p.
article
14 Average number of occurrences of repetitions in a necklace Kusano, Kazuhiko
2014
31-40 P3 p. 334-342
9 p.
article
15 Bannai et al. method proves the d -step conjecture for strings Deza, Antoine
2017
31-40 P3 p. 488-494
7 p.
article
16 Codes over a family of local Frobenius rings, Gray maps and self-dual codes Dougherty, Steven T.
2017
31-40 P3 p. 512-524
13 p.
article
17 Combinatorial and spectral properties of König–Egerváry graphs Cardoso, Domingos M.
2017
31-40 P3 p. 446-454
9 p.
article
18 Computing the number of cubic runs in standard Sturmian words Piątkowski, Marcin
2014
31-40 P3 p. 361-372
12 p.
article
19 Contents 2017
31-40 P3 p. v-vi
nvt p.
article
20 Contents 2017
31-40 P3 p. v-vi
nvt p.
article
21 Contents 2014
31-40 P3 p. v-vi
nvt p.
article
22 Cycle-aware minimization of acyclic deterministic finite-state automata Bubenzer, Johannes
2014
31-40 P3 p. 238-246
9 p.
article
23 Discriminative measures for comparison of phylogenetic trees Arslan, Omur
2017
31-40 P3 p. 405-426
22 p.
article
24 Efficient broadcast trees for weighted vertices Harutyunyan, Hovhannes A.
2017
31-40 P3 p. 598-608
11 p.
article
25 Free monoids and forests of rational numbers Nathanson, Melvyn B.
2017
31-40 P3 p. 662-669
8 p.
article
26 Graph connectivity and universal rigidity of bar frameworks Alfakih, A.Y.
2017
31-40 P3 p. 707-710
4 p.
article
27 Graphs that are simultaneously efficient open domination and efficient closed domination graphs Klavžar, Sandi
2017
31-40 P3 p. 613-621
9 p.
article
28 Graphs that locally maximize clustering coefficient in the space of graphs with a fixed degree sequence Fukami, Tatsuya
2017
31-40 P3 p. 525-535
11 p.
article
29 Improving deduplication techniques by accelerating remainder calculations Hirsch, M.
2014
31-40 P3 p. 307-315
9 p.
article
30 Inferring strings from suffix trees and links on a binary alphabet I, Tomohiro
2014
31-40 P3 p. 316-325
10 p.
article
31 Italian domination in trees Henning, Michael A.
2017
31-40 P3 p. 557-564
8 p.
article
32 Linear-time generation of uniform random derangements encoded in cycle notation Mikawa, Kenji
2017
31-40 P3 p. 722-728
7 p.
article
33 Minimum multiple originator broadcast graphs Liestman, Arthur L.
2017
31-40 P3 p. 646-661
16 p.
article
34 Modular periodicity of exponential sums of symmetric Boolean functions Castro, Francis N.
2017
31-40 P3 p. 455-473
19 p.
article
35 New simple efficient algorithms computing powers and runs in strings Crochemore, M.
2014
31-40 P3 p. 258-267
10 p.
article
36 Odd gossiping Fertin, Guillaume
2017
31-40 P3 p. 550-561
12 p.
article
37 On 2-distance coloring of plane graphs with girth 5 Dong, Wei
2017
31-40 P3 p. 495-505
11 p.
article
38 On finite pseudorandom binary lattices Gyarmati, Katalin
2017
31-40 P3 p. 589-597
9 p.
article
39 On graphs uniquely defined by their K -circular matroids De Jesús, José F.
2017
31-40 P3 p. 474-487
14 p.
article
40 On Kloosterman sums over finite fields of characteristic 3 Bassalygo, L.A.
2017
31-40 P3 p. 518-523
6 p.
article
41 On longest non-Hamiltonian cycles in digraphs with the conditions of Bang-Jensen, Gutin and Li Darbinyan, S.Kh.
2017
31-40 P3 p. 537-549
13 p.
article
42 On pseudorandomness of families of binary sequences Sárközy, András
2017
31-40 P3 p. 670-676
7 p.
article
43 On the maximum number of edges in a hypergraph with given matching number Frankl, Peter
2017
31-40 P3 p. 562-581
20 p.
article
44 On the minimal ABC index of trees with k leaves Lin, Wenshui
2017
31-40 P3 p. 622-627
6 p.
article
45 On 3-uniform hypergraphs without a cycle of a given length Füredi, Zoltán
2017
31-40 P3 p. 582-588
7 p.
article
46 On weight choosabilities of graphs with bounded maximum average degree Przybyło, Jakub
2017
31-40 P3 p. 663-672
10 p.
article
47 Permutation polynomials and a new public-key encryption Khachatrian, Gurgen
2017
31-40 P3 p. 622-626
5 p.
article
48 Practical fixed length Lempel–Ziv coding Klein, Shmuel T.
2014
31-40 P3 p. 326-333
8 p.
article
49 Preface: Levon Khachatrian’s legacy in extremal combinatorics Füredi, Zoltán
2017
31-40 P3 p. 483-488
6 p.
article
50 Recursive cubes of rings as models for interconnection networks Mokhtar, Hamid
2017
31-40 P3 p. 639-662
24 p.
article
51 Rime: Repeat identification Federico, Maria
2014
31-40 P3 p. 275-286
12 p.
article
52 Scaling laws for maximum coloring of random geometric graphs Borst, Sem
2017
31-40 P3 p. 427-437
11 p.
article
53 Simple tree pattern matching for trees in the prefix bar notation Lahoda, Jan
2014
31-40 P3 p. 343-351
9 p.
article
54 Solving the train marshalling problem by inclusion–exclusion Rinaldi, Franca
2017
31-40 P3 p. 685-690
6 p.
article
55 Strict chordal and strict split digraphs Hell, Pavol
2017
31-40 P3 p. 609-617
9 p.
article
56 String matching with lookahead Peltola, Hannu
2014
31-40 P3 p. 352-360
9 p.
article
57 Stringology algorithms Holub, Jan
2014
31-40 P3 p. 237-
1 p.
article
58 t -CIS codes over G F ( p ) and orthogonal arrays Kim, Hyun Jin
2017
31-40 P3 p. 601-612
12 p.
article
59 Text searching allowing for inversions and translocations of factors Cantone, Domenico
2014
31-40 P3 p. 247-257
11 p.
article
60 The complexity of partitioning into disjoint cliques and a triangle-free graph Bougeret, Marin
2017
31-40 P3 p. 438-445
8 p.
article
61 The 2-good-neighbor connectivity and 2-good-neighbor diagnosability of bubble-sort star graph networks Wang, Shiying
2017
31-40 P3 p. 691-706
16 p.
article
62 The k -rainbow reinforcement numbers in graphs Amjadi, J.
2017
31-40 P3 p. 394-404
11 p.
article
63 The pessimistic diagnosability of three kinds of graphs Gu, Mei-Mei
2017
31-40 P3 p. 548-556
9 p.
article
64 The splitting technique in monotone recognition Aslanyan, L.
2017
31-40 P3 p. 502-512
11 p.
article
65 Tight and simple Web graph compression for forward and reverse neighbor queries Grabowski, Szymon
2014
31-40 P3 p. 298-306
9 p.
article
66 Total domination in maximal outerplanar graphs Dorfling, Michael
2017
31-40 P3 p. 506-511
6 p.
article
67 ToTo: An open database for computation, storage and retrieval of tree decompositions van Wersch, Rim
2017
31-40 P3 p. 389-393
5 p.
article
68 Towards extending the Ahlswede–Khachatrian theorem to cross t -intersecting families Lee, Sang June
2017
31-40 P3 p. 627-645
19 p.
article
                             68 results found
 
 Koninklijke Bibliotheek - National Library of the Netherlands