Digitale Bibliotheek
Sluiten Bladeren door artikelen uit een tijdschrift
 
Zoeken naar met titel:
ABCDEFGHIJKLMNOPQRSTUVWXYZ

     Tijdschrift beschrijving
       Alle jaargangen van het bijbehorende tijdschrift
         Alle afleveringen van het bijbehorende jaargang
                                       Alle artikelen van de bijbehorende aflevering
 
                             390 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 A complexity analysis of Policy Iteration through combinatorial matrices arising from Unique Sink Orientations Gerencsér, Balázs
 2017
 38-41 C p. 21-38
18 p.
 artikel
2 A computational framework for determining run-maximal strings Baker, Andrew
 2013
 38-41 C p. 43-50
8 p.
 artikel
3 A condensation-based application of Cramerʼs rule for solving large-scale linear systems Habgood, Ken
 2012
 38-41 C p. 98-109
12 p.
 artikel
4 Acyclic colorings of graph subdivisions revisited Mondal, Debajyoti
 2012
 38-41 C p. 90-103
14 p.
 artikel
5 Acyclic coloring with few division vertices Mondal, Debajyoti
 2013
 38-41 C p. 42-53
12 p.
 artikel
6 Adaptive search over sorted sets Bonasera, Biagio
 2015
 38-41 C p. 128-133
6 p.
 artikel
7 A distribution-sensitive dictionary with low space overhead Bose, Prosenjit
 2012
 38-41 C p. 140-145
6 p.
 artikel
8 A faster algorithm for the resource allocation problem with convex cost functions Shi, Cong
 2015
 38-41 C p. 137-146
10 p.
 artikel
9 A faster implementation of online RLBWT and its application to LZ77 parsing Ohno, Tatsuya
 2018
 38-41 C p. 18-28
 artikel
10 A golden ratio parameterized algorithm for Cluster Editing Böcker, Sebastian
 2012
 38-41 C p. 79-89
11 p.
 artikel
11 A graph-theoretic model to solve the approximate string matching problem allowing for translocations Ahmed, Pritom
 2013
 38-41 C p. 143-156
14 p.
 artikel
12 A heuristic algorithm for finding cost-effective solutions to real-world school bus routing problems Lewis, R.
 2018
 38-41 C p. 2-17
 artikel
13 Algorithms and combinatorial properties on shortest unique palindromic substrings Inoue, Hiroe
 2018
 38-41 C p. 122-132
 artikel
14 Algorithms for computing Best Coverage Path in the presence of obstacles in a sensor field Basu Roy, Senjuti
 2012
 38-41 C p. 86-97
12 p.
 artikel
15 Algorithms for GA-H reduced graphs Gavril, Fanica
 2015
 38-41 C p. 17-26
10 p.
 artikel
16 Algorithms for path-constrained sequence alignment Pinhas, Tamar
 2014
 38-41 C p. 48-58
11 p.
 artikel
17 Algorithms for topology-free and alignment network queries Pinter, Ron Y.
 2014
 38-41 C p. 29-53
25 p.
 artikel
18 A linear algorithm for string reconstruction in the reverse complement equivalence model Cicalese, Ferdinando
 2012
 38-41 C p. 37-54
18 p.
 artikel
19 A linear time algorithm for Shortest Cyclic Cover of Strings Cazaux, Bastien
 2016
 38-41 C p. 56-67
12 p.
 artikel
20 All-maximum and all-minimum problems under some measures Mukhopadhyay, Asish
 2013
 38-41 C p. 18-31
14 p.
 artikel
21 A lower bound for weak Schur numbers with a deterministic algorithm Ben Hassine, Ghada
 2018
 38-41 C p. 12-25
 artikel
22 Alphabet-independent algorithms for finding context-sensitive repeats in linear time Ohlebusch, Enno
 2015
 38-41 C p. 23-36
14 p.
 artikel
23 An algorithm for enumerating all infinite repetitions in a D0L-system Klouda, Karel
 2015
 38-41 C p. 130-138
9 p.
 artikel
24 An algorithm for finding input–output constrained convex sets in an acyclic digraph Gutin, G.
 2012
 38-41 C p. 47-58
12 p.
 artikel
25 An algorithm for mapping short reads to a dynamically changing genomic sequence Iliopoulos, Costas S.
 2012
 38-41 C p. 15-22
8 p.
 artikel
26 An algorithm for road coloring Trahtman, A.N.
 2012
 38-41 C p. 213-223
11 p.
 artikel
27 An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints Wu, Yingjie
 2014
 38-41 C p. 98-105
8 p.
 artikel
28 An efficient Gray code algorithm for generating all permutations with a given major index Vajnovszki, Vincent
 2014
 38-41 C p. 77-88
12 p.
 artikel
29 An efficient Variable-to-Fixed length encoding using multiplexed parse trees Yoshida, Satoshi
 2015
 38-41 C p. 75-86
12 p.
 artikel
30 An elegant algorithm for the construction of suffix arrays Rajasekaran, Sanguthevar
 2014
 38-41 C p. 21-28
8 p.
 artikel
31 A new upper bound for the traveling salesman problem in cubic graphs Liśkiewicz, Maciej
 2014
 38-41 C p. 1-20
20 p.
 artikel
32 A new view on Rural Postman based on Eulerian Extension and Matching Sorge, Manuel
 2012
 38-41 C p. 12-33
22 p.
 artikel
33 An exact exponential-time algorithm for the Directed Maximum Leaf Spanning Tree problem Binkele-Raible, Daniel
 2012
 38-41 C p. 43-55
13 p.
 artikel
34 An improved algorithm for the all-pairs suffix–prefix problem Tustumi, William H.A.
 2016
 38-41 C p. 34-43
10 p.
 artikel
35 An improved algorithm for the shortest descending path on a convex terrain Wei, Xiangzhi
 2013
 38-41 C p. 52-56
5 p.
 artikel
36 An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2 Wei, Chia-Chen
 2015
 38-41 C p. 62-71
10 p.
 artikel
37 An improved upper bound and algorithm for clique covers McIntyre, Ryan
 2018
 38-41 C p. 42-56
 artikel
38 An O ( n 3 log ⁡ log ⁡ n / log 2 ⁡ n ) time algorithm for all pairs shortest paths Han, Yijie
 2016
 38-41 C p. 9-19
11 p.
 artikel
39 A note on a simple computation of the maximal suffix of a string Adamczyk, Zbigniew
 2013
 38-41 C p. 61-64
4 p.
 artikel
40 A note on maximum differential coloring of planar graphs Bekos, M.A.
 2014
 38-41 C p. 1-7
7 p.
 artikel
41 A note on the largest number of red nodes in red-black trees Zhu, Daxin
 2017
 38-41 C p. 81-94
14 p.
 artikel
42 A note on the longest common compatible prefix problem for partial words Crochemore, M.
 2015
 38-41 C p. 49-53
