| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A Faster Reduction of the Dynamic Time Warping Distance to the Longest Increasing Subsequence Length
|
Sakai, Yoshifumi
|
|
|
84 |
9 |
p. 2581-2596
|
artikel
|
| 2 |
Approximating the Geometric Edit Distance
|
Fox, Kyle
|
|
|
84 |
9 |
p. 2395-2413
|
artikel
|
| 3 |
Approximation Algorithms for Replenishment Problems with Fixed Turnover Times
|
Bosman, Thomas
|
|
|
84 |
9 |
p. 2597-2621
|
artikel
|
| 4 |
Asymptotic Analysis of q-Recursive Sequences
|
Heuberger, Clemens
|
|
|
84 |
9 |
p. 2480-2532
|
artikel
|
| 5 |
Asymptotic Quasi-Polynomial Time Approximation Scheme for Resource Minimization for Fire Containment
|
Rahgoshay, Mirmahdi
|
|
|
84 |
9 |
p. 2462-2479
|
artikel
|
| 6 |
Component Order Connectivity in Directed Graphs
|
Bang-Jensen, Jørgen
|
|
|
84 |
9 |
p. 2767-2784
|
artikel
|
| 7 |
Fast and Simple Compact Hashing via Bucketing
|
Köppl, Dominik
|
|
|
84 |
9 |
p. 2735-2766
|
artikel
|
| 8 |
Fast Exact Algorithms for Survivable Network Design with Uniform Requirements
|
Agrawal, Akanksha
|
|
|
84 |
9 |
p. 2622-2641
|
artikel
|
| 9 |
Graph Searches and Their End Vertices
|
Rong, Guozhen
|
|
|
84 |
9 |
p. 2642-2666
|
artikel
|
| 10 |
Mincut Sensitivity Data Structures for the Insertion of an Edge
|
Baswana, Surender
|
|
|
84 |
9 |
p. 2702-2734
|
artikel
|
| 11 |
ℓp-Norm Multiway Cut
|
Chandrasekaran, Karthekeyan
|
|
|
84 |
9 |
p. 2667-2701
|
artikel
|
| 12 |
Space-Efficient Vertex Separators for Treewidth
|
Kammer, Frank
|
|
|
84 |
9 |
p. 2414-2461
|
artikel
|
| 13 |
The Largest Connected Subgraph Game
|
Bensmail, Julien
|
|
|
84 |
9 |
p. 2533-2555
|
artikel
|
| 14 |
Universal Slope Sets for Upward Planar Drawings
|
Bekos, Michael A.
|
|
|
84 |
9 |
p. 2556-2580
|
artikel
|
Tijdschrift beschrijving