?
Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms ,
1
Efficient fully dynamic elimination forests with applicatio..:
, In:
?
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA) ,
2
Efficient fully dynamic elimination forests with applicatio..:
, In:
?
Treewidth, Kernels, and Algorithms; Lecture Notes in Computer Science ,
3
Hans Bodlaender and the Theory of Kernelization Lower Bound:
, In:
?
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms ,
4
SETH-based lower bounds for subset sum and bicriteria path:
, In:
?
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete algorithms ,
5
Weak compositions and their applications to polynomial lowe..:
, In:
?
Proceedings of the 10th ACM conference on Electronic commerce ,
6
An exact almost optimal algorithm for target set selection ..:
, In:
?
Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms ,
7
Optimization problems in multiple-interval graphs:
, In:
1-7