default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID16th TAMC 2020: Changsha, China
- Jianer Chen, Qilong Feng, Jinhui Xu:
Theory and Applications of Models of Computation, 16th International Conference, TAMC 2020, Changsha, China, October 18-20, 2020, Proceedings. Lecture Notes in Computer Science 12337, Springer 2020, ISBN 978-3-030-59266-0 - Nikolay Bazhenov
, Manat Mustafa, Sergei Ospichev:
Semilattices of Punctual Numberings. 1-12 - Philip Bille, Inge Li Gørtz, Frederik Rye Skjoldjensen:
Partial Sums on the Ultra-Wide Word RAM. 13-24 - Suthee Ruangwises, Toshiya Itoh:
Securely Computing the n-Variable Equality Function with 2n Cards. 25-36 - Yixin Cao, Yuping Ke, Hanchun Yuan:
Polynomial Kernels for Paw-Free Edge Modification Problems. 37-49 - Katsuhisa Yamanaka, Shin-Ichi Nakano:
Floorplans with Walls. 50-59 - Wenbin Chen, Fufang Li, Ke Qi, Miao Liu, Maobin Tang:
A Primal-Dual Randomized Algorithm for the Online Weighted Set Multi-cover Problem. 60-68 - Yuki Takeuchi, Tomoyuki Morimae, Seiichiro Tani:
Sumcheck-Based Delegation of Quantum Computing to Rational Server. 69-81 - Kanaho Hanji, Hiroshi Fujiwara, Hiroaki Yamamoto:
Online Removable Knapsack Problems for Integer-Sized Items. 82-93 - Zhen Zhang, Yutian Guo, Junyu Huang:
An Improved Approximation Algorithm for the Prize-Collecting Red-Blue Median Problem. 94-106 - Yunyun Deng, Yi Chen, Kewen Liao, Longkun Guo:
LP-Based Algorithms for Computing Maximum Vertex-Disjoint Paths with Different Colors. 107-118 - Yutian Guo, Junyu Huang, Zhen Zhang:
A Constant Factor Approximation for Lower-Bounded k-Median. 119-131 - Huishan Wu:
Reverse Mathematics, Projective Modules and Invertible Modules. 132-143 - Zhicheng Liu, Hong Chang, Ran Ma, Donglei Du, Xiaoyan Zhang:
Two-Stage Submodular Maximization Problem Beyond Non-negative and Monotone. 144-155 - Yuni Iwamasa, Kenjiro Takazawa:
Optimal Matroid Bases with Intersection Constraints: Valuated Matroids, M-convex Functions, and Their Applications. 156-167 - Kévin Perrot, Pacôme Perrotin, Sylvain Sené:
On the Complexity of Acyclic Modules in Automata Networks. 168-180 - Toshihiro Fujito, Tomoya Nakamura:
Eternal Connected Vertex Cover Problem. 181-192 - Ruiqi Yang, Dachuan Xu, Longkun Guo, Dongmei Zhang:
Parametric Streaming Two-Stage Submodular Maximization. 193-204 - Xin Sun, Dachuan Xu, Longkun Guo, Min Li:
Approximation Guarantees for Deterministic Maximization of Submodular Function with a Matroid Constraint. 205-214 - Qian Liu, Jianxin Liu, Min Li, Yang Zhou:
A Novel Initialization Algorithm for Fuzzy C-means Problem. 215-225 - Ronny Tredup, Evgeny Erofeev:
On the Parameterized Complexity of d-Restricted Boolean Net Synthesis. 226-238 - Theofilos Triommatis, Aris Pagourtzis:
Approximate #Knapsack Computations to Count Semi-fair Allocations. 239-250 - Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis:
Characterizations and Approximability of Hard Counting Classes Below \(\#\mathsf {P}\). 251-262 - Bugra Çaskurlu, Özgün Ekici, Fatih Erdem Kizilkaya:
On Existence of Equilibrium Under Social Coalition Structures. 263-274 - Yanglin Hu, Darya Melnyk, Yuyi Wang, Roger Wattenhofer:
Space Complexity of Streaming Algorithms on Universal Quantum Computers. 275-286 - Murad Tukan, Cenk Baykal, Dan Feldman, Daniela Rus:
On Coresets for Support Vector Machines. 287-299 - Feng Shi, Jie You, Zhen Zhang, Jingyi Liu:
Tractabilities for Tree Assembly Problems. 300-312 - Xin He, Huaming Zhang:
On Characterization of Petrie Partitionable Plane Graphs. 313-326 - Longchun Wang, Qingguo Li:
Disjunctive Propositional Logic and Scott Domains. 327-339 - Xiaozhou He, Wenfeng Lai, Binhai Zhu, Peng Zou:
Dispersing and Grouping Points on Segments in the Plane. 340-351 - Jens Bruchertseifer, Henning Fernau:
Synchronizing Words and Monoid Factorization: A Parameterized Perspective. 352-364 - Jialu Bao, Kun He, Xiaodong Xin, Bart Selman, John E. Hopcroft:
Hidden Community Detection on Two-Layer Stochastic Models: A Theoretical Perspective. 365-376 - Chunying Ren, Dachuan Xu, Donglei Du, Min Li:
A Primal-Dual Algorithm for Euclidean k-Means Problem with Penalties. 377-389 - Zhenyu Guo, Mingyu Xiao, Yi Zhou:
The Complexity of the Partition Coloring Problem. 390-401 - Bin Sheng:
FPT Algorithms for Generalized Feedback Vertex Set Problems. 402-413 - Yunlong Liu, Jie Chen, Jingui Huang:
Fixed-Order Book Thickness with Respect to the Vertex-Cover Number: New Observations and Further Analysis. 414-425 - Qiaojun Shu, Yong Chen, Shuguang Han, Guohui Lin, Eiji Miyano, An Zhang:
Acyclic Edge Coloring Conjecture Is True on Planar Graphs Without Intersecting Triangles. 426-438 - Sagar Bisoyi, Krishnamoorthy Dinesh, Jayalal Sarma:
On Pure Space vs Catalytic Space. 439-451
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-13 23:58 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
