| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
An FPTAS for the Volume Computation of 0-1 Knapsack Polytopes Based on Approximate Convolution
|
Ando, Ei
|
|
2015
|
76 |
4 |
p. 1245-1263
|
artikel
|
| 2 |
Approximating Maximum Agreement Forest on Multiple Binary Trees
|
Chen, Jianer
|
|
2015
|
76 |
4 |
p. 867-889
|
artikel
|
| 3 |
Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds
|
Bansal, Nikhil
|
|
2016
|
76 |
4 |
p. 1077-1096
|
artikel
|
| 4 |
A Randomized Incremental Algorithm for the Hausdorff Voronoi Diagram of Non-crossing Clusters
|
Cheilaris, Panagiotis
|
|
2016
|
76 |
4 |
p. 935-960
|
artikel
|
| 5 |
A Randomized $$\mathrm {O}(\log n)$$O(logn)-Competitive Algorithm for the Online Connected Facility Location Problem
|
San Felice, Mário César
|
|
2016
|
76 |
4 |
p. 1139-1157
|
artikel
|
| 6 |
A Short Implicant of a CNF Formula with Many Satisfying Assignments
|
Kane, Daniel
|
|
2016
|
76 |
4 |
p. 1203-1223
|
artikel
|
| 7 |
Biased Predecessor Search
|
Bose, Prosenjit
|
|
2016
|
76 |
4 |
p. 1097-1105
|
artikel
|
| 8 |
Building Above Read-Once Polynomials: Identity Testing and Hardness of Representation
|
Mahajan, Meena
|
|
2015
|
76 |
4 |
p. 890-909
|
artikel
|
| 9 |
Computing and Combinatorics
|
Cai, Zhipeng
|
|
2016
|
76 |
4 |
p. 865-866
|
artikel
|
| 10 |
Conjugacy in Baumslag’s Group, Generic Case Complexity, and Division in Power Circuits
|
Diekert, Volker
|
|
2016
|
76 |
4 |
p. 961-988
|
artikel
|
| 11 |
Counting and Generating Permutations in Regular Classes
|
Basset, Nicolas
|
|
2016
|
76 |
4 |
p. 989-1034
|
artikel
|
| 12 |
Diffuse Reflection Radius in a Simple Polygon
|
Fox-Epstein, Eli
|
|
2015
|
76 |
4 |
p. 910-931
|
artikel
|
| 13 |
Dynamic Algorithms for Multimachine Interval Scheduling Through Analysis of Idle Intervals
|
Gavryushkin, Alex
|
|
2016
|
76 |
4 |
p. 1160-1180
|
artikel
|
| 14 |
Faster Algorithms for Computing the R* Consensus Tree
|
Jansson, Jesper
|
|
2016
|
76 |
4 |
p. 1224-1244
|
artikel
|
| 15 |
Generalised and Quotient Models for Random And/Or Trees and Application to Satisfiability
|
Genitrini, Antoine
|
|
2016
|
76 |
4 |
p. 1106-1138
|
artikel
|
| 16 |
Guest Editor’s Foreword
|
Ahn, Hee-Kap
|
|
2016
|
76 |
4 |
p. 1158-1159
|
artikel
|
| 17 |
On the Computational Complexity of Vertex Integrity and Component Order Connectivity
|
Drange, Pål Grønås
|
|
2016
|
76 |
4 |
p. 1181-1202
|
artikel
|
| 18 |
Preface-S.I.: LATIN 2014
|
Viola, Alfredo
|
|
2016
|
76 |
4 |
p. 932-934
|
artikel
|
| 19 |
The Power and Limitations of Static Binary Search Trees with Lazy Finger
|
Bose, Prosenjit
|
|
2016
|
76 |
4 |
p. 1264-1275
|
artikel
|
| 20 |
2-Xor Revisited: Satisfiability and Probabilities of Functions
|
Panafieu, Élie de
|
|
2016
|
76 |
4 |
p. 1035-1076
|
artikel
|
Tijdschrift beschrijving