| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Adaptive text mining: inferring structure from sequences
|
Witten, I.H.
|
|
2004
|
|
2 |
p. 137-159
23 p.
|
artikel
|
| 2 |
A dynamic edit distance table
|
Kim, Sung-Ryul
|
|
2004
|
|
2 |
p. 303-312
10 p.
|
artikel
|
| 3 |
A faster algorithm for the single source shortest path problem with few distinct positive lengths
|
Orlin, James B.
|
|
2010
|
|
2 |
p. 189-198
10 p.
|
artikel
|
| 4 |
Algorithms for extracting motifs from biological weighted sequences
|
Iliopoulos, C.
|
|
2007
|
|
2 |
p. 229-242
14 p.
|
artikel
|
| 5 |
Algorithms for finding distance-edge-colorings of graphs
|
Ito, Takehiro
|
|
2007
|
|
2 |
p. 304-322
19 p.
|
artikel
|
| 6 |
Algorithms for optimal outlier removal
|
Atanassov, Rossen
|
|
2009
|
|
2 |
p. 239-248
10 p.
|
artikel
|
| 7 |
A lower bound for the breakpoint phylogeny problem
|
Bryant, David
|
|
2004
|
|
2 |
p. 229-255
27 p.
|
artikel
|
| 8 |
An improved approximation algorithm for maximum edge 2-coloring in simple graphs
|
Chen, Zhi-Zhong
|
|
2008
|
|
2 |
p. 205-215
11 p.
|
artikel
|
| 9 |
A note on the complexity of minimum dominating set
|
Grandoni, Fabrizio
|
|
2006
|
|
2 |
p. 209-214
6 p.
|
artikel
|
| 10 |
A polynomial time upper bound for the number of contacts in the HP-model on the face-centered-cubic lattice (FCC)
|
Backofen, Rolf
|
|
2004
|
|
2 |
p. 161-206
46 p.
|
artikel
|
| 11 |
Approximating survivable networks with β-metric costs
|
David, Johnny
|
|
2011
|
|
2 |
p. 170-175
6 p.
|
artikel
|
| 12 |
Approximating the k-traveling repairman problem with repairtimes
|
Jothi, Raja
|
|
2007
|
|
2 |
p. 293-303
11 p.
|
artikel
|
| 13 |
Approximation algorithms for Hamming clustering problems
|
Ga̧sieniec, Leszek
|
|
2004
|
|
2 |
p. 289-301
13 p.
|
artikel
|
| 14 |
Approximation algorithms for shortest descending paths in terrains
|
Ahmed, Mustaq
|
|
2010
|
|
2 |
p. 214-230
17 p.
|
artikel
|
| 15 |
Approximation results for the weighted P 4 partition problem
|
Monnot, Jérôme
|
|
2008
|
|
2 |
p. 299-312
14 p.
|
artikel
|
| 16 |
Boolean circuit programming: A new paradigm to design parallel algorithms
|
Park, Kunsoo
|
|
2009
|
|
2 |
p. 267-277
11 p.
|
artikel
|
| 17 |
Bounded list injective homomorphism for comparative analysis of protein–protein interaction graphs
|
Fagnot, Isabelle
|
|
2008
|
|
2 |
p. 178-191
14 p.
|
artikel
|
| 18 |
Character sets of strings
|
Didier, Gilles
|
|
2007
|
|
2 |
p. 330-340
11 p.
|
artikel
|
| 19 |
CHECKCOL: Improved local search for graph coloring
|
Caramia, Massimiliano
|
|
2006
|
|
2 |
p. 277-298
22 p.
|
artikel
|
| 20 |
Choose the damping, choose the ranking?
|
Bressan, Marco
|
|
2010
|
|
2 |
p. 199-213
15 p.
|
artikel
|
| 21 |
Completely connected clustered graphs
|
Cornelsen, Sabine
|
|
2006
|
|
2 |
p. 313-323
11 p.
|
artikel
|
| 22 |
Computational determination of ( 3 , 11 ) and ( 4 , 7 ) cages
|
Exoo, Geoffrey
|
|
2011
|
|
2 |
p. 166-169
4 p.
|
artikel
|
| 23 |
Consensus in Byzantine asynchronous systems
|
Baldoni, Roberto
|
|
2003
|
|
2 |
p. 185-210
26 p.
|
artikel
|
| 24 |
Converting suffix trees into factor/suffix oracles
|
Rusu, Irena
|
|
2008
|
|
2 |
p. 324-340
17 p.
|
artikel
|
| 25 |
Cooperative computing with fragmentable and mergeable groups
|
Georgiou, Chryssis
|
|
2003
|
|
2 |
p. 211-235
25 p.
|
artikel
|
| 26 |
Counting the number of independent sets in chordal graphs
|
Okamoto, Yoshio
|
|
2008
|
|
2 |
p. 229-242
14 p.
|
artikel
|
| 27 |
Crossing-constrained hierarchical drawings
|
Finocchi, Irene
|
|
2006
|
|
2 |
p. 299-312
14 p.
|
artikel
|
| 28 |
Cut problems in graphs with a budget constraint
|
Engelberg, Roee
|
|
2007
|
|
2 |
p. 262-279
18 p.
|
artikel
|
| 29 |
Discovering subword associations in strings in time linear in the output size
|
Apostolico, Alberto
|
|
2009
|
|
2 |
p. 227-238
12 p.
|
artikel
|
| 30 |
Distance-hereditary digraphs
|
Lätsch, Martin
|
|
2010
|
|
2 |
p. 231-240
10 p.
|
artikel
|
| 31 |
Dynamic extended suffix arrays
|
Salson, M.
|
|
2010
|
|
2 |
p. 241-257
17 p.
|
artikel
|
| 32 |
Edit distance with move operations
|
Shapira, Dana
|
|
2007
|
|
2 |
p. 380-392
13 p.
|
artikel
|
| 33 |
Editorial
|
Broersma, Hajo
|
|
2010
|
|
2 |
p. 101-
1 p.
|
artikel
|
| 34 |
Editorial
|
Guimarães, Katia S.
|
|
2008
|
|
2 |
p. 163-
1 p.
|
artikel
|
| 35 |
Editorial
|
Broersma, Hajo
|
|
2009
|
|
2 |
p. 147-
1 p.
|
artikel
|
| 36 |
Editorial Board
|
|
|
2010
|
|
2 |
p. iii-iv
nvt p.
|
artikel
|
| 37 |
Editorial board
|
|
|
2003
|
|
2 |
p. iii-iv
nvt p.
|
artikel
|
| 38 |
Editorial board
|
|
|
2004
|
|
2 |
p. v-vi
nvt p.
|
artikel
|
| 39 |
Editorial Board
|
|
|
2006
|
|
2 |
p. iii-iv
nvt p.
|
artikel
|
| 40 |
Editorial Board
|
|
|
2008
|
|
2 |
p. iii-iv
nvt p.
|
artikel
|
| 41 |
Editorial Board
|
|
|
2007
|
|
2 |
p. iii-iv
nvt p.
|
artikel
|
| 42 |
Editorial Board
|
|
|
2009
|
|
2 |
p. iii-iv
nvt p.
|
artikel
|
| 43 |
Editorial Board
|
|
|
2011
|
|
2 |
p. iii-iv
nvt p.
|
artikel
|
| 44 |
Efficient one-dimensional real scaled matching
|
Amir, Amihood
|
|
2007
|
|
2 |
p. 205-211
7 p.
|
artikel
|
| 45 |
Exact arithmetic on the Stern–Brocot tree
|
Niqui, Milad
|
|
2007
|
|
2 |
p. 356-379
24 p.
|
artikel
|
| 46 |
Exact communication costs for consensus and leader in a tree
|
Dinitz, Yefim
|
|
2003
|
|
2 |
p. 167-183
17 p.
|
artikel
|
| 47 |
Fast detection of common sequence structure patterns in RNAs
|
Backofen, Rolf
|
|
2007
|
|
2 |
p. 212-228
17 p.
|
artikel
|
| 48 |
Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3
|
Razgon, Igor
|
|
2009
|
|
2 |
p. 191-212
22 p.
|
artikel
|
| 49 |
Finite automata based algorithms on subsequences and supersequences of degenerate strings
|
Iliopoulos, Costas
|
|
2010
|
|
2 |
p. 117-130
14 p.
|
artikel
|
| 50 |
Fixed parameter algorithms for one-sided crossing minimization revisited
|
Dujmović, Vida
|
|
2008
|
|
2 |
p. 313-323
11 p.
|
artikel
|
| 51 |
HyperQuick algorithm for discrete hypergeometric distribution
|
Berkopec, Aleš
|
|
2007
|
|
2 |
p. 341-347
7 p.
|
artikel
|
| 52 |
Improved approximation algorithms for the single-sink buy-at-bulk network design problems
|
Jothi, Raja
|
|
2009
|
|
2 |
p. 249-255
7 p.
|
artikel
|
| 53 |
Inapproximability and approximability of minimal tree routing and coloring
|
Chen, Xujin
|
|
2008
|
|
2 |
p. 341-351
11 p.
|
artikel
|
| 54 |
Intersection representations of matrices by subtrees and unicycles on graphs
|
Gavril, Fanica
|
|
2008
|
|
2 |
p. 216-228
13 p.
|
artikel
|
| 55 |
Largest empty circle centered on a query line
|
Augustine, John
|
|
2010
|
|
2 |
p. 143-153
11 p.
|
artikel
|
| 56 |
Linear time algorithm for the longest common repeat problem
|
Lee, Inbok
|
|
2007
|
|
2 |
p. 243-249
7 p.
|
artikel
|
| 57 |
Lower bounds for weak sense of direction
|
Boldi, Paolo
|
|
2003
|
|
2 |
p. 119-128
10 p.
|
artikel
|
| 58 |
Missing pattern discovery
|
Angelov, Stanislav
|
|
2011
|
|
2 |
p. 153-165
13 p.
|
artikel
|
| 59 |
Multiscale approach for the network compression-friendly ordering
|
Safro, Ilya
|
|
2011
|
|
2 |
p. 190-202
13 p.
|
artikel
|
| 60 |
New algorithms for text fingerprinting
|
Kolpakov, Roman
|
|
2008
|
|
2 |
p. 243-255
13 p.
|
artikel
|
| 61 |
[No title]
|
Giancarlo, Raffaele
|
|
2004
|
|
2 |
p. 135-136
2 p.
|
artikel
|
| 62 |
Online competitive algorithms for maximizing weighted throughput of unit jobs
|
Chin, Francis Y.L.
|
|
2006
|
|
2 |
p. 255-276
22 p.
|
artikel
|
| 63 |
On minimum power connectivity problems
|
Lando, Yuval
|
|
2010
|
|
2 |
p. 164-173
10 p.
|
artikel
|
| 64 |
On stable cutsets in claw-free graphs and planar graphs
|
Le, Van Bang
|
|
2008
|
|
2 |
p. 256-276
21 p.
|
artikel
|
| 65 |
On the approximation of the single source k-splittable flow problem
|
Caramia, Massimiliano
|
|
2008
|
|
2 |
p. 277-289
13 p.
|
artikel
|
| 66 |
On the communication complexity of Bar-Yehuda, Goldreich and Itai's randomized broadcasting algorithm
|
Tyrakowski, Tomasz
|
|
2007
|
|
2 |
p. 323-329
7 p.
|
artikel
|
| 67 |
On the complexity of finding gapped motifs
|
Michael, Morris
|
|
2010
|
|
2 |
p. 131-142
12 p.
|
artikel
|
| 68 |
On the complexity of Jensen's algorithm for counting fixed polyominoes
|
Barequet, Gill
|
|
2007
|
|
2 |
p. 348-355
8 p.
|
artikel
|
| 69 |
On the guessing number of shift graphs
|
Wu, Taoyang
|
|
2009
|
|
2 |
p. 220-226
7 p.
|
artikel
|
| 70 |
On the mean number of encryptions for tree-based broadcast encryption schemes
|
Park, E.C.
|
|
2006
|
|
2 |
p. 215-238
24 p.
|
artikel
|
| 71 |
On the number of shortest descending paths on the surface of a convex terrain
|
Ahmed, Mustaq
|
|
2011
|
|
2 |
p. 182-189
8 p.
|
artikel
|
| 72 |
On time versus size for monotone dynamic monopolies in regular topologies
|
Flocchini, Paola
|
|
2003
|
|
2 |
p. 129-150
22 p.
|
artikel
|
| 73 |
Optimal broadcast on parallel locality models
|
Juurlink, Ben
|
|
2003
|
|
2 |
p. 151-166
16 p.
|
artikel
|
| 74 |
Optimally computing all solutions of Stackelberg with parametric prices and of general monotonous gain functions on a tree
|
Spoerhase, J.
|
|
2009
|
|
2 |
p. 256-266
11 p.
|
artikel
|
| 75 |
Optimal on-line colorings for minimizing the number of ADMs in optical networks
|
Shalom, Mordechai
|
|
2010
|
|
2 |
p. 174-188
15 p.
|
artikel
|
| 76 |
Parameterized complexity of finding regular induced subgraphs
|
Moser, Hannes
|
|
2009
|
|
2 |
p. 181-190
10 p.
|
artikel
|
| 77 |
Parametric multiple sequence alignment and phylogeny construction
|
Fernández-Baca, David
|
|
2004
|
|
2 |
p. 271-287
17 p.
|
artikel
|
| 78 |
Path coupling without contraction
|
Bordewich, Magnus
|
|
2007
|
|
2 |
p. 280-292
13 p.
|
artikel
|
| 79 |
Petri net modelling of biological regulatory networks
|
Chaouiya, Claudine
|
|
2008
|
|
2 |
p. 165-177
13 p.
|
artikel
|
| 80 |
Polynomial recognition of equal unions in hypergraphs with few vertices of large degree
|
Jacobs, David P.
|
|
2006
|
|
2 |
p. 201-208
8 p.
|
artikel
|
| 81 |
Popular matchings in the weighted capacitated house allocation problem
|
Sng, Colin T.S.
|
|
2010
|
|
2 |
p. 102-116
15 p.
|
artikel
|
| 82 |
Sampling Eulerian orientations of triangular lattice graphs
|
Creed, Páidí
|
|
2009
|
|
2 |
p. 168-180
13 p.
|
artikel
|
| 83 |
Shift error detection in standardized exams
|
Skiena, Steven
|
|
2004
|
|
2 |
p. 313-331
19 p.
|
artikel
|
| 84 |
Shuffling biological sequences with motif constraints
|
Rivière, Romain
|
|
2008
|
|
2 |
p. 192-204
13 p.
|
artikel
|
| 85 |
Some heuristics for the binary paint shop problem and their expected number of colour changes
|
Andres, Stephan Dominique
|
|
2011
|
|
2 |
p. 203-211
9 p.
|
artikel
|
| 86 |
Stable marriage with ties and bounded length preference lists
|
Irving, Robert W.
|
|
2009
|
|
2 |
p. 213-219
7 p.
|
artikel
|
| 87 |
Structural properties and tractability results for linear synteny
|
Liben-Nowell, David
|
|
2004
|
|
2 |
p. 207-228
22 p.
|
artikel
|
| 88 |
2004 Symposium on String Processing and Information Retrieval
|
Apostolico, Alberto
|
|
2007
|
|
2 |
p. 203-
1 p.
|
artikel
|
| 89 |
Testing set proportionality and the Ádám isomorphism of circulant graphs
|
Coppersmith, Don
|
|
2006
|
|
2 |
p. 324-335
12 p.
|
artikel
|
| 90 |
The compactness of adaptive routing tables
|
Gavoille, Cyril
|
|
2003
|
|
2 |
p. 237-254
18 p.
|
artikel
|
| 91 |
The complexity of minimum difference cover
|
Mereghetti, Carlo
|
|
2006
|
|
2 |
p. 239-254
16 p.
|
artikel
|
| 92 |
The longest common subsequence problem for arc-annotated sequences
|
Jiang, Tao
|
|
2004
|
|
2 |
p. 257-270
14 p.
|
artikel
|
| 93 |
The on-line asymmetric traveling salesman problem
|
Ausiello, Giorgio
|
|
2008
|
|
2 |
p. 290-298
9 p.
|
artikel
|
| 94 |
The Steiner Forest Problem revisited
|
Gassner, Elisabeth
|
|
2010
|
|
2 |
p. 154-163
10 p.
|
artikel
|
| 95 |
Tight bounds for online stable sorting
|
Gagie, Travis
|
|
2011
|
|
2 |
p. 176-181
6 p.
|
artikel
|
| 96 |
Track assignment
|
Cornelsen, Sabine
|
|
2007
|
|
2 |
p. 250-261
12 p.
|
artikel
|
| 97 |
Vertex and edge covers with clustering properties: Complexity and algorithms
|
Fernau, Henning
|
|
2009
|
|
2 |
p. 149-167
19 p.
|
artikel
|
Tijdschrift beschrijving