Proceedings Downloads:
TAMC 2020 Proceedings
TAMC 2020 Program
| Oct 18, 2020 |
| 8:50-9:00 | Welcome | ||
| 9:00-10:15 | Session 1 Chair: Jinhui Xu Video |
9:00-9:50 | Keynote: A Geometric Understanding of Deep Learning
Xianfeng David Gu |
| 9:50-10:15 | Two-Stage Submodular Maximization Problem Beyond Non-Negative and Monotone
Zhicheng Liu, Hong Chang, Ran Ma, Donglei Du and Xiaoyan Zhang |
||
| 10:15-10:30 | Break | ||
| 10:30-11:45 | Session 2 Chair: Mingyu Xiao Video |
10:30-10:55 | Polynomial Kernels for Paw-free Edge Modification Problems
Yixin Cao, Yuping Ke and Hanchun Yuan |
| 10:55-11:20 | FPT Algorithms for Generalized Feedback Vertex Set Problems
Bin Sheng |
||
| 11:20-11:45 | Tractabilities for Tree Assembly Problems
Feng Shi, Jie You, Zhen Zhang and Jingyi Liu |
||
| 11:50-14:30 | Break | ||
| 14:30-16:10 | Session 3 Chair: Feng Shi Video |
14:30-14:55 | A Novel Initialization Algorithm for Fuzzy C-means Problem
Qian Liu, Jianxin Liu, Min Li and Yang Zhou |
| 14:55-15:20 | An Improved Approximation Algorithm for the Prize-Collecting Red-Blue Median Problem
Zhen Zhang, Yutian Guo and Junyu Huang |
||
| 15:20-15:45 | A Constant Factor Approximation for Lower-Bounded k-Median
Yutian Guo, Junyu Huang and Zhen Zhang |
||
| 15:45-16:10 | A Primal-Dual Algorithm for Euclidean k-Means problem with Penalties
Chunying Ren, Dachuan Xu, Donglei Du and Min Li |
||
| 16:10-16:25 | Break | ||
| 16:25-18:05 | Session 4 Chair: Yixin Cao Video |
16:25-16:50 | Floorplans with Walls
Katsuhisa Yamanaka and Shin-Ichi Nakano |
| 16:50-17:15 | On the Parameterized Complexity of d-Restricted Boolean Net Synthesis
Ronny Tredup and Evgeny Erofeev |
||
| 17:15-17:40 | Synchronizing Words and Monoid Factorization: A Parameterized Perspective
Jens Bruchertseifer and Henning Fernau |
||
| 17:40-18:05 | On Pure Space vs Catalytic Space
Sagar Bisoyi, Krishnamoorthy Dinesh and Jayalal Sarma |
||
| Oct 19, 2020 |
| 9:00-10:15 | Session 5 Chair: Min Li Video |
9:00-9:25 | On Characterization of Petrie Partitionable Plane Graphs
Xin He and Huaming Zhang |
| 9:25-9:50 | Securely Computing the n-Variable Equality Function with 2n Cards
Suthee Ruangwises and Toshiya Itoh |
||
| 9:50-10:15 | Eternal Connected Vertex Cover Problem
Toshihiro Fujito and Tomoya Nakamura |
| 10:15-10:30 | Break | ||
| 10:30-11:45 | Session 6 Chair: Hong Chang Video |
10:30-10:55 | Dispersing and Grouping Points on Segments in the Plane
Xiaozhou He, Wenfeng Lai, Binhai Zhu and Peng Zou |
| 10:55-11:20 | LP-Based Algorithms for Computing Maximum Vertex-Disjoint Paths with Different Colors
Yunyun Deng, Yi Chen, Kewen Liao and Longkun Guo |
||
| 11:20-11:45 | Approximation Guarantees for Deterministic Maximization of Submodular Function with A Matroid Constraint
Xin Sun, Dachuan Xu, Longkun Guo and Min Li |
||
| 11:50-14:30 | Break | ||
| 14:30-16:10 | Session 7 Chair: Qilong Feng Video |
14:30-14:55 | Parametric Streaming Two-Stage Submodular Maximization
Ruiqi Yang, Dachuan Xu, Longkun Guo and Dongmei Zhang |
| 14:55-15:20 | On Coresets for Support Vector Machines
Murad Tukan, Cenk Baykal, Dan Feldman and Daniela Rus |
||
| 15:20-15:45 | Characterizations and approximability of hard counting classes below #P
Eleni Bakali, Aggeliki Chalki and Aris Pagourtzis |
||
| 15:45-16:10 | On Existence of Equilibrium Under Social Coalition Structures
Bugra Caskurlu, Ozgun Ekici and Fatih Erdem Kızılkaya |
||
| 16:10-16:25 | Break | ||
| 16:25-18:30 | Session 8 Chair: Yongjie Yang Jianer Chen Video |
16:25-16:50 | Space Complexity of Streaming Algorithms on Universal Quantum Computers
Yanglin Hu, Darya Melnyk, Yuyi Wang and Roger Wattenhofer |
| 16:50-17:15 | Approximate #Knapsack Computations to Count Semi-Fair Allocations
Theofilos Triommatis and Aris Pagourtzis |
||
| 17:15-17:40 | Partial Sums on the Ultra-Wide Word RAM
Philip Bille, Inge Li Gørtz and Frederik Rye Skjoldjensen |
||
| 17:40-18:30 | Keynote: Parameterized Graph Coloring Problems
Gregory Gutin |
||
| Oct 20, 2020 |
| 9:00-10:15 | Session 9 Chair: Bin Sheng Video |
9:00-9:25 | Reverse Mathematics, Projective Modules and Invertible Modules
Huishan Wu |
| 9:25-9:50 | Disjunctive Propositional Logic and Scott Domains
Longchun Wang and Qingguo Li |
||
| 9:50-10:15 | Semilattices of Punctual Numberings
Nikolay Bazhenov, Manat Mustafa and Sergey Ospichev |
| 10:15-10:30 | Break | ||
| 10:30-11:45 | Session 10 Chair: Wenbin Chen Video |
10:30-10:55 | A Primal-Dual Randomized Algorithm for the Online Weighted Set Multi-Cover Problem
Wenbin Chen, Fufang Li, Ke Qi, Miao Liu and Maobin Tang |
| 10:55-11:20 | Hidden Community Detection on Two-Layer Stochastic Models: A Theoretical Prospective
Jialu Bao, Kun He, Xiaodong Xin, Bart Selman and John E.Hopcroft |
||
| 11:20-11:45 | Optimal Matroid Bases with Intersection Constraints: Valuated Matroids, M-convex Functions, and Their Applications
Yuni Iwamasa and Kenjiro Takazawa |
||
| 11:50-14:30 | Break | ||
| 14:30-16:10 | Session 11 Chair: Yong Chen Video |
14:30-14:55 | Sumcheck-Based Delegation of Quantum Computing to Rational Server
Yuki Takeuchi, Tomoyuki Morimae and Seiichiro Tani |
| 14:55-15:20 | The Complexity of the Partition Coloring Problem
Zhenyu Guo, Mingyu Xiao and Yi Zhou |
||
| 15:20-15:45 | Online Removable Knapsack Problems for Integer-Sized Items
Kanaho Hanji, Hiroshi Fujiwara and Hiroaki Yamamoto |
||
| 15:45-16:10 | Fixed-order Book Thickness with Respect to Vertex-cover Number: New Observations and Further Analysis
Yunlong Liu, Jie Chen and Jingui Huang |
||
| 16:10-16:25 | Break | ||
| 16:25-17:15 | Session 12 Chair: Longkun Guo Video |
16:25-16:50 | Acyclic Edge Coloring Conjecture Is True on Planar Graphs Without Intersecting Triangles
Qiaojun Shu, Yong Chen, Shuguang Han, Guohui Lin, Eiji Miyano and An Zhang |
| 16:50-17:15 | On the Complexity of Acyclic Modules in Automata Networks
Kévin Perrot, Pacôme Perrotin and Sylvain Sené |
||