5 p.
 artikel
43 A novel approach for leveraging co-occurrence to improve the false positive error in signature files Ghodsnia, Pedram
 2013
 38-41 C p. 63-74
12 p.
 artikel
44 A pathfinding problem for search trees with unknown edge length Hiraishi, Kunihiko
 2018
 38-41 C p. 1-7
 artikel
45 Approximate one-to-one point pattern matching Benkert, Marc
 2012
 38-41 C p. 1-15
15 p.
 artikel
46 Approximate pattern matching in LZ77-compressed texts Gagie, Travis
 2015
 38-41 C p. 64-68
5 p.
 artikel
47 Approximate regular expression matching with multi-strings Belazzougui, Djamal
 2013
 38-41 C p. 14-21
8 p.
 artikel
48 Approximate search of short patterns with high error rates using the 01⁎0 lossless seeds Vroland, Christophe
 2016
 38-41 C p. 3-16
14 p.
 artikel
49 Approximating minimum cost source location problems with local vertex-connectivity demands Fukunaga, Takuro
 2013
 38-41 C p. 30-38
9 p.
 artikel
50 Approximating subset k-connectivity problems Nutov, Zeev
 2012
 38-41 C p. 51-59
9 p.
 artikel
51 Approximating the 3-period Incremental Knapsack Problem Della Croce, Federico
 2018
 38-41 C p. 55-69
 artikel
52 Approximating vertex cover in dense hypergraphs Cardinal, Jean
 2012
 38-41 C p. 67-77
11 p.
 artikel
53 Approximation and hardness results for the maximum edge q-coloring problem Adamaszek, Anna
 2016
 38-41 C p. 1-8
8 p.
 artikel
54 Approximation complexity of Metric Dimension problem Hauptmann, Mathias
 2012
 38-41 C p. 214-222
9 p.
 artikel
55 Approximation schemes for generalized two-dimensional vector packing with application to data placement Shachnai, Hadas
 2012
 38-41 C p. 35-48
14 p.
 artikel
56 Approximation with a fixed number of solutions of some multiobjective maximization problems Bazgan, Cristina
 2013
 38-41 C p. 19-29
11 p.
 artikel
57 A prefix array for parameterized strings Beal, Richard
 2017
 38-41 C p. 23-34
12 p.
 artikel
58 A priority queue with the time-finger property Elmasry, Amr
 2012
 38-41 C p. 206-212
7 p.
 artikel
59 A separation between RLSLPs and LZ77 Bille, Philip
 2018
 38-41 C p. 36-39
 artikel
60 A space efficient direct access data structure Baruch, Gilad
 2017
 38-41 C p. 26-37
12 p.
 artikel
61 Astral graphs (threshold graphs), scale-free graphs and related algorithmic questions Vernitski, Alexei
 2012
 38-41 C p. 24-28
5 p.
 artikel
62 A subquadratic algorithm for minimum palindromic factorization Fici, Gabriele
 2014
 38-41 C p. 41-48
8 p.
 artikel
63 A succinct data structure for self-indexing ternary relations Alvarez-Garcia, Sandra
 2017
 38-41 C p. 38-53
16 p.
 artikel
64 A suffix tree or not a suffix tree? Starikovskaya, Tatiana
 2015
 38-41 C p. 14-23
10 p.
 artikel
65 A tight upper bound on the ( 2 , 1 )-total labeling number of outerplanar graphs Hasunuma, Toru
 2012
 38-41 C p. 189-206
18 p.
 artikel
66 A top down algorithm for constrained tree inclusion Hsiao, Yu-Hsiang
 2015
 38-41 C p. 62-69
8 p.
 artikel
67 Autonomous localization based energy saving mechanism in indoor MANETs using ACO Vallikannu, R.
 2015
 38-41 C p. 19-30
12 p.
 artikel
68 Bothway embedding of circulant network into grid Rajasingh, Indra
 2015
 38-41 C p. 2-9
8 p.
 artikel
69 Bottleneck Steiner tree with bounded number of Steiner vertices Abu-Affash, A. Karim
 2015
 38-41 C p. 96-100
5 p.
 artikel
70 Bottom-k document retrieval Navarro, Gonzalo
 2015
 38-41 C p. 69-74
6 p.
 artikel
71 Bounded max-colorings of graphs Bampis, E.
 2014
 38-41 C p. 56-68
13 p.
 artikel
72 Bounds from a card trick Gagie, Travis
 2012
 38-41 C p. 2-4
3 p.
 artikel
73 Burrows–Wheeler transform and LCP array construction in constant space Louza, Felipe A.
 2017
 38-41 C p. 14-22
9 p.
 artikel
74 Capacitated Arc Stabbing Rawitz, Dror
 2012
 38-41 C p. 86-94
9 p.
 artikel
75 Chains-into-bins processes Batu, Tuğkan
 2012
 38-41 C p. 21-28
8 p.
 artikel
76 Common intervals and permutation reconstruction from MinMax -betweenness constraints Pelletier, Léo
 2018
 38-41 C p. 8-26
 artikel
77 Complexity and lowers bounds for Power Edge Set Problem Darties, Benoît
 2018
 38-41 C p. 70-91
 artikel
78 Complexity dichotomies for the Minimum F -Overlay problem Cohen, Nathann
 2018
 38-41 C p. 133-142
 artikel
79 Complexity of majority monopoly and signed domination problems Mishra, Sounaka
 2012
 38-41 C p. 49-60
12 p.
 artikel
80 Compressed text indexing with wildcards Hon, Wing-Kai
 2013
 38-41 C p. 23-29
7 p.
 artikel
81 Computational Complexity Relationship between Compaction, Vertex-Compaction, and Retraction Vikas, Narayan
 2018
 38-41 C p. 168-181
 artikel
82 Computing a longest common subsequence that is almost increasing on sequences having no repeated elements Moosa, Johra Muhammad
 2013
 38-41 C p. 12-20
9 p.
 artikel
83 Computing role assignments of proper interval graphs in polynomial time Heggernes, Pinar
 2012
 38-41 C p. 173-188
16 p.
 artikel
84 Computing the Burrows–Wheeler transform in place and in small space Crochemore, Maxime
 2015
 38-41 C p. 44-52
9 p.
 artikel
85 Computing the Burrows–Wheeler transform of a string and its reverse in parallel Ohlebusch, Enno
 2014
 38-41 C p. 21-33
13 p.
 artikel
86 Computing the list chromatic index of graphs Schauz, Uwe
 2018
 38-41 C p. 182-191
 artikel
87 Computing the longest common prefix array based on the Burrows–Wheeler transform Beller, Timo
 2013
 38-41 C p. 22-31
10 p.
 artikel
88 Computing the partial word avoidability indices of binary patterns Blanchet-Sadri, F.
 2013
 38-41 C p. 113-118
6 p.
 artikel
89 Computing the partial word avoidability indices of ternary patterns Blanchet-Sadri, F.
 2013
 38-41 C p. 119-142
24 p.
 artikel
90 Computing the rooted triplet distance between galled trees by counting triangles Jansson, Jesper
 2014
 38-41 C p. 66-78
13 p.
 artikel
91 Computing upward topological book embeddings of upward planar digraphs Giordano, F.
 2015
 38-41 C p. 45-69
25 p.
 artikel
92 Computing with membranes and picture arrays Prasanna Venkatesan, A.S.
 2015
 38-41 C p. 31-42
12 p.
 artikel
93 Constructing non-cyclic pandiagonal Latin squares of prime orders Dabbaghian, Vahid
 2015
 38-41 C p. 70-77
8 p.
 artikel
94 Cool-lex order and k-ary Catalan structures Durocher, Stephane
 2012
 38-41 C p. 287-307
21 p.
 artikel
95 Correcting gene tree by removal and modification: Tractability and approximability Beretta, Stefano
 2015
 38-41 C p. 115-129
15 p.
 artikel
96 Corrections to “Finding dominators via disjoint set union” [J. Discrete Algorithms 23 (2013) 2–20] Fraczak, Wojciech
 2014
 38-41 C p. 106-110
5 p.
 artikel
97 Correlation decay and deterministic FPTAS for counting colorings of a graph Gamarnik, David
 2012
 38-41 C p. 29-47
19 p.
 artikel
98 Corrigendum to “On a lemma of Crochemore and Rytter” [Journal of Discrete Algorithms 34 (2015) 18–22] Bai, H.
 2016
 38-41 C p. 50-51
2 p.
 artikel
99 Corrigendum to “On the negative cost girth problem in planar networks” [Journal of Discrete Algorithms 35 (2015) 40–50] Williamson, Matthew
 2016
 38-41 C p. 52-53
2 p.
 artikel
100 Counting and computing the Rand and block distances of pairs of set partitions Ruskey, Frank
 2012
 38-41 C p. 236-248
13 p.
 artikel
101 Counting solutions to CSP using generating polynomials Berend, Daniel
 2014
 38-41 C p. 89-97
9 p.
 artikel
102 Cross-document pattern matching Kopelowitz, Tsvi
 2014
 38-41 C p. 40-47
8 p.
 artikel
103 Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes Foucaud, Florent
 2015
 38-41 C p. 48-68
21 p.
 artikel
104 Degree associated edge reconstruction number of graphs Monikandan, S.
 2013
 38-41 C p. 35-41
7 p.
 artikel
105 Designing optimal- and fast-on-average pattern matching algorithms Didier, Gilles
 2017
 38-41 C p. 45-60
16 p.
 artikel
106 Detecting induced star-like minors in polynomial time Fiala, Jiří
 2012
 38-41 C p. 74-85
12 p.
 artikel
107 Detecting 2-joins faster Charbit, Pierre
 2012
 38-41 C p. 60-66
7 p.
 artikel
108 Dictionary-symbolwise flexible parsing Crochemore, Maxime
 2012
 38-41 C p. 74-90
17 p.
 artikel
109 Discrete algorithms and methods for security of statistical databases related to the work of Mirka Miller Kelarev, Andrei
 2018
 38-41 C p. 112-121
 artikel
110 Distributed colorings for collision-free routing in sink-centric sensor networks Navarra, Alfredo
 2012
 38-41 C p. 232-247
16 p.
 artikel
111 Dominating induced matchings in graphs without a skew star Korpelainen, Nicholas
 2014
 38-41 C p. 45-55
11 p.
 artikel
112 d-Transversals of stable sets and vertex covers in weighted bipartite graphs Bentz, C.
 2012
 38-41 C p. 95-102
8 p.
 artikel
113 Dynamic edit distance table under a general weighted cost function Hyyrö, Heikki
 2015
 38-41 C p. 2-17
16 p.
 artikel
114 Dynamic graph-based search in unknown environments Haynes, Paul S.
 2012
 38-41 C p. 2-13
12 p.
 artikel
115 Editorial Stoye, Jens
 2014
 38-41 C p. 1-
1 p.
 artikel
116 Editorial Bharati, R.
 2015
 38-41 C p. 1-
1 p.
 artikel
117 Editorial Bannai, Hideo
 2015
 38-41 C p. 1-
1 p.
 artikel
118 Editorial Grossi, Roberto
 2013
 38-41 C p. 1-2
2 p.
 artikel
119 Editorial Ciaccia, Paolo
 2012
 38-41 C p. 1-
1 p.
 artikel
120 Editorial Stewart, Iain A.
 2012
 38-41 C p. 1-
1 p.
 artikel
121 Editorial Iliopoulos, Costas S.
 2012
 38-41 C p. 1-
1 p.
 artikel
122 Editorial Radzik, Tomasz
 2012
 38-41 C p. 1-2
2 p.
 artikel
123 Editorial Lecroq, Thierry
 2015
 38-41 C p. 1-
1 p.
 artikel
124 Editorial Kundu, Ritu
 2018
 38-41 C p. 1
 artikel
125 Editorial Board 2015
 38-41 C p. iii-
1 p.
 artikel
126 Editorial Board 2014
 38-41 C p. iii-iv
nvt p.
 artikel
127 Editorial Board 2014
 38-41 C p. iii-iv
nvt p.
 artikel
128 Editorial Board 2014
 38-41 C p. iii-iv
nvt p.
 artikel
129 Editorial Board 2016
 38-41 C p. iii-
1 p.
 artikel
130 Editorial Board 2015
 38-41 C p. iii-
1 p.
 artikel
131 Editorial Board 2016
 38-41 C p. iii-
1 p.
 artikel
132 Editorial Board 2014
 38-41 C p. iii-iv
nvt p.
 artikel
133 Editorial Board 2014
 38-41 C p. iii-iv
nvt p.
 artikel
134 Editorial Board 2017
 38-41 C p. iii-
1 p.
 artikel
135 Editorial Board 2017
 38-41 C p. iii-
1 p.
 artikel
136 Editorial Board 2016
 38-41 C p. iii-
1 p.
 artikel
137 Editorial Board 2018
 38-41 C p. ii
 artikel
138 Editorial Board 2018
 38-41 C p. ii
 artikel
139 Editorial Board 2017
 38-41 C p. iii-
1 p.
 artikel
140 Editorial Board 2017
 38-41 C p. iii-
1 p.
 artikel
141 Editorial Board 2017
 38-41 C p. iii-
1 p.
 artikel
142 Editorial Board 2015
 38-41 C p. iii-
1 p.
 artikel
143 Editorial Board 2015
 38-41 C p. iii-
1 p.
 artikel
144 Editorial Board 2012
 38-41 C p. iii-iv
nvt p.
 artikel
