default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID11. FAW 2017: Chengdu, China
- Mingyu Xiao, Frances A. Rosamond:
Frontiers in Algorithmics - 11th International Workshop, FAW 2017, Chengdu, China, June 23-25, 2017, Proceedings. Lecture Notes in Computer Science 10336, Springer 2017, ISBN 978-3-319-59604-4 - Eric Angel, Evripidis Bampis
, Vincent Chau, Vassilis Zissimopoulos:
On the Complexity of Minimizing the Total Calibration Cost. 1-12 - Sergey Bereg, Feifei Ma, Wencheng Wang, Jian Zhang, Binhai Zhu:
On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model. 13-21 - Arindam Biswas, Varunkumar Jayapaul, Venkatesh Raman, Srinivasa Rao Satti:
The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments. 22-33 - Piotr Borowiecki:
On Computational Aspects of Greedy Partitioning of Graphs. 34-46 - Hao Chen, Tian Liu:
Maximum Edge Bicliques in Tree Convex Bipartite Graphs. 47-55 - Wei Chen, Hanrui Zhang:
Complete Submodularity Characterization in the Comparative Independent Cascade Model. 56-67 - Xiaoli Chen, Weijun Xu:
A Risk-Reward Model for On-line Financial Leasing Problem with an Interest Rate. 68-78 - Shota Yuasa, Zhi-Zhong Chen, Bin Ma, Lusheng Wang:
Designing and Implementing Algorithms for the Closest String Problem. 79-90 - Jian Gao, Rong Chen, Minghao Yin, Hui Li:
The Broken-Triangle Property with Adjoint Values. 91-102 - Xin Han, Ning Ma, Kazuhisa Makino, He Chen:
Online Knapsack Problem Under Concave Functions. 103-114 - Kai Jin:
Fluctuated Fitting Under the 𝓁1-metric. 115-126 - Kai Jin:
Optimal Partitioning Which Maximizes the Weighted Sum of Products. 127-138 - Faisal N. Abu-Khzam, Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, Pavel Podlipyan:
Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity. 139-150 - Songhua Li, Yin-Feng Xu:
Online Strategies for Evacuating from a Convex Region in the Plane. 151-162 - Weidong Li, Xi Liu, Xiaolu Zhang, Xuejie Zhang:
A Further Analysis of the Dynamic Dominant Resource Fairness Mechanism. 163-174 - Wenjun Li, Haiyan Liu, Jianxin Wang, Lingyun Xiang, Yongjie Yang:
A 42k Kernel for the Complementary Maximal Strip Recovery Problem. 175-186 - Kelin Luo, Yinfeng Xu, Huili Zhang, Wei Luo:
On-line Scheduling with a Monotonous Subsequence Constraint. 187-195 - Jingjing Ma, Haitao Jiang, Daming Zhu, Shu Zhang:
A 1.4-Approximation Algorithm for Two-Sided Scaffold Filling. 196-208 - Diptapriyo Majumdar, Venkatesh Raman:
FPT Algorithms for FVS Parameterized by Split and Cluster Vertex Deletion Sets and Other Parameters. 209-220 - Kung-Jui Pai, Jou-Ming Chang, Ro-Yu Wu:
A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order. 221-232 - Yue-Li Wang:
Geodetic Contraction Games on Trees. 233-240 - Guangwei Wu, Jianer Chen, Jianxin Wang:
On Approximation Algorithms for Two-Stage Scheduling Problems. 241-253 - Boting Yang:
A New Lower Bound for Positive Zero Forcing. 254-266 - Junping Zhou, Shuli Hu, Tingting Zou, Minghao Yin:
Phase Transition for Maximum Not-All-Equal Satisfiability. 267-279
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 2026-01-30 22: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:
