Остановите войну!
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 17 matches
- 2023
- Oswin Aichholzer, Matias Korman, Yoshio Okamoto, Irene Parada, Daniel Perz, André van Renssen, Birgit Vogtenhuber:
Graphs with large total angular resolution. Theor. Comput. Sci. 943: 73-88 (2023) - M. Anand, Kishan Bhushan Sahay, Mohammed Altaf Ahmed, Daniyar Sultan, Radha Raman Chandan, Bharat Singh:
Deep learning and natural language processing in computation for offensive language detection in online social networks by feature selection and ensemble classification techniques. Theor. Comput. Sci. 943: 203-218 (2023) - Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse, Nacim Oijid:
The Maker-Breaker Largest Connected Subgraph game. Theor. Comput. Sci. 943: 102-120 (2023) - Murphy Berzish, Joel D. Day, Vijay Ganesh, Mitja Kulczynski, Florin Manea, Federico Mora, Dirk Nowotka:
Towards more efficient methods for solving regular-expression heavy string constraints. Theor. Comput. Sci. 943: 50-72 (2023) - Guram Bezhanishvili, John Harding, Patrick J. Morandi:
Remarks on hyperspaces for Priestley spaces. Theor. Comput. Sci. 943: 187-202 (2023) - Toni Böhnlein, Oliver Schaudt, Joachim Schauer:
Stackelberg packing games. Theor. Comput. Sci. 943: 16-35 (2023) - Ali Çivril:
A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem. Theor. Comput. Sci. 943: 121-130 (2023) - Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa:
Reconfiguring (non-spanning) arborescences. Theor. Comput. Sci. 943: 131-141 (2023) - Nils Köpp, Helmut Schwichtenberg:
Lookahead analysis in exact real arithmetic with logical methods. Theor. Comput. Sci. 943: 171-186 (2023) - Takkolu Sree Lakshmi, Muthukumarasamy Govindarajan, Asadi Sreenivasulu:
Malware visual resemblance analysis with minimum losses using Siamese neural networks. Theor. Comput. Sci. 943: 219-229 (2023) - V. L. Padma Latha, N. Sudhakar Reddy, A. Suresh Babu:
Optimizing Scalability and Availability of Cloud Based Software Services Using Modified Scale Rate Limiting Algorithm. Theor. Comput. Sci. 943: 230-240 (2023) - Depeng Liu, Bow-Yaw Wang, Chen Fu, Lijun Zhang:
Model checking differentially private properties. Theor. Comput. Sci. 943: 153-170 (2023) - Saadia Nemmaoui, Mohamed Baslam, Belaid Bouikhalene:
Game theory analysis of biometric systems market: Users choice VS service providers revenue. Theor. Comput. Sci. 943: 142-152 (2023) - B. S. Panda, Juhi Chaudhary:
Acyclic matching in some subclasses of graphs. Theor. Comput. Sci. 943: 36-49 (2023) - Chao Qian, Dan-Xuan Liu, Chao Feng, Ke Tang:
Multi-objective evolutionary algorithms are generally good: Maximizing monotone submodular functions over sequences. Theor. Comput. Sci. 943: 241-266 (2023) - Liam Roditty, Roei Tov:
Approximate distance oracles with improved stretch for sparse graphs. Theor. Comput. Sci. 943: 89-101 (2023) - Shu-Li Zhao, Jou-Ming Chang:
Reliability assessment of the divide-and-swap cube in terms of generalized connectivity. Theor. Comput. Sci. 943: 1-15 (2023)
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-23 07:18 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