| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A Fast Algorithm for the Product Structure of Planar Graphs
|
Morin, Pat
|
|
|
83 |
5 |
p. 1544-1558
|
article
|
| 2 |
Approximating the Canadian Traveller Problem with Online Randomization
|
Demaine, Erik D.
|
|
|
83 |
5 |
p. 1524-1543
|
article
|
| 3 |
Budget Feasible Mechanisms on Matroids
|
Leonardi, Stefano
|
|
|
83 |
5 |
p. 1222-1237
|
article
|
| 4 |
Computing the Largest Bond and the Maximum Connected Cut of a Graph
|
Duarte, Gabriel L.
|
|
|
83 |
5 |
p. 1421-1458
|
article
|
| 5 |
Eternal Domination: D-Dimensional Cartesian and Strong Grids and Everything in Between
|
Mc Inerney, Fionn
|
|
|
83 |
5 |
p. 1459-1492
|
article
|
| 6 |
Matching Cut in Graphs with Large Minimum Degree
|
Chen, Chi-Yeh
|
|
|
83 |
5 |
p. 1238-1255
|
article
|
| 7 |
Obtaining a Proportional Allocation by Deleting Items
|
Dorn, Britta
|
|
|
83 |
5 |
p. 1559-1603
|
article
|
| 8 |
Packing Arc-Disjoint Cycles in Tournaments
|
Bessy, Stéphane
|
|
|
83 |
5 |
p. 1393-1420
|
article
|
| 9 |
Polynomial Time Approximation Schemes for All 1-Center Problems on Metric Rational Set Similarities
|
Bury, Marc
|
|
|
83 |
5 |
p. 1371-1392
|
article
|
| 10 |
Popular Matchings in Complete Graphs
|
Cseh, Ágnes
|
|
|
83 |
5 |
p. 1493-1523
|
article
|
| 11 |
The Inverse Voronoi Problem in Graphs II: Trees
|
Bonnet, Édouard
|
|
|
83 |
5 |
p. 1165-1200
|
article
|
| 12 |
The Price of Defense
|
Mavronicolas, Marios
|
|
|
83 |
5 |
p. 1256-1315
|
article
|
| 13 |
Towards a Polynomial Kernel for Directed Feedback Vertex Set
|
Bergougnoux, Benjamin
|
|
|
83 |
5 |
p. 1201-1221
|
article
|
| 14 |
Travelling on Graphs with Small Highway Dimension
|
Disser, Yann
|
|
|
83 |
5 |
p. 1352-1370
|
article
|
| 15 |
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers
|
Akitaya, Hugo A.
|
|
|
83 |
5 |
p. 1316-1351
|
article
|
Journal description