| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A Clustering-Based Approach to Kinetic Closest Pair
|
Rahmati, Zahed
|
|
2017
|
|
10 |
p. 2742-2756
|
artikel
|
| 2 |
A Faster Algorithm for Truth Discovery via Range Cover
|
Huang, Ziyun
|
|
2019
|
|
10 |
p. 4118-4133
|
artikel
|
| 3 |
A Fixed-Parameter Perspective on #BIS
|
Curticapean, Radu
|
|
2019
|
|
10 |
p. 3844-3864
|
artikel
|
| 4 |
A General Framework for Enumerating Equivalence Classes of Solutions
|
Wang, Yishu
|
|
|
|
10 |
p. 3003-3023
|
artikel
|
| 5 |
Algorithms for the Unit-Cost Stochastic Score Classification Problem
|
Grammel, Nathaniel
|
|
|
|
10 |
p. 3054-3074
|
artikel
|
| 6 |
Almost-Smooth Histograms and Sliding-Window Graph Algorithms
|
Krauthgamer, Robert
|
|
|
|
10 |
p. 2926-2953
|
artikel
|
| 7 |
Almost Universal Anonymous Rendezvous in the Plane
|
Dieudonné, Yoann
|
|
|
|
10 |
p. 3110-3143
|
artikel
|
| 8 |
A Moderately Exponential Time Algorithm for k-IBDD Satisfiability
|
Nagao, Atsuki
|
|
2017
|
|
10 |
p. 2725-2741
|
artikel
|
| 9 |
An EPTAS for Scheduling on Unrelated Machines of Few Different Types
|
Jansen, Klaus
|
|
2019
|
|
10 |
p. 4134-4164
|
artikel
|
| 10 |
An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs
|
Karpov, Nikolai
|
|
2018
|
|
10 |
p. 4029-4042
|
artikel
|
| 11 |
A Note on Submodular Function Minimization with Covering Type Linear Constraints
|
Kamiyama, Naoyuki
|
|
2017
|
|
10 |
p. 2957-2971
|
artikel
|
| 12 |
A Polynomial Kernel for 3-Leaf Power Deletion
|
Ahn, Jungho
|
|
|
|
10 |
p. 3058-3087
|
artikel
|
| 13 |
Approximating Global Optimum for Probabilistic Truth Discovery
|
Li, Shi
|
|
|
|
10 |
p. 3091-3116
|
artikel
|
| 14 |
Approximating Small Balanced Vertex Separators in Almost Linear Time
|
Brandt, Sebastian
|
|
2018
|
|
10 |
p. 4070-4097
|
artikel
|
| 15 |
A Tight (3/2+ε)-Approximation for Skewed Strip Packing
|
Gálvez, Waldo
|
|
|
|
10 |
p. 3088-3109
|
artikel
|
| 16 |
A Unified Model and Algorithms for Temporal Map Labeling
|
Gemsa, Andreas
|
|
|
|
10 |
p. 2709-2736
|
artikel
|
| 17 |
A Weight-Scaling Algorithm for f-Factors of Multigraphs
|
Gabow, Harold N.
|
|
|
|
10 |
p. 3214-3289
|
artikel
|
| 18 |
Blocking Trails for f-factors of Multigraphs
|
Gabow, Harold N.
|
|
|
|
10 |
p. 3168-3213
|
artikel
|
| 19 |
Characterizing Star-PCGs
|
Xiao, Mingyu
|
|
|
|
10 |
p. 3066-3090
|
artikel
|
| 20 |
Clique Clustering Yields a PTAS for Max-Coloring Interval Graphs
|
Nonner, Tim
|
|
2017
|
|
10 |
p. 2941-2956
|
artikel
|
| 21 |
Complexity of Secure Sets
|
Bliem, Bernhard
|
|
2017
|
|
10 |
p. 2909-2940
|
artikel
|
| 22 |
Computational Aspects of Ordered Integer Partitions with Bounds
|
Glück, Roland
|
|
|
|
10 |
p. 2955-2984
|
artikel
|
| 23 |
Connected Reconfiguration of Lattice-Based Cellular Structures by Finite-Memory Robots
|
Fekete, Sándor P.
|
|
|
|
10 |
p. 2954-2986
|
artikel
|
| 24 |
Correction to: Guess Free Maximization of Submodular and Linear Sums
|
Feldman, Moran
|
|
|
|
10 |
p. 3101-3102
|
artikel
|
| 25 |
Correction to: Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints
|
Shi, Feng
|
|
|
|
10 |
p. 3117-3123
|
artikel
|
| 26 |
Correlation Clustering and Two-Edge-Connected Augmentation for Planar Graphs
|
Klein, Philip N.
|
|
|
|
10 |
p. 3024-3057
|
artikel
|
| 27 |
Dual-Based Approximation Algorithms for Cut-Based Network Connectivity Problems
|
Grimmer, Benjamin
|
|
2017
|
|
10 |
p. 2849-2873
|
artikel
|
| 28 |
Editor’s Note: Special Issue on Genetic and Evolutionary Computation
|
|
|
|
|
10 |
p. 3015-3016
|
artikel
|
| 29 |
Editor’s Note: Special Issue on Parameterized and Exact Computation
|
|
|
2019
|
|
10 |
p. 3843
|
artikel
|
| 30 |
Facility Reallocation on the Line
|
de Keijzer, Bart
|
|
|
|
10 |
p. 2898-2925
|
artikel
|
| 31 |
Finding Matching Cuts in H-Free Graphs
|
Lucke, Felicia
|
|
|
|
10 |
p. 3290-3322
|
artikel
|
| 32 |
Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality is the Key to Single-Exponential Parameterized Algorithms
|
Bonnet, Édouard
|
|
2019
|
|
10 |
p. 3890-3935
|
artikel
|
| 33 |
Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants
|
Björklund, Andreas
|
|
2018
|
|
10 |
p. 4010-4028
|
artikel
|
| 34 |
How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs?
|
Bougeret, Marin
|
|
2018
|
|
10 |
p. 4043-4068
|
artikel
|
| 35 |
Improved Approximation Algorithms for Path Vertex Covers in Regular Graphs
|
Zhang, An
|
|
|
|
10 |
p. 3041-3064
|
artikel
|
| 36 |
Improved Runtime Results for Simple Randomised Search Heuristics on Linear Functions with a Uniform Constraint
|
Neumann, Frank
|
|
|
|
10 |
p. 3209-3237
|
artikel
|
| 37 |
Light Spanners for High Dimensional Norms via Stochastic Decompositions
|
Filtser, Arnold
|
|
|
|
10 |
p. 2987-3007
|
artikel
|
| 38 |
Lipschitz Continuity and Approximate Equilibria
|
Deligkas, Argyrios
|
|
|
|
10 |
p. 2927-2954
|
artikel
|
| 39 |
Lower Bounds on the Runtime of Crossover-Based Algorithms via Decoupling and Family Graphs
|
Sutton, Andrew M.
|
|
|
|
10 |
p. 3180-3208
|
artikel
|
| 40 |
Modular Circulation and Applications to Traffic Management
|
Dasler, Philip
|
|
2018
|
|
10 |
p. 4098-4117
|
artikel
|
| 41 |
Multiplicative Up-Drift
|
Doerr, Benjamin
|
|
|
|
10 |
p. 3017-3058
|
artikel
|
| 42 |
New Tools and Connections for Exponential-Time Approximation
|
Bansal, Nikhil
|
|
2018
|
|
10 |
p. 3993-4009
|
artikel
|
| 43 |
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest
|
Dabrowski, Konrad K.
|
|
|
|
10 |
p. 2841-2866
|
artikel
|
| 44 |
One-Pass Additive-Error Subset Selection for ℓp Subspace Approximation and (k, p)-Clustering
|
Deshpande, Amit
|
|
|
|
10 |
p. 3144-3167
|
artikel
|
| 45 |
On Finding the Best and Worst Orientations for the Metric Dimension
|
Araujo, Julio
|
|
|
|
10 |
p. 2962-3002
|
artikel
|
| 46 |
Online Stochastic Matching: New Algorithms and Bounds
|
Brubach, Brian
|
|
|
|
10 |
p. 2737-2783
|
artikel
|
| 47 |
On Subgraph Complementation to H-free Graphs
|
Antony, Dhanyamol
|
|
|
|
10 |
p. 2842-2870
|
artikel
|
| 48 |
On the Approximate Compressibility of Connected Vertex Cover
|
Majumdar, Diptapriyo
|
|
|
|
10 |
p. 2902-2926
|
artikel
|
| 49 |
Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials
|
Jansen, Bart M. P.
|
|
2019
|
|
10 |
p. 3865-3889
|
artikel
|
| 50 |
Paired-Domination Problem on Distance-Hereditary Graphs
|
Lin, Ching-Chi
|
|
|
|
10 |
p. 2809-2840
|
artikel
|
| 51 |
Parameterised Counting in Logspace
|
Haak, Anselm
|
|
|
|
10 |
p. 2923-2961
|
artikel
|
| 52 |
Parameterized Complexity of Maximum Edge Colorable Subgraph
|
Agrawal, Akanksha
|
|
|
|
10 |
p. 3075-3100
|
artikel
|
| 53 |
Particle-Based Assembly Using Precise Global Control
|
Keller, Jakob
|
|
|
|
10 |
p. 2871-2897
|
artikel
|
| 54 |
Preface: Special Issue on WADS 2017
|
|
|
2019
|
|
10 |
p. 4069
|
artikel
|
| 55 |
Publisher Correction: Longest Common Substring with Approximately k Mismatches
|
Kociumaka, Tomasz
|
|
|
|
10 |
p. 3323
|
artikel
|
| 56 |
Rank Reduction of Oriented Graphs by Vertex and Edge Deletions
|
Meesum, Syed M.
|
|
2017
|
|
10 |
p. 2757-2776
|
artikel
|
| 57 |
Reachability Problems for Transmission Graphs
|
An, Shinwoo
|
|
|
|
10 |
p. 2820-2841
|
artikel
|
| 58 |
Runtime Analyses of the Population-Based Univariate Estimation of Distribution Algorithms on LeadingOnes
|
Lehre, Per Kristian
|
|
|
|
10 |
p. 3238-3280
|
artikel
|
| 59 |
Scheduling Distributed Clusters of Parallel Machines : Primal-Dual and LP-based Approximation Algorithms
|
Murray, Riley
|
|
2017
|
|
10 |
p. 2777-2798
|
artikel
|
| 60 |
Selected Papers of the 31st International Workshop on Combinatorial Algorithms, IWOCA 2020
|
Gąsieniec, Leszek
|
|
|
|
10 |
p. 3103-3106
|
artikel
|
| 61 |
Self-Adjusting Mutation Rates with Provably Optimal Success Rules
|
Doerr, Benjamin
|
|
|
|
10 |
p. 3108-3147
|
artikel
|
| 62 |
Sensor Network Topology Design and Analysis for Efficient Data Gathering by a Mobile Mule
|
Yedidsion, Harel
|
|
|
|
10 |
p. 2784-2808
|
artikel
|
| 63 |
Sequential Metric Dimension
|
Bensmail, Julien
|
|
|
|
10 |
p. 2867-2901
|
artikel
|
| 64 |
Small Candidate Set for Translational Pattern Search
|
Huang, Ziyun
|
|
|
|
10 |
p. 3034-3053
|
artikel
|
| 65 |
Solving String Problems on Graphs Using the Labeled Direct Product
|
Rizzo, Nicola
|
|
|
|
10 |
p. 3008-3033
|
artikel
|
| 66 |
Special Issue on Computing and Combinatorics
|
|
|
|
|
10 |
p. 3065
|
artikel
|
| 67 |
Strongly Polynomial FPTASes for Monotone Dynamic Programs
|
Alon, Tzvi
|
|
|
|
10 |
p. 2785-2819
|
artikel
|
| 68 |
The A Priori Traveling Repairman Problem
|
Ee, Martijn van
|
|
2017
|
|
10 |
p. 2818-2833
|
artikel
|
| 69 |
The Induced Separation Dimension of a Graph
|
Ziedan, Emile
|
|
2017
|
|
10 |
p. 2834-2848
|
artikel
|
| 70 |
The Inverse Voronoi Problem in Graphs I: Hardness
|
Bonnet, Édouard
|
|
|
|
10 |
p. 3018-3040
|
artikel
|
| 71 |
The Ordered Covering Problem
|
Feige, Uriel
|
|
2017
|
|
10 |
p. 2874-2908
|
artikel
|
| 72 |
The Runtime of the Compact Genetic Algorithm on Jump Functions
|
Doerr, Benjamin
|
|
|
|
10 |
p. 3059-3107
|
artikel
|
| 73 |
Tight Conditional Lower Bounds for Longest Common Increasing Subsequence
|
Duraj, Lech
|
|
2018
|
|
10 |
p. 3968-3992
|
artikel
|
| 74 |
Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem
|
Bossek, Jakob
|
|
|
|
10 |
p. 3148-3179
|
artikel
|
| 75 |
Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor
|
Jansen, Bart M. P.
|
|
2019
|
|
10 |
p. 3936-3967
|
artikel
|
| 76 |
Upper Domination: Towards a Dichotomy Through Boundary Properties
|
AbouEisha, Hassan
|
|
2017
|
|
10 |
p. 2799-2817
|
artikel
|
| 77 |
Upward Planar Morphs
|
Da Lozzo, Giordano
|
|
|
|
10 |
p. 2985-3017
|
artikel
|
Tijdschrift beschrijving