Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
12 | Gregory Lupton, Nicholas A. Scoville |
Digital fundamental groups and edge groups of clique complexes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Appl. Comput. Topol. ![In: J. Appl. Comput. Topol. 6(4), pp. 529-558, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Anita Liebenau, Rajko Nenadov |
The threshold bias of the clique-factor game. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 152, pp. 221-247, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Hong Liu 0010, Guanghui Wang 0002, Donglei Yang |
Clique immersion in graphs without a fixed bipartite graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 157, pp. 346-365, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Robert Brignall, Daniel Cocks |
Uncountably Many Minimal Hereditary Classes of Graphs of Unbounded Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 29(1), 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Tal Laor |
Twitter as a clique: journalists' patterns of Twitter use in Israel. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Online Inf. Rev. ![In: Online Inf. Rev. 46(1), pp. 40-58, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Sergiy Butenko, Mykyta Makovenko, Panos M. Pardalos |
A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Optim. ![In: SIAM J. Optim. 32(3), pp. 2102-2128, September 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Weiqi Fu, Pan Shao, Ting Dong, Zhewei Liu |
Novel Higher-Order Clique Conditional Random Field to Unsupervised Change Detection for Remote Sensing Images. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Remote. Sens. ![In: Remote. Sens. 14(15), pp. 3651, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Chi Hoi Yip |
On the clique number of Paley graphs of prime power order. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Finite Fields Their Appl. ![In: Finite Fields Their Appl. 77, pp. 101930, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Dóra Kardos, Patrik Patassy, Sándor Szabó, Bogdán Zaválnij |
Numerical experiments with LP formulations of the maximum clique problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Central Eur. J. Oper. Res. ![In: Central Eur. J. Oper. Res. 30(4), pp. 1353-1367, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Kenji Kanazawa |
FPGA Acceleration of Swap-Based Tabu Search for Solving Maximum Clique Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Inf. Process. ![In: J. Inf. Process. 30, pp. 513-524, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Fairouz Hussein, Subhieh El-Salhi, Rajaa Alazazma, Tasneem Abu-Hantash, Haneen Abu-Hantash, Heba Thaher |
An Android Application Using Machine Learning Algorithm for Clique Detection in Issues Related to Transportation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Interact. Mob. Technol. ![In: Int. J. Interact. Mob. Technol. 16(14), pp. 4-22, July 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Pingping Wu, Lizhen Wang 0001, Muquan Zou |
A maximal ordered ego-clique based approach for prevalent co-location pattern mining. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Sci. ![In: Inf. Sci. 608, pp. 630-654, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Rafael A. Melo, Celso C. Ribeiro, José A. Riveaux |
The minimum quasi-clique partitioning problem: Complexity, formulations, and a computational study. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Sci. ![In: Inf. Sci. 612, pp. 655-674, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Jing Bai 0011, Junfeng Zhou, Ming Du, Ziyang Chen |
Index-based top kα-maximal-clique enumeration over uncertain graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Supercomput. ![In: J. Supercomput. 78(17), pp. 19372-19400, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Kazuma Fuchimoto, Takatoshi Ishii, Maomi Ueno |
Hybrid Maximum Clique Algorithm Using Parallel Integer Programming for Uniform Test Assembly. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Learn. Technol. ![In: IEEE Trans. Learn. Technol. 15(2), pp. 252-264, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Shuliang Wang, Xiaorui Qin, Lianhua Chi |
HashWalk: An efficient node classification method based on clique-compressed graph embedding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Pattern Recognit. Lett. ![In: Pattern Recognit. Lett. 156, pp. 133-141, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Baiguo An, Guozhong Feng, Jianhua Guo 0005 |
Interaction Identification and Clique Screening for Classification with Ultra-high Dimensional Discrete Features. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Classif. ![In: J. Classif. 39(1), pp. 122-146, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Arpita Sanyal (Bhaduri), Amit Saha, Banani Saha, Amlan Chakrabarti |
Circuit design for clique problem and its implementation on quantum computer. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IET Quantum Commun. ![In: IET Quantum Commun. 3(1), pp. 30-49, March 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Shuli Li, Tao Tian |
Resistance Between Two Nodes of a Ring Clique Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Circuits Syst. Signal Process. ![In: Circuits Syst. Signal Process. 41(3), pp. 1287-1298, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Mathias Bourel, Eduardo Alberto Canale, Franco Robledo, Pablo Romero, Luis Stábile |
Complexity and heuristics for the weighted max cut-clique problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. Trans. Oper. Res. ![In: Int. Trans. Oper. Res. 29(2), pp. 908-928, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Mohammad Izadi, Hari Mohan Srivastava |
Fractional Clique Collocation Technique for Numerical Simulations of Fractional-Order Brusselator Chemical Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Axioms ![In: Axioms 11(11), pp. 654, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Qian Liu 0008, Zebin Wu 0001, Qian Du 0001, Yang Xu 0006, Zhihui Wei |
Multiscale Alternately Updated Clique Network for Hyperspectral Image Classification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Geosci. Remote. Sens. ![In: IEEE Trans. Geosci. Remote. Sens. 60, pp. 1-15, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Chuan-Min Lee |
Remarks on Parameterized Complexity of Variations of the Maximum-Clique Transversal Problem on Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Symmetry ![In: Symmetry 14(4), pp. 676, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Sándor Szabó, Bogdán Zaválnij |
Graph Coloring via Clique Search with Symmetry Breaking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Symmetry ![In: Symmetry 14(8), pp. 1574, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | J. Mark Keil, Debajyoti Mondal, Ehsan Moradi, Yakov Nekrich |
Finding a Maximum Clique in a Grounded 1-Bend String Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Algorithms Appl. ![In: J. Graph Algorithms Appl. 26(1), pp. 553-575, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Jinyu Dai, Zhengtian Wu, Hamid Reza Karimi, Baoping Jiang, Guangquan Lu |
An approximation lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Frankl. Inst. ![In: J. Frankl. Inst. 359(12), pp. 6080-6098, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Muyuan Lin, Varun Murali, Sertac Karaman |
A Planted Clique Perspective on Hypothesis Pruning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Robotics Autom. Lett. ![In: IEEE Robotics Autom. Lett. 7(2), pp. 5167-5174, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Yu-Kai Lin, Wen-Chieh Lin, Chieh-Chih Wang |
K-Closest Points and Maximum Clique Pruning for Efficient and Effective 3-D Laser Scan Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Robotics Autom. Lett. ![In: IEEE Robotics Autom. Lett. 7(2), pp. 1471-1477, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Chenglong Dai, Jia Wu 0001, Dechang Pi, Stefanie I. Becker, Lin Cui 0002, Qin Zhang 0011, Blake W. Johnson |
Brain EEG Time-Series Clustering Using Maximum-Weight Clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Cybern. ![In: IEEE Trans. Cybern. 52(1), pp. 357-371, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Zhi Lu, Yi Zhou 0016, Jin-Kao Hao |
A Hybrid Evolutionary Algorithm for the Clique Partitioning Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Cybern. ![In: IEEE Trans. Cybern. 52(9), pp. 9391-9403, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Sumit Kumar Gupta, Dhirendra Pratap Singh, Jaytrilok Choudhary |
A review of clique-based overlapping community detection algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Knowl. Inf. Syst. ![In: Knowl. Inf. Syst. 64(8), pp. 2023-2058, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Guillaume Ducoffe |
Maximum Matching in Almost Linear Time on Graphs of Bounded Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(11), pp. 3489-3520, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Tuukka Korhonen |
Finding Optimal Triangulations Parameterized by Edge Clique Cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(8), pp. 2242-2270, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Lars Jaffke, Paloma T. Lima, Geevarghese Philip |
Structural Parameterizations of Clique Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(2), pp. 273-303, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Guillaume Ducoffe |
Optimal Centrality Computations Within Bounded Clique-Width Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(11), pp. 3192-3222, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Sebastián Bustamante 0001, Daniel A. Quiroz, Maya Stein, José Zamora |
Clique immersions and independence number. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 106, pp. 103550, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Xiaoyu He, Jiaxi Nie, Sam Spiro |
Maximal independent sets in clique-free graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 106, pp. 103575, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Peter Frankl, Erica L. L. Liu, Jian Wang 0092 |
On the maximum number of edges in hypergraphs with fixed matching and clique number. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 106, pp. 103589, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Zhuo Yu, Xiaofeng Wang, Jian Zhao 0002 |
A local dense decision-making method for solving the maximum clique problem in large-scale undirected graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Electr. Eng. ![In: Comput. Electr. Eng. 102, pp. 108220, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Marco A. López Medina, J. Leonardo González-Ruiz, José Raymundo Marcial-Romero, José Antonio Hernández Servín |
Computing the Clique-Width on Series-Parallel Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computación y Sistemas ![In: Computación y Sistemas 26(2), 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
12 | Mehdi Kadivar, Neda Mohammadi |
A maximum clique based approximation algorithm for wireless link scheduling under SINR model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 129, pp. 72-89, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Mohammad Mehdi Daliri Khomami, Mohammad Reza Meybodi, Reyhaneh Ameri |
Cellular goore game with application to finding maximum clique in social networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Des. Eng. ![In: J. Comput. Des. Eng. 9(3), pp. 966-991, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Gary MacGillivray, Christina M. Mynhardt, Virgélot Virgile |
Eternal domination and clique covering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Graph Theory Appl. ![In: Electron. J. Graph Theory Appl. 10(2), pp. 603-624, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Douglas Frederico Guimarães Santiago, Anderson Luiz Pedrosa Porto, Kaio Ariel Silva Sá |
A generalization of a Turán's theorem about maximum clique on graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Graph Theory Appl. ![In: Electron. J. Graph Theory Appl. 10(2), pp. 475-483, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Shuchita Goyal, Samir Shukla, Anurag Singh 0003 |
Topology of clique complexes of line graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Art Discret. Appl. Math. ![In: Art Discret. Appl. Math. 5(2), 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Daniil Baldouski |
Product irregularity strength of graphs with small clique cover number. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Art Discret. Appl. Math. ![In: Art Discret. Appl. Math. 5(1), 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Supachoke Isariyapalakul, Witsarut Pho-on, Varanoot Khemmani |
Bounds on the connected local dimension of graphs in terms of the marked dimension and the clique number. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AKCE Int. J. Graphs Comb. ![In: AKCE Int. J. Graphs Comb. 19(2), pp. 95-101, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Michal Dory, Merav Parter |
Exponentially Faster Shortest Paths in the Congested Clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 69(4), pp. 29:1-29:42, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Jian Gao 0007, Yiqi Lv, Minghao Liu 0001, Shaowei Cai 0001, Feifei Ma |
Improving Simulated Annealing for Clique Partitioning Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Artif. Intell. Res. ![In: J. Artif. Intell. Res. 74, pp. 1485-1513, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Wanfang Chen, Changhong Lu, Long-Tu Yuan |
Extremal Graphs for Two Vertex-Disjoint Copies of a Clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 38(3), pp. 67, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Yu Du, Gary A. Kochenberger, Fred W. Glover, Haibo Wang 0001, Mark W. Lewis, Weihong Xie, Takeshi Tsuyuguchi |
Solving Clique Partitioning Problems: A Comparison of Models and Commercial Solvers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Inf. Technol. Decis. Mak. ![In: Int. J. Inf. Technol. Decis. Mak. 21(1), pp. 59-81, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Shengli Sun, Weiping Li, Yimo Wang, Weilong Liao, Philip S. Yu |
Continuous Monitoring of Maximum Clique Over Dynamic Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 34(4), pp. 1667-1683, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Kedong Yan, Hong Seo Ryoo |
Graph, clique and facet of boolean logical polytope. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Glob. Optim. ![In: J. Glob. Optim. 82(4), pp. 1015-1052, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Arpita Sanyal (Bhaduri), Amit Saha, Banani Saha, Amlan Chakrabarti |
Robust Quantum Circuit for Clique Problem with Intermediate Qudits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2211.07947, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Clément Dallard, Martin Milanic, Kenny Storgel |
Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2206.15092, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Soura Sena Das, Soumen Nandi, Sagnik Sen 0001 |
The oriented relative clique number of triangle-free planar graphs is 10. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2208.10188, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Rares-Darius Buhai, Pravesh K. Kothari, David Steurer |
Algorithms approaching the threshold for semi-random planted clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2212.05619, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Zi Chen, Long Yuan, Xuemin Lin 0001, Lu Qin 0001, Wenjie Zhang 0001 |
Balanced Clique Computation in Signed Networks: Concepts and Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2204.00515, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Sebastian Forster, Tijn de Vos |
The Laplacian Paradigm in the Broadcast Congested Clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2205.12059, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Zhirong Yuan, You Peng, Peng Cheng 0003, Li Han 0001, Xuemin Lin 0001, Lei Chen 0002, Wenjie Zhang 0001 |
Efficient k-clique Listing with Set Intersection Speedup [Technical Report]. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2203.13512, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Yimeng Min, Frederik Wenkel, Michael Perlmutter, Guy Wolf |
Can Hybrid Geometric Scattering Networks Help Solve the Maximal Clique Problem? ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2206.01506, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Narmina Baghirova, Carolina Lucía Gonzalez, David Schindl |
Locally checkable problems in bounded clique-width graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2203.02992, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Anisur Rahaman Molla, Manish Kumar, Sumathi Sivasubramaniam |
Fault-Tolerant Graph Realizations in the Congested Clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2208.10135, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Ahammed Ullah |
Computing Clique Cover with Structural Parameterization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2208.12438, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Venkatesan Guruswami, Pravesh K. Kothari, Peter Manohar |
Bypassing the XOR Trick: Stronger Certificates for Hypergraph Clique Number. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2205.06739, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Quanquan C. Liu |
A Note on Improved Results for One Round Distributed Clique Listing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2212.12843, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Xinrui Zhang, Qin Wang 0008, Rujia Li, Qi Wang 0012 |
Frontrunning Block Attack in PoA Clique: A Case Study. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2205.10257, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Mitre Costa Dourado, Rodolfo Alves de Oliveira, Vitor S. Ponciano, Alessandra B. Queiróz, Rômulo L. O. da Silva |
Expanded-clique graphs and the domination problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2208.03411, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov |
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2210.06845, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Ali Baran Tasdemir, Tuna Karacan, Emir Kaan Kirmaci, Lale Özkahya |
Learning Heuristics for the Maximum Clique Enumeration Problem Using Low Dimensional Representations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2210.16963, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Robert Brignall, Daniel Cocks |
A framework for minimal hereditary classes of graphs of unbounded clique-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2203.15446, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Yuto Watanabe, Kazunori Sakurama |
Accelerated Distributed Projected Gradient Descent for Convex Optimization with Clique-wise Coupled Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2211.06284, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Shivani Bathla, Vinita Vasudevan |
IBIA: Bayesian Inference via Incremental Build-Infer-Approximate operations on Clique Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2202.12003, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
12 | Sujoy Bhore, Fabian Klute, Jelle J. Oostveen |
On Streaming Algorithms for Geometric Independent Set and Clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2207.01108, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Felicia Lucke, Felix Mann |
Using Edge Contractions and Vertex Deletions to Reduce the Independence Number and the Clique Number. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2202.08574, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
12 | Peter Robinson 0002 |
What Can We Compute in a Single Round of the Congested Clique? ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2210.02638, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Mohammad Almasri, Yen-Hsiang Chang, Izzat El Hajj, Rakesh Nagi, Jinjun Xiong, Wen-mei W. Hwu |
Parallelizing Maximal Clique Enumeration on GPUs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2212.01473, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Dmitriy Kunisky, Xifan Yu |
A degree 4 sum-of-squares lower bound for the clique number of the Paley graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2211.02713, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Marina Moscarini |
A necessary condition for the equality of the clique number and the convexity number of a graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 314, pp. 191-196, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Annegret Katrin Wagler |
On the Lovász-Schrijver PSD-operator on graph classes defined by clique cutsets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 308, pp. 209-219, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Christoph Brause, Maximilian Geißer, Ingo Schiermeyer |
Homogeneous sets, clique-separators, critical graphs, and optimal χ-binding functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 320, pp. 211-222, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Grahame Erskine, Terry S. Griggs, Jozef Sirán |
Clique-partitioned graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 314, pp. 238-248, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Átila A. Jones, Fábio Protti, Renata R. Del-Vecchio |
Edge clique partition in (k, ℓ)-graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 306, pp. 89-97, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Mohammad Javad Naderi, Austin Buchanan, Jose L. Walteros |
Worst-case analysis of clique MIPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 195(1), pp. 517-551, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | K. Venkatakrishna Rao, Mahender Katukuri, Maheswari Jagarapu |
CIM: clique-based heuristic for finding influential nodes in multilayer networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Intell. ![In: Appl. Intell. 52(5), pp. 5173-5184, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Yanhao Yang, Pan Shi, Yuyi Wang 0001, Kun He 0001 |
Quadratic Optimization based Clique Expansion for overlapping community detection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Knowl. Based Syst. ![In: Knowl. Based Syst. 247, pp. 108760, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | János Barta, Roberto Montemanni |
The Maximum Clique Problem for Permutation Hamming Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Optim. Theory Appl. ![In: J. Optim. Theory Appl. 194(2), pp. 492-507, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Miyuki Koshimura, Emi Watanabe, Yuko Sakurai, Makoto Yokoo |
Concise integer linear programming formulation for clique partitioning problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Constraints An Int. J. ![In: Constraints An Int. J. 27(1-2), pp. 99-115, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Markus Baumeister, Anna M. Limbach |
Clique dynamics of locally cyclic graphs with δ ≥ 6. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 345(7), pp. 112873, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Gholamreza Abrishami, Michael A. Henning, Mostafa Tavakoli |
Local metric dimension for graphs with small clique numbers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 345(4), pp. 112763, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Zixiang Xu, Gennian Ge |
A note on multicolor Ramsey number of small odd cycles versus a large clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 345(6), pp. 112823, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | András Imolay, Anett Kocsis, Ádám Schweitzer |
Clique number of Xor products of Kneser graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 345(7), pp. 112886, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Sam Mattheus, Francesco Pavese |
A clique-free pseudorandom subgraph of the pseudo polarity graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 345(7), pp. 112871, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | René Thiemann |
Clique is not solvable by monotone circuits of polynomial size. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Formal Proofs ![In: Arch. Formal Proofs 2022, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
12 | Matija Bucic, Jacob Fox, Benny Sudakov |
Clique minors in graphs with a forbidden subgraph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Random Struct. Algorithms ![In: Random Struct. Algorithms 60(3), pp. 327-338, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Srinibas Swain, Deepak Puthal, Elisa Bertino |
CryptoCliqIn: Graph-Theoretic Cryptography Using Clique Injection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Intell. Syst. ![In: IEEE Intell. Syst. 37(5), pp. 59-65, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Yehor Blokhin, Sergiy Butenko, Petar Momcilovic, Oleg A. Prokopyev |
On maximum ratio clique relaxations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Networks ![In: Networks 80(4), pp. 440-465, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Meng Han, Dongjing Miao, Jinbao Wang, Liyuan Liu |
A balm: defend the clique-based attack from a fundamental aspect. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 44(3), pp. 1637-1658, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Nicolas Grelier |
Computing a maximum clique in geometric superclasses of disk graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 44(4), pp. 3106-3135, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Zhonghui Mei, Xiaoyan Zhou |
Maximum Decoding Clique Based Maximum Weight Vertex Search Algorithm for Buffered Instantly Decodable Network Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Commun. Lett. ![In: IEEE Commun. Lett. 26(2), pp. 229-233, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|