| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A Faster Algorithm for Cuckoo Insertion and Bipartite Matching in Large Graphs
|
Khosla, Megha
|
|
2019
|
81 |
9 |
p. 3707-3724
|
artikel
|
| 2 |
A Fully Polynomial-Time Approximation Scheme for Speed Scaling with a Sleep State
|
Antoniadis, Antonios
|
|
2019
|
81 |
9 |
p. 3725-3745
|
artikel
|
| 3 |
An $$O(n \log n)$$O(nlogn) Time Algorithm for Computing the Path-Length Distance Between Trees
|
Bryant, David
|
|
2019
|
81 |
9 |
p. 3692-3706
|
artikel
|
| 4 |
Constrained Pseudorandom Functions for Turing Machines Revisited: How to Achieve Verifiability and Key Delegation
|
Datta, Pratish
|
|
2019
|
81 |
9 |
p. 3245-3390
|
artikel
|
| 5 |
Deleting Vertices to Graphs of Bounded Genus
|
Kociumaka, Tomasz
|
|
2019
|
81 |
9 |
p. 3655-3691
|
artikel
|
| 6 |
Improving and Extending the Testing of Distributions for Shape-Restricted Properties
|
Fischer, E.
|
|
2019
|
81 |
9 |
p. 3765-3802
|
artikel
|
| 7 |
Minmax Regret k-Sink Location on a Dynamic Path Network with Uniform Capacities
|
Arumugam, Guru Prakash
|
|
2019
|
81 |
9 |
p. 3534-3585
|
artikel
|
| 8 |
NodeTrix Planarity Testing with Small Clusters
|
Di Giacomo, Emilio
|
|
2019
|
81 |
9 |
p. 3464-3493
|
artikel
|
| 9 |
Non-clairvoyantly Scheduling to Minimize Convex Functions
|
Fox, Kyle
|
|
2019
|
81 |
9 |
p. 3746-3764
|
artikel
|
| 10 |
Primal–Dual and Dual-Fitting Analysis of Online Scheduling Algorithms for Generalized Flow-Time Problems
|
Angelopoulos, Spyros
|
|
2019
|
81 |
9 |
p. 3391-3421
|
artikel
|
| 11 |
Size Versus Truthfulness in the House Allocation Problem
|
Krysta, Piotr
|
|
2019
|
81 |
9 |
p. 3422-3463
|
artikel
|
| 12 |
Subset Feedback Vertex Set in Chordal and Split Graphs
|
Philip, Geevarghese
|
|
2019
|
81 |
9 |
p. 3586-3629
|
artikel
|
| 13 |
The Complexity of Optimization on Grids
|
Barba, Luis
|
|
2019
|
81 |
9 |
p. 3494-3518
|
artikel
|
| 14 |
The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue
|
Krithika, R.
|
|
2019
|
81 |
9 |
p. 3803-3841
|
artikel
|
| 15 |
Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams
|
Gawrychowski, Paweł
|
|
2019
|
81 |
9 |
p. 3630-3654
|
artikel
|
| 16 |
Two Approaches to Building Time-Windowed Geometric Data Structures
|
Chan, Timothy M.
|
|
2019
|
81 |
9 |
p. 3519-3533
|
artikel
|
Tijdschrift beschrijving