| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A Class of Random Recursive Tree Algorithms with Deletion
|
Saunders, Arnold T.
|
|
|
|
11 |
p. 3363-3378
|
artikel
|
| 2 |
A Faster Exact-Counting Protocol for Anonymous Dynamic Networks
|
Chakraborty, Maitri
|
|
2017
|
|
11 |
p. 3023-3049
|
artikel
|
| 3 |
Algorithms for Communication Scheduling in Data Gathering Network with Data Compression
|
Luo, Wenchang
|
|
2017
|
|
11 |
p. 3158-3176
|
artikel
|
| 4 |
A Polynomial Kernel for Bipartite Permutation Vertex Deletion
|
Derbisz, Jan
|
|
|
|
11 |
p. 3246-3275
|
artikel
|
| 5 |
Approximation Algorithms for Highly Connected Multi-dominating Sets in Unit Disk Graphs
|
Fukunaga, Takuro
|
|
2017
|
|
11 |
p. 3270-3292
|
artikel
|
| 6 |
Approximation Algorithms for the Max-Buying Problem with Limited Supply
|
Fernandes, Cristina G.
|
|
2017
|
|
11 |
p. 2973-2992
|
artikel
|
| 7 |
Approximation Schemes for Stochastic Mean Payoff Games with Perfect Information and Few Random Positions
|
Boros, Endre
|
|
2017
|
|
11 |
p. 3132-3157
|
artikel
|
| 8 |
Batch Coloring of Graphs
|
Boyar, Joan
|
|
2017
|
|
11 |
p. 3293-3315
|
artikel
|
| 9 |
Bounded-Hop Communication Networks
|
Carmi, Paz
|
|
2017
|
|
11 |
p. 3050-3077
|
artikel
|
| 10 |
Building Fences Straight and High: An Optimal Algorithm for Finding the Maximum Length You Can Cut k Times from Given Sticks
|
Reitzig, Raphael
|
|
2017
|
|
11 |
p. 3365-3396
|
artikel
|
| 11 |
CNF Satisfiability in a Subspace and Related Problems
|
Arvind, V.
|
|
|
|
11 |
p. 3276-3299
|
artikel
|
| 12 |
Connected Subgraph Defense Games
|
Akrida, Eleni C.
|
|
|
|
11 |
p. 3403-3431
|
artikel
|
| 13 |
Correction to: A Connection Between Sports and Matroids: How Many Teams Can We Beat?
|
Schlotter, Ildikó
|
|
2017
|
|
11 |
p. 3428-3430
|
artikel
|
| 14 |
Correction to: Outer 1-Planar Graphs
|
Auer, Christopher
|
|
|
|
11 |
p. 3534-3535
|
artikel
|
| 15 |
Correction to: Randomized Algorithms for Tracking Distributed Count, Frequencies, and Ranks
|
Huang, Zengfeng
|
|
|
|
11 |
p. 3413
|
artikel
|
| 16 |
Correction to: Trading Off Worst and Expected Cost in Decision Tree Problems
|
Saettler, Aline
|
|
2018
|
|
11 |
p. 3431-3436
|
artikel
|
| 17 |
Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams
|
Aronov, Boris
|
|
2017
|
|
11 |
p. 3316-3334
|
artikel
|
| 18 |
De-anonymization of Heterogeneous Random Graphs in Quasilinear Time
|
Bringmann, Karl
|
|
2017
|
|
11 |
p. 3397-3427
|
artikel
|
| 19 |
Deterministic Treasure Hunt in the Plane with Angular Hints
|
Bouchard, Sébastien
|
|
|
|
11 |
p. 3250-3281
|
artikel
|
| 20 |
Dynamic Clustering to Minimize the Sum of Radii
|
Henzinger, Monika
|
|
|
|
11 |
p. 3183-3194
|
artikel
|
| 21 |
Dynamic Data Structures for Timed Automata Acceptance
|
Grez, Alejandro
|
|
|
|
11 |
p. 3223-3245
|
artikel
|
| 22 |
Dynamic Kernels for Hitting Sets and Set Packing
|
Bannach, Max
|
|
|
|
11 |
p. 3459-3488
|
artikel
|
| 23 |
Dynamic Relative Compression, Dynamic Partial Sums, and Substring Concatenation
|
Bille, Philip
|
|
2017
|
|
11 |
p. 3207-3224
|
artikel
|
| 24 |
Efficient Online String Matching Based on Characters Distance Text Sampling
|
Faro, Simone
|
|
|
|
11 |
p. 3390-3412
|
artikel
|
| 25 |
Efficient 1-Space Bounded Hypercube Packing Algorithm
|
Grzegorek, Paulina
|
|
|
|
11 |
p. 3216-3249
|
artikel
|
| 26 |
Embedding Graphs into Embedded Graphs
|
Fulek, Radoslav
|
|
|
|
11 |
p. 3282-3305
|
artikel
|
| 27 |
Encoding Two-Dimensional Range Top-k Queries
|
Jo, Seungbum
|
|
|
|
11 |
p. 3379-3402
|
artikel
|
| 28 |
Explicit Correlation Amplifiers for Finding Outlier Correlations in Deterministic Subquadratic Time
|
Karppa, Matti
|
|
|
|
11 |
p. 3306-3337
|
artikel
|
| 29 |
Finding Pairwise Intersections Inside a Query Range
|
Berg, Mark de
|
|
2017
|
|
11 |
p. 3253-3269
|
artikel
|
| 30 |
Greed is Good for Deterministic Scale-Free Networks
|
Chauhan, Ankit
|
|
|
|
11 |
p. 3338-3389
|
artikel
|
| 31 |
Happy Set Problem on Subclasses of Co-comparability Graphs
|
Eto, Hiroshi
|
|
|
|
11 |
p. 3327-3347
|
artikel
|
| 32 |
Hardness of Metric Dimension in Graphs of Constant Treewidth
|
Li, Shaohua
|
|
|
|
11 |
p. 3110-3155
|
artikel
|
| 33 |
Immunization in the Threshold Model: A Parameterized Complexity Study
|
Cordasco, Gennaro
|
|
|
|
11 |
p. 3376-3405
|
artikel
|
| 34 |
Improved Bounds in Stochastic Matching and Optimization
|
Baveja, Alok
|
|
2017
|
|
11 |
p. 3225-3252
|
artikel
|
| 35 |
Improved Solution to Data Gathering with Mobile Mule
|
Zur, Yoad
|
|
|
|
11 |
p. 3125-3164
|
artikel
|
| 36 |
Introducing lop-Kernels: A Framework for Kernelization Lower Bounds
|
Araújo, Júlio
|
|
|
|
11 |
p. 3365-3406
|
artikel
|
| 37 |
Lempel–Ziv-Like Parsing in Small Space
|
Kosolobov, Dmitry
|
|
|
|
11 |
p. 3195-3215
|
artikel
|
| 38 |
Local Search Algorithms for the Maximum Carpool Matching Problem
|
Kutiel, Gilad
|
|
|
|
11 |
p. 3165-3182
|
artikel
|
| 39 |
Maximizing Dominance in the Plane and its Applications
|
Choi, Jongmin
|
|
|
|
11 |
p. 3491-3513
|
artikel
|
| 40 |
Maximum Matching in Almost Linear Time on Graphs of Bounded Clique-Width
|
Ducoffe, Guillaume
|
|
|
|
11 |
p. 3489-3520
|
artikel
|
| 41 |
Metastability of Logit Dynamics for Coordination Games
|
Auletta, Vincenzo
|
|
2017
|
|
11 |
p. 3078-3131
|
artikel
|
| 42 |
Near Isometric Terminal Embeddings for Doubling Metrics
|
Elkin, Michael
|
|
|
|
11 |
p. 3319-3337
|
artikel
|
| 43 |
Network Design under General Wireless Interference
|
Halldórsson, Magnús M.
|
|
|
|
11 |
p. 3469-3490
|
artikel
|
| 44 |
On H-Topological Intersection Graphs
|
Chaplick, Steven
|
|
|
|
11 |
p. 3281-3318
|
artikel
|
| 45 |
Online Constrained Forest and Prize-Collecting Network Design
|
Qian, Jiawei
|
|
2017
|
|
11 |
p. 3335-3364
|
artikel
|
| 46 |
On Unrooted and Root-Uncertain Variants of Several Well-Known Phylogenetic Network Problems
|
Iersel, Leo van
|
|
2017
|
|
11 |
p. 2993-3022
|
artikel
|
| 47 |
Optimal Centrality Computations Within Bounded Clique-Width Graphs
|
Ducoffe, Guillaume
|
|
|
|
11 |
p. 3192-3222
|
artikel
|
| 48 |
Optimal Deterministic Shallow Cuttings for 3-d Dominance Ranges
|
Afshani, Peyman
|
|
2017
|
|
11 |
p. 3192-3206
|
artikel
|
| 49 |
Parameterized Complexity of Minimum Membership Dominating Set
|
Agrawal, Akanksha
|
|
|
|
11 |
p. 3430-3452
|
artikel
|
| 50 |
Path Cover Problems with Length Cost
|
Kobayashi, Kenya
|
|
|
|
11 |
p. 3348-3375
|
artikel
|
| 51 |
Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size
|
Donkers, Huib
|
|
|
|
11 |
p. 3407-3458
|
artikel
|
| 52 |
Recognizing k-Clique Extendible Orderings
|
Francis, Mathew
|
|
|
|
11 |
p. 3338-3362
|
artikel
|
| 53 |
Spanning Trees in Multipartite Geometric Graphs
|
Biniaz, Ahmad
|
|
2017
|
|
11 |
p. 3177-3191
|
artikel
|
| 54 |
Special Issue Dedicated to the 16th International Symposium on Parameterized and Exact Computation
|
Golovach, Petr A.
|
|
|
|
11 |
p. 3107-3109
|
artikel
|
| 55 |
Special Issue Dedicated to 16th International Conference and Workshops on Algorithms and Computation, WALCOM 2022
|
Rahman, Md. Saidur
|
|
|
|
11 |
p. 3325-3326
|
artikel
|
| 56 |
(Sub)linear Kernels for Edge Modification Problems Toward Structured Graph Classes
|
Bathie, Gabriel
|
|
|
|
11 |
p. 3338-3364
|
artikel
|
| 57 |
Succinct Encoding of Binary Strings Representing Triangulations
|
Fuentes-Sepúlveda, José
|
|
|
|
11 |
p. 3432-3468
|
artikel
|
| 58 |
The Complexity of L(p, q)-Edge-Labelling
|
Berthe, Gaétan
|
|
|
|
11 |
p. 3406-3429
|
artikel
|
| 59 |
The Fine-Grained Complexity of Multi-Dimensional Ordering Properties
|
An, Haozhe
|
|
|
|
11 |
p. 3156-3191
|
artikel
|
| 60 |
Translation Invariant Fréchet Distance Queries
|
Gudmundsson, Joachim
|
|
|
|
11 |
p. 3514-3533
|
artikel
|
| 61 |
Traversability, Reconfiguration, and Reachability in the Gadget Framework
|
Ani, Joshua
|
|
|
|
11 |
p. 3453-3486
|
artikel
|
| 62 |
Twin-width and Polynomial Kernels
|
Bonnet, Édouard
|
|
|
|
11 |
p. 3300-3337
|
artikel
|
Tijdschrift beschrijving