| 2020 | On Coresets for Support Vector Machines. | Murad Tukan, Cenk Baykal, Dan Feldman, Daniela Rus |
| 2020 | Approximate #Knapsack Computations to Count Semi-fair Allocations. | Theofilos Triommatis, Aris Pagourtzis |
| 2020 | On the Parameterized Complexity of | Ronny Tredup, Evgeny Erofeev |
| 2020 | Sumcheck-Based Delegation of Quantum Computing to Rational Server. | Yuki Takeuchi, Tomoyuki Morimae, Seiichiro Tani |
| 2020 | Approximation Guarantees for Deterministic Maximization of Submodular Function with a Matroid Constraint. | Xin Sun, Dachuan Xu, Longkun Guo, Min Li |
| 2020 | Acyclic Edge Coloring Conjecture Is True on Planar Graphs Without Intersecting Triangles. | Qiaojun Shu, Yong Chen, Shuguang Han, Guohui Lin, Eiji Miyano, An Zhang |
| 2020 | FPT Algorithms for Generalized Feedback Vertex Set Problems. | Bin Sheng |
| 2020 | Securely Computing the | Suthee Ruangwises, Toshiya Itoh |
| 2020 | A Primal-Dual Algorithm for Euclidean | Chunying Ren, Dachuan Xu, Donglei Du, Min Li |
| 2020 | On the Complexity of Acyclic Modules in Automata Networks. | Kvin Perrot, Pacme Perrotin, Sylvain Sen |
| 2020 | A Novel Initialization Algorithm for Fuzzy | Qian Liu, Jianxin Liu, Min Li, Yang Zhou |
| 2020 | Two-Stage Submodular Maximization Problem Beyond Non-negative and Monotone. | Zhicheng Liu, Hong Chang, Ran Ma, Donglei Du, Xiaoyan Zhang |
| 2020 | Fixed-Order Book Thickness with Respect to the Vertex-Cover Number: New Observations and Further Analysis. | Yunlong Liu, Jie Chen, Jingui Huang |
| 2020 | Optimal Matroid Bases with Intersection Constraints: Valuated Matroids, M-convex Functions, and Their Applications. | Yuni Iwamasa, Kenjiro Takazawa |
| 2020 | Space Complexity of Streaming Algorithms on Universal Quantum Computers. | Yanglin Hu, Darya Melnyk, Yuyi Wang, Roger Wattenhofer |
| 2020 | On Characterization of Petrie Partitionable Plane Graphs. | Xin He, Huaming Zhang |
| 2020 | Dispersing and Grouping Points on Segments in the Plane. | Xiaozhou He, Wenfeng Lai, Binhai Zhu, Peng Zou |
| 2020 | Online Removable Knapsack Problems for Integer-Sized Items. | Kanaho Hanji, Hiroshi Fujiwara, Hiroaki Yamamoto |
| 2020 | The Complexity of the Partition Coloring Problem. | Zhenyu Guo, Mingyu Xiao, Yi Zhou |
| 2020 | A Constant Factor Approximation for Lower-Bounded | Yutian Guo, Junyu Huang, Zhen Zhang |
| 2020 | Eternal Connected Vertex Cover Problem. | Toshihiro Fujito, Tomoya Nakamura |
| 2020 | LP-Based Algorithms for Computing Maximum Vertex-Disjoint Paths with Different Colors. | Yunyun Deng, Yi Chen, Kewen Liao, Longkun Guo |
| 2020 | A Primal-Dual Randomized Algorithm for the Online Weighted Set Multi-cover Problem. | Wenbin Chen, Fufang Li, Ke Qi, Miao Liu, Maobin Tang |
| 2020 | On Existence of Equilibrium Under Social Coalition Structures. | Bugra askurlu, zgn Ekici, Fatih Erdem Kizilkaya |
| 2020 | Synchronizing Words and Monoid Factorization: A Parameterized Perspective. | Jens Bruchertseifer, Henning Fernau |