| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A Constant Factor Approximation Algorithm for the Storage Allocation Problem
|
Bar-Yehuda, Reuven
|
|
2016
|
77 |
4 |
p. 1105-1127
|
artikel
|
| 2 |
A Generalization of Multiple Choice Balls-into-Bins: Tight Bounds
|
Park, Gahyun
|
|
2016
|
77 |
4 |
p. 1159-1193
|
artikel
|
| 3 |
An On-line Competitive Algorithm for Coloring Bipartite Graphs Without Long Induced Paths
|
Micek, Piotr
|
|
2016
|
77 |
4 |
p. 1060-1070
|
artikel
|
| 4 |
A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands
|
Chitnis, Rajesh
|
|
2016
|
77 |
4 |
p. 1216-1239
|
artikel
|
| 5 |
Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet
|
Kociumaka, Tomasz
|
|
2016
|
77 |
4 |
p. 1194-1215
|
artikel
|
| 6 |
Extending Partial Representations of Proper and Unit Interval Graphs
|
Klavík, Pavel
|
|
2016
|
77 |
4 |
p. 1071-1104
|
artikel
|
| 7 |
Finding a Shortest Non-zero Path in Group-Labeled Graphs via Permanent Computation
|
Kobayashi, Yusuke
|
|
2016
|
77 |
4 |
p. 1128-1142
|
artikel
|
| 8 |
Finding Dominating Induced Matchings in $$P_8$$P8-Free Graphs in Polynomial Time
|
Brandstädt, Andreas
|
|
2016
|
77 |
4 |
p. 1283-1302
|
artikel
|
| 9 |
Improved Pseudo-polynomial Bound for the Value Problem and Optimal Strategy Synthesis in Mean Payoff Games
|
Comin, Carlo
|
|
2016
|
77 |
4 |
p. 995-1021
|
artikel
|
| 10 |
Local Computation Algorithms for Graphs of Non-constant Degrees
|
Levi, Reut
|
|
2016
|
77 |
4 |
p. 971-994
|
artikel
|
| 11 |
Optimal Program-Size Complexity for Self-Assembled Squares at Temperature 1 in 3D
|
Furcy, David
|
|
2016
|
77 |
4 |
p. 1240-1282
|
artikel
|
| 12 |
Short Sequences of Improvement Moves Lead to Approximate Equilibria in Constraint Satisfaction Games
|
Caragiannis, Ioannis
|
|
2016
|
77 |
4 |
p. 1143-1158
|
artikel
|
| 13 |
Strip Planarity Testing for Embedded Planar Graphs
|
Angelini, Patrizio
|
|
2016
|
77 |
4 |
p. 1022-1059
|
artikel
|
Tijdschrift beschrijving