| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A 3-approximation algorithm for the subtree distance between phylogenies
|
Bordewich, Magnus
|
|
2008
|
|
3 |
p. 458-471
14 p.
|
artikel
|
| 2 |
Admission control with advance reservations in simple networks
|
Rawitz, Dror
|
|
2007
|
|
3 |
p. 491-500
10 p.
|
artikel
|
| 3 |
Algorithms for computing parameters of graph-based extensions of BCH codes
|
Kelarev, A.V.
|
|
2007
|
|
3 |
p. 553-563
11 p.
|
artikel
|
| 4 |
An approximation algorithm for a bottleneck traveling salesman problem
|
Kao, Ming-Yang
|
|
2009
|
|
3 |
p. 315-326
12 p.
|
artikel
|
| 5 |
An approximation algorithm for sorting by reversals and transpositions
|
Rahman, Atif
|
|
2008
|
|
3 |
p. 449-457
9 p.
|
artikel
|
| 6 |
An exact algorithm for connected red–blue dominating set
|
Abu-Khzam, Faisal N.
|
|
2011
|
|
3 |
p. 252-262
11 p.
|
artikel
|
| 7 |
A note on two source location problems
|
Kortsarz, Guy
|
|
2008
|
|
3 |
p. 520-525
6 p.
|
artikel
|
| 8 |
A parallel extended GCD algorithm
|
Sedjelmaci, Sidi Mohamed
|
|
2008
|
|
3 |
p. 526-538
13 p.
|
artikel
|
| 9 |
Approximate colored range and point enclosure queries
|
Lai, Ying Kit
|
|
2008
|
|
3 |
p. 420-432
13 p.
|
artikel
|
| 10 |
Approximate hierarchical facility location and applications to the bounded depth Steiner tree and range assignment problems
|
Kantor, Erez
|
|
2009
|
|
3 |
p. 341-362
22 p.
|
artikel
|
| 11 |
Approximate labelled subtree homeomorphism
|
Pinter, Ron Y.
|
|
2008
|
|
3 |
p. 480-496
17 p.
|
artikel
|
| 12 |
Approximating Huffman codes in parallel
|
Berman, P.
|
|
2007
|
|
3 |
p. 479-490
12 p.
|
artikel
|
| 13 |
Approximating the traffic grooming problem
|
Flammini, Michele
|
|
2008
|
|
3 |
p. 472-479
8 p.
|
artikel
|
| 14 |
A station strategy to deter backoff attacks in IEEE 802.11 LANs
|
Konorski, Jerzy
|
|
2007
|
|
3 |
p. 436-454
19 p.
|
artikel
|
| 15 |
Asymptotic distributions for Random Median Quicksort
|
Okasha, H.M.
|
|
2007
|
|
3 |
p. 592-608
17 p.
|
artikel
|
| 16 |
A Zero-Space algorithm for Negative Cost Cycle Detection in networks
|
Subramani, K.
|
|
2007
|
|
3 |
p. 408-421
14 p.
|
artikel
|
| 17 |
Breaking the 2 n -barrier for Irredundance: Two lines of attack
|
Binkele-Raible, Daniel
|
|
2011
|
|
3 |
p. 214-230
17 p.
|
artikel
|
| 18 |
Cache placement in sensor networks under an update cost constraint
|
Tang, Bin
|
|
2007
|
|
3 |
p. 422-435
14 p.
|
artikel
|
| 19 |
Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3
|
Bazgan, Cristina
|
|
2008
|
|
3 |
p. 510-519
10 p.
|
artikel
|
| 20 |
Computing sharp 2-factors in claw-free graphs
|
Broersma, Hajo
|
|
2010
|
|
3 |
p. 321-329
9 p.
|
artikel
|
| 21 |
Computing the maximum clique in the visibility graph of a simple polygon
|
Ghosh, Subir Kumar
|
|
2007
|
|
3 |
p. 524-532
9 p.
|
artikel
|
| 22 |
Contracting planar graphs to contractions of triangulations
|
Kamiński, Marcin
|
|
2011
|
|
3 |
p. 299-306
8 p.
|
artikel
|
| 23 |
Convex drawings of hierarchical planar graphs and clustered planar graphs
|
Hong, Seok-Hee
|
|
2010
|
|
3 |
p. 282-295
14 p.
|
artikel
|
| 24 |
Dense trees: a new look at degenerate graphs
|
Franceschini, Gianni
|
|
2006
|
|
3 |
p. 455-474
20 p.
|
artikel
|
| 25 |
Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures
|
Demetrescu, Camil
|
|
2006
|
|
3 |
p. 353-383
31 p.
|
artikel
|
| 26 |
Editorial
|
Syrotiuk, Violet R.
|
|
2007
|
|
3 |
p. 393-394
2 p.
|
artikel
|
| 27 |
Editorial Board
|
|
|
2010
|
|
3 |
p. iii-iv
nvt p.
|
artikel
|
| 28 |
Editorial Board
|
|
|
2006
|
|
3 |
p. iii-iv
nvt p.
|
artikel
|
| 29 |
Editorial board
|
|
|
2004
|
|
3 |
p. iii-iv
nvt p.
|
artikel
|
| 30 |
Editorial Board
|
|
|
2008
|
|
3 |
p. iii-iv
nvt p.
|
artikel
|
| 31 |
Editorial Board
|
|
|
2007
|
|
3 |
p. iii-iv
nvt p.
|
artikel
|
| 32 |
Editorial Board
|
|
|
2009
|
|
3 |
p. iii-iv
nvt p.
|
artikel
|
| 33 |
Editorial Board
|
|
|
2011
|
|
3 |
p. iii-iv
nvt p.
|
artikel
|
| 34 |
Efficient algorithms and methods to solve dynamic MINs stability problem using stable matching with complete ties
|
Nitin,
|
|
2008
|
|
3 |
p. 353-380
28 p.
|
artikel
|
| 35 |
Efficient generation of super condensed neighborhoods
|
Russo, Luís M.S.
|
|
2007
|
|
3 |
p. 501-513
13 p.
|
artikel
|
| 36 |
Efficient offline algorithms for the bicriteria k-server problem and online applications
|
Flammini, Michele
|
|
2006
|
|
3 |
p. 414-432
19 p.
|
artikel
|
| 37 |
Fair cost-sharing methods for scheduling jobs on parallel machines
|
Bleischwitz, Yvonne
|
|
2009
|
|
3 |
p. 280-290
11 p.
|
artikel
|
| 38 |
Fast equation automaton computation
|
Khorsi, Ahmed
|
|
2008
|
|
3 |
p. 433-448
16 p.
|
artikel
|
| 39 |
Fast parameterized matching with q-grams
|
Salmela, Leena
|
|
2008
|
|
3 |
p. 408-419
12 p.
|
artikel
|
| 40 |
Fast reoptimization for the minimum spanning tree problem
|
Boria, Nicolas
|
|
2010
|
|
3 |
p. 296-310
15 p.
|
artikel
|
| 41 |
Finding the maximum suffix with fewer comparisons
|
Franceschini, Gianni
|
|
2011
|
|
3 |
p. 279-286
8 p.
|
artikel
|
| 42 |
Generalized function matching
|
Amir, Amihood
|
|
2007
|
|
3 |
p. 514-523
10 p.
|
artikel
|
| 43 |
Graph unique-maximum and conflict-free colorings
|
Cheilaris, Panagiotis
|
|
2011
|
|
3 |
p. 241-251
11 p.
|
artikel
|
| 44 |
Hardness of approximation for orthogonal rectangle packing and covering problems
|
Chlebík, Miroslav
|
|
2009
|
|
3 |
p. 291-305
15 p.
|
artikel
|
| 45 |
Local solutions for global problems in wireless networks
|
Urrutia, J.
|
|
2007
|
|
3 |
p. 395-407
13 p.
|
artikel
|
| 46 |
Location tracking in mobile ad hoc networks using particle filters
|
Huang, Rui
|
|
2007
|
|
3 |
p. 455-470
16 p.
|
artikel
|
| 47 |
Lossless filter for multiple repetitions with Hamming distance
|
Peterlongo, Pierre
|
|
2008
|
|
3 |
p. 497-509
13 p.
|
artikel
|
| 48 |
Matching subsequences in trees
|
Bille, Philip
|
|
2009
|
|
3 |
p. 306-314
9 p.
|
artikel
|
| 49 |
Maximum agreement and compatible supertrees
|
Berry, Vincent
|
|
2007
|
|
3 |
p. 564-591
28 p.
|
artikel
|
| 50 |
[No title]
|
Calamoneri, Tiziana
|
|
2011
|
|
3 |
p. 213-
1 p.
|
artikel
|
| 51 |
Online weighted flow time and deadline scheduling
|
Becchetti, Luca
|
|
2006
|
|
3 |
p. 339-352
14 p.
|
artikel
|
| 52 |
On minimum k-modal partitions of permutations
|
Di Stefano, Gabriele
|
|
2008
|
|
3 |
p. 381-392
12 p.
|
artikel
|
| 53 |
On Multi-threaded Metrical Task Systems
|
Feuerstein, Esteban
|
|
2006
|
|
3 |
p. 401-413
13 p.
|
artikel
|
| 54 |
On strategy improvement algorithms for simple stochastic games
|
Tripathi, Rahul
|
|
2011
|
|
3 |
p. 263-278
16 p.
|
artikel
|
| 55 |
On the approximation of the generalized capacitated tree-routing problem
|
Morsy, Ehab
|
|
2010
|
|
3 |
p. 311-320
10 p.
|
artikel
|
| 56 |
On the expected longest length probe sequence for hashing with separate chaining
|
Reviriego, Pedro
|
|
2011
|
|
3 |
p. 307-312
6 p.
|
artikel
|
| 57 |
On the minimum load coloring problem
|
Ahuja, Nitin
|
|
2007
|
|
3 |
p. 533-545
13 p.
|
artikel
|
| 58 |
Optimal leaf ordering of complete binary trees
|
Brandes, Ulrik
|
|
2007
|
|
3 |
p. 546-552
7 p.
|
artikel
|
| 59 |
Packing two disks into a polygonal environment
|
Bose, Prosenjit
|
|
2004
|
|
3 |
p. 373-380
8 p.
|
artikel
|
| 60 |
Parameterized complexity of even/odd subgraph problems
|
Cai, Leizhen
|
|
2011
|
|
3 |
p. 231-240
10 p.
|
artikel
|
| 61 |
Practical and flexible pattern matching over Ziv–Lempel compressed text
|
Navarro, Gonzalo
|
|
2004
|
|
3 |
p. 347-371
25 p.
|
artikel
|
| 62 |
Preface
|
Italiano, Giuseppe F.
|
|
2006
|
|
3 |
p. 337-338
2 p.
|
artikel
|
| 63 |
Preface
|
Italiano, Giuseppe F.
|
|
2009
|
|
3 |
p. 279-
1 p.
|
artikel
|
| 64 |
Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies
|
Gieseke, Fabian
|
|
2010
|
|
3 |
p. 259-272
14 p.
|
artikel
|
| 65 |
Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies
|
Fotakis, Dimitris A.
|
|
2006
|
|
3 |
p. 433-454
22 p.
|
artikel
|
| 66 |
Real roots of univariate polynomials and straight line programs
|
Perrucci, Daniel
|
|
2007
|
|
3 |
p. 471-478
8 p.
|
artikel
|
| 67 |
Red-blue covering problems and the consecutive ones property
|
Dom, Michael
|
|
2008
|
|
3 |
p. 393-407
15 p.
|
artikel
|
| 68 |
Routing permutations and involutions on optical ring networks: complexity results and solution to an open problem
|
Yuan, Jinjiang
|
|
2007
|
|
3 |
p. 609-621
13 p.
|
artikel
|
| 69 |
Selecting distances in arrangements of hyperplanes spanned by points
|
Bespamyatnikh, Sergei
|
|
2004
|
|
3 |
p. 333-345
13 p.
|
artikel
|
| 70 |
Spanners of additively weighted point sets
|
Bose, Prosenjit
|
|
2011
|
|
3 |
p. 287-298
12 p.
|
artikel
|
| 71 |
Steiner diagrams and k-star hubs
|
Blasum, Ulrich
|
|
2007
|
|
3 |
p. 622-634
13 p.
|
artikel
|
| 72 |
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
|
Sau, Ignasi
|
|
2010
|
|
3 |
p. 330-338
9 p.
|
artikel
|
| 73 |
The strength of weak proximity
|
Di Battista, Giuseppe
|
|
2006
|
|
3 |
p. 384-400
17 p.
|
artikel
|
| 74 |
Tighter approximation bounds for LPT scheduling in two special cases
|
Kovács, Annamária
|
|
2009
|
|
3 |
p. 327-340
14 p.
|
artikel
|
| 75 |
Upper bounds on the bisection width of 3- and 4-regular graphs
|
Monien, Burkhard
|
|
2006
|
|
3 |
p. 475-498
24 p.
|
artikel
|
| 76 |
Weighted LCS
|
Amir, Amihood
|
|
2010
|
|
3 |
p. 273-281
9 p.
|
artikel
|
Tijdschrift beschrijving