nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Binary Search in Graphs Revisited
|
Deligkas, Argyrios |
|
2018 |
81 |
5 |
p. 1757-1780 |
artikel |
2 |
Building an Optimal Point-Location Structure in $$O( sort (n))$$O(sort(n)) I/Os
|
Hu, Xiaocheng |
|
2018 |
81 |
5 |
p. 1921-1937 |
artikel |
3 |
Characterizing and Recognizing 4-Map Graphs
|
Brandenburg, Franz J. |
|
2018 |
81 |
5 |
p. 1818-1843 |
artikel |
4 |
Computing Dense Tensor Decompositions with Optimal Dimension Trees
|
Kaya, Oguz |
|
2018 |
81 |
5 |
p. 2092-2121 |
artikel |
5 |
Computing the Number of Induced Copies of a Fixed Graph in a Bounded Degree Graph
|
Patel, Viresh |
|
2018 |
81 |
5 |
p. 1844-1858 |
artikel |
6 |
Deterministic Leader Election Takes $$\Theta (D + \log n)$$Θ(D+logn) Bit Rounds
|
Casteigts, A. |
|
2018 |
81 |
5 |
p. 1901-1920 |
artikel |
7 |
Dynamic Graph Stream Algorithms in o(n) Space
|
Huang, Zengfeng |
|
2018 |
81 |
5 |
p. 1965-1987 |
artikel |
8 |
Edge-Orders
|
Schlipf, Lena |
|
2018 |
81 |
5 |
p. 1881-1900 |
artikel |
9 |
O(f) Bi-criteria Approximation for Capacitated Covering with Hard Capacities
|
Kao, Mong-Jen |
|
2018 |
81 |
5 |
p. 1800-1817 |
artikel |
10 |
Online Algorithms for Maximum Cardinality Matching with Edge Arrivals
|
Buchbinder, Niv |
|
2018 |
81 |
5 |
p. 1781-1799 |
artikel |
11 |
Online Dominating Set
|
Boyar, Joan |
|
2018 |
81 |
5 |
p. 1938-1964 |
artikel |
12 |
On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings
|
Bekos, Michael A. |
|
2018 |
81 |
5 |
p. 2046-2071 |
artikel |
13 |
Streaming Pattern Matching with d Wildcards
|
Golan, Shay |
|
2018 |
81 |
5 |
p. 1988-2015 |
artikel |
14 |
Succinct Summing over Sliding Windows
|
Ben Basat, Ran |
|
2018 |
81 |
5 |
p. 2072-2091 |
artikel |
15 |
The k-Server Problem with Advice in d Dimensions and on the Sphere
|
Burjons, Elisabet |
|
2018 |
81 |
5 |
p. 1859-1880 |
artikel |
16 |
When Can Graph Hyperbolicity be Computed in Linear Time?
|
Fluschnik, Till |
|
2018 |
81 |
5 |
p. 2016-2045 |
artikel |