| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Algorithms and Lower Bounds for Comparator Circuits from Shrinkage
|
Cavalar, Bruno P.
|
|
|
|
7 |
p. 2131-2155
|
artikel
|
| 2 |
A New Lower Bound for Classic Online Bin Packing
|
Balogh, János
|
|
|
|
7 |
p. 2047-2062
|
artikel
|
| 3 |
A Polynomial Kernel for Distance-Hereditary Vertex Deletion
|
Kim, Eun Jung
|
|
|
|
7 |
p. 2096-2141
|
artikel
|
| 4 |
Approximate Generalized Matching: f-Matchings and f-Edge Covers
|
Huang, Dawei
|
|
|
|
7 |
p. 1952-1992
|
artikel
|
| 5 |
Approximation in (Poly-) Logarithmic Space
|
Biswas, Arindam
|
|
|
|
7 |
p. 2303-2331
|
artikel
|
| 6 |
Cluster Deletion on Interval Graphs and Split Related Graphs
|
Konstantinidis, Athanasios L.
|
|
|
|
7 |
p. 2018-2046
|
artikel
|
| 7 |
Colouring (Pr + Ps)-Free Graphs
|
Klimošová, Tereza
|
|
|
|
7 |
p. 1833-1858
|
artikel
|
| 8 |
Compact Distributed Certification of Planar Graphs
|
Feuilloley, Laurent
|
|
|
|
7 |
p. 2215-2244
|
artikel
|
| 9 |
Compact Representation of Graphs of Small Clique-Width
|
Kamali, Shahin
|
|
2017
|
|
7 |
p. 2106-2131
|
artikel
|
| 10 |
Competitive Vertex Recoloring
|
Azar, Yossi
|
|
|
|
7 |
p. 2001-2027
|
artikel
|
| 11 |
Complexity and Approximation for Discriminating and Identifying Code Problems in Geometric Setups
|
Dey, Sanjana
|
|
|
|
7 |
p. 1850-1882
|
artikel
|
| 12 |
Compressed Dynamic Range Majority and Minority Data Structures
|
Gagie, Travis
|
|
|
|
7 |
p. 2063-2086
|
artikel
|
| 13 |
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs
|
Koana, Tomohiro
|
|
|
|
7 |
p. 2156-2187
|
artikel
|
| 14 |
Constant-Factor Approximation Algorithms for Parity-Constrained Facility Location and k-Center
|
Kim, Kangsan
|
|
|
|
7 |
p. 1883-1911
|
artikel
|
| 15 |
Constant-Time Tree Traversal and Subtree Equality Check for Grammar-Compressed Trees
|
Lohrey, Markus
|
|
2017
|
|
7 |
p. 2082-2105
|
artikel
|
| 16 |
Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons
|
Barequet, Gill
|
|
|
|
7 |
p. 2245-2272
|
artikel
|
| 17 |
Correlation Clustering in Data Streams
|
Ahn, Kook Jin
|
|
|
|
7 |
p. 1980-2017
|
artikel
|
| 18 |
Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity
|
Bodlaender, Hans L.
|
|
2017
|
|
7 |
p. 2160-2180
|
artikel
|
| 19 |
Deterministic Constructions of High-Dimensional Sets with Small Dispersion
|
Ullrich, Mario
|
|
|
|
7 |
p. 1897-1915
|
artikel
|
| 20 |
Editorial: Special Issue on Algorithms and Computation
|
Hong, Seok-Hee
|
|
2018
|
|
7 |
p. 2132-2133
|
artikel
|
| 21 |
Fault Tolerant Depth First Search in Undirected Graphs: Simple Yet Efficient
|
Baswana, Surender
|
|
|
|
7 |
p. 2028-2049
|
artikel
|
| 22 |
Guest Editorial: Special Issue on Compact Data Structures
|
Gagie, Travis
|
|
2017
|
|
7 |
p. 1983-1985
|
artikel
|
| 23 |
Improved Bounds for Metric Capacitated Covering Problems
|
Bandyapadhyay, Sayan
|
|
|
|
7 |
p. 1825-1849
|
artikel
|
| 24 |
Internal Dictionary Matching
|
Charalampopoulos, Panagiotis
|
|
|
|
7 |
p. 2142-2169
|
artikel
|
| 25 |
Lempel–Ziv-78 Compressed String Dictionaries
|
Arz, Julian
|
|
2017
|
|
7 |
p. 2012-2047
|
artikel
|
| 26 |
Lempel–Ziv Factorization Powered by Space Efficient Suffix Trees
|
Fischer, Johannes
|
|
2017
|
|
7 |
p. 2048-2081
|
artikel
|
| 27 |
LZ77 Computation Based on the Run-Length Encoded BWT
|
Policriti, Alberto
|
|
2017
|
|
7 |
p. 1986-2011
|
artikel
|
| 28 |
Minmax Centered k-Partitioning of Trees and Applications to Sink Evacuation with Dynamic Confluent Flows
|
Chen, Di
|
|
|
|
7 |
p. 1948-2000
|
artikel
|
| 29 |
Multistage s–t Path: Confronting Similarity with Dissimilarity
|
Fluschnik, Till
|
|
|
|
7 |
p. 2028-2064
|
artikel
|
| 30 |
New FPT Algorithms for Finding the Temporal Hybridization Number for Sets of Phylogenetic Trees
|
Borst, Sander
|
|
|
|
7 |
p. 2050-2087
|
artikel
|
| 31 |
On (1, $$\epsilon $$ϵ)-Restricted Max–Min Fair Allocation Problem
|
Chan, T.-H. Hubert
|
|
2018
|
|
7 |
p. 2181-2200
|
artikel
|
| 32 |
On the Approximability of the Single Allocation p-Hub Center Problem with Parameterized Triangle Inequality
|
Chen, Li-Hsuan
|
|
|
|
7 |
p. 1993-2027
|
artikel
|
| 33 |
On the Minimum Consistent Subset Problem
|
Biniaz, Ahmad
|
|
|
|
7 |
p. 2273-2302
|
artikel
|
| 34 |
On the Optimality of Tape Merge of Two Lists with Similar Size
|
Li, Qian
|
|
|
|
7 |
p. 2107-2132
|
artikel
|
| 35 |
Optimal Composition Ordering Problems for Piecewise Linear Functions
|
Kawase, Yasushi
|
|
2017
|
|
7 |
p. 2134-2159
|
artikel
|
| 36 |
Parameterized Aspects of Strong Subgraph Closure
|
Golovach, Petr A.
|
|
|
|
7 |
p. 2006-2038
|
artikel
|
| 37 |
Parameterized Complexity of Conflict-Free Matchings and Paths
|
Agrawal, Akanksha
|
|
|
|
7 |
p. 1939-1965
|
artikel
|
| 38 |
Parameterized Orientable Deletion
|
Hanaka, Tesshu
|
|
|
|
7 |
p. 1909-1938
|
artikel
|
| 39 |
Placing Labels in Road Maps: Algorithms and Complexity
|
Gemsa, Andreas
|
|
|
|
7 |
p. 1881-1908
|
artikel
|
| 40 |
Producing Genomic Sequences after Genome Scaffolding with Ambiguous Paths: Complexity, Approximation and Lower Bounds
|
Davot, Tom
|
|
|
|
7 |
p. 2063-2095
|
artikel
|
| 41 |
Reconstructing Phylogenetic Trees from Multipartite Quartet Systems
|
Hirai, Hiroshi
|
|
|
|
7 |
p. 1875-1896
|
artikel
|
| 42 |
Relaxing the Irrevocability Requirement for Online Graph Algorithms
|
Boyar, Joan
|
|
|
|
7 |
p. 1916-1951
|
artikel
|
| 43 |
Restricted Max-Min Allocation: Integrality Gap and Approximation Algorithm
|
Cheng, Siu-Wing
|
|
|
|
7 |
p. 1835-1874
|
artikel
|
| 44 |
Robust Reoptimization of Steiner Trees
|
Goyal, Keshav
|
|
|
|
7 |
p. 1966-1988
|
artikel
|
| 45 |
Shortest Paths in the Plane with Obstacle Violations
|
Hershberger, John
|
|
|
|
7 |
p. 1813-1832
|
artikel
|
| 46 |
Social Distancing Network Creation
|
Friedrich, Tobias
|
|
|
|
7 |
p. 2087-2130
|
artikel
|
| 47 |
Sorting a Permutation by Best Short Swaps
|
Zhang, Shu
|
|
|
|
7 |
p. 1953-1979
|
artikel
|
| 48 |
Structural Parameterizations for Equitable Coloring: Complexity, FPT Algorithms, and Kernelization
|
Gomes, Guilherme C. M.
|
|
|
|
7 |
p. 1912-1947
|
artikel
|
| 49 |
Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs
|
Fomin, Fedor V.
|
|
|
|
7 |
p. 2170-2214
|
artikel
|
| 50 |
Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number
|
Misra, Pranabendu
|
|
|
|
7 |
p. 2065-2086
|
artikel
|
| 51 |
Subgraph Complementation
|
Fomin, Fedor V.
|
|
|
|
7 |
p. 1859-1880
|
artikel
|
| 52 |
The Distance-Constrained Matroid Median Problem
|
Kamiyama, Naoyuki
|
|
|
|
7 |
p. 2087-2106
|
artikel
|
| 53 |
The Generalized Definitions of the Two-Dimensional Largest Common Substructure Problems
|
Chan, Huang-Ting
|
|
|
|
7 |
p. 2039-2062
|
artikel
|
| 54 |
The Heaviest Induced Ancestors Problem: Better Data Structures and Applications
|
Abedin, Paniz
|
|
|
|
7 |
p. 2088-2105
|
artikel
|
| 55 |
The Parameterized Hardness of the k-Center Problem in Transportation Networks
|
Feldmann, Andreas Emil
|
|
|
|
7 |
p. 1989-2005
|
artikel
|
| 56 |
The Subset Assignment Problem for Data Placement in Caches
|
Ghandeharizadeh, Shahram
|
|
2018
|
|
7 |
p. 2201-2220
|
artikel
|
| 57 |
Towards Constant-Factor Approximation for Chordal/Distance-Hereditary Vertex Deletion
|
Ahn, Jungho
|
|
|
|
7 |
p. 2106-2133
|
artikel
|
| 58 |
Tree Automata and Pigeonhole Classes of Matroids: I
|
Funk, Daryl
|
|
|
|
7 |
p. 1795-1834
|
artikel
|
| 59 |
Walking Through Waypoints
|
Akhoondian Amiri, Saeed
|
|
|
|
7 |
p. 1784-1812
|
artikel
|
| 60 |
Why Did the Shape of Your Network Change? (On Detecting Network Anomalies via Non-local Curvatures)
|
DasGupta, Bhaskar
|
|
|
|
7 |
p. 1741-1783
|
artikel
|
Tijdschrift beschrijving