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 52 matches
- 2022
- S. K. M. Anoop, Jayalal Sarma:
Rotation Distance for Rank Bounded Trees. COCOON 2022: 529-536 - Robert D. Barish, Tetsuo Shibuya:
Proper Colorability of Segment Intersection Graphs. COCOON 2022: 573-584 - Daniel Chicayban Bastos, Luis Antonio Brasil Kowada:
A Quantum Version of Pollard's Rho of Which Shor's Algorithm is a Particular Case. COCOON 2022: 212-219 - Ivan Bliznets, Anton Bukov, Danil Sagunov:
Fair Division with Minimal Withheld Information in Social Networks. COCOON 2022: 126-137 - Ivan Bliznets, Danil Sagunov:
Two Generalizations of Proper Coloring: Hardness and Approximability. COCOON 2022: 82-93 - Johannes Blum, Sabine Storandt:
Customizable Hub Labeling: Properties and Algorithms. COCOON 2022: 345-356 - Anthony Bonato, Ryan Cushman, Trent G. Marbach, Zhiyuan Zhang:
An Evolving Network Model from Clique Extension. COCOON 2022: 432-443 - Milutin Brankovic, Martin P. Seybold:
Optimal Window Queries on Line Segments Using the Trapezoidal Search DAG. COCOON 2022: 521-528 - Jin-Yi Cai, Ashwin Maran:
Counting Cycles on Planar Graphs in Subexponential Time. COCOON 2022: 268-279 - T.-H. Hubert Chan, Silvio Lattanzi, Mauro Sozio, Bo Wang:
Fully Dynamic k-Center Clustering with Outliers. COCOON 2022: 150-161 - Hau Chan, Minming Li, Chenhao Wang, Yingchao Zhao:
Facility Location Games with Ordinal Preferences. COCOON 2022: 138-149 - Hong Chang, Zhicheng Liu, Donglei Du, Xiaoyan Zhang:
Two-Stage BP Maximization Under p-matroid Constraint. COCOON 2022: 452-462 - Juhi Chaudhary, Sounaka Mishra, B. S. Panda:
On the Complexity of Minimum Maximal Acyclic Matchings. COCOON 2022: 106-117 - Jianer Chen, Zirui Chu, Ying Guo, Wei Yang:
Space Limited Graph Algorithms on Big Data. COCOON 2022: 255-267 - Rajni Dabas, Neelima Gupta:
Capacitated Facility Location with Outliers/Penalties. COCOON 2022: 549-560 - Minati De, Satyam Singh:
Hitting Geometric Objects Online via Points in $\mathbb {Z}d$. COCOON 2022: 537-548 - Junkai Feng, Ruiqi Yang, Haibin Zhang, Zhenning Zhang:
Online Non-monotone DR-Submodular Maximization: 1/4 Approximation Ratio and Sublinear Regret. COCOON 2022: 118-125 - Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Martin S. Krejca, Marcus Pappik:
Algorithms for Hard-Constraint Point Processes via Discretization. COCOON 2022: 242-254 - Tianpeng Gao, Jianzhong Li:
Analysis of Approximate Sorting in I/O Model. COCOON 2022: 70-81 - Barun Gorain, Kaushik Mondal, Supantha Pandit:
Distributed Dominating Sets in Interval Graphs. COCOON 2022: 508-520 - Koki Hamada, Shuichi Miyazaki:
Refined Computational Complexities of Hospitals/Residents Problem with Regional Caps. COCOON 2022: 333-344 - Jing Huang, Ying Ying Ye:
Semi-strict Chordal Digraphs. COCOON 2022: 280-291 - Liting Huang, Wei Yu, Zhaohui Liu:
Approximation Algorithms for the Min-Max Mixed Rural Postmen Cover Problem and Its Variants. COCOON 2022: 36-48 - Toshimasa Ishii, Jun Kawahara, Kazuhisa Makino, Hirotaka Ono:
Reallocation Problems with Minimum Completion Time. COCOON 2022: 292-304 - Hongyi Jiang, Samitha Samaranayake:
Approximation Algorithms for Capacitated Assignment with Budget Constraints and Applications in Transportation Systems. COCOON 2022: 94-105 - Vahideh Keikha:
Large k-Gons in a 1.5D Terrain. COCOON 2022: 49-60 - Kento Kimura, Kazuyuki Amano, Shin-Ichi Nakano:
Escape from the Room. COCOON 2022: 232-241 - Xiangyan Kong, Zhen Zhang:
Approximation Schemes for k-Facility Location. COCOON 2022: 488-495 - Keenan Lee, André van Renssen:
Generalized Sweeping Line Spanners. COCOON 2022: 406-418 - Fei Li:
An O(n3)-Time Algorithm for the Min-Gap Unit-Length Job Scheduling Problem. COCOON 2022: 476-487
skipping 22 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-09-28 00:32 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