145 Editorial Board 2013
 38-41 C p. iii-iv
nvt p.
 artikel
146 Editorial Board 2013
 38-41 C p. iii-iv
nvt p.
 artikel
147 Editorial Board 2013
 38-41 C p. v-vi
nvt p.
 artikel
148 Editorial Board 2013
 38-41 C p. iii-iv
nvt p.
 artikel
149 Editorial Board 2013
 38-41 C p. iii-iv
nvt p.
 artikel
150 Editorial Board 2012
 38-41 C p. iii-iv
nvt p.
 artikel
151 Editorial Board 2012
 38-41 C p. iii-iv
nvt p.
 artikel
152 Editorial Board 2013
 38-41 C p. iii-iv
nvt p.
 artikel
153 Editorial Board 2014
 38-41 C p. iii-iv
nvt p.
 artikel
154 Editorial Board 2012
 38-41 C p. iii-iv
nvt p.
 artikel
155 Editorial Board 2012
 38-41 C p. iii-iv
nvt p.
 artikel
156 Editorial Board 2012
 38-41 C p. iii-iv
nvt p.
 artikel
157 Editorial Board 2012
 38-41 C p. iii-iv
nvt p.
 artikel
158 Editorial Board 2012
 38-41 C p. iii-iv
nvt p.
 artikel
159 Editorial Board 2015
 38-41 C p. iii-
1 p.
 artikel
160 Editorial Board 2015
 38-41 C p. iii-
1 p.
 artikel
161 Editorial Board 2018
 38-41 C p. ii
 artikel
162 Editorial Board 2018
 38-41 C p. ii
 artikel
163 Editorial Board 2018
 38-41 C p. ii
 artikel
164 Efficient algorithms for the periodic subgraphs mining problem Apostolico, Alberto
 2012
 38-41 C p. 24-30
7 p.
 artikel
165 Efficient algorithms for three variants of the LPF table Crochemore, Maxime
 2012
 38-41 C p. 51-61
11 p.
 artikel
166 Efficient chaining of seeds in ordered trees Allali, Julien
 2012
 38-41 C p. 107-118
12 p.
 artikel
167 Efficient codon optimization with motif engineering Condon, Anne
 2012
 38-41 C p. 104-112
9 p.
 artikel
168 Efficient exponential-time algorithms for edit distance between unordered trees Akutsu, Tatsuya
 2014
 38-41 C p. 79-93
15 p.
 artikel
169 Efficient Lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements Gu, Hanyu
 2018
 38-41 C p. 143-155
 artikel
170 Efficient total domination in digraphs Schaudt, Oliver
 2012
 38-41 C p. 32-42
11 p.
 artikel
171 Embedding certain height-balanced trees and complete p m -ary trees into hypercubes Indhumathi, Raman
 2013
 38-41 C p. 53-65
13 p.
 artikel
172 Energy-efficient broadcasting in ad hoc wireless networks Karmakar, Sushanta
 2017
 38-41 C p. 2-13
12 p.
 artikel
173 Engineering graph-based models for dynamic timetable information systems Cionini, Alessio
 2017
 38-41 C p. 40-58
19 p.
 artikel
174 Enumerating trichromatic triangles containing the origin in linear time Elmasry, Amr
 2012
 38-41 C p. 45-50
6 p.
 artikel
175 ESP-index: A compressed index based on edit-sensitive parsing Maruyama, Shirou
 2013
 38-41 C p. 100-112
13 p.
 artikel
176 Exact counting of Euler tours for generalized series-parallel graphs Chebolu, Prasad
 2012
 38-41 C p. 110-122
13 p.
 artikel
177 Excessive index for mesh derived networks Rajasingh, Indra
 2015
 38-41 C p. 43-48
6 p.
 artikel
178 Exploring the median of permutations problem Milosz, Robin
 2018
 38-41 C p. 92-111
 artikel
179 Exponential approximation schemata for some network design problems Boria, Nicolas
 2013
 38-41 C p. 43-52
10 p.
 artikel
180 Extended to multi-tilde–bar regular expressions and efficient finite automata constructions Ouardi, Faissal
 2015
 38-41 C p. 58-70
13 p.
 artikel
181 Extending common intervals searching from permutations to sequences Rusu, Irena
 2014
 38-41 C p. 27-46
20 p.
 artikel
182 Fast and flexible packed string matching Faro, Simone
 2014
 38-41 C p. 61-72
12 p.
 artikel
183 Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism Kaneta, Yusaku
 2012
 38-41 C p. 119-135
17 p.
 artikel
184 Faster replacement paths algorithms in case of edge or node failure for undirected, positive integer weighted graphs Mahadeokar, Jay
 2013
 38-41 C p. 54-62
9 p.
 artikel
185 Fast q-gram mining on SLP compressed strings Goto, Keisuke
 2013
 38-41 C p. 89-99
11 p.
 artikel
186 Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs Cantone, Domenico
 2014
 38-41 C p. 12-25
14 p.
 artikel
187 Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement Bhagat, S.
 2016
 38-41 C p. 50-62
13 p.
 artikel
188 Finding dominators via disjoint set union Fraczak, Wojciech
 2013
 38-41 C p. 2-20
19 p.
 artikel
189 Finding kernels or solving SAT Walicki, Michał
 2012
 38-41 C p. 146-164
19 p.
 artikel
190 Fine-tuning the search for microsatellites de Ridder, C.
 2013
 38-41 C p. 21-37
17 p.
 artikel
191 Folding a paper strip to minimize thickness Demaine, Erik D.
 2016
 38-41 C p. 18-26
9 p.
 artikel
192 Forwarding and optical indices of 4-regular circulant networks Gan, Heng-Soon
 2015
 38-41 C p. 27-39
13 p.
 artikel
193 Fuzzy local ω-systems Arulprakasam, R.
 2013
 38-41 C p. 157-164
8 p.
 artikel
194 Gathering six oblivious robots on anonymous symmetric rings D'Angelo, Gianlorenzo
 2014
 38-41 C p. 16-27
12 p.
 artikel
195 Generating simple convex Venn diagrams Mamakani, Khalegh
 2012
 38-41 C p. 270-286
17 p.
 artikel
196 Gene tree correction for reconciliation and species tree inference: Complexity and algorithms Dondi, Riccardo
 2014
 38-41 C p. 51-65
15 p.
 artikel
197 GLOUDS: Representing tree-like graphs Fischer, Johannes
 2016
 38-41 C p. 39-49
11 p.
 artikel
198 Grammar compressed sequences with rank/select support Ordóñez, Alberto
 2017
 38-41 C p. 54-71
18 p.
 artikel
199 Graph modification problem for some classes of graphs Sritharan, R.
 2016
 38-41 C p. 32-37
6 p.
 artikel
200 Greedy algorithms and poset matroids Ferrari, Luca
 2014
 38-41 C p. 21-26
6 p.
 artikel
