| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A Nearly Optimal Algorithm for the Geodesic Voronoi Diagram of Points in a Simple Polygon
|
Liu, Chih-Hung
|
|
|
82 |
4 |
p. 915-937
|
artikel
|
| 2 |
Assortment Optimisation Under a General Discrete Choice Model: A Tight Analysis of Revenue-Ordered Assortments
|
Berbeglia, Gerardo
|
|
|
82 |
4 |
p. 681-720
|
artikel
|
| 3 |
Assortment Optimisation Under a General Discrete Choice Model: A Tight Analysis of Revenue-Ordered Assortments
|
Berbeglia, Gerardo
|
|
|
82 |
4 |
p. 681-720
|
artikel
|
| 4 |
A Unified Framework for Clustering Constrained Data Without Locality Property
|
Ding, Hu
|
|
|
82 |
4 |
p. 808-852
|
artikel
|
| 5 |
Correction to: Sorting Real Numbers in O(nlogn)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$O(n\sqrt{\log n})$$\end{document} Time and Linear Space
|
Han, Yijie
|
|
|
82 |
4 |
p. 979
|
artikel
|
| 6 |
Deterministic Dynamic Matching in O(1) Update Time
|
Bhattacharya, Sayan
|
|
|
82 |
4 |
p. 1057-1080
|
artikel
|
| 7 |
Extended Learning Graphs for Triangle Finding
|
Carette, Titouan
|
|
|
82 |
4 |
p. 980-1005
|
artikel
|
| 8 |
Local Algorithms for Sparse Spanning Graphs
|
Levi, Reut
|
|
|
82 |
4 |
p. 747-786
|
artikel
|
| 9 |
Making Bidirected Graphs Strongly Connected
|
Matsuoka, Tatsuya
|
|
|
82 |
4 |
p. 787-807
|
artikel
|
| 10 |
On Bubble Generators in Directed Graphs
|
Acuña, V.
|
|
|
82 |
4 |
p. 898-914
|
artikel
|
| 11 |
Online Clique Clustering
|
Chrobak, Marek
|
|
|
82 |
4 |
p. 938-965
|
artikel
|
| 12 |
On the Relation of Strong Triadic Closure and Cluster Deletion
|
Grüttemeier, Niels
|
|
|
82 |
4 |
p. 853-880
|
artikel
|
| 13 |
Quadratic Vertex Kernel for Rainbow Matching
|
Gupta, Sushmita
|
|
|
82 |
4 |
p. 881-897
|
artikel
|
| 14 |
Sorting Real Numbers in O(nlogn)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$O\big (n\sqrt{\log n}\big )$$\end{document} Time and Linear Space
|
Han, Yijie
|
|
|
82 |
4 |
p. 966-978
|
artikel
|
| 15 |
Sorting Real Numbers in O(nlogn) Time and Linear Space
|
Han, Yijie
|
|
|
82 |
4 |
p. 966-978
|
artikel
|
| 16 |
Space-Efficient DFS and Applications to Connectivity Problems: Simpler, Leaner, Faster
|
Hagerup, Torben
|
|
|
82 |
4 |
p. 1033-1056
|
artikel
|
| 17 |
Streaming Algorithms for Maximizing Monotone Submodular Functions Under a Knapsack Constraint
|
Huang, Chien-Chung
|
|
|
82 |
4 |
p. 1006-1032
|
artikel
|
| 18 |
Weak Coverage of a Rectangular Barrier
|
Dobrev, Stefan
|
|
|
82 |
4 |
p. 721-746
|
artikel
|
Tijdschrift beschrijving