Остановите войну!
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 30 matches
- 2024
- Weili Wu, Guangmo Tong:
Computing and Combinatorics - 29th International Conference, COCOON 2023, Hawaii, HI, USA, December 15-17, 2023, Proceedings, Part I. Lecture Notes in Computer Science 14422, Springer 2024, ISBN 978-3-031-49189-4 [contents] - 2023
- Yuichi Asahiro, Jesper Jansson, Avraham A. Melkman, Eiji Miyano, Hirotaka Ono, Quan Xue, Shay Zakov:
Shortest Longest-Path Graph Orientations. COCOON (1) 2023: 141-154 - Lora Bailey, Heather C. Smith Blake, Garner Cochran, Nathan Fox, Michael Levet, Reem Mahmoud, Elizabeth Bailey Matson, Inne Singgih, Grace Stadnyk, Xinyi Wang, Alexander Wiedemann:
Complexity and Enumeration in Models of Genome Rearrangement. COCOON (1) 2023: 3-14 - Sergey Bereg, Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni, Binhai Zhu:
Red-Black Spanners for Mixed-Charging Vehicular Networks. COCOON (1) 2023: 220-231 - Nader H. Bshouty, Catherine A. Haddad-Zaknoon:
On Detecting Some Defective Items in Group Testing. COCOON (1) 2023: 244-271 - Elisabet Burjons, Fabian Frei, Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith:
Delaying Decisions and Reservation Costs. COCOON (1) 2023: 371-383 - Shuzhen Chen, Yuan Yuan, Youming Tao, Zhipeng Cai, Dongxiao Yu:
Resource-Adaptive Newton's Method for Distributed Learning. COCOON (1) 2023: 335-346 - Xinyu Fu, Yitong Yin, Chaodong Zheng:
Self-stabilizing $(\varDelta +1)$-Coloring in Sublinear (in $\varDelta $) Rounds via Locally-Iterative Algorithms. COCOON (1) 2023: 232-243 - Joachim Gudmundsson, Zijin Huang, Sampson Wong:
Approximating the λ-low-density Value. COCOON (1) 2023: 71-82 - Kyosuke Hatsugai, Kyoichi Asano, Yoshiki Abe:
A Physical Zero-Knowledge Proof for Sumplete, a Puzzle Generated by ChatGPT. COCOON (1) 2023: 398-410 - Marc Hellmuth, Guillaume E. Scholz:
Linear Time Algorithms for NP-Hard Problems Restricted to GaTEx Graphs. COCOON (1) 2023: 115-126 - Yuya Higashikawa, Ayano Nishii, Junichi Teruyama, Yuki Tokuni:
Sink Location Problems in Dynamic Flow Grid Networks. COCOON (1) 2023: 155-167 - Bjørn Kjos-Hanssen:
Conditional Automatic Complexity and Its Metrics. COCOON (1) 2023: 15-28 - M. Oguzhan Külekci:
Randomized Data Partitioning with Efficient Search, Retrieval and Privacy-Preservation. COCOON (1) 2023: 310-323 - Kota Kumakura, Akira Suzuki, Yuma Tamura, Xiao Zhou:
On the Routing Problems in Graphs with Ordered Forbidden Transitions. COCOON (1) 2023: 359-370 - Yanfei Li, Min Li, Qian Liu, Yang Zhou:
DR-Submodular Function Maximization with Adaptive Stepsize. COCOON (1) 2023: 347-358 - Yifei Li, Hao Ye, Ruixi Huang, Hejiao Huang, Hongwei Du:
Multi-Load Agent Path Finding for Online Pickup and Delivery Problem. COCOON (1) 2023: 285-296 - Xin Li, Yu Zheng:
Streaming and Query Once Space Complexity of Longest Increasing Subsequence. COCOON (1) 2023: 29-60 - Peng Li, Xingli Zhou, Zhiang Zhou:
The k Edge-Vertex Domination Problem. COCOON (1) 2023: 324-334 - Ying Liu:
Exponential Time Complexity of the Complex Weighted Boolean #CSP. COCOON (1) 2023: 83-96 - Weidong Luo:
Polynomial Turing Compressions for Some Graph Problems Parameterized by Modular-Width. COCOON (1) 2023: 127-140 - Xing Lyu, Travis Gagie, Meng He, Yakov Nekrich, Norbert Zeh:
Sum-of-Local-Effects Data Structures for Separable Graphs. COCOON (1) 2023: 195-206 - Bohan Lyu, Jianzhong Li:
An Efficient Data Analysis Method for Big Data Using Multiple-Model Linear Regression. COCOON (1) 2023: 272-284 - Shin-Ichi Nakano:
Variants of Euclidean k-Center Clusterings. COCOON (1) 2023: 209-219 - Banu Baklan Sen, Öznur Yasar Diner, Thomas Erlebach:
List 3-Coloring on Comb-Convex and Caterpillar-Convex Bipartite Graphs. COCOON (1) 2023: 168-181 - Eli Stafford, Chunjiang Zhu:
Improved Sourcewise Roundtrip Spanners with Constant Stretch. COCOON (1) 2023: 297-309 - Kangyi Tian, Mingyu Xiao, Boting Yang:
Parameterized Algorithms for Cluster Vertex Deletion on Degree-4 Graphs and General Graphs. COCOON (1) 2023: 182-194 - Meng-Shiou Tsai, Sun-Yuan Hsieh, Ling-Ju Hung:
Hardness and Approximation for the Star β-Hub Routing Cost Problem in $\varDelta _\beta $-Metric Graphs. COCOON (1) 2023: 97-111 - Di Wu, Jinhui Xu, Jianxin Wang:
A PTAS Framework for Clustering Problems in Doubling Metrics. COCOON (1) 2023: 384-397 - Jing Yuan, Shaojie Tang:
Approximating Decision Trees with Priority Hypotheses. COCOON (1) 2023: 61-70
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-06-04 07:28 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