201 Guarding monotone art galleries with sliding cameras in linear time de Berg, Mark
 2017
 38-41 C p. 39-47
9 p.
 artikel
202 Hamiltonian orthogeodesic alternating paths Di Giacomo, Emilio
 2012
 38-41 C p. 34-52
19 p.
 artikel
203 Hybrid Bellman–Ford–Dijkstra algorithm Dinitz, Yefim
 2017
 38-41 C p. 35-44
10 p.
 artikel
204 Identifying path covers in graphs Foucaud, Florent
 2013
 38-41 C p. 21-34
14 p.
 artikel
205 Improved and extended locating functionality on compressed suffix arrays Gog, Simon
 2015
 38-41 C p. 53-63
11 p.
 artikel
206 Improved and self-tuned occurrence heuristics Cantone, Domenico
 2014
 38-41 C p. 73-84
12 p.
 artikel
207 Improved approximation bounds for the Student-Project Allocation problem with preferences over projects Iwama, Kazuo
 2012
 38-41 C p. 59-66
8 p.
 artikel
208 Improved approximations for TSP with simple precedence constraints Böckenhauer, Hans-Joachim
 2013
 38-41 C p. 32-40
9 p.
 artikel
209 Improved compressed indexes for full-text document retrieval Belazzougui, Djamal
 2013
 38-41 C p. 3-13
11 p.
 artikel
210 Improved pattern-scan-order algorithms for string matching Ryu, Cheol
 2018
 38-41 C p. 27-36
 artikel
211 Improved Range Minimum Queries Ferrada, Héctor
 2017
 38-41 C p. 72-80
9 p.
 artikel
212 Improved Steiner tree algorithms for bounded treewidth Chimani, Markus
 2012
 38-41 C p. 67-78
12 p.
 artikel
213 Improving time-efficiency in blocking expanding ring search for mobile ad hoc networks Pu, Ida M.
 2014
 38-41 C p. 59-67
9 p.
 artikel
214 Improvised divide and conquer approach for the LIS problem Rani, Seema
 2018
 38-41 C p. 17-26
 artikel
215 Indeterminate string inference algorithms Nazeen, Sumaiya
 2012
 38-41 C p. 23-34
12 p.
 artikel
216 Indexability, concentration, and VC theory Pestov, Vladimir
 2012
 38-41 C p. 2-18
17 p.
 artikel
217 Indexing hypertext Thachuk, Chris
 2013
 38-41 C p. 113-122
10 p.
 artikel
218 Inferring an indeterminate string from a prefix graph Alatabbi, Ali
 2015
 38-41 C p. 6-13
8 p.
 artikel
219 Infinite words containing the minimal number of repetitions Badkobeh, Golnaz
 2013
 38-41 C p. 38-42
5 p.
 artikel
220 Insertion and sorting in a sequence of numbers minimizing the maximum sum of a contiguous subsequence Corrêa, Ricardo C.
 2013
 38-41 C p. 1-10
10 p.
 artikel
221 Integer representations towards efficient counting in the bit probe model Brodal, Gerth Stølting
 2014
 38-41 C p. 34-44
11 p.
 artikel
222 Interval graph representation with given interval and intersection lengths Köbler, Johannes
 2015
 38-41 C p. 108-117
10 p.
 artikel
223 Irreversible conversion processes with deadlines Rautenbach, Dieter
 2014
 38-41 C p. 69-76
8 p.
 artikel
224 k-Abelian pattern matching Ehlers, Thorsten
 2015
 38-41 C p. 37-48
12 p.
 artikel
225 Kinetic Euclidean minimum spanning tree in the plane Rahmati, Zahed
 2012
 38-41 C p. 2-11
10 p.
 artikel
226 Large deviation properties for patterns Bourdon, Jérémie
 2014
 38-41 C p. 2-11
10 p.
 artikel
227 Largest inscribed rectangles in convex polygons Knauer, Christian
 2012
 38-41 C p. 78-85
8 p.
 artikel
228 Lattices, whose incomparability graphs have horns Wasadikar, Meenakshi
 2013
 38-41 C p. 63-75
13 p.
 artikel
229 Layouts for improved hierarchical parallel computations Hirsch, Michael
 2014
 38-41 C p. 23-30
8 p.
 artikel
230 Leader election and gathering for asynchronous fat robots without common chirality Gan Chaudhuri, Sruti
 2015
 38-41 C p. 171-192
22 p.
 artikel
231 Lightweight LCP construction for very large collections of strings Cox, Anthony J.
 2016
 38-41 C p. 17-33
17 p.
 artikel
232 Linear ordering based MIP formulations for the vertex separation or pathwidth problem Mallach, Sven
 2018
 38-41 C p. 156-167
 artikel
233 2015 London Stringology Days and London Algorithmic Workshop (LSD & LAW) Radoszewski, Jakub
 2016
 38-41 C p. 1-2
2 p.
 artikel
234 LP-rounding algorithms for the fault-tolerant facility placement problem Yan, Li
 2015
 38-41 C p. 93-114
22 p.
 artikel
235 Lyndon array construction during Burrows–Wheeler inversion Louza, Felipe A.
 2018
 38-41 C p. 2-9
 artikel
236 Maximal strip recovery problem with gaps: Hardness and approximation algorithms Bulteau, Laurent
 2013
 38-41 C p. 1-22
22 p.
 artikel
237 Maximizing the overall end-user satisfaction of data broadcast in wireless mesh networks Audrito, G.
 2017
 38-41 C p. 14-25
12 p.
 artikel
238 Maximum spectral radius of graphs with given connectivity, minimum degree and independence number Lu, Hongliang
 2015
 38-41 C p. 113-119
7 p.
 artikel
239 Max-leaves spanning tree is APX-hard for cubic graphs Bonsma, Paul
 2012
 38-41 C p. 14-23
10 p.
 artikel
240 Minimal sum labeling of graphs Konečný, Matěj
 2018
 38-41 C p. 29-37
 artikel
241 Minimum weight Euclidean t-spanner is NP-hard Carmi, Paz
 2013
 38-41 C p. 30-42
13 p.
 artikel
242 Model Based Comparison of Discounted Cumulative Gain and Average Precision Dupret, Georges
 2013
 38-41 C p. 49-62
14 p.
 artikel
243 Modelling efficient novelty-based search result diversification in metric spaces Gil-Costa, Veronica
 2013
 38-41 C p. 75-88
14 p.
 artikel
244 Monomer-dimer tatami tilings of square regions Erickson, Alejandro
 2012
 38-41 C p. 258-269
12 p.
 artikel
245 More results on overlapping squares Franek, Frantisek
 2012
 38-41 C p. 2-8
7 p.
 artikel
246 Multi-pattern matching with bidirectional indexes ☆ ☆ Preliminary version of this article appeared in COCOON 2012 [12]. Gog, Simon
 2014
 38-41 C p. 26-39
