| 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
|
|
9 |
p. 3707-3724
|
artikel
|
| 2 |
A Faster Interior-Point Method for Sum-of-Squares Optimization
|
Jiang, Shunhua
|
|
|
|
9 |
p. 2843-2884
|
artikel
|
| 3 |
A Faster Reduction of the Dynamic Time Warping Distance to the Longest Increasing Subsequence Length
|
Sakai, Yoshifumi
|
|
|
|
9 |
p. 2581-2596
|
artikel
|
| 4 |
A Fully Polynomial-Time Approximation Scheme for Speed Scaling with a Sleep State
|
Antoniadis, Antonios
|
|
2019
|
|
9 |
p. 3725-3745
|
artikel
|
| 5 |
A 3+Ω(1) Lower Bound for Page Migration
|
Matsubayashi, Akira
|
|
|
|
9 |
p. 2535-2563
|
artikel
|
| 6 |
An Efficient Exhaustive Search Algorithm for the Escherization Problem
|
Nagata, Yuichi
|
|
|
|
9 |
p. 2502-2534
|
artikel
|
| 7 |
An Efficient Sum Query Algorithm for Distance-Based Locally Dominating Functions
|
Huang, Ziyun
|
|
|
|
9 |
p. 2415-2431
|
artikel
|
| 8 |
A New Lower Bound for Deterministic Truthful Scheduling
|
Giannakopoulos, Yiannis
|
|
|
|
9 |
p. 2895-2913
|
artikel
|
| 9 |
A New Vertex Coloring Heuristic and Corresponding Chromatic Number
|
Zaker, Manouchehr
|
|
|
|
9 |
p. 2395-2414
|
artikel
|
| 10 |
An $$O(n \log n)$$O(nlogn) Time Algorithm for Computing the Path-Length Distance Between Trees
|
Bryant, David
|
|
2019
|
|
9 |
p. 3692-3706
|
artikel
|
| 11 |
Approximating the Geometric Edit Distance
|
Fox, Kyle
|
|
|
|
9 |
p. 2395-2413
|
artikel
|
| 12 |
Approximation Algorithms for Replenishment Problems with Fixed Turnover Times
|
Bosman, Thomas
|
|
|
|
9 |
p. 2597-2621
|
artikel
|
| 13 |
A Queueing Network-Based Distributed Laplacian Solver
|
Gillani, Iqra Altaf
|
|
|
|
9 |
p. 2859-2894
|
artikel
|
| 14 |
Asymptotic Analysis of q-Recursive Sequences
|
Heuberger, Clemens
|
|
|
|
9 |
p. 2480-2532
|
artikel
|
| 15 |
Asymptotic Quasi-Polynomial Time Approximation Scheme for Resource Minimization for Fire Containment
|
Rahgoshay, Mirmahdi
|
|
|
|
9 |
p. 2462-2479
|
artikel
|
| 16 |
Best Fit Bin Packing with Random Order Revisited
|
Albers, Susanne
|
|
|
|
9 |
p. 2833-2858
|
artikel
|
| 17 |
Bitonic st-Orderings for Upward Planar Graphs: Splits and Bends in the Variable Embedding Scenario
|
Angelini, Patrizio
|
|
|
|
9 |
p. 2667-2692
|
artikel
|
| 18 |
Clustering with Lower-Bounded Sizes
|
Abu-Khzam, Faisal N.
|
|
2017
|
|
9 |
p. 2517-2550
|
artikel
|
| 19 |
Complexity of Token Swapping and Its Variants
|
Bonnet, Édouard
|
|
2017
|
|
9 |
p. 2656-2682
|
artikel
|
| 20 |
Component Order Connectivity in Directed Graphs
|
Bang-Jensen, Jørgen
|
|
|
|
9 |
p. 2767-2784
|
artikel
|
| 21 |
Compression of Dynamic Graphs Generated by a Duplication Model
|
Turowski, Krzysztof
|
|
|
|
9 |
p. 2687-2707
|
artikel
|
| 22 |
Computing Bend-Minimum Orthogonal Drawings of Plane Series–Parallel Graphs in Linear Time
|
Didimo, Walter
|
|
|
|
9 |
p. 2605-2666
|
artikel
|
| 23 |
Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions
|
Hasunuma, Toru
|
|
|
|
9 |
p. 2697-2718
|
artikel
|
| 24 |
Constrained Pseudorandom Functions for Turing Machines Revisited: How to Achieve Verifiability and Key Delegation
|
Datta, Pratish
|
|
2019
|
|
9 |
p. 3245-3390
|
artikel
|
| 25 |
Deleting Vertices to Graphs of Bounded Genus
|
Kociumaka, Tomasz
|
|
2019
|
|
9 |
p. 3655-3691
|
artikel
|
| 26 |
Dynamic Parameterized Problems
|
Krithika, R.
|
|
2017
|
|
9 |
p. 2637-2655
|
artikel
|
| 27 |
Editor’s Note: Special Issue Dedicated to the 60th Birthday of Gregory Gutin
|
|
|
2018
|
|
9 |
p. 2516
|
artikel
|
| 28 |
Fast and Simple Compact Hashing via Bucketing
|
Köppl, Dominik
|
|
|
|
9 |
p. 2735-2766
|
artikel
|
| 29 |
Fast Exact Algorithms for Survivable Network Design with Uniform Requirements
|
Agrawal, Akanksha
|
|
|
|
9 |
p. 2622-2641
|
artikel
|
| 30 |
Finding Temporal Paths Under Waiting Time Constraints
|
Casteigts, Arnaud
|
|
|
|
9 |
p. 2754-2802
|
artikel
|
| 31 |
Fréchet Distance Between a Line and Avatar Point Set
|
Banik, Aritra
|
|
2017
|
|
9 |
p. 2616-2636
|
artikel
|
| 32 |
Graph Searches and Their End Vertices
|
Rong, Guozhen
|
|
|
|
9 |
p. 2642-2666
|
artikel
|
| 33 |
Improving and Extending the Testing of Distributions for Shape-Restricted Properties
|
Fischer, E.
|
|
2019
|
|
9 |
p. 3765-3802
|
artikel
|
| 34 |
Independent Set Reconfiguration Parameterized by Modular-Width
|
Belmonte, Rémy
|
|
|
|
9 |
p. 2586-2605
|
artikel
|
| 35 |
Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs
|
Martin, Barnaby
|
|
|
|
9 |
p. 2580-2604
|
artikel
|
| 36 |
Linear Kernels and Linear-Time Algorithms for Finding Large Cuts
|
Etscheid, Michael
|
|
2017
|
|
9 |
p. 2574-2615
|
artikel
|
| 37 |
MAX CUT in Weighted Random Intersection Graphs and Discrepancy of Sparse Random Set Systems
|
Nikoletseas, Sotiris
|
|
|
|
9 |
p. 2817-2842
|
artikel
|
| 38 |
Max-3-Lin Over Non-abelian Groups with Universal Factor Graphs
|
Bhangale, Amey
|
|
|
|
9 |
p. 2693-2734
|
artikel
|
| 39 |
Mincut Sensitivity Data Structures for the Insertion of an Edge
|
Baswana, Surender
|
|
|
|
9 |
p. 2702-2734
|
artikel
|
| 40 |
Minmax Regret k-Sink Location on a Dynamic Path Network with Uniform Capacities
|
Arumugam, Guru Prakash
|
|
2019
|
|
9 |
p. 3534-3585
|
artikel
|
| 41 |
Monotone Arithmetic Complexity of Graph Homomorphism Polynomials
|
Komarath, Balagopal
|
|
|
|
9 |
p. 2554-2579
|
artikel
|
| 42 |
NodeTrix Planarity Testing with Small Clusters
|
Di Giacomo, Emilio
|
|
2019
|
|
9 |
p. 3464-3493
|
artikel
|
| 43 |
Non-clairvoyantly Scheduling to Minimize Convex Functions
|
Fox, Kyle
|
|
2019
|
|
9 |
p. 3746-3764
|
artikel
|
| 44 |
On Girth and the Parameterized Complexity of Token Sliding and Token Jumping
|
Bartier, Valentin
|
|
|
|
9 |
p. 2914-2951
|
artikel
|
| 45 |
Online Budgeted Maximum Coverage
|
Rawitz, Dror
|
|
|
|
9 |
p. 2989-3014
|
artikel
|
| 46 |
Online Node- and Edge-Deletion Problems with Advice
|
Chen, Li-Hsuan
|
|
|
|
9 |
p. 2719-2753
|
artikel
|
| 47 |
On the Approximability of the Stable Matching Problem with Ties of Size Two
|
Chiang, Robert
|
|
|
|
9 |
p. 2668-2686
|
artikel
|
| 48 |
On the Complexity of Broadcast Domination and Multipacking in Digraphs
|
Foucaud, Florent
|
|
|
|
9 |
p. 2651-2677
|
artikel
|
| 49 |
On the Tractability of Optimization Problems on H-Graphs
|
Fomin, Fedor V.
|
|
|
|
9 |
p. 2432-2473
|
artikel
|
| 50 |
Parameterized Multi-Scenario Single-Machine Scheduling Problems
|
Hermelin, Danny
|
|
|
|
9 |
p. 2644-2667
|
artikel
|
| 51 |
ℓp-Norm Multiway Cut
|
Chandrasekaran, Karthekeyan
|
|
|
|
9 |
p. 2667-2701
|
artikel
|
| 52 |
Preface to Special Issue Dedicated to the 60th Birthday of Gregory Gutin
|
Fomin, Fedor V.
|
|
2018
|
|
9 |
p. 2513-2515
|
artikel
|
| 53 |
Primal–Dual and Dual-Fitting Analysis of Online Scheduling Algorithms for Generalized Flow-Time Problems
|
Angelopoulos, Spyros
|
|
2019
|
|
9 |
p. 3391-3421
|
artikel
|
| 54 |
Public Bayesian Persuasion: Being Almost Optimal and Almost Persuasive
|
Castiglioni, Matteo
|
|
|
|
9 |
p. 2885-2921
|
artikel
|
| 55 |
Queue Layouts of Planar 3-Trees
|
Alam, Jawaherul Md.
|
|
|
|
9 |
p. 2564-2585
|
artikel
|
| 56 |
Reconfiguration of Spanning Trees with Degree Constraints or Diameter Constraints
|
Bousquet, Nicolas
|
|
|
|
9 |
p. 2779-2816
|
artikel
|
| 57 |
Scheduling in the Random-Order Model
|
Albers, Susanne
|
|
|
|
9 |
p. 2803-2832
|
artikel
|
| 58 |
Selfish Vector Packing
|
Epstein, Leah
|
|
|
|
9 |
p. 2952-2988
|
artikel
|
| 59 |
Size Versus Truthfulness in the House Allocation Problem
|
Krysta, Piotr
|
|
2019
|
|
9 |
p. 3422-3463
|
artikel
|
| 60 |
Space-Efficient Vertex Separators for Treewidth
|
Kammer, Frank
|
|
|
|
9 |
p. 2414-2461
|
artikel
|
| 61 |
Stable Matching Games: Manipulation via Subgraph Isomorphism
|
Gupta, Sushmita
|
|
2017
|
|
9 |
p. 2551-2573
|
artikel
|
| 62 |
Strongly Stable and Maximum Weakly Stable Noncrossing Matchings
|
Hamada, Koki
|
|
|
|
9 |
p. 2678-2696
|
artikel
|
| 63 |
Structural Parameterizations of Undirected Feedback Vertex Set: FPT Algorithms and Kernelization
|
Majumdar, Diptapriyo
|
|
2018
|
|
9 |
p. 2683-2724
|
artikel
|
| 64 |
Subset Feedback Vertex Set in Chordal and Split Graphs
|
Philip, Geevarghese
|
|
2019
|
|
9 |
p. 3586-3629
|
artikel
|
| 65 |
The Approximability of Multiple Facility Location on Directed Networks with Random Arc Failures
|
Hassin, Refael
|
|
|
|
9 |
p. 2474-2501
|
artikel
|
| 66 |
The Complexity of Optimization on Grids
|
Barba, Luis
|
|
2019
|
|
9 |
p. 3494-3518
|
artikel
|
| 67 |
The Complexity of Tree Partitioning
|
An, Zhao
|
|
|
|
9 |
p. 2606-2643
|
artikel
|
| 68 |
The Largest Connected Subgraph Game
|
Bensmail, Julien
|
|
|
|
9 |
p. 2533-2555
|
artikel
|
| 69 |
The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue
|
Krithika, R.
|
|
2019
|
|
9 |
p. 3803-3841
|
artikel
|
| 70 |
Tight Approximation Algorithms for Geometric Bin Packing with Skewed Items
|
Khan, Arindam
|
|
|
|
9 |
p. 2735-2778
|
artikel
|
| 71 |
Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams
|
Gawrychowski, Paweł
|
|
2019
|
|
9 |
p. 3630-3654
|
artikel
|
| 72 |
Transmitting Once to Elect a Leader on Wireless Networks
|
Ravelomanana, Vlady
|
|
|
|
9 |
p. 2529-2553
|
artikel
|
| 73 |
Two Approaches to Building Time-Windowed Geometric Data Structures
|
Chan, Timothy M.
|
|
2019
|
|
9 |
p. 3519-3533
|
artikel
|
| 74 |
Universal Slope Sets for Upward Planar Drawings
|
Bekos, Michael A.
|
|
|
|
9 |
p. 2556-2580
|
artikel
|
Tijdschrift beschrijving