default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID12th FAW 2018: Guangzhou, China
- Jianer Chen, Pinyan Lu:
Frontiers in Algorithmics - 12th International Workshop, FAW 2018, Guangzhou, China, May 8-10, 2018, Proceedings. Lecture Notes in Computer Science 10823, Springer 2018, ISBN 978-3-319-78454-0
Graph Algorithms
- Jou-Ming Chang
, Kung-Jui Pai, Jinn-Shyong Yang, Ro-Yu Wu:
Two Kinds of Generalized 3-Connectivities of Alternating Group Networks. 3-14 - Ke Chen, Adrian Dumitrescu:
On the Longest Spanning Tree with Neighborhoods. 15-28 - S. Vaishali, M. S. Atulya, Nidhi Purohit:
Efficient Algorithms for a Graph Partitioning Problem. 29-42 - Biing-Feng Wang, Jhih-Hong Ye, Chih-Yu Li:
On the Minmax Regret Path Center Problem on Trees. 43-53 - Koki Takayama, Yusuke Kobayashi:
A Strongly Polynomial Time Algorithm for the Maximum Supply Rate Problem on Trees. 54-67 - Sangram Kishor Jena, Ramesh K. Jallu, Gautam K. Das, Subhas C. Nandy:
The Maximum Distance-d Independent Set Problem on Unit Disk Graphs. 68-80 - Wei Yu, Zhaohui Liu, Xiaoguang Bao:
New Approximation Algorithms for the Minimum Cycle Cover Problem. 81-95
Parameterized Algorithms
- Jie You, Jianxin Wang, Qilong Feng:
Parameterized Algorithms for Minimum Tree Cut/Paste Distance and Minimum Common Integer Partition. 99-111 - Nitesh Tripathi, Manjish Pal, Minati De, Gautam K. Das, Subhas C. Nandy:
Guarding Polyhedral Terrain by k-Watchtowers. 112-125 - Pranav Arora, Aritra Banik, Vijay Kumar Paliwal, Venkatesh Raman:
Some (in)tractable Parameterizations of Coloring and List-Coloring. 126-139 - Wenjun Li, Junjie Ye, Yixin Cao:
Kernelization for P2-Packing: A Gerrymandering Approach. 140-153 - M. R. Rani, Mohith Jagalmohanan, R. Subashini:
Classical Complexity and Fixed-Parameter Tractability of Simultaneous Consecutive Ones Submatrix & Editing Problems. 154-168 - Qilong Feng, Beilin Zhuo, Guanlan Tan, Neng Huang, Jianxin Wang:
Improved Kernels for Several Problems on Planar Graphs. 169-180
Other Algorithms
- Xiaotie Deng, Keyu Zhu:
On Bayesian Epistemology of Myerson Auction. 183-196 - Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro:
Low-Weight Superimposed Codes and Their Applications. 197-211 - Songhua Li, Yinfeng Xu:
Single Vehicle's Package Delivery Strategy with Online Traffic Congestion of Certain Delay Time. 212-223 - Gaoang Liu, Xiuying Liu:
The Complexity of Weak Consistency. 224-237 - Tian Liu, Chaoyi Wang, Wei Xu:
Balanced Random Constraint Satisfaction: Phase Transition and Hardness. 238-250 - Sundar Annamalai, N. S. Narayanaswamy:
Exact Algorithms for Allocation Problems. 251-262 - Toshihiro Akagi, Tetsuya Araki, Takashi Horiyama, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa:
Exact Algorithms for the Max-Min Dispersion Problem. 263-272 - Yuan Tang, Haibin Kan:
Non-orthogonal Homothetic Range Partial-Sum Query on Integer Grids - [Extended Abstract]. 273-285 - Yong Wang, Jeffrey B. Remmel:
A Method to Compute the Sparse Graphs for Traveling Salesman Problem Based on Frequency Quadrilaterals. 286-299 - Piotr Wojciechowski, K. Subramani, Matthew D. Williamson:
Optimal Length Tree-Like Refutations of Linear Feasibility in UTVPI Constraints. 300-314
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-12-12 20:47 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:
