Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID27th COCOON 2021: Tainan, Taiwan
- Chi-Yeh Chen
, Wing-Kai Hon, Ling-Ju Hung, Chia-Wei Lee:
Computing and Combinatorics - 27th International Conference, COCOON 2021, Tainan, Taiwan, October 24-26, 2021, Proceedings. Lecture Notes in Computer Science 13025, Springer 2021, ISBN 978-3-030-89542-6
Algorithms
- Edward Pyne, Salil P. Vadhan:
Limitations of the Impagliazzo-Nisan-Wigderson Pseudorandom Generator Against Permutation Branching Programs. 3-12 - Dong Xiang, Yunzhou Ju:
All-to-All Broadcast in Dragonfly Networks. 13-24 - Chun Lin, Chao-Yuan Huang, Ming-Jer Tsai:
An Efficient Algorithm for Enumerating Longest Common Increasing Subsequences. 25-36 - Bugra Çaskurlu, Özgün Ekici, Fatih Erdem Kizilkaya:
On Singleton Congestion Games with Resilience Against Collusion. 37-48 - Ben Cameron, Aaron Grubb, Joe Sawada:
A Pivot Gray Code Listing for the Spanning Trees of the Fan Graph. 49-60
Approximation Algorithms
- Sheng-Yen Ko, Ho-Lin Chen, Siu-Wing Cheng, Wing-Kai Hon, Chung-Shou Liao:
General Max-Min Fair Allocation. 63-75 - Tom Davot, Lucas Isenmann, Jocelyn Thiebaut:
On the Approximation Hardness of Geodetic Set and Its Variants. 76-88 - Liam Roditty, Roei Tov:
Approximate Distance Oracles with Improved Stretch for Sparse Graphs. 89-100 - Pooja Goyal, B. S. Panda:
Hardness and Approximation Results of Roman {3}-Domination in Graphs. 101-111 - Faryad Darabi Sahneh, Stephen G. Kobourov, Richard Spence:
Approximation Algorithms for Priority Steiner Tree Problems. 112-123 - Arindam Biswas, Venkatesh Raman:
Sublinear-Space Approximation Algorithms for Max r-SAT. 124-136 - Jingyang Zhao, Mingyu Xiao:
A Further Improvement on Approximating TTP-2. 137-149
Automata
- Sammy Khalife, Yann Ponty, Laurent Bulteau:
Sequence Graphs Realizations and Ambiguity in Language Models. 153-163 - Tomoyuki Yamakami:
Between SC and LOGDCFL: Families of Languages Accepted by Polynomial-Time Logarithmic-Space Deterministic Auxiliary Depth-k Storage Automata. 164-175 - Stefan Hoffmann:
Ideal Separation and General Theorems for Constrained Synchronization and Their Application to Small Constraint Automata. 176-188 - Hyunjoon Cheon, Joonghyuk Hahn, Yo-Sub Han, Sang-Ki Ko:
Most Pseudo-copy Languages Are Not Context-Free. 189-200
Computational Geometry
- Stephane Durocher, J. Mark Keil, Saeed Mehrabi, Debajyoti Mondal:
Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set. 203-214 - Ching-Lueh Chang:
Deterministic Metric 1-median Selection with a 1-o(1) Fraction of Points Ignored. 215-220 - Shin-Ichi Nakano:
The Coverage Problem by Aligned Disks. 221-230 - Yannick Bosch, Peter Schäfer, Joachim Spoerhase, Sabine Storandt, Johannes Zink:
Consistent Simplification of Polyline Tree Bundles. 231-243 - Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh:
Improving Upper and Lower Bounds for the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs. 244-256 - Ankush Acharyya, Ramesh K. Jallu, Vahideh Keikha, Maarten Löffler, Maria Saumell:
Minimum Color Spanning Circle in Imprecise Setup. 257-268
Fault Tolerant Computing and Fault Diagnosis
- Yihong Wang, Shuming Zhou, Zhengqin Yu:
Reliability Evaluation of Subsystem Based on Exchanged Hypercube. 271-282 - Jiafei Liu, Qianru Zhou, Zhengqin Yu, Shuming Zhou:
Fault Diagnosability of Regular Networks Under the Hybrid PMC Model. 283-297 - Nai-Wen Chang, Hsuan-Jung Wu, Sun-Yuan Hsieh:
A Study for Conditional Diagnosability of Pancake Graphs. 298-305 - Meirun Chen, D. Frank Hsu, Cheng-Kuan Lin:
A New Measure for Locally t-Diagnosable Under PMC Model. 306-316
Graph Algorithms
- Jan Goedgebeur, Shenwei Huang, Yiao Ju, Owen D. Merkel:
Colouring Graphs with No Induced Six-Vertex Path or Diamond. 319-329 - Yu-Han Chen, Kung-Jui Pai, Hsin-Jung Lin, Jou-Ming Chang:
Constructing Tri-CISTs in Shuffle-Cubes. 330-342 - Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa:
Reconfiguring Directed Trees in a Digraph. 343-354 - Yusuke Yanagisawa, Akira Suzuki, Yuma Tamura, Xiao Zhou:
Decremental Optimization of Vertex-Coloring Under the Reconfiguration Framework. 355-366 - Kung-Jui Pai:
Embedding Three Edge-Disjoint Hamiltonian Cycles into Locally Twisted Cubes. 367-374 - Luérbio Faria, Uéverton S. Souza:
On the Probe Problem for (r, ℓ )-Well-Coveredness. 375-386 - Nina Klobas, Matjaz Krnc:
Distinguishing Graphs via Cycles. 387-398
Graph Theory and Applications
- Ruo-Wei Hung, Ming-Jung Chiu:
The Restrained Domination and Independent Restrained Domination in Extending Supergrid Graphs. 401-412 - Alan M. Frieze, Krzysztof Turowski, Wojciech Szpankowski:
The Concentration of the Maximum Degree in the Duplication-Divergence Models. 413-424 - Sambhav Gupta, Eddie Cheng, László Lipták:
Conditional Fractional Matching Preclusion for Burnt Pancake Graphs and Pancake-Like Graphs (Extended Abstract). 425-435 - Justie Su-Tzu Juan, Zong-You Lai:
The Weakly Dimension-Balanced Pancyclicity on Toroidal Mesh Graph Tm, n When Both m and n Are Odd. 436-448 - Maciej Skorski:
Hypercontractivity via Tensor Calculus. 449-459
Network and Algorithms
- Neelima Gupta, Sapna Grover, Rajni Dabas:
Respecting Lower Bounds in Uniform Lower and Upper Bounded Facility Location Problem. 463-475 - Wei Ding:
Finding Cheapest Deadline Paths. 476-486 - Lu Han, Chenchen Wu, Yicheng Xu:
Approximate the Lower-Bounded Connected Facility Location Problem. 487-498 - Longteng Duan, Zifan Gong, Minming Li, Chenhao Wang, Xiaoying Wu:
Mechanism Design for Facility Location with Fractional Preferences and Minimum Distance. 499-511
Online Algorithm and Streaming Algorithms
- T.-H. Hubert Chan, Chui Shan Lee:
On the Hardness of Opinion Dynamics Optimization with L1-Budget on Varying Susceptibility to Persuasion. 515-527 - Vladimir Braverman, Viska Wei, Samson Zhou:
Symmetric Norm Estimation and Regression on Sliding Windows. 528-539 - Cheng-Hung Chiang, Meng-Tsung Tsai:
Single-Pass Streaming Algorithms to Partition Graphs into Few Forests. 540-552 - Elisabet Burjons, Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith:
The Secretary Problem with Reservation Costs. 553-564 - Songhua Li, Minming Li, Lingjie Duan, Victor C. S. Lee:
Online Ride-Hitching in UAV Travelling. 565-576
Parameterized Complexity and Algorithms
- Guilherme de C. M. Gomes, Bruno Porto Masquio, Paulo E. D. Pinto, Vinícius Fernandes dos Santos, Jayme Luiz Szwarcfiter:
Disconnected Matchings. 579-590 - Sun-Yuan Hsieh, Van Bang Le, Sheng-Lung Peng:
On the d-Claw Vertex Deletion Problem. 591-603 - Ankush Acharyya, Vahideh Keikha, Diptapriyo Majumdar, Supantha Pandit:
Constrained Hitting Set Problem with Intervals. 604-616 - Sen Huang, Mingyu Xiao, Xiaoyu Chen:
Exact Algorithms for Maximum Weighted Independent Set on Sparse Graphs (Extended Abstract). 617-628
Recreational Games
- Suthee Ruangwises:
Two Standard Decks of Playing Cards Are Sufficient for a ZKP for Sudoku. 631-642 - Win Hlaing Hlaing Myint, Ryuhei Uehara, Giovanni Viglietta:
Token Shifting on Graphs. 643-654 - Masaaki Kanzaki, Yota Otachi, Ryuhei Uehara:
Computational Complexity of Jumping Block Puzzles. 655-667 - Raimu Isuzugawa, Kodai Toyoda, Yu Sasaki, Daiki Miyahara, Takaaki Mizuki:
A Card-Minimal Three-Input AND Protocol Using Two Shuffles. 668-679 - Eurinardo Rodrigues Costa, Nicolas Almeida Martins, Rudini M. Sampaio:
Spy Game: FPT-Algorithm and Results on Graph Products. 680-691
a service of 
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-07-17 21:36 CEST 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:
