| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
Colouring (Pr + Ps)-Free Graphs
|
Klimošová, Tereza
|
|
|
82 |
7 |
p. 1833-1858
|
article
|
| 2 |
Compressed Dynamic Range Majority and Minority Data Structures
|
Gagie, Travis
|
|
|
82 |
7 |
p. 2063-2086
|
article
|
| 3 |
On the Optimality of Tape Merge of Two Lists with Similar Size
|
Li, Qian
|
|
|
82 |
7 |
p. 2107-2132
|
article
|
| 4 |
Parameterized Aspects of Strong Subgraph Closure
|
Golovach, Petr A.
|
|
|
82 |
7 |
p. 2006-2038
|
article
|
| 5 |
Parameterized Complexity of Conflict-Free Matchings and Paths
|
Agrawal, Akanksha
|
|
|
82 |
7 |
p. 1939-1965
|
article
|
| 6 |
Parameterized Orientable Deletion
|
Hanaka, Tesshu
|
|
|
82 |
7 |
p. 1909-1938
|
article
|
| 7 |
Placing Labels in Road Maps: Algorithms and Complexity
|
Gemsa, Andreas
|
|
|
82 |
7 |
p. 1881-1908
|
article
|
| 8 |
Robust Reoptimization of Steiner Trees
|
Goyal, Keshav
|
|
|
82 |
7 |
p. 1966-1988
|
article
|
| 9 |
Shortest Paths in the Plane with Obstacle Violations
|
Hershberger, John
|
|
|
82 |
7 |
p. 1813-1832
|
article
|
| 10 |
Subgraph Complementation
|
Fomin, Fedor V.
|
|
|
82 |
7 |
p. 1859-1880
|
article
|
| 11 |
The Distance-Constrained Matroid Median Problem
|
Kamiyama, Naoyuki
|
|
|
82 |
7 |
p. 2087-2106
|
article
|
| 12 |
The Generalized Definitions of the Two-Dimensional Largest Common Substructure Problems
|
Chan, Huang-Ting
|
|
|
82 |
7 |
p. 2039-2062
|
article
|
| 13 |
The Parameterized Hardness of the k-Center Problem in Transportation Networks
|
Feldmann, Andreas Emil
|
|
|
82 |
7 |
p. 1989-2005
|
article
|
| 14 |
Walking Through Waypoints
|
Akhoondian Amiri, Saeed
|
|
|
82 |
7 |
p. 1784-1812
|
article
|
| 15 |
Why Did the Shape of Your Network Change? (On Detecting Network Anomalies via Non-local Curvatures)
|
DasGupta, Bhaskar
|
|
|
82 |
7 |
p. 1741-1783
|
article
|
Journal description