14 p.
 artikel
247 Nearly tight approximation bounds for vertex cover on dense k-uniform k-partite hypergraphs Karpinski, Marek
 2015
 38-41 C p. 49-57
9 p.
 artikel
248 Near optimal algorithm for the shortest descending path on the surface of a convex terrain Roy, Sasanka
 2012
 38-41 C p. 63-70
8 p.
 artikel
249 Near optimal line segment queries in simple polygons Nouri Bygi, Mojtaba
 2015
 38-41 C p. 51-61
11 p.
 artikel
250 Near-optimal online multiselection in internal and external memory Barbay, Jérémy
 2016
 38-41 C p. 3-17
15 p.
 artikel
251 Near real-time suffix tree construction via the fringe marked ancestor problem Breslauer, Dany
 2013
 38-41 C p. 32-48
17 p.
 artikel
252 Necklaces and Lyndon words in colexicographic and binary reflected Gray code order Sawada, Joe
 2017
 38-41 C p. 25-35
11 p.
 artikel
253 New applications of interval generators to genome comparison Rusu, Irena
 2012
 38-41 C p. 123-139
17 p.
 artikel
254 New relationships for multi-neighborhood search for the minimum linear arrangement problem Glover, Fred
 2017
 38-41 C p. 16-24
9 p.
 artikel
255 Non-metric similarity search of tandem mass spectra including posttranslational modifications Novák, Jiří
 2012
 38-41 C p. 19-31
13 p.
 artikel
256 [No title] Mouchard, Laurent
 2012
 38-41 C p. 1-
1 p.
 artikel
257 [No title] Arumugam, S.
 2013
 38-41 C p. 1-
1 p.
 artikel
258 [No title] Iliopoulos, Costas S.
 2012
 38-41 C p. 1-
1 p.
 artikel
259 [No title] Daykin, Jacqueline W.
 2012
 38-41 C p. 1-
1 p.
 artikel
260 [No title] Brankovic, Ljiljana
 2018
 38-41 C p. 1
 artikel
261 Number of holes in unavoidable sets of partial words I Blanchet-Sadri, F.
 2012
 38-41 C p. 55-64
10 p.
 artikel
262 Number of holes in unavoidable sets of partial words II Blanchet-Sadri, F.
 2012
 38-41 C p. 65-73
9 p.
 artikel
263 On a conjecture of Erdős for multiplicities of cliques Deza, Antoine
 2012
 38-41 C p. 9-14
6 p.
 artikel
264 On a lemma of Crochemore and Rytter Bai, Haoyue
 2015
 38-41 C p. 18-22
5 p.
 artikel
265 On antimagic labeling of regular graphs with particular factors Wang, Tao-Ming
 2013
 38-41 C p. 76-82
7 p.
 artikel
266 On bounded degree plane strong geometric spanners Bose, Prosenjit
 2012
 38-41 C p. 16-31
16 p.
 artikel
267 On left and right seeds of a string Christou, Michalis
 2012
 38-41 C p. 31-44
14 p.
 artikel
268 On-line construction of position heaps Kucherov, Gregory
 2013
 38-41 C p. 3-11
9 p.
 artikel
269 On-line suffix tree construction with reduced branching Senft, Martin
 2012
 38-41 C p. 48-60
13 p.
 artikel
270 On parsing optimality for dictionary-based text compression—the Zip case Langiu, Alessio
 2013
 38-41 C p. 65-70
6 p.
 artikel
271 On position restricted substring searching in succinct space Hon, Wing-Kai
 2012
 38-41 C p. 109-114
6 p.
 artikel
272 On relating edges in graphs without cycles of length 4 Levit, Vadim E.
 2014
 38-41 C p. 28-33
6 p.
 artikel
273 On the approximability of Dense Steiner Problems Hauptmann, Mathias
 2013
 38-41 C p. 41-51
11 p.
 artikel
274 On the arrangement of stochastic lines in R 2 Li, Yuan
 2017
 38-41 C p. 1-20
20 p.
 artikel
275 On the bit-parallel simulation of the nondeterministic Aho–Corasick and suffix automata for a set of patterns Cantone, Domenico
 2012
 38-41 C p. 25-36
12 p.
 artikel
276 On the complexity of determining the irregular chromatic index of a graph Baudon, Olivier
 2015
 38-41 C p. 113-127
15 p.
 artikel
277 On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion Mishra, Sounaka
 2015
 38-41 C p. 71-80
10 p.
 artikel
278 On the complexity of multi-parameterized cluster editing Abu-Khzam, Faisal N.
 2017
 38-41 C p. 26-34
9 p.
 artikel
279 On the complexity of role colouring planar graphs, trees and cographs Purcell, Christopher
 2015
 38-41 C p. 1-8
8 p.
 artikel
280 On the hardness of full Steiner tree problems Biniaz, Ahmad
 2015
 38-41 C p. 118-127
10 p.
 artikel
281 On the hardness of maximum rank aggregation problems Bachmaier, Christian
 2015
 38-41 C p. 2-13
12 p.
 artikel
282 On the kernel size of clique cover reductions for random intersection graphs Friedrich, Tobias
 2015
 38-41 C p. 128-136
9 p.
 artikel
283 On the maximal sum of exponents of runs in a string Crochemore, Maxime
 2012
 38-41 C p. 29-36
8 p.
 artikel
284 On the maximum independent set problem in subclasses of subcubic graphs Lozin, Vadim
 2015
 38-41 C p. 104-112
9 p.
 artikel
285 On the metric dimension of HDN Xu, Dacheng
 2014
 38-41 C p. 1-6
6 p.
 artikel
286 On the negative cost girth problem in planar networks Williamson, Matthew
 2015
 38-41 C p. 40-50
11 p.
 artikel
287 On the number of elements to reorder when updating a suffix array Léonard, M.
 2012
 38-41 C p. 87-99
13 p.
 artikel
288 On the parameterized complexity of coloring graphs in the absence of a linear forest Couturier, Jean-François
 2012
 38-41 C p. 56-62
7 p.
 artikel
289 On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs Kloks, Ton
 2015
 38-41 C p. 21-28
8 p.
 artikel
290 On the structure of compacted subword graphs of Thue–Morse words and their applications Radoszewski, Jakub
 2012
 38-41 C p. 15-24
10 p.
 artikel
291 On the structure of run-maximal strings Baker, Andrew
 2012
 38-41 C p. 10-14
5 p.
 artikel
292 On weighted efficient total domination Schaudt, Oliver
 2012
 38-41 C p. 61-69
9 p.
 artikel
293 Optimal cover time for a graph-based coupon collector process Dimitrov, Nedialko B.
 2013
 38-41 C p. 39-51
13 p.
 artikel
294 Optimizing bandwidth allocation in elastic optical networks with application to scheduling Shachnai, Hadas
 2017
 38-41 C p. 1-13
