| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
Efficient Computation of Sequence Mappability
|
Charalampopoulos, Panagiotis
|
|
|
84 |
5 |
p. 1418-1440
|
article
|
| 2 |
Enumeration of Support-Closed Subsets in Confluent Systems
|
Haraguchi, Kazuya
|
|
|
84 |
5 |
p. 1279-1315
|
article
|
| 3 |
Faster Minimization of Tardy Processing Time on a Single Machine
|
Bringmann, Karl
|
|
|
84 |
5 |
p. 1341-1356
|
article
|
| 4 |
Graph Modification for Edge-Coloured and Signed Graph Homomorphism Problems: Parameterized and Classical Complexity
|
Foucaud, Florent
|
|
|
84 |
5 |
p. 1183-1212
|
article
|
| 5 |
Local Routing in Sparse and Lightweight Geometric Graphs
|
Ashvinkumar, Vikrant
|
|
|
84 |
5 |
p. 1316-1340
|
article
|
| 6 |
Metric Violation Distance: Hardness and Approximation
|
Fan, Chenglin
|
|
|
84 |
5 |
p. 1441-1465
|
article
|
| 7 |
Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-Width
|
Bergougnoux, Benjamin
|
|
|
84 |
5 |
p. 1385-1417
|
article
|
| 8 |
On Approximating Degree-Bounded Network Design Problems
|
Guo, Xiangyu
|
|
|
84 |
5 |
p. 1252-1278
|
article
|
| 9 |
Online Coloring and a New Type of Adversary for Online Graph Problems
|
Li, Yaqiao
|
|
|
84 |
5 |
p. 1232-1251
|
article
|
| 10 |
Online Unit Clustering and Unit Covering in Higher Dimensions
|
Dumitrescu, Adrian
|
|
|
84 |
5 |
p. 1213-1231
|
article
|
| 11 |
Randomized Online Computation with High Probability Guarantees
|
Komm, Dennis
|
|
|
84 |
5 |
p. 1357-1384
|
article
|
Journal description