| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
Additive approximation algorithms for modularity maximization
|
Kawase, Yasushi
|
|
|
117 |
C |
p. 182-201
|
article
|
| 2 |
Block trees
|
Belazzougui, Djamal
|
|
|
117 |
C |
p. 1-22
|
article
|
| 3 |
Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem
|
Lagerkvist, Victor
|
|
|
117 |
C |
p. 23-39
|
article
|
| 4 |
Computing exact solutions of consensus halving and the Borsuk-Ulam theorem
|
Deligkas, Argyrios
|
|
|
117 |
C |
p. 75-98
|
article
|
| 5 |
Counting subset repairs with functional dependencies
|
Livshits, Ester
|
|
|
117 |
C |
p. 154-164
|
article
|
| 6 |
Editorial Board
|
|
|
|
117 |
C |
p. ii
|
article
|
| 7 |
Maximum parsimony distance on phylogenetic trees: A linear kernel and constant factor approximation algorithm
|
Jones, Mark
|
|
|
117 |
C |
p. 165-181
|
article
|
| 8 |
On approximate pure Nash equilibria in weighted congestion games with polynomial latencies
|
Caragiannis, Ioannis
|
|
|
117 |
C |
p. 40-48
|
article
|
| 9 |
On the profits of competing cloud service providers: A game theoretic approach
|
Li, Keqin
|
|
|
117 |
C |
p. 130-153
|
article
|
| 10 |
Parameterized k-Clustering: Tractability island
|
Fomin, Fedor V.
|
|
|
117 |
C |
p. 50-74
|
article
|
| 11 |
Reachability relations of timed pushdown automata
|
Clemente, Lorenzo
|
|
|
117 |
C |
p. 202-241
|
article
|
| 12 |
Selective monitoring
|
Grigore, Radu
|
|
|
117 |
C |
p. 99-129
|
article
|
| 13 |
46th International Colloquium on Automata, Languages and Programming (ICALP 2019) - Track C: Foundations of networks and multi-agent systems
|
Flocchini, Paola
|
|
|
117 |
C |
p. 49
|
article
|
Journal description