13 p.
 artikel
295 Pancake flipping and sorting permutations Hasan, Masud
 2015
 38-41 C p. 139-149
11 p.
 artikel
296 Parallel lightweight wavelet tree, suffix array and FM-index construction Labeit, Julian
 2017
 38-41 C p. 2-17
16 p.
 artikel
297 Parameterized approximability of maximizing the spread of influence in networks Bazgan, Cristina
 2014
 38-41 C p. 54-65
12 p.
 artikel
298 Parameterized complexity of finding small degree-constrained subgraphs Amini, Omid
 2012
 38-41 C p. 70-83
14 p.
 artikel
299 Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem Jordán, Tibor
 2015
 38-41 C p. 29-44
16 p.
 artikel
300 Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number Dabrowski, Konrad
 2012
 38-41 C p. 207-213
7 p.
 artikel
301 Partial Information Network Queries Pinter, Ron Y.
 2015
 38-41 C p. 129-145
17 p.
 artikel
302 Path-based supports for hypergraphs Brandes, Ulrik
 2012
 38-41 C p. 248-261
14 p.
 artikel
303 Pattern matching with wildcards and length constraints using maximum network flow Arslan, Abdullah N.
 2015
 38-41 C p. 9-16
8 p.
 artikel
304 Periods in partial words: An algorithm Blanchet-Sadri, F.
 2012
 38-41 C p. 113-128
16 p.
 artikel
305 Perspectives Smyth, Bill
 2015
 38-41 C p. 3-5
3 p.
 artikel
306 Phase transition of random non-uniform hypergraphs de Panafieu, Élie
 2015
 38-41 C p. 26-39
14 p.
 artikel
307 Pivot selection: Dimension reduction for distance-based indexing Mao, Rui
 2012
 38-41 C p. 32-46
15 p.
 artikel
308 Position-restricted substring searching over small alphabets Biswas, Sudip
 2017
 38-41 C p. 36-39
4 p.
 artikel
309 Power domination in certain chemical structures Stephen, Sudeep
 2015
 38-41 C p. 10-18
9 p.
 artikel
310 Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences Sawada, Joe
 2017
 38-41 C p. 95-110
16 p.
 artikel
311 Preface Mercaş, Robert
 2017
 38-41 C p. 1-
1 p.
 artikel
312 Preface Lecroq, Thierry
 2014
 38-41 C p. 1-
1 p.
 artikel
313 Preface – Compact Data Structures Gagie, Travis
 2017
 38-41 C p. 1-
1 p.
 artikel
314 Prefix and suffix transreversals on binary and ternary strings Khaledur Rahman, Md.
 2015
 38-41 C p. 160-170
11 p.
 artikel
315 (Prefix) reversal distance for (signed) strings with few blocks or small alphabets Bulteau, Laurent
 2016
 38-41 C p. 44-55
12 p.
 artikel
316 Primality test for numbers of the form A p n + w n Deng, Yingpu
 2015
 38-41 C p. 81-92
12 p.
 artikel
317 p-Suffix sorting as arithmetic coding Beal, Richard
 2012
 38-41 C p. 151-169
19 p.
 artikel
318 Quasi-cyclic codes over F 13 and enumeration of defining polynomials Venkaiah, Vadlamudi Ch.
 2012
 38-41 C p. 249-257
9 p.
 artikel
319 Random generation and enumeration of bipartite permutation graphs Saitoh, Toshiki
 2012
 38-41 C p. 84-97
14 p.
 artikel
320 Range search on tuples of points Agrawal, Akash
 2015
 38-41 C p. 1-12
12 p.
 artikel
321 Range selection and predecessor queries in data aware space and time Külekci, M. Oğuzhan
 2017
 38-41 C p. 18-25
8 p.
 artikel
322 Reconstructing binary matrices with timetabling constraints Brlek, Srecko
 2016
 38-41 C p. 20-31
12 p.
 artikel
323 Reporting and counting maximal points in a query orthogonal rectangle Das, Ananda Swarup
 2015
 38-41 C p. 78-95
18 p.
 artikel
324 Reverse engineering of compact suffix trees and links: A novel algorithm Cazaux, Bastien
 2014
 38-41 C p. 9-22
14 p.
 artikel
325 Running time analysis of Ant Colony Optimization for shortest path problems Sudholt, Dirk
 2012
 38-41 C p. 165-180
16 p.
 artikel
326 SAT and IP based algorithms for magic labeling including a complete search for total magic labelings Jäger, Gerold
 2015
 38-41 C p. 87-103
17 p.
 artikel
327 Saturated fully leafed tree-like polyforms and polycubes Blondin Massé, Alexandre
 2018
 38-41 C p. 38-54
 artikel
328 Searching for smallest grammars on large sequences and application to DNA Carrascosa, Rafael
 2012
 38-41 C p. 62-72
11 p.
 artikel
329 Searching of gapped repeats and subrepetitions in a word Kolpakov, Roman
 2017
 38-41 C p. 1-15
15 p.
 artikel
330 Simple and efficient LZW-compressed multiple pattern matching Gawrychowski, Paweł
 2014
 38-41 C p. 34-41
8 p.
 artikel
331 Simple, compact and robust approximate string dictionary Chegrane, Ibrahim
 2014
 38-41 C p. 49-60
12 p.
 artikel
332 Skip lift: A probabilistic alternative to red–black trees Bose, Prosenjit
 2012
 38-41 C p. 13-20
8 p.
 artikel
333 Small k-pyramids and the complexity of determining k Schauerte, Boris
 2015
 38-41 C p. 13-20
8 p.
 artikel
334 Solving the canonical representation and Star System Problems for proper circular-arc graphs in logspace Köbler, Johannes
 2016
 38-41 C p. 38-49
12 p.
 artikel
335 Space efficient data structures for nearest larger neighbor Jayapaul, Varunkumar
 2016
 38-41 C p. 63-75
13 p.
 artikel
336 Space-efficient indexes for forbidden extension queries Biswas, Sudip
 2018
 38-41 C p. 23-35
 artikel
337 Special issue on WALCOM 2015 Rahman, M. Sohel
 2016
 38-41 C p. 1-2
2 p.
 artikel
338 Steiner tree reoptimization in graphs with sharpened triangle inequality Böckenhauer, Hans-Joachim
 2012
 38-41 C p. 73-86
14 p.
 artikel
339 Straight-path queries in trajectory data de Berg, Mark
 2016
 38-41 C p. 27-38
12 p.
 artikel
340 Strengthening hash families and compressive sensing Colbourn, Charles J.
 2012
 38-41 C p. 170-186
17 p.
 artikel
341 String covering with optimal covers Mhaskar, Neerja
 2018
 38-41 C p. 26-38
 artikel
342 StringMasters 2011 Special Issue Crochemore, Maxime
 2013
 38-41 C p. 1-2
