![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.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 11 matches
- 2024
- Juhi Chaudhary, Sounaka Mishra, B. S. Panda:
On the complexity of minimum maximal acyclic matchings. J. Comb. Optim. 48(1): 10 (2024) - Shengminjie Chen, Donglei Du, Wenguo Yang, Suixiang Gao:
Maximizing stochastic set function under a matroid constraint from decomposition. J. Comb. Optim. 48(1): 3 (2024) - Parikshit Das, Kinkar Chandra Das, Sourav Mondal, Anita Pal:
First zagreb spectral radius of unicyclic graphs and trees. J. Comb. Optim. 48(1): 5 (2024) - Marc Demange, Marcel Adonis Haddad, Cécile Murat:
Approximating the probabilistic p-Center problem under pressure. J. Comb. Optim. 48(1): 9 (2024) - Fatemeh Ehsani, Monireh Hosseini:
Customer churn prediction using a novel meta-classifier: an investigation on transaction, Telecommunication and customer churn datasets. J. Comb. Optim. 48(1): 7 (2024) - Renzo Gómez, Flávio Keidi Miyazawa, Yoshiko Wakabayashi:
Polynomial algorithms for sparse spanners on subcubic graphs. J. Comb. Optim. 48(1): 11 (2024) - Takumi Gomyou
, Toshimasa Kobayashi, Takefumi Kondo, Shin Nayatani:
Embedding and the first Laplace eigenvalue of a finite graph. J. Comb. Optim. 48(1): 1 (2024) - Jin'an He, Fangping Peng, Xiuying Xie:
Risk-adjusted exponential gradient strategies for online portfolio selection. J. Comb. Optim. 48(1): 2 (2024) - Koji M. Kobayashi, Ying Li:
An improved upper bound for the online graph exploration problem on unicyclic graphs. J. Comb. Optim. 48(1): 4 (2024) - Mateus Martin, Horacio Hideki Yanasse, Maristela Oliveira Santos, Reinaldo Morabito:
Models for two-dimensional bin packing problems with customer order spread. J. Comb. Optim. 48(1): 8 (2024) - Qi-Xia Yang, Long-Cheng Liu, Min Huang, Tian-Run Wang:
Algorithms for a two-machine no-wait flow shop scheduling problem with two competing agents. J. Comb. Optim. 48(1): 6 (2024)
loading more results
failed to load more results, please try again later
![](https://dblp.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-08-16 02:27 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