| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks
|
Abu-Khzam, Faisal N.
|
|
2018
|
62 |
8 |
p. 1673-1689
|
article
|
| 2 |
Finger Search in Grammar-Compressed Strings
|
Bille, Philip
|
|
2018
|
62 |
8 |
p. 1715-1735
|
article
|
| 3 |
Online Bin Packing with Advice of Small Size
|
Angelopoulos, Spyros
|
|
2018
|
62 |
8 |
p. 2006-2034
|
article
|
| 4 |
Parameterised Algorithms for Deletion to Classes of DAGs
|
Agrawal, Akanksha
|
|
2018
|
62 |
8 |
p. 1880-1909
|
article
|
| 5 |
Parameterized Complexity of Voter Control in Multi-Peaked Elections
|
Yang, Yongjie
|
|
2018
|
62 |
8 |
p. 1798-1825
|
article
|
| 6 |
Polynomial Kernels for Vertex Cover Parameterized by Small Degree Modulators
|
Majumdar, Diptapriyo
|
|
2018
|
62 |
8 |
p. 1910-1951
|
article
|
| 7 |
Primitivity, Uniform Minimality, and State Complexity of Boolean Operations
|
Davies, Sylvie
|
|
2018
|
62 |
8 |
p. 1952-2005
|
article
|
| 8 |
Reasoning About XML Constraints Based on XML-to-Relational Mappings
|
Niewerth, Matthias
|
|
2018
|
62 |
8 |
p. 1826-1879
|
article
|
| 9 |
Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels
|
Krithika, R.
|
|
2018
|
62 |
8 |
p. 1690-1714
|
article
|
| 10 |
Set Cover Problems with Small Neighborhood Covers
|
Agarwal, Archita
|
|
2018
|
62 |
8 |
p. 1763-1797
|
article
|
| 11 |
Space Efficient Linear Time Algorithms for BFS, DFS and Applications
|
Banerjee, Niranka
|
|
2018
|
62 |
8 |
p. 1736-1762
|
article
|
| 12 |
The Most Points Connected-Covering Problem with Two Disks
|
Soltani, Sanaz
|
|
2018
|
62 |
8 |
p. 2035-2047
|
article
|
Journal description