2 p.
 artikel
343 StringMasters 2012 & 2013 special issue – volume 2 Crochemore, Maxime
 2015
 38-41 C p. 1-2
2 p.
 artikel
344 StringMasters 2012 & 2013 special issue – volume 1 Crochemore, Maxime
 2014
 38-41 C p. 1-
1 p.
 artikel
345 String matching with alphabet sampling Claude, Francisco
 2012
 38-41 C p. 37-50
14 p.
 artikel
346 String shuffle: Circuits and graphs Mhaskar, Neerja
 2015
 38-41 C p. 120-128
9 p.
 artikel
347 Structural properties of subdivided-line graphs Hasunuma, Toru
 2015
 38-41 C p. 69-86
18 p.
 artikel
348 Sub-quadratic time and linear space data structures for permutation matching in binary strings Moosa, Tanaeem M.
 2012
 38-41 C p. 5-9
5 p.
 artikel
349 Subsequence automata with default transitions Bille, Philip
 2017
 38-41 C p. 48-55
8 p.
 artikel
350 Subset feedback vertex sets in chordal graphs Golovach, Petr A.
 2014
 38-41 C p. 7-15
9 p.
 artikel
351 Succinct representations of weighted trees supporting path queries Patil, Manish
 2012
 38-41 C p. 103-108
6 p.
 artikel
352 Suffix array and Lyndon factorization of a text Mantaci, Sabrina
 2014
 38-41 C p. 2-8
7 p.
 artikel
353 Testing connectivity of faulty networks in sublinear time Dvořák, Tomáš
 2012
 38-41 C p. 223-231
9 p.
 artikel
354 Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph Angelini, Patrizio
 2012
 38-41 C p. 150-172
23 p.
 artikel
355 The adversary degree-associated reconstruction number of double-brooms Ma, Meijie
 2015
 38-41 C p. 150-159
10 p.
 artikel
356 The complete parsimony haplotype inference problem and algorithms based on integer programming, branch-and-bound and Boolean satisfiability Jäger, Gerold
 2016
 38-41 C p. 68-83
16 p.
 artikel
357 The complexity of finding uniform sparsest cuts in various graph classes Bonsma, Paul
 2012
 38-41 C p. 136-149
14 p.
 artikel
358 The complexity of string partitioning Condon, Anne
 2015
 38-41 C p. 24-43
20 p.
 artikel
359 The constrained shortest common supersequence problem Dondi, Riccardo
 2013
 38-41 C p. 11-17
7 p.
 artikel
360 The greedy approach to dictionary-based static text compression on a distributed system De Agostino, Sergio
 2015
 38-41 C p. 54-61
8 p.
 artikel
361 The incidence game chromatic number of ( a , d ) -decomposable graphs Charpentier, C.
 2015
 38-41 C p. 14-25
12 p.
 artikel
362 The knapsack problem with neighbour constraints Borradaile, Glencora
 2012
 38-41 C p. 224-235
12 p.
 artikel
363 The lexicographically smallest universal cycle for binary strings with minimum specified weight Sawada, Joe
 2014
 38-41 C p. 31-40
10 p.
 artikel
364 The maximum k-differential coloring problem Bekos, Michael A.
 2017
 38-41 C p. 35-53
19 p.
 artikel
365 The shortest path problem in the Knödel graph Grigoryan, Hayk
 2015
 38-41 C p. 40-47
8 p.
 artikel
366 The structural border array Beal, Richard
 2013
 38-41 C p. 98-112
15 p.
 artikel
367 The substring inclusion constraint longest common subsequence problem can be solved in quadratic time Alam, Muhammad Rashed
 2012
 38-41 C p. 67-73
7 p.
 artikel
368 The three squares lemma revisited Kopylova, Evguenia
 2012
 38-41 C p. 3-14
12 p.
 artikel
369 The weak-heap data structure: Variants and applications Edelkamp, Stefan
 2012
 38-41 C p. 187-205
19 p.
 artikel
370 Threshold behaviour of discordant voting on the complete graph Cooper, Colin
 2018
 38-41 C p. 10-22
 artikel
371 Time–space trade-offs for longest common extensions Bille, Philip
 2014
 38-41 C p. 42-50
9 p.
 artikel
372 Towards a theory of patches Amir, Amihood
 2012
 38-41 C p. 61-73
13 p.
 artikel
373 Tree based symmetric key broadcast encryption Bhattacherjee, Sanjay
 2015
 38-41 C p. 78-107
30 p.
 artikel
374 Tree template matching in ranked ordered trees by pushdown automata Flouri, Tomáš
 2012
 38-41 C p. 15-23
9 p.
 artikel
375 Tree template matching in unranked ordered trees Christou, Michalis
 2013
 38-41 C p. 51-60
10 p.
 artikel
376 Tropical dominating sets in vertex-coloured graphs Anglès d'Auriac, J.-A.
 2018
 38-41 C p. 27-41
 artikel
377 Uniqueness of Butson Hadamard matrices of small degrees Hirasaka, Mitsugu
 2015
 38-41 C p. 70-77
8 p.
 artikel
378 Unit disk cover problem in 2D Basappa, Manjanna
 2015
 38-41 C p. 193-201
9 p.
 artikel
379 Universal point sets for planar three-trees Fulek, Radoslav
 2015
 38-41 C p. 101-112
12 p.
 artikel
380 Unranking of small combinations from large sets Shimizu, Toshihiro
 2014
 38-41 C p. 8-20
13 p.
 artikel
381 Upper and lower I/O bounds for pebbling r-pyramids Ranjan, Desh
 2012
 38-41 C p. 2-12
11 p.
 artikel
382 Using TPA to count linear extensions Banks, Jacqueline
 2018
 38-41 C p. 1-11
 artikel
383 Variations of the parameterized longest previous factor Beal, Richard
 2012
 38-41 C p. 129-150
22 p.
 artikel
384 Various improvements to text fingerprinting Belazzougui, Djamal
 2013
 38-41 C p. 1-18
18 p.
 artikel
385 Verifiable pattern matching on outsourced texts Catalano, Dario
 2018
 38-41 C p. 39-50
 artikel
386 Wavelet trees for all Navarro, Gonzalo
 2014
 38-41 C p. 2-20
19 p.
 artikel
387 Weak heaps engineered Edelkamp, Stefan
 2013
 38-41 C p. 83-97
15 p.
 artikel
388 Weighted improper colouring Araujo, J.
 2012
 38-41 C p. 53-66
14 p.
 artikel
389 Worst-case efficient single and multiple string matching on packed texts in the word-RAM model Belazzougui, Djamal
 2012
 38-41 C p. 91-106
16 p.
 artikel
390 xkcd-repeats: A new taxonomy of repeats defined by their context diversity Gallé, Matthias
 2018
 38-41 C p. 1-16
 artikel
                             390 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland