| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A 3-approximation for the pathwidth of Halin graphs
|
Fomin, Fedor V.
|
|
2006
|
|
4 |
p. 499-510
12 p.
|
article
|
| 2 |
A bounded search tree algorithm for parameterized face cover
|
Abu-Khzam, Faisal N.
|
|
2008
|
|
4 |
p. 541-552
12 p.
|
article
|
| 3 |
A cost-aggregating integer linear program for motif finding
|
Kingsford, Carl
|
|
2011
|
|
4 |
p. 326-334
9 p.
|
article
|
| 4 |
A fixed parameter algorithm for optimal convex partitions
|
Spillner, Andreas
|
|
2008
|
|
4 |
p. 561-569
9 p.
|
article
|
| 5 |
A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing
|
Peyer, Sven
|
|
2009
|
|
4 |
p. 377-390
14 p.
|
article
|
| 6 |
Algorithms for generating convex sets in acyclic digraphs
|
Balister, P.
|
|
2009
|
|
4 |
p. 509-518
10 p.
|
article
|
| 7 |
A linear size index for approximate pattern matching
|
Chan, Ho-Leung
|
|
2011
|
|
4 |
p. 358-364
7 p.
|
article
|
| 8 |
A linear time algorithm for the inversion median problem in circular bacterial genomes
|
Ohlebusch, Enno
|
|
2007
|
|
4 |
p. 637-646
10 p.
|
article
|
| 9 |
A loop-free two-close Gray-code algorithm for listing k-ary Dyck words
|
Vajnovszki, Vincent
|
|
2006
|
|
4 |
p. 633-648
16 p.
|
article
|
| 10 |
A new upper bound for Max-2-SAT: A graph-theoretic approach
|
Binkele-Raible, Daniel
|
|
2010
|
|
4 |
p. 388-401
14 p.
|
article
|
| 11 |
An exact algorithm for subgraph homeomorphism
|
Lingas, Andrzej
|
|
2009
|
|
4 |
p. 464-468
5 p.
|
article
|
| 12 |
An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality
|
Bläser, Markus
|
|
2006
|
|
4 |
p. 623-632
10 p.
|
article
|
| 13 |
An O ( n 3 / 2 log ( n ) ) algorithm for sorting by reciprocal translocations
|
Ozery-Flato, Michal
|
|
2011
|
|
4 |
p. 344-357
14 p.
|
article
|
| 14 |
An upper bound on the hardness of exact matrix based motif discovery
|
Horton, Paul
|
|
2007
|
|
4 |
p. 706-713
8 p.
|
article
|
| 15 |
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
|
Lozin, Vadim V.
|
|
2008
|
|
4 |
p. 595-604
10 p.
|
article
|
| 16 |
Approximability of partitioning graphs with supply and demand
|
Ito, Takehiro
|
|
2008
|
|
4 |
p. 627-650
24 p.
|
article
|
| 17 |
Approximating call-scheduling makespan in all-optical networks
|
Becchetti, Luca
|
|
2004
|
|
4 |
p. 501-515
15 p.
|
article
|
| 18 |
Approximating largest convex hulls for imprecise points
|
van Kreveld, Marc
|
|
2008
|
|
4 |
p. 583-594
12 p.
|
article
|
| 19 |
Approximating schedules for dynamic process graphs efficiently
|
Jakoby, Andreas
|
|
2004
|
|
4 |
p. 471-500
30 p.
|
article
|
| 20 |
Approximating the longest path length of a stochastic DAG by a normal distribution in linear time
|
Ando, Ei
|
|
2009
|
|
4 |
p. 420-438
19 p.
|
article
|
| 21 |
Approximation of RNA multiple structural alignment
|
Kubica, Marcin
|
|
2011
|
|
4 |
p. 365-376
12 p.
|
article
|
| 22 |
Area-preserving approximations of polygonal paths
|
Bose, Prosenjit
|
|
2006
|
|
4 |
p. 554-566
13 p.
|
article
|
| 23 |
A robust randomized algorithm to perform independent tasks
|
Chlebus, Bogdan S.
|
|
2008
|
|
4 |
p. 651-665
15 p.
|
article
|
| 24 |
Art networks with geometrical distances
|
Dagher, Issam
|
|
2006
|
|
4 |
p. 538-553
16 p.
|
article
|
| 25 |
A simple fast hybrid pattern-matching algorithm
|
Franek, Frantisek
|
|
2007
|
|
4 |
p. 682-695
14 p.
|
article
|
| 26 |
Author Index
|
|
|
2006
|
|
4 |
p. 693-694
2 p.
|
article
|
| 27 |
Author Index
|
|
|
2004
|
|
4 |
p. 531-532
2 p.
|
article
|
| 28 |
Author Index
|
|
|
2007
|
|
4 |
p. 749-750
2 p.
|
article
|
| 29 |
Average case analysis of DJ graphs
|
Blieberger, Johann
|
|
2006
|
|
4 |
p. 649-675
27 p.
|
article
|
| 30 |
Average-optimal string matching
|
Fredriksson, Kimmo
|
|
2009
|
|
4 |
p. 579-594
16 p.
|
article
|
| 31 |
Bandwidth of bipartite permutation graphs in polynomial time
|
Heggernes, Pinar
|
|
2009
|
|
4 |
p. 533-544
12 p.
|
article
|
| 32 |
Budget constrained minimum cost connected medians
|
Konjevod, Goran
|
|
2004
|
|
4 |
p. 453-469
17 p.
|
article
|
| 33 |
Combinatorial Pattern Matching
|
Park, Kunsoo
|
|
2007
|
|
4 |
p. 635-
1 p.
|
article
|
| 34 |
Comparing similar ordered trees in linear-time
|
Touzet, Hélène
|
|
2007
|
|
4 |
p. 696-705
10 p.
|
article
|
| 35 |
Computing input multiplicity in anonymous synchronous networks with dynamic faults
|
Dobrev, Stefan
|
|
2004
|
|
4 |
p. 425-438
14 p.
|
article
|
| 36 |
CPM 2006
|
Lewenstein, M.
|
|
2011
|
|
4 |
p. 313-
1 p.
|
article
|
| 37 |
Crossing minimization in weighted bipartite graphs
|
Çakıroḡlu, Olca A.
|
|
2009
|
|
4 |
p. 439-452
14 p.
|
article
|
| 38 |
DAG reversal is NP-complete
|
Naumann, Uwe
|
|
2009
|
|
4 |
p. 402-410
9 p.
|
article
|
| 39 |
Delay optimization of linear depth boolean circuits with prescribed input arrival times
|
Rautenbach, Dieter
|
|
2006
|
|
4 |
p. 526-537
12 p.
|
article
|
| 40 |
Distributed algorithms for weighted problems in sparse graphs
|
Czygrinow, A.
|
|
2006
|
|
4 |
p. 588-607
20 p.
|
article
|
| 41 |
Dynamic multi-dimensional bin packing
|
Epstein, Leah
|
|
2010
|
|
4 |
p. 356-372
17 p.
|
article
|
| 42 |
Editorial Board
|
|
|
2010
|
|
4 |
p. iii-iv
nvt p.
|
article
|
| 43 |
Editorial Board
|
|
|
2008
|
|
4 |
p. iii-iv
nvt p.
|
article
|
| 44 |
Editorial Board
|
|
|
2006
|
|
4 |
p. iii-iv
nvt p.
|
article
|
| 45 |
Editorial board
|
|
|
2004
|
|
4 |
p. v-vi
nvt p.
|
article
|
| 46 |
Editorial Board
|
|
|
2007
|
|
4 |
p. iii-iv
nvt p.
|
article
|
| 47 |
Editorial Board
|
|
|
2009
|
|
4 |
p. iii-iv
nvt p.
|
article
|
| 48 |
Editorial Board
|
|
|
2011
|
|
4 |
p. iii-iv
nvt p.
|
article
|
| 49 |
Efficient index for retrieving top-k most frequent documents
|
Hon, Wing-Kai
|
|
2010
|
|
4 |
p. 402-417
16 p.
|
article
|
| 50 |
Exact algorithms and applications for Tree-like Weighted Set Cover
|
Guo, Jiong
|
|
2006
|
|
4 |
p. 608-622
15 p.
|
article
|
| 51 |
Exploiting locality: approximating sorting buffers
|
Bar-Yehuda, Reuven
|
|
2007
|
|
4 |
p. 729-738
10 p.
|
article
|
| 52 |
Faster algorithms for computing longest common increasing subsequences
|
Kutz, Martin
|
|
2011
|
|
4 |
p. 314-325
12 p.
|
article
|
| 53 |
Fast index for approximate string matching
|
Tsur, Dekel
|
|
2010
|
|
4 |
p. 339-345
7 p.
|
article
|
| 54 |
Finding common RNA pseudoknot structures in polynomial time
|
Evans, Patricia A.
|
|
2011
|
|
4 |
p. 335-343
9 p.
|
article
|
| 55 |
Fixed-parameter algorithms for protein similarity search under mRNA structure constraints
|
Blin, Guillaume
|
|
2008
|
|
4 |
p. 618-626
9 p.
|
article
|
| 56 |
Foreword
|
Brandes, Ulrik
|
|
2004
|
|
4 |
p. 381-
1 p.
|
article
|
| 57 |
Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs
|
Ishii, Toshimasa
|
|
2009
|
|
4 |
p. 570-578
9 p.
|
article
|
| 58 |
How to draw a clustered tree
|
Di Battista, Giuseppe
|
|
2009
|
|
4 |
p. 479-499
21 p.
|
article
|
| 59 |
ISB-tree: A new indexing scheme with efficient expected behaviour
|
Kaporis, Alexis
|
|
2010
|
|
4 |
p. 373-387
15 p.
|
article
|
| 60 |
Linear time isotonic and unimodal regression in the L 1 and L ∞ norms
|
Boyarshinov, Victor
|
|
2006
|
|
4 |
p. 676-691
16 p.
|
article
|
| 61 |
Mass spectra alignments and their significance
|
Böcker, Sebastian
|
|
2007
|
|
4 |
p. 714-728
15 p.
|
article
|
| 62 |
Networks with small stretch number
|
Cicerone, Serafino
|
|
2004
|
|
4 |
p. 383-405
23 p.
|
article
|
| 63 |
On k-connectivity problems with sharpened triangle inequality
|
Böckenhauer, Hans-Joachim
|
|
2008
|
|
4 |
p. 605-617
13 p.
|
article
|
| 64 |
Online time-constrained scheduling in linear and ring networks
|
Naor, Joseph (Seffi)
|
|
2010
|
|
4 |
p. 346-355
10 p.
|
article
|
| 65 |
On the Ehrenfeucht–Mycielski sequence
|
Herman, Grzegorz
|
|
2009
|
|
4 |
p. 500-508
9 p.
|
article
|
| 66 |
Optimal algorithms for page migration in dynamic networks
|
Bienkowski, Marcin
|
|
2009
|
|
4 |
p. 545-569
25 p.
|
article
|
| 67 |
Optimal fault-tolerant routings with small routing tables for k-connected graphs
|
Wada, Koichi
|
|
2004
|
|
4 |
p. 517-530
14 p.
|
article
|
| 68 |
Optimizing cost flows by edge cost and capacity upgrade
|
Demgensky, I.
|
|
2004
|
|
4 |
p. 407-423
17 p.
|
article
|
| 69 |
Ordered interval routing schemes
|
Ahmed, Mustaq
|
|
2009
|
|
4 |
p. 363-376
14 p.
|
article
|
| 70 |
Planar bichromatic minimum spanning trees
|
Borgelt, Magdalene G.
|
|
2009
|
|
4 |
p. 469-478
10 p.
|
article
|
| 71 |
Preface
|
Broersma, Hajo
|
|
2008
|
|
4 |
p. 539-
1 p.
|
article
|
| 72 |
Randomized algorithm for the k-server problem on decomposable spaces
|
Nagy-György, Judit
|
|
2009
|
|
4 |
p. 411-419
9 p.
|
article
|
| 73 |
Recognizing graphs without asteroidal triples
|
Köhler, Ekkehard
|
|
2004
|
|
4 |
p. 439-452
14 p.
|
article
|
| 74 |
Regular expression constrained sequence alignment
|
Arslan, Abdullah N.
|
|
2007
|
|
4 |
p. 647-661
15 p.
|
article
|
| 75 |
Reoptimization of minimum and maximum traveling salesman's tours
|
Ausiello, Giorgio
|
|
2009
|
|
4 |
p. 453-463
11 p.
|
article
|
| 76 |
Semi-local longest common subsequences in subquadratic time
|
Tiskin, Alexander
|
|
2008
|
|
4 |
p. 570-581
12 p.
|
article
|
| 77 |
Strictly chordal graphs are leaf powers
|
Kennedy, William
|
|
2006
|
|
4 |
p. 511-525
15 p.
|
article
|
| 78 |
Student-Project Allocation with preferences over Projects
|
Manlove, David F.
|
|
2008
|
|
4 |
p. 553-560
8 p.
|
article
|
| 79 |
Subject Index
|
|
|
2006
|
|
4 |
p. 695-699
5 p.
|
article
|
| 80 |
Subject Index
|
|
|
2004
|
|
4 |
p. 533-536
4 p.
|
article
|
| 81 |
Subject Index
|
|
|
2007
|
|
4 |
p. 751-755
5 p.
|
article
|
| 82 |
Text indexing with errors
|
Maaß, Moritz G.
|
|
2007
|
|
4 |
p. 662-681
20 p.
|
article
|
| 83 |
The longest common extension problem revisited and applications to approximate string searching
|
Ilie, Lucian
|
|
2010
|
|
4 |
p. 418-428
11 p.
|
article
|
| 84 |
The union of minimal hitting sets: Parameterized combinatorial bounds and counting
|
Damaschke, Peter
|
|
2009
|
|
4 |
p. 391-401
11 p.
|
article
|
| 85 |
Threshold dominating cliques in random graphs and interval routing
|
Gao, Yong
|
|
2009
|
|
4 |
p. 519-532
14 p.
|
article
|
| 86 |
Two-pattern strings II—frequency of occurrence and substring complexity
|
Franek, Frantisek
|
|
2007
|
|
4 |
p. 739-748
10 p.
|
article
|
| 87 |
Utilitarian resource assignment
|
Berenbrink, Petra
|
|
2006
|
|
4 |
p. 567-587
21 p.
|
article
|
Journal description