|
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
108 gevonden resultaten
| nr | titel | auteur | tijdschrift | jaar | jaarg. | afl. | pagina('s) | type |
| 1 | A derandomization using min-wise independent permutations |
Broder, Andrei Z. |
2003 |
38-41 | 1 |
p. 11-20 10 p. |
artikel |
|
| 2 | A framework and algorithms for circular drawings of graphs |
Six, Janet M. |
2006 |
38-41 | 1 |
p. 25-50 26 p. |
artikel |
|
| 3 | Algorithms for propositional model counting |
Samer, Marko |
2010 |
38-41 | 1 |
p. 50-64 15 p. |
artikel |
|
| 4 | Algorithms for shortest paths and d-cycle problems |
Bespamyatnikh, Sergei |
2003 |
38-41 | 1 |
p. 1-9 9 p. |
artikel |
|
| 5 | An architecture independent study of parallel segment trees |
Gerbessiotis, Alexandros V. |
2006 |
38-41 | 1 |
p. 1-24 24 p. |
artikel |
|
| 6 | An efficient fixed-parameter algorithm for 3-Hitting Set |
Niedermeier, Rolf |
2003 |
38-41 | 1 |
p. 89-102 14 p. |
artikel |
|
| 7 | An efficient representation of Benes networks and its applications |
Manuel, Paul D. |
2008 |
38-41 | 1 |
p. 11-19 9 p. |
artikel |
|
| 8 | A new constrained edit distance between quotiented ordered trees |
Ouangraoua, Aïda |
2009 |
38-41 | 1 |
p. 78-89 12 p. |
artikel |
|
| 9 | An optimal algorithm to generate tilings |
Desreux, Sébastien |
2006 |
38-41 | 1 |
p. 168-180 13 p. |
artikel |
|
| 10 | A note on data structures for maintaining bipartitions |
Calinescu, Gruia |
2007 |
38-41 | 1 |
p. 129-134 6 p. |
artikel |
|
| 11 | Approximate clustering of incomplete fingerprints |
Figueroa, A. |
2008 |
38-41 | 1 |
p. 103-108 6 p. |
artikel |
|
| 12 | Approximate similarity search: A multi-faceted problem |
Patella, Marco |
2009 |
38-41 | 1 |
p. 36-48 13 p. |
artikel |
|
| 13 | Approximation algorithms for the Label-CoverMAX and Red-Blue Set Cover problems |
Peleg, David |
2007 |
38-41 | 1 |
p. 55-64 10 p. |
artikel |
|
| 14 | A primal-dual algorithm for online non-uniform facility location |
Fotakis, Dimitris |
2007 |
38-41 | 1 |
p. 141-148 8 p. |
artikel |
|
| 15 | A PTAS for the sparsest 2-spanner of 4-connected planar triangulations |
Duckworth, William |
2003 |
38-41 | 1 |
p. 67-76 10 p. |
artikel |
|
| 16 | A unifying look at the Apostolico–Giancarlo string-matching algorithm |
Crochemore, Maxime |
2003 |
38-41 | 1 |
p. 37-52 16 p. |
artikel |
|
| 17 | Broadcasting in geometric radio networks |
Dessmark, Anders |
2007 |
38-41 | 1 |
p. 187-201 15 p. |
artikel |
|
| 18 | Cardinality constrained and multicriteria (multi)cut problems |
Bentz, C. |
2009 |
38-41 | 1 |
p. 102-111 10 p. |
artikel |
|
| 19 | Compact directed acyclic word graphs for a sliding window |
Inenaga, Shunsuke |
2004 |
38-41 | 1 |
p. 33-51 19 p. |
artikel |
|
| 20 | Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs |
Escoffier, Bruno |
2010 |
38-41 | 1 |
p. 36-49 14 p. |
artikel |
|
| 21 | Complexity issues in vertex-colored graph pattern matching |
Dondi, Riccardo |
2011 |
38-41 | 1 |
p. 82-99 18 p. |
artikel |
|
| 22 | Complexity results for three-dimensional orthogonal graph drawing |
Patrignani, Maurizio |
2008 |
38-41 | 1 |
p. 140-161 22 p. |
artikel |
|
| 23 | Computing the throughput of Concatenation State Machines |
Czyzowicz, Jurek |
2008 |
38-41 | 1 |
p. 28-36 9 p. |
artikel |
|
| 24 | Contents |
2008 |
38-41 | 1 |
p. viii- 1 p. |
artikel |
||
| 25 | Counting distance permutations |
Skala, Matthew |
2009 |
38-41 | 1 |
p. 49-61 13 p. |
artikel |
|
| 26 | Deconstructing intractability—A multivariate complexity analysis of interval constrained coloring |
Komusiewicz, Christian |
2011 |
38-41 | 1 |
p. 137-151 15 p. |
artikel |
|
| 27 | Editorial |
Chávez, Edgar |
2009 |
38-41 | 1 |
p. 1-2 2 p. |
artikel |
|
| 28 | Editorial Board |
2010 |
38-41 | 1 |
p. iii-iv nvt p. |
artikel |
||
| 29 | Editorial board |
2003 |
38-41 | 1 |
p. v-vi nvt p. |
artikel |
||
| 30 | Editorial board |
2004 |
38-41 | 1 |
p. v-vi nvt p. |
artikel |
||
| 31 | Editorial Board |
2006 |
38-41 | 1 |
p. v-vi nvt p. |
artikel |
||
| 32 | Editorial Board |
2008 |
38-41 | 1 |
p. v-vi nvt p. |
artikel |
||
| 33 | Editorial board |
2005 |
38-41 | 1 |
p. v-vi nvt p. |
artikel |
||
| 34 | Editorial Board |
2007 |
38-41 | 1 |
p. v-vi nvt p. |
artikel |
||
| 35 | Editorial Board |
2009 |
38-41 | 1 |
p. iii-iv nvt p. |
artikel |
||
| 36 | Editorial Board |
2011 |
38-41 | 1 |
p. iii-iv nvt p. |
artikel |
||
| 37 | Efficient algorithms for Koblitz curves over fields of characteristic three |
Blake, Ian F. |
2005 |
38-41 | 1 |
p. 113-124 12 p. |
artikel |
|
| 38 | Efficient sampling of random permutations |
Gustedt, Jens |
2008 |
38-41 | 1 |
p. 125-139 15 p. |
artikel |
|
| 39 | Existence of a limiting distribution for the binary GCD algorithm |
Maze, Gérard |
2007 |
38-41 | 1 |
p. 176-186 11 p. |
artikel |
|
| 40 | Failed disk recovery in double erasure RAID arrays |
Srinivasan, Kaushik |
2007 |
38-41 | 1 |
p. 115-128 14 p. |
artikel |
|
| 41 | Fast pattern-matching on indeterminate strings |
Holub, Jan |
2008 |
38-41 | 1 |
p. 37-50 14 p. |
artikel |
|
| 42 | Fast RNA structure alignment for crossing input structures |
Backofen, Rolf |
2011 |
38-41 | 1 |
p. 2-11 10 p. |
artikel |
|
| 43 | Fast searching in packed strings |
Bille, Philip |
2011 |
38-41 | 1 |
p. 49-56 8 p. |
artikel |
|
| 44 | Finding all sorting tandem duplication random loss operations |
Bernt, Matthias |
2011 |
38-41 | 1 |
p. 32-48 17 p. |
artikel |
|
| 45 | Finding occurrences of protein complexes in protein–protein interaction graphs |
Fertin, Guillaume |
2009 |
38-41 | 1 |
p. 90-101 12 p. |
artikel |
|
| 46 | Fixed-parameter tractability results for feedback set problems in tournaments |
Dom, Michael |
2010 |
38-41 | 1 |
p. 76-86 11 p. |
artikel |
|
| 47 | From searching text to querying XML streams |
Suciu, Dan |
2004 |
38-41 | 1 |
p. 17-32 16 p. |
artikel |
|
| 48 | Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion |
Wild, Marcel |
2008 |
38-41 | 1 |
p. 93-102 10 p. |
artikel |
|
| 49 | Greedy colorings for the binary paintshop problem |
Amini, Hadis |
2010 |
38-41 | 1 |
p. 8-14 7 p. |
artikel |
|
| 50 | HSAGA and its application for the construction of near-Moore digraphs |
Tang, Jianmin |
2008 |
38-41 | 1 |
p. 73-84 12 p. |
artikel |
|
| 51 | Improved random graph isomorphism |
Czajka, Tomek |
2008 |
38-41 | 1 |
p. 85-92 8 p. |
artikel |
|
| 52 | Indexing text using the Ziv–Lempel trie |
Navarro, Gonzalo |
2004 |
38-41 | 1 |
p. 87-114 28 p. |
artikel |
|
| 53 | Light orthogonal networks with constant geometric dilation |
Dumitrescu, Adrian |
2009 |
38-41 | 1 |
p. 112-129 18 p. |
artikel |
|
| 54 | List total colorings of series-parallel graphs |
Zhou, Xiao |
2005 |
38-41 | 1 |
p. 47-60 14 p. |
artikel |
|
| 55 | Local similarity between quotiented ordered trees |
Ouangraoua, Aïda |
2007 |
38-41 | 1 |
p. 23-35 13 p. |
artikel |
|
| 56 | Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs |
Bentz, Cédric |
2007 |
38-41 | 1 |
p. 36-54 19 p. |
artikel |
|
| 57 | New complexity bounds for image matching under rotation and scaling |
Hundt, Christian |
2011 |
38-41 | 1 |
p. 122-136 15 p. |
artikel |
|
| 58 | New dynamic construction techniques for M-tree |
Skopal, Tomáš |
2009 |
38-41 | 1 |
p. 62-77 16 p. |
artikel |
|
| 59 | [No title] |
Kucherov, Gregory |
2011 |
38-41 | 1 |
p. 1- 1 p. |
artikel |
|
| 60 | Off-line and on-line guaranteed start-up delay for Media-on-Demand with stream merging |
Bar-Noy, Amotz |
2006 |
38-41 | 1 |
p. 72-105 34 p. |
artikel |
|
| 61 | On consecutive edge magic total labeling of graphs |
Sugeng, K.A. |
2008 |
38-41 | 1 |
p. 59-65 7 p. |
artikel |
|
| 62 | Online and offline algorithms for the sorting buffers problem on the line metric |
Khandekar, Rohit |
2010 |
38-41 | 1 |
p. 24-35 12 p. |
artikel |
|
| 63 | On-line load balancing made simple: Greedy strikes back |
Crescenzi, Pilu |
2007 |
38-41 | 1 |
p. 162-175 14 p. |
artikel |
|
| 64 | On-line scheduling of parallel jobs on two machines |
Chan, Wun-Tat |
2008 |
38-41 | 1 |
p. 3-10 8 p. |
artikel |
|
| 65 | On minimum metric dimension of honeycomb networks |
Manuel, Paul |
2008 |
38-41 | 1 |
p. 20-27 8 p. |
artikel |
|
| 66 | On reductions for the Steiner Problem in Graphs |
Kingston, Jeffrey H |
2003 |
38-41 | 1 |
p. 77-88 12 p. |
artikel |
|
| 67 | On shredders and vertex connectivity augmentation |
Liberman, Gilad |
2007 |
38-41 | 1 |
p. 91-101 11 p. |
artikel |
|
| 68 | On the analysis of a dynamic evolutionary algorithm |
Jansen, Thomas |
2006 |
38-41 | 1 |
p. 181-199 19 p. |
artikel |
|
| 69 | On the analysis of a simple evolutionary algorithm on quadratic pseudo-boolean functions |
Wegener, Ingo |
2005 |
38-41 | 1 |
p. 61-78 18 p. |
artikel |
|
| 70 | On the approximability of the maximum induced matching problem |
Duckworth, William |
2005 |
38-41 | 1 |
p. 79-91 13 p. |
artikel |
|
| 71 | On the generalized Berge sorting conjecture |
Deza, Antoine |
2010 |
38-41 | 1 |
p. 1-7 7 p. |
artikel |
|
| 72 | On the number of distinct prime factors of an odd perfect number |
Cohen, Graeme L. |
2003 |
38-41 | 1 |
p. 21-35 15 p. |
artikel |
|
| 73 | On the probabilistic behaviour of a heuristic algorithm for maximal Hamiltonian tours |
Martens, Marco |
2007 |
38-41 | 1 |
p. 102-114 13 p. |
artikel |
|
| 74 | Optimizing a constrained convex polygonal annulus |
Barequet, Gill |
2005 |
38-41 | 1 |
p. 1-26 26 p. |
artikel |
|
| 75 | Parallel query processing on distributed clustering indexes |
Gil-Costa, Veronica |
2009 |
38-41 | 1 |
p. 3-17 15 p. |
artikel |
|
| 76 | Parameterized matching with mismatches |
Apostolico, Alberto |
2007 |
38-41 | 1 |
p. 135-140 6 p. |
artikel |
|
| 77 | Partially dynamic maintenance of minimum weight hyperpaths |
Ausiello, Giorgio |
2005 |
38-41 | 1 |
p. 27-46 20 p. |
artikel |
|
| 78 | Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size |
Ito, Takehiro |
2006 |
38-41 | 1 |
p. 142-154 13 p. |
artikel |
|
| 79 | Pattern matching in pseudo real-time |
Clifford, Raphaël |
2011 |
38-41 | 1 |
p. 67-81 15 p. |
artikel |
|
| 80 | Polar SAT and related graphs |
Zverovich, Igor' |
2006 |
38-41 | 1 |
p. 155-167 13 p. |
artikel |
|
| 81 | Position heaps: A simple and dynamic text indexing data structure |
Ehrenfeucht, Andrzej |
2011 |
38-41 | 1 |
p. 100-121 22 p. |
artikel |
|
| 82 | Probabilistic proximity searching algorithms based on compact partitions |
Bustos, Benjamin |
2004 |
38-41 | 1 |
p. 115-134 20 p. |
artikel |
|
| 83 | Quantum protocols for untrusted computations |
Mihara, Takashi |
2007 |
38-41 | 1 |
p. 65-72 8 p. |
artikel |
|
| 84 | Radial drawings of graphs: Geometric constraints and trade-offs |
Di Giacomo, Emilio |
2008 |
38-41 | 1 |
p. 109-124 16 p. |
artikel |
|
| 85 | Realizing partitions respecting full and partial order information |
Demaine, Erik D. |
2008 |
38-41 | 1 |
p. 51-58 8 p. |
artikel |
|
| 86 | Reducing structural changes in van Emde Boas' data structure to the lower bound for the dynamic predecessor problem |
Lagogiannis, George |
2006 |
38-41 | 1 |
p. 106-141 36 p. |
artikel |
|
| 87 | Reoptimization of the metric deadline TSP |
Böckenhauer, Hans-Joachim |
2010 |
38-41 | 1 |
p. 87-100 14 p. |
artikel |
|
| 88 | Replacing suffix trees with enhanced suffix arrays |
Abouelhoda, Mohamed Ibrahim |
2004 |
38-41 | 1 |
p. 53-86 34 p. |
artikel |
|
| 89 | Routing of single-source and multiple-source queries in static sensor networks |
Gąsieniec, Leszek |
2007 |
38-41 | 1 |
p. 1-11 11 p. |
artikel |
|
| 90 | Searching for a set of correlated patterns |
Klein, Shmuel T. |
2007 |
38-41 | 1 |
p. 149-161 13 p. |
artikel |
|
| 91 | Sigma-local graphs |
Bose, Prosenjit |
2010 |
38-41 | 1 |
p. 15-23 9 p. |
artikel |
|
| 92 | Solving similarity joins and range queries in metric spaces with the list of twin clusters |
Paredes, Rodrigo |
2009 |
38-41 | 1 |
p. 18-35 18 p. |
artikel |
|
| 93 | Some string matching problems from Bioinformatics which still need better solutions |
Gonnet, Gaston H. |
2004 |
38-41 | 1 |
p. 3-15 13 p. |
artikel |
|
| 94 | Sparse RNA folding: Time and space efficient algorithms |
Backofen, Rolf |
2011 |
38-41 | 1 |
p. 12-31 20 p. |
artikel |
|
| 95 | Special Issue of the Sixteenth Australasian Workshop on Combinatorial Algorithms (AWOCA 2005) September 18–21, 2005, Ballarat, Australia |
Iliopoulos, Costas |
2008 |
38-41 | 1 |
p. 1-2 2 p. |
artikel |
|
| 96 | Special issue on string processing and information retrieval |
Laender, Alberto H.F. |
2004 |
38-41 | 1 |
p. 1-2 2 p. |
artikel |
|
| 97 | Statistical properties of factor oracles |
Bourdon, Jérémie |
2011 |
38-41 | 1 |
p. 57-66 10 p. |
artikel |
|
| 98 | String matching in O ( n + m ) quantum time |
Ramesh, H |
2003 |
38-41 | 1 |
p. 103-110 8 p. |
artikel |
|
| 99 | Succinct data structures for flexible text retrieval systems |
Sadakane, Kunihiko |
2007 |
38-41 | 1 |
p. 12-22 11 p. |
artikel |
|
| 100 | Symbolic topological sorting with OBDDs |
Woelfel, Philipp |
2006 |
38-41 | 1 |
p. 51-71 21 p. |
artikel |
|
| 101 | The consensus string problem for a metric is NP-complete |
Sim, Jeong Seop |
2003 |
38-41 | 1 |
p. 111-117 7 p. |
artikel |
|
| 102 | The eight variable homogeneous degree three bent functions |
Charnes, C. |
2008 |
38-41 | 1 |
p. 66-72 7 p. |
artikel |
|
| 103 | Torpid mixing of the Wang–Swendsen–Kotecký algorithm for sampling colorings |
Łuczak, Tomasz |
2005 |
38-41 | 1 |
p. 92-100 9 p. |
artikel |
|
| 104 | Two algorithms for the Student-Project Allocation problem |
Abraham, David J. |
2007 |
38-41 | 1 |
p. 73-90 18 p. |
artikel |
|
| 105 | Update games and update networks |
Dinneen, Michael J. |
2003 |
38-41 | 1 |
p. 53-65 13 p. |
artikel |
|
| 106 | Virtual path layouts optimizing total hop count on ATM tree networks |
Peleg, David |
2005 |
38-41 | 1 |
p. 101-112 12 p. |
artikel |
|
| 107 | Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks |
Byrka, Jaroslaw |
2010 |
38-41 | 1 |
p. 65-75 11 p. |
artikel |
|
| 108 | Yet another optimal algorithm for 3-edge-connectivity |
Tsin, Yung H. |
2009 |
38-41 | 1 |
p. 130-146 17 p. |
artikel |
108 gevonden resultaten