| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Active-Learning a Convex Body in Low Dimensions
|
Har-Peled, Sariel
|
|
|
|
6 |
p. 1885-1917
|
artikel
|
| 2 |
Algorithms and Complexity on Indexing Founder Graphs
|
Equi, Massimo
|
|
|
|
6 |
p. 1586-1623
|
artikel
|
| 3 |
A Multiplicative Weight Updates Algorithm for Packing and Covering Semi-infinite Linear Programs
|
Elbassioni, Khaled
|
|
2019
|
|
6 |
p. 2377-2429
|
artikel
|
| 4 |
An Efficient Randomized Algorithm for Higher-Order Abstract Voronoi Diagrams
|
Bohler, Cecilia
|
|
2018
|
|
6 |
p. 2317-2345
|
artikel
|
| 5 |
An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width
|
Bergougnoux, Benjamin
|
|
|
|
6 |
p. 1654-1674
|
artikel
|
| 6 |
Approximate Span Programs
|
Ito, Tsuyoshi
|
|
2018
|
|
6 |
p. 2158-2195
|
artikel
|
| 7 |
Approximating k-Connected m-Dominating Sets
|
Nutov, Zeev
|
|
|
|
6 |
p. 1511-1525
|
artikel
|
| 8 |
A Rigorous Runtime Analysis of the (1+(λ,λ)) GA on Jump Functions
|
Antipov, Denis
|
|
|
|
6 |
p. 1573-1602
|
artikel
|
| 9 |
A Stronger Lower Bound on Parametric Minimum Spanning Trees
|
Eppstein, David
|
|
|
|
6 |
p. 1738-1753
|
artikel
|
| 10 |
A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs
|
Madathil, Jayakrishnan
|
|
|
|
6 |
p. 1861-1884
|
artikel
|
| 11 |
Average-Case Approximation Ratio of Scheduling without Payments
|
Zhang, Jie
|
|
|
|
6 |
p. 1638-1652
|
artikel
|
| 12 |
Better Distance Labeling for Unweighted Planar Graphs
|
Gawrychowski, Paweł
|
|
|
|
6 |
p. 1805-1823
|
artikel
|
| 13 |
Clique-Based Separators for Geometric Intersection Graphs
|
de Berg, Mark
|
|
|
|
6 |
p. 1652-1678
|
artikel
|
| 14 |
Clustered Planarity with Pipes
|
Angelini, Patrizio
|
|
2019
|
|
6 |
p. 2484-2526
|
artikel
|
| 15 |
Computing $$L_1$$L1 Shortest Paths Among Polygonal Obstacles in the Plane
|
Chen, Danny Z.
|
|
2019
|
|
6 |
p. 2430-2483
|
artikel
|
| 16 |
Computing the Rooted Triplet Distance Between Phylogenetic Networks
|
Jansson, Jesper
|
|
|
|
6 |
p. 1786-1828
|
artikel
|
| 17 |
Constructing the first (and coolest) fixed-content universal cycle
|
Sawada, Joe
|
|
|
|
6 |
p. 1754-1785
|
artikel
|
| 18 |
Covering Uncertain Points in a Tree
|
Wang, Haitao
|
|
2019
|
|
6 |
p. 2346-2376
|
artikel
|
| 19 |
Deleting Edges to Restrict the Size of an Epidemic: A New Application for Treewidth
|
Enright, Jessica
|
|
2017
|
|
6 |
p. 1857-1889
|
artikel
|
| 20 |
Discovering Small Target Sets in Social Networks: A Fast and Effective Algorithm
|
Cordasco, Gennaro
|
|
2017
|
|
6 |
p. 1804-1833
|
artikel
|
| 21 |
Dispersing Obnoxious Facilities on a Graph
|
Grigoriev, Alexander
|
|
|
|
6 |
p. 1734-1749
|
artikel
|
| 22 |
Does Comma Selection Help to Cope with Local Optima?
|
Doerr, Benjamin
|
|
|
|
6 |
p. 1659-1693
|
artikel
|
| 23 |
Dynamic Dictionaries for Multisets and Counting Filters with Constant Time Operations
|
Bercea, Ioana O.
|
|
|
|
6 |
p. 1786-1804
|
artikel
|
| 24 |
Editorial
|
Lengler, Johannes
|
|
|
|
6 |
p. 1571-1572
|
artikel
|
| 25 |
Essentially Tight Kernels for (Weakly) Closed Graphs
|
Koana, Tomohiro
|
|
|
|
6 |
p. 1706-1735
|
artikel
|
| 26 |
Fast Mutation in Crossover-Based Algorithms
|
Antipov, Denis
|
|
|
|
6 |
p. 1724-1761
|
artikel
|
| 27 |
Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization
|
Gomes, Guilherme C. M.
|
|
|
|
6 |
p. 1677-1706
|
artikel
|
| 28 |
Fixed-Target Runtime Analysis
|
Buzdalov, Maxim
|
|
|
|
6 |
p. 1762-1793
|
artikel
|
| 29 |
Guest Editorial: Special Issue on Combinatorial Optimization and Applications
|
Lu, Zaixin
|
|
2018
|
|
6 |
p. 1769-1770
|
artikel
|
| 30 |
Hierarchical Partial Planarity
|
Angelini, Patrizio
|
|
2018
|
|
6 |
p. 2196-2221
|
artikel
|
| 31 |
High-Dimensional Approximate r-Nets
|
Avarikioti, Z.
|
|
|
|
6 |
p. 1675-1702
|
artikel
|
| 32 |
Improved Online Algorithms for Knapsack and GAP in the Random Order Model
|
Albers, Susanne
|
|
|
|
6 |
p. 1750-1785
|
artikel
|
| 33 |
Improved Parameterized Algorithms for Network Query Problems
|
Pinter, Ron Y.
|
|
2018
|
|
6 |
p. 2270-2316
|
artikel
|
| 34 |
Independent Sets and Hitting Sets of Bicolored Rectangular Families
|
Soto, José A.
|
|
|
|
6 |
p. 1918-1952
|
artikel
|
| 35 |
Longest Common Substring with Approximately k Mismatches
|
Kociumaka, Tomasz
|
|
2019
|
|
6 |
p. 2633-2652
|
artikel
|
| 36 |
Longest Common Substring with Approximately k Mismatches
|
Kociumaka, Tomasz
|
|
|
|
6 |
p. 2633-2652
|
artikel
|
| 37 |
Machine Covering in the Random-Order Model
|
Albers, Susanne
|
|
|
|
6 |
p. 1560-1585
|
artikel
|
| 38 |
Mind the Gap!
|
Amir, Amihood
|
|
2018
|
|
6 |
p. 2123-2157
|
artikel
|
| 39 |
Multidimensional Period Recovery
|
Amir, Amihood
|
|
|
|
6 |
p. 1490-1510
|
artikel
|
| 40 |
Nested Convex Bodies are Chaseable
|
Bansal, Nikhil
|
|
|
|
6 |
p. 1640-1653
|
artikel
|
| 41 |
New and Simple Algorithms for Stable Flow Problems
|
Cseh, Ágnes
|
|
2019
|
|
6 |
p. 2557-2591
|
artikel
|
| 42 |
On 3-Coloring of (2P4,C5)-Free Graphs
|
Jelínek, Vít
|
|
|
|
6 |
p. 1526-1547
|
artikel
|
| 43 |
On Structural Parameterizations of the Edge Disjoint Paths Problem
|
Ganian, Robert
|
|
|
|
6 |
p. 1605-1637
|
artikel
|
| 44 |
On the Complexity Landscape of Connected f-Factor Problems
|
Ganian, R.
|
|
2019
|
|
6 |
p. 2606-2632
|
artikel
|
| 45 |
On the Complexity of Computing Treebreadth
|
Ducoffe, Guillaume
|
|
|
|
6 |
p. 1574-1600
|
artikel
|
| 46 |
On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths
|
Araújo, Júlio
|
|
|
|
6 |
p. 1616-1639
|
artikel
|
| 47 |
On the Kernel and Related Problems in Interval Digraphs
|
Francis, Mathew C.
|
|
|
|
6 |
p. 1522-1559
|
artikel
|
| 48 |
Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems
|
Asahiro, Yuichi
|
|
2017
|
|
6 |
p. 1834-1856
|
artikel
|
| 49 |
Optimal Matroid Partitioning Problems
|
Kawase, Yasushi
|
|
|
|
6 |
p. 1653-1676
|
artikel
|
| 50 |
Optimal Self-Assembly of Finite Shapes at Temperature 1 in 3D
|
Furcy, David
|
|
2016
|
|
6 |
p. 1909-1963
|
artikel
|
| 51 |
Optimization with Demand Oracles
|
Badanidiyuru, Ashwinkumar
|
|
2018
|
|
6 |
p. 2244-2269
|
artikel
|
| 52 |
Parameterized Counting of Partially Injective Homomorphisms
|
Roth, Marc
|
|
|
|
6 |
p. 1829-1860
|
artikel
|
| 53 |
Polynomial Time Algorithms for Tracking Path Problems
|
Choudhary, Pratibha
|
|
|
|
6 |
p. 1548-1570
|
artikel
|
| 54 |
Preclustering Algorithms for Imprecise Points
|
Abam, Mohammad Ali
|
|
|
|
6 |
p. 1467-1489
|
artikel
|
| 55 |
Preface to the Special Issue on the 17th Algorithms and Data Structures Symposium (WADS 2021)
|
He, Meng
|
|
|
|
6 |
p. 1736-1737
|
artikel
|
| 56 |
Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs
|
Pilipczuk, Michał
|
|
|
|
6 |
p. 1703-1739
|
artikel
|
| 57 |
Randomized Algorithms for Tracking Distributed Count, Frequencies, and Ranks
|
Huang, Zengfeng
|
|
2018
|
|
6 |
p. 2222-2243
|
artikel
|
| 58 |
Randomized Algorithms for Tracking Distributed Count, Frequencies, and Ranks
|
Huang, Zengfeng
|
|
|
|
6 |
p. 2222-2243
|
artikel
|
| 59 |
Range Majorities and Minorities in Arrays
|
Belazzougui, Djamal
|
|
|
|
6 |
p. 1707-1733
|
artikel
|
| 60 |
Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees
|
Gualà, Luciano
|
|
|
|
6 |
p. 1624-1651
|
artikel
|
| 61 |
Revisiting Connected Dominating Sets: An Almost Optimal Local Information Algorithm
|
Khuller, Samir
|
|
2019
|
|
6 |
p. 2592-2605
|
artikel
|
| 62 |
Scaffolding Problems Revisited: Complexity, Approximation and Fixed Parameter Tractable Algorithms, and Some Special Cases
|
Weller, Mathias
|
|
2018
|
|
6 |
p. 1771-1803
|
artikel
|
| 63 |
Self-Adjusting Evolutionary Algorithms for Multimodal Optimization
|
Rajabi, Amirhossein
|
|
|
|
6 |
p. 1694-1723
|
artikel
|
| 64 |
Shortest Beer Path Queries in Outerplanar Graphs
|
Bacic, Joyce
|
|
|
|
6 |
p. 1679-1705
|
artikel
|
| 65 |
Special Issue on Algorithms and Computation (ISAAC 2021)
|
|
|
|
|
6 |
p. 1521
|
artikel
|
| 66 |
Speeding Up the Gomory-Hu Parallel Cut Tree Algorithm with Efficient Graph Contractions
|
Maske, Charles
|
|
|
|
6 |
p. 1601-1615
|
artikel
|
| 67 |
Structural and Algorithmic Properties of 2-Community Structures
|
Bazgan, Cristina
|
|
2017
|
|
6 |
p. 1890-1908
|
artikel
|
| 68 |
Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs
|
Conte, Alessio
|
|
|
|
6 |
p. 1547-1573
|
artikel
|
| 69 |
Tight Bounds on the Expected Runtime of a Standard Steady State Genetic Algorithm
|
Oliveto, Pietro S.
|
|
|
|
6 |
p. 1603-1658
|
artikel
|
| 70 |
Trees, Paths, Stars, Caterpillars and Spiders
|
Jiang, Minghui
|
|
2016
|
|
6 |
p. 1964-1982
|
artikel
|
| 71 |
Universal Slope Sets for 1-Bend Planar Drawings
|
Angelini, Patrizio
|
|
2019
|
|
6 |
p. 2527-2556
|
artikel
|
Tijdschrift beschrijving