Остановите войну!
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 11 matches
- 2022
- János Barta, Roberto Montemanni:
The Maximum Clique Problem for Permutation Hamming Graphs. J. Optim. Theory Appl. 194(2): 492-507 (2022) - 2020
- Sreenanda Raut, Madhumangal Pal:
Generation of maximal fuzzy cliques of fuzzy permutation graph and applications. Artif. Intell. Rev. 53(3): 1585-1614 (2020) - 2015
- Aistis Atminas, Robert Brignall, Nicholas Korpelainen, Vadim V. Lozin, Vincent Vatter:
Well-Quasi-Order for Permutation Graphs Omitting a Path and a Clique. Electron. J. Comb. 22(2): 2 (2015) - 2013
- Valentina Cacchiani, Alberto Caprara, Paolo Toth:
Finding cliques of maximum weight on a generalization of permutation graphs. Optim. Lett. 7(2): 289-296 (2013) - 2006
- Alexandre Tiskin:
Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs. CPM 2006: 270-281 - 2003
- Andreas Brandstädt, Vadim V. Lozin:
On the linear structure and clique-width of bipartite permutation graphs. Ars Comb. 67 (2003) - J. Adrian Bondy, Guillermo Durán, Min Chih Lin, Jayme Luiz Szwarcfiter:
Self-clique graphs and matrix permutations. J. Graph Theory 44(3): 178-192 (2003) - 2000
- Shouichi Matsui, Ken-ichi Tokoro:
A New Genetic Algorithm for Minimum Span Frequency Assignment using Permutation and Clique. GECCO 2000: 682-689 - 1992
- Maw-Shang Chang, Fu-Hsing Wang:
Efficient Algorithms for the Maximum Weight Clique and Maximum Weight Independent Set Problems on Permutation Graphs. Inf. Process. Lett. 43(6): 293-295 (1992) - 1991
- Aravind Srinivasan, C. Pandu Rangan:
Efficient Algorithms for the Minimum Weighted Dominating Clique Problem on Permutation Graphs. Theor. Comput. Sci. 91(1): 1-21 (1991) - 1983
- Pasquale Quattrocchi:
A Class of Maximal Permutation Cliques. Eur. J. Comb. 4(4): 367-369 (1983)
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-04-20 02:08 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