Остановите войну!
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 66 matches
- 2024
- Maria Axenovich, Domagoj Bradac, Lior Gishboliner, Dhruv Mubayi, Lea Weber:
Large cliques or cocliques in hypergraphs with forbidden order-size pairs. Comb. Probab. Comput. 33(3): 286-299 (2024) - Jérémie Dusart, Michel Habib, Derek G. Corneil:
Maximal Cliques Lattices Structures for Cocomparability Graphs with Algorithmic Applications. Order 41(1): 99-133 (2024) - 2023
- Leilei Zhang:
The maximum number of cliques in graphs with prescribed order, circumference and minimum degree. Eur. J. Comb. 112: 103728 (2023) - Sergey Goryainov, Leonid Shalaginov, Chi Hoi Yip:
On eigenfunctions and maximal cliques of generalised Paley graphs of square order. Finite Fields Their Appl. 87: 102150 (2023) - Maojun Cao, Yingda Hu, Lizhu Yue:
Research on variable weight CLIQUE clustering algorithm based on partial order set. J. Intell. Fuzzy Syst. 44(6): 9461-9473 (2023) - Yoshiro Kitamura, Yuanzhong Li, Wataru Ito, Hiroshi Ishikawa:
Data-Dependent Higher-Order Clique Selection for Artery-Vein Segmentation by Energy Minimization. CoRR abs/2312.07860 (2023) - 2022
- Mohammad Izadi, Hari Mohan Srivastava:
Fractional Clique Collocation Technique for Numerical Simulations of Fractional-Order Brusselator Chemical Model. Axioms 11(11): 654 (2022) - Sergey Goryainov, Alexander Masley, Leonid Shalaginov:
On a correspondence between maximal cliques in Paley graphs of square order. Discret. Math. 345(6): 112853 (2022) - Chi Hoi Yip:
On the clique number of Paley graphs of prime power order. Finite Fields Their Appl. 77: 101930 (2022) - Pingping Wu, Lizhen Wang, Muquan Zou:
A maximal ordered ego-clique based approach for prevalent co-location pattern mining. Inf. Sci. 608: 630-654 (2022) - Weiqi Fu, Pan Shao, Ting Dong, Zhewei Liu:
Novel Higher-Order Clique Conditional Random Field to Unsupervised Change Detection for Remote Sensing Images. Remote. Sens. 14(15): 3651 (2022) - 2021
- Mathew C. Francis, Rian Neogi, Venkatesh Raman:
Recognizing k-Clique Extendible Orderings. Algorithmica 83(11): 3338-3362 (2021) - Gary R. W. Greaves, Jack H. Koolen, Jongyook Park:
Augmenting the Delsarte bound: A forbidden interval for the order of maximal cliques in strongly regular graphs. Eur. J. Comb. 97: 103384 (2021) - Sören Berger, Simón Piga, Christian Reiher, Vojtech Rödl, Mathias Schacht:
Turán density of cliques of order five in 3-uniform hypergraphs with quasirandom links. LAGOS 2021: 412-418 - Ali Baran Tasdemir, Lale Özkahya:
Learning Heuristics for the Maximum Clique Enumeration Problem Using Higher-Order Graph Structures. SIU 2021: 1-4 - 2020
- Peizhong Yang, Lizhen Wang, Xiaoxuan Wang:
A MapReduce approach for spatial co-location pattern mining via ordered-clique-growth. Distributed Parallel Databases 38(2): 531-560 (2020) - Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma:
Clique-width and well-quasi-ordering of triangle-free graph classes. J. Comput. Syst. Sci. 108: 64-91 (2020) - Ronghua Li, Sen Gao, Lu Qin, Guoren Wang, Weihua Yang, Jeffrey Xu Yu:
Ordering Heuristics for k-clique Listing. Proc. VLDB Endow. 13(11): 2536-2548 (2020) - Mathew C. Francis, Rian Neogi, Venkatesh Raman:
Recognizing k-Clique Extendible Orderings. WG 2020: 274-285 - Huda Nassar, Caitlin Kennedy, Shweta Jain, Austin R. Benson, David F. Gleich:
Using Cliques with Higher-order Spectral Embeddings Improves Graph Visualizations. WWW 2020: 2927-2933 - Mathew C. Francis, Rian Neogi, Venkatesh Raman:
Recognizing k-Clique Extendible Orderings. CoRR abs/2007.06060 (2020) - 2019
- János Pach, István Tomon:
Ordered graphs and large bi-cliques in intersection graphs of curves. Eur. J. Comb. 82 (2019) - 2018
- Sergey Goryainov, Vladislav V. Kabanov, Leonid Shalaginov, Alexandr Valyuzhenich:
On eigenfunctions and maximal cliques of Paley graphs of square order. Finite Fields Their Appl. 52: 361-369 (2018) - Vadim V. Lozin, Igor Razgon, Viktor Zamaraev:
Well-quasi-ordering versus clique-width. J. Comb. Theory, Ser. B 130: 1-18 (2018) - Pingge Chen, Yuejian Peng:
Connection Between Polynomial Optimization and Maximum Cliques of Non-Uniform Hypergraphs. Order 35(2): 301-319 (2018) - Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma:
Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes. Order 35(2): 253-274 (2018) - Ishant Shanu, Chetan Arora, S. N. Maheshwari:
Inference in Higher Order MRF-MAP Problems With Small and Large Cliques. CVPR 2018: 7883-7891 - Peizhong Yang, Lizhen Wang, Xiaoxuan Wang:
A Parallel Spatial Co-location Pattern Mining Approach Based on Ordered Clique Growth. DASFAA (1) 2018: 734-742 - 2017
- Pablo San Segundo, Alvaro Lopez, Mikhail Batsyn, Alexey Nikolaev, Panos M. Pardalos:
Erratum to: Improved initial vertex ordering for exact maximum clique search. Appl. Intell. 46(1): 240 (2017) - Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma:
Clique-Width and Well-Quasi-Ordering of Triangle-Free Graph Classes. WG 2017: 220-233
skipping 36 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-05-10 15:55 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