Остановите войну!
for scientists:
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 56 matches
- 2021
- Mahdi Belbasi, Martin Fürer:
Finding All Leftmost Separators of Size $\le k$. COCOA 2021: 273-287 - Daniel Berend, Shahar Golan, Yochai Twitto:
A Novel Algorithm for Max Sat Calling MOCE to Order. COCOA 2021: 302-317 - Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane, Srinivasa Rao Satti:
Succinct Data Structures for Series-Parallel, Block-Cactus and 3-Leaf Power Graphs. COCOA 2021: 416-430 - Ying Chen, Yongxi Cheng:
Optimal Due Date Assignment Without Restriction and Convex Resource Allocation in Group Technology Scheduling. COCOA 2021: 456-467 - Jinmian Chen, Yukun Cheng, Zhiqi Xu, Yan Cao:
Evolutionary Equilibrium Analysis for Decision on Block Size in Blockchain Systems. COCOA 2021: 180-194 - Min Cui, Donglei Du, Ling Gai, Ruiqi Yang:
A Linear-Time Streaming Algorithm for Cardinality-Constrained Maximizing Monotone Non-submodular Set Functions. COCOA 2021: 96-110 - Chunsheng Cui, Baiqiu Li, Liu Wang:
The Selection of COVID-19 Epidemic Prevention and Control Programs Based on Group Decision Making. COCOA 2021: 46-60 - Tom Davot, Rodolphe Giroudeau, Jean-Claude König:
Complexity and Approximation Results on the Shared Transportation Problem. COCOA 2021: 140-151 - Liman Du, Wenguo Yang, Suixiang Gao:
Generalized Self-profit Maximization in Attribute Networks. COCOA 2021: 333-347 - Jessica A. Enright, Duncan Lee, Kitty Meeks, William Pettersson, John Sylvester:
The Complexity of Finding Optimal Subgraphs to Represent Spatial Correlation. COCOA 2021: 152-166 - Ling Gai, Weiwei Zhang, Wenchang Luo, Yukun Cheng:
On Various Open-End Bin Packing Game. COCOA 2021: 86-95 - Ajinkya Gaikwad, Soumen Maity:
On Structural Parameterizations of the Offensive Alliance Problem. COCOA 2021: 579-586 - Xiangyu Gao, Jian-Zhong Li, Dongjing Miao:
Sublinear-Time Reductions for Big Data Computing. COCOA 2021: 374-388 - Qinqin Gong, Suixiang Gao, Fengmin Wang, Ruiqi Yang:
A Multi-pass Streaming Algorithm for Regularized Submodular Maximization. COCOA 2021: 701-711 - Pooja Goyal, B. S. Panda:
Hardness Results of Connected Power Domination for Bipartite Graphs and Chordal Graphs. COCOA 2021: 653-667 - Ran Gu, Gregory Z. Gutin, Shasha Li, Yongtang Shi, Zhenyu Taoqiu:
The Smallest Number of Vertices in a 2-Arc-Strong Digraph Without Pair of Arc-Disjoint In- and Out-Branchings. COCOA 2021: 318-332 - Frank Gurski, Dominique Komander, Carolin Rehs, Sebastian Wiederrecht:
Directed Width Parameters on Semicomplete Digraphs. COCOA 2021: 615-628 - Michael A. Henning, Arti Pandey, Vikash Tripathi:
Approximation Algorithm and Hardness Results for Defensive Domination in Graphs. COCOA 2021: 247-261 - Weizhi Hong, Zhao Zhang, Yingli Ran:
Parallel Algorithm for Minimum Partial Dominating Set in Unit Disk Graph. COCOA 2021: 527-537 - R. Inkulu, Pawan Kumar:
Routing Among Convex Polygonal Obstacles in the Plane. COCOA 2021: 1-11 - Sai Ji, Yukun Cheng, Jingjing Tan, Zhongrui Zhao:
An Improved Approximation Algorithm for Capacitated Correlation Clustering Problem. COCOA 2021: 35-45 - Sai Ji, Min Li, Mei Liang, Zhenning Zhang:
Approximation Algorithm for Min-Max Correlation Clustering Problem with Outliers. COCOA 2021: 668-675 - Vahideh Keikha, Hamidreza Keikha, Ali Mohades:
On the k-colored Rainbow Sets in Fixed Dimensions. COCOA 2021: 587-601 - Yanzhi Li, Zhicheng Liu, Chuchu Xu, Ping Li, Hong Chang, Xiaoyan Zhang:
Two-Stage Submodular Maximization Under Curvature. COCOA 2021: 25-34 - Min Li, Qian Liu, Yang Zhou:
Two-Stage Stochastic Max-Weight Independent Set Problems. COCOA 2021: 203-213 - Xianyue Li, Ruowang Yang, Heping Zhang, Zhao Zhang:
Capacitated Partial Inverse Maximum Spanning Tree Under the Weighted l∞ -norm. COCOA 2021: 389-399 - Jiangkun Li, Peng Zhang:
New Approximation Algorithms for the Rooted Budgeted Cycle Cover Problem. COCOA 2021: 167-179 - Junran Lichen:
Cycle-Connected Mixed Graphs and Related Problems. COCOA 2021: 602-614 - Junran Lichen, Lijian Cai, Jianping Li, Suding Liu, Pengxiang Pan, Wencheng Wang:
Delay-Constrained Minimum Shortest Path Trees and Related Problems. COCOA 2021: 676-686 - Yunlong Liu, Yixuan Li, Jingui Huang:
Parameterized Algorithms for Linear Layouts of Graphs with Respect to the Vertex Cover Number. COCOA 2021: 553-567
skipping 26 more matches
loading more results
failed to load more results, please try again later
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-08-19 14:48 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