![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 32 matches
- 2024
- Weili Wu
, Guangmo Tong
:
Computing and Combinatorics - 29th International Conference, COCOON 2023, Hawaii, HI, USA, December 15-17, 2023, Proceedings, Part II. Lecture Notes in Computer Science 14423, Springer 2024, ISBN 978-3-031-49192-4 [contents] - 2023
- Matthew Anderson, Vu Le:
Efficiently-Verifiable Strong Uniquely Solvable Puzzles and Matrix Multiplication. COCOON (2) 2023: 41-54 - Binay Bhattacharya, Amirhossein Mozafari, Thomas C. Shermer:
A Sub-quadratic Time Algorithm for Computing the Beacon Kernel of Simple Polygons. COCOON (2) 2023: 69-81 - Xue Chen, Kuan Cheng, Xin Li, Songtao Mao:
Random Shortening of Linear Codes and Applications. COCOON (2) 2023: 184-197 - Xianrun Chen, Lu Han, Dachuan Xu, Yicheng Xu, Yong Zhang:
k-Median/Means with Outliers Revisited: A Simple Fpt Approximation. COCOON (2) 2023: 295-302 - Andrew Drucker, Yuan Li
:
On the Minimum Depth of Circuits with Linear Number of Wires Encoding Good Codes. COCOON (2) 2023: 392-403 - Liman Du
, Wenguo Yang
, Suixiang Gao:
Maximizing Diversity and Persuasiveness of Opinion Articles in Social Networks. COCOON (2) 2023: 317-328 - Yucen Gao, Mingqian Ma, Jiale Zhang, Songjian Zhang, Jun Fang, Xiaofeng Gao, Guihai Chen:
Algorithms for Shortest Path Tour Problem in Large-Scale Road Network. COCOON (2) 2023: 340-352 - Hongjie Guo, Jianzhong Li, Fangyao Shen, Hong Gao:
Diversity and Freshness-Aware Regret Minimizing Set Queries. COCOON (2) 2023: 250-262 - Jaroslav Hancl, Adam Kabela, Michal Opler, Jakub Sosnovec, Robert Sámal, Pavel Valtr:
Improved Bounds for the Binary Paint Shop Problem. COCOON (2) 2023: 210-221 - Marc Hellmuth
, Peter F. Stadler
, Sandhya Thekkumpadan Puthiyaveedu
:
Fitch Graph Completion. COCOON (2) 2023: 225-237 - Naonori Kakimura
, Tomohiro Nakayoshi:
Deterministic Primal-Dual Algorithms for Online k-Way Matching with Delays. COCOON (2) 2023: 238-249 - Akinori Kawachi, Yuki Naito:
Quantum Query Lower Bounds for Key Recovery Attacks on the Even-Mansour Cipher. COCOON (2) 2023: 3-16 - Yuta Kurokawa, Ryotaro Mitsuboshi, Haruki Hamasaki
, Kohei Hatano
, Eiji Takimoto
, Holakou Rahmanian:
Extended Formulations via Decision Diagrams. COCOON (2) 2023: 17-28 - Yandi Li
, Jianxiong Guo
:
A Modified EXP3 in Adversarial Bandits with Multi-user Delayed Feedback. COCOON (2) 2023: 263-278 - Xiaowei Li, Xiwen Lu:
A Cost-Sharing Scheme for the k-Product Facility Location Game with Penalties. COCOON (2) 2023: 303-314 - Zihui Liang, Bakh Khoussainov, Haidong Yang:
Topological Network-Control Games. COCOON (2) 2023: 144-156 - Andrzej Lingas, Mia Persson:
$(\min ,+)$ Matrix and Vector Products for Inputs Decomposable into Few Monotone Subsequences. COCOON (2) 2023: 55-68 - Hengzhao Ma, Jianzhong Li:
The Hardness of Optimization Problems on the Weighted Massively Parallel Computation Model. COCOON (2) 2023: 106-117 - Qiufen Ni
, Yun Bai, Zhongzheng Tang
:
Profit Maximization for Competitive Influence Spread in Social Networks. COCOON (2) 2023: 366-377 - Pengxiang Pan, Junran Lichen, Ping Yang, Jianping Li:
The Heterogeneous Rooted Tree Cover Problem. COCOON (2) 2023: 94-105 - Zimo Sheng, Mingyu Xiao
:
A Discharging Method: Improved Kernels for Edge Triangle Packing and Covering. COCOON (2) 2023: 171-183 - Jingfang Su, Hongwei Du:
Algorithms for Full-View Coverage of Targets with Group Set Cover. COCOON (2) 2023: 198-209 - Xin Sun, Congying Han, Chenchen Wu, Dachuan Xu, Yang Zhou:
The Regularized Submodular Maximization via the Lyapunov Method. COCOON (2) 2023: 118-143 - Xin Tong, Yixiao Yu, Ziyi Fang, Haitao Jiang, Lusheng Wang
, Binhai Zhu
, Daming Zhu:
Cabbage Can't Always Be Transformed into Turnip: Decision Algorithms for Sorting by Symmetric Reversals. COCOON (2) 2023: 279-294 - Vincent Vajnovszki, Dennis Wong:
Greedy Gray Codes for Dyck Words and Ballot Sequences. COCOON (2) 2023: 29-40 - Shiwen Wang, Chenhao Wang, Tian Wang, Weijia Jia:
Approval-Based Participatory Budgeting with Donations. COCOON (2) 2023: 404-416 - Jianbo Wang
, Chao Xu
, Siyun Zhou
:
Solving Systems of Linear Equations Through Zero Forcing Set. COCOON (2) 2023: 353-365 - Jianting Yang, Ke Ye, Lihong Zhi:
Lower Bounds of Functions on Finite Abelian Groups. COCOON (2) 2023: 157-170 - Chaofeng Yu, Nan Zhang, Zhenhua Duan, Cong Tian:
An Approach to Agent Path Planning Under Temporal Logic Constraints. COCOON (2) 2023: 82-93
skipping 2 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-07-21 09:11 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint