|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 794 occurrences of 503 keywords
|
|
|
Results
Found 3106 publication records. Showing 3106 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
12 | Irena Penev |
On the structure and clique-width of ( 4 K 1 , C 4 , C 6 , C 7 ) -free graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 99(3), pp. 435-460, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | A. Arciprete, Vincenza Carchiolo, D. Chiavetta, Marco Grassia, Michele Malgeri, Giuseppe Mangioni |
Geometric Deep Learning Graph Pruning to Speed-Up the Run-Time of Maximum Clique Enumerarion Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COMPLEX NETWORKS (1) ![In: Complex Networks and Their Applications XI - Proceedings of The Eleventh International Conference on Complex Networks and Their Applications: COMPLEX NETWORKS 2022, Palermo, Italy, 8-10 November, 2022, Volume 1, pp. 415-425, 2022, Springer, 978-3-031-21126-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Narmina Baghirova, Carolina Lucía Gonzalez, Bernard Ries, David Schindl |
Locally Checkable Problems Parameterized by Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 33rd International Symposium on Algorithms and Computation, ISAAC 2022, December 19-21, 2022, Seoul, Korea., pp. 31:1-31:20, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-258-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Kazuho Kanahara, Shun Ito, Kengo Katayama |
The Performance of a Local Search based on Vertex Coloring for the Maximum Clique Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCCM ![In: Proceedings of the 10th International Conference on Computer and Communications Management, ICCCM 2022, Okayama, Japan, July 29-31, 2022, pp. 79-83, 2022, ACM, 978-1-4503-9634-9. 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) |
ICBC ![In: IEEE International Conference on Blockchain and Cryptocurrency, ICBC 2022, Shanghai, China, May 2-5, 2022, pp. 1-3, 2022, IEEE, 978-1-6654-9538-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Antares Chen, Jonathan Shi, Luca Trevisan |
Cut Sparsification of the Clique Beyond the Ramanujan Bound: A Separation of Cut Versus Spectral Sparsification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022, pp. 3693-3731, 2022, SIAM, 978-1-61197-707-3. 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-\text{clique}$ Listing with Set Intersection Speedup. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: 38th IEEE International Conference on Data Engineering, ICDE 2022, Kuala Lumpur, Malaysia, May 9-12, 2022, pp. 1955-1968, 2022, IEEE, 978-1-6654-0883-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Minjia Pan, Rong-Hua Li, Qi Zhang 0010, Yongheng Dai, Qun Tian, Guoren Wang |
Fairness-aware Maximal Clique Enumeration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: 38th IEEE International Conference on Data Engineering, ICDE 2022, Kuala Lumpur, Malaysia, May 9-12, 2022, pp. 259-271, 2022, IEEE, 978-1-6654-0883-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Chen Chen 0017, Yanping Wu, Renjie Sun, Xiaoyang Wang 0002 |
Maximum Signed $\theta$-Clique Identification in Large Signed Graphs (Extended abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: 38th IEEE International Conference on Data Engineering, ICDE 2022, Kuala Lumpur, Malaysia, May 9-12, 2022, pp. 1493-1494, 2022, IEEE, 978-1-6654-0883-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Guimu Guo, Da Yan 0001, Lyuheng Yuan, Jalal Khalil, Cheng Long, Zhe Jiang 0001, Yang Zhou 0001 |
Maximal Directed Quasi -Clique Mining. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: 38th IEEE International Conference on Data Engineering, ICDE 2022, Kuala Lumpur, Malaysia, May 9-12, 2022, pp. 1900-1913, 2022, IEEE, 978-1-6654-0883-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Xiaowei Ye, Rong-Hua Li, Qiangqiang Dai, Hongzhi Chen, Guoren Wang |
Lightning Fast and Space Efficient k-clique Counting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WWW ![In: WWW '22: The ACM Web Conference 2022, Virtual Event, Lyon, France, April 25 - 29, 2022, pp. 1191-1202, 2022, ACM, 978-1-4503-9096-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Antoine Castillon, Julien Baste, Hamida Seba, Mohammed Haddad 0001 |
Quasi-Clique Mining for Graph Summarization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DEXA (2) ![In: Database and Expert Systems Applications - 33rd International Conference, DEXA 2022, Vienna, Austria, August 22-24, 2022, Proceedings, Part II, pp. 310-315, 2022, Springer, 978-3-031-12425-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Bingkai Lin, Xuandi Ren, Yican Sun, Xiuhan Wang |
On Lower Bounds of Approximating Parameterized k-Clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, July 4-8, 2022, Paris, France., pp. 90:1-90:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-235-8. 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) |
ICALP ![In: 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, July 4-8, 2022, Paris, France., pp. 66:1-66:20, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-235-8. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Connor Beck, Anja Kunze, Dominique Zosso |
Archetypal Analysis for neuronal clique detection in low-rate calcium fluorescence imaging. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EMBC ![In: 44th Annual International Conference of the IEEE Engineering in Medicine & Biology Society, EMBC 2022, Glasgow, Scotland, United Kingdom, July 11-15, 2022, pp. 162-166, 2022, IEEE, 978-1-7281-2782-8. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Qiangqiang Dai, Rong-Hua Li, Meihao Liao, Hongzhi Chen, Guoren Wang |
Fast Maximal Clique Enumeration on Uncertain Graphs: A Pivot-based Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: SIGMOD '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12 - 17, 2022, pp. 2034-2047, 2022, ACM, 978-1-4503-9249-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | John Augustine, Anisur Rahaman Molla, Gopal Pandurangan, Yadu Vasudev |
Byzantine Connectivity Testing in the Congested Clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: 36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA., pp. 7:1-7:21, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-255-6. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Jian Gao 0007, Zhenghang Xu, Ruizhi Li, Minghao Yin |
An Exact Algorithm with New Upper Bounds for the Maximum k-Defective Clique Problem in Massive Sparse Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAAI ![In: Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, Thirty-Fourth Conference on Innovative Applications of Artificial Intelligence, IAAI 2022, The Twelveth Symposium on Educational Advances in Artificial Intelligence, EAAI 2022 Virtual Event, February 22 - March 1, 2022, pp. 10174-10183, 2022, AAAI Press, 978-1-57735-876-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Jun Wu 0020, Minghao Yin |
A Hybrid Evolutionary Algorithm for the Diversified Top-k Weight Clique Search Problem (Student Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAAI ![In: Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, Thirty-Fourth Conference on Innovative Applications of Artificial Intelligence, IAAI 2022, The Twelveth Symposium on Educational Advances in Artificial Intelligence, EAAI 2022 Virtual Event, February 22 - March 1, 2022, pp. 13083-13084, 2022, AAAI Press, 978-1-57735-876-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Manish Kumar, Anisur Rahaman Molla, Sumathi Sivasubramaniam |
Fault-Tolerant Graph Realizations in the Congested Clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALGOSENSORS ![In: Algorithmics of Wireless Networks - 18th International Symposium on Algorithmics of Wireless Networks, ALGOSENSORS 2022, Potsdam, Germany, September 8-9, 2022, Proceedings, pp. 108-122, 2022, Springer, 978-3-031-22049-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Mohammad Almasri, Izzat El Hajj, Rakesh Nagi, Jinjun Xiong, Wen-Mei Hwu |
Parallel K-clique counting on GPUs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICS ![In: ICS '22: 2022 International Conference on Supercomputing, Virtual Event, June 28 - 30, 2022, pp. 21:1-21:14, 2022, ACM, 978-1-4503-9281-5. 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) |
CSoNet ![In: Computational Data and Social Networks - 11th International Conference, CSoNet 2022, Virtual Event, December 5-7, 2022, Proceedings, pp. 236-244, 2022, Springer, 978-3-031-26302-6. 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) |
PODC ![In: PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022, pp. 335-344, 2022, ACM, 978-1-4503-9262-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Shiri Chechik, Tianyi Zhang 0008 |
Constant-Round Near-Optimal Spanners in Congested Clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022, pp. 325-334, 2022, ACM, 978-1-4503-9262-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI 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) |
WAOA ![In: Approximation and Online Algorithms - 20th International Workshop, WAOA 2022, Potsdam, Germany, September 8-9, 2022, Proceedings, pp. 211-224, 2022, Springer, 978-3-031-18366-9. 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) |
IWOCA ![In: Combinatorial Algorithms - 33rd International Workshop, IWOCA 2022, Trier, Germany, June 7-9, 2022, Proceedings, pp. 412-424, 2022, Springer, 978-3-031-06677-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Soumen Nandi, Sagnik Sen 0001, S. Taruni |
On Relative Clique Number of Triangle-Free Planar Colored Mixed Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWOCA ![In: Combinatorial Algorithms - 33rd International Workshop, IWOCA 2022, Trier, Germany, June 7-9, 2022, Proceedings, pp. 439-450, 2022, Springer, 978-3-031-06677-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Ziliang Zhang, Yunxiang Ge, Weibei Dou |
Clique Network-Based Statistics for Detecting Altered Topological Structures in the Brain Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIBM ![In: IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2022, Las Vegas, NV, USA, December 6-8, 2022, pp. 1966-1973, 2022, IEEE, 978-1-6654-6819-0. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Darren Strash, Louise Thompson |
Effective Data Reduction for the Vertex Clique Cover Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2022, Alexandria, VA, USA, January 9-10, 2022, pp. 41-53, 2022, SIAM, 978-1-61197-704-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Takuya Noguchi, Akihiro Fujiwara |
An asynchronous P system for solving the maximum clique problem with the Bron-Kerbosch algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CANDARW ![In: 2022 Tenth International Symposium on Computing and Networking, CANDAR 2022 - Workshops, Himeji, Japan, November 21-24, 2022, pp. 199-205, 2022, IEEE, 978-1-6654-7532-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Kei Ikebe, Kouichi Sakurai |
Analysis of Variance of Searching Time for Serial Concatenation of Graph-Clique based Cryptocurrency Mining. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CANDARW ![In: 2022 Tenth International Symposium on Computing and Networking, CANDAR 2022 - Workshops, Himeji, Japan, November 21-24, 2022, pp. 380-383, 2022, IEEE, 978-1-6654-7532-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Alexander Belyi, Stanislav Sobolevsky |
Network Size Reduction Preserving Optimal Modularity and Clique Partition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (1) ![In: Computational Science and Its Applications - ICCSA 2022 - 22nd International Conference, Malaga, Spain, July 4-7, 2022, Proceedings, Part I, pp. 19-33, 2022, Springer, 978-3-031-10521-0. 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 Maximum Clique Problem? ![Search on Bibsonomy](Pics/bibsonomy.png) |
NeurIPS ![In: Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, NeurIPS 2022, New Orleans, LA, USA, November 28 - December 9, 2022., 2022, 9781713871088. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
12 | Charly Alizadeh, Pegah Alizadeh, Miguel F. Anjos, Lucas Létocart, Emiliano Traversi |
How to Learn the Optimal Clique Decompositions in Solving Semidefinite Relaxations for OPF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCNN ![In: International Joint Conference on Neural Networks, IJCNN 2022, Padua, Italy, July 18-23, 2022, pp. 1-8, 2022, IEEE, 978-1-7281-8671-9. 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) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference)., pp. 42:1-42:7, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-249-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Anuj Dawar, Abhisekh Sankaran |
MSO Undecidability for Hereditary Classes of Unbounded Clique Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: 30th EACSL Annual Conference on Computer Science Logic, CSL 2022, February 14-19, 2022, Göttingen, Germany (Virtual Conference)., pp. 17:1-17:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-218-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Kazuho Kanahara, Tetsuya Oda, Elis Kulla, Akira Uejima, Kengo Katayama |
An Efficient Local Search for the Maximum Clique Problem on Massive Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EIDWT ![In: Advances in Internet, Data & Web Technologies - The 10th International Conference on Emerging Internet, Data and Web Technologies, EIDWT 2022, Okayama, Japan, 24-26 February 2022., pp. 201-211, 2022, Springer, 978-3-030-95902-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Anthony Bonato, Ryan Cushman, Trent G. Marbach, Zhiyuan Zhang |
An Evolving Network Model from Clique Extension. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics - 28th International Conference, COCOON 2022, Shenzhen, China, October 22-24, 2022, Proceedings, pp. 432-443, 2022, Springer, 978-3-031-22104-0. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Karthik C. S., Subhash Khot |
Almost Polynomial Factor Inapproximability for Parameterized k-Clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 37th Computational Complexity Conference, CCC 2022, July 20-23, 2022, Philadelphia, PA, USA., pp. 6:1-6:21, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-241-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Zebin Ren, Hongchao Qin, Rong-Hua Li, Yongheng Dai, Guoren Wang, Yanhui Li |
Mining Periodic k-Clique from Real-World Sparse Temporal Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APWeb/WAIM (1) ![In: Web and Big Data - 6th International Joint Conference, APWeb-WAIM 2022, Nanjing, China, November 25-27, 2022, Proceedings, Part I, pp. 461-476, 2022, Springer, 978-3-031-25157-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Jun Wu 0020, Chu Min Li, Yupeng Zhou, Minghao Yin, Xin Xu, Dangdang Niu |
HEA-D: A Hybrid Evolutionary Algorithm for Diversified Top-k Weight Clique Search Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022, Vienna, Austria, 23-29 July 2022., pp. 4821-4827, 2022, ijcai.org. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Barbara Giunti, Guillaume Houry, Michael Kerber |
Average Complexity of Matrix Reduction for Clique Filtrations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4 - 7, 2022, pp. 187-196, 2022, ACM, 978-1-4503-8688-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Md. Mainul Islam, Mpyana Mwamba Merlec, Hoh Peter In |
A Comparative Analysis of Proof-of-Authority Consensus Algorithms: Aura vs Clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCC ![In: IEEE International Conference on Services Computing, SCC 2022, Barcelona, Spain, July 10-16, 2022, pp. 327-332, 2022, IEEE, 978-1-6654-8146-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Nicolas Grelier |
Maximum Clique in Generalisations of Disk Graphs and Plane Geometric Graphs on Degenerate Point Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2022 |
RDF |
|
12 | Shuli Hu, Xiaoli Wu, Huan Liu, Ruizhi Li, Minghao Yin |
A novel two-model local search algorithm with a self-adaptive parameter for clique partitioning problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Neural Comput. Appl. ![In: Neural Comput. Appl. 33(10), pp. 4929-4944, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Vanha Tran, Lizhen Wang 0001, Hongmei Chen 0003, Qing Xiao |
MCHT: A maximal clique and hash table-based maximal prevalent co-location pattern mining algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Expert Syst. Appl. ![In: Expert Syst. Appl. 175, pp. 114830, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Dhruv Rohatgi, John C. Urschel, Jake Wellens |
Regarding Two Conjectures on Clique and Biclique Partitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 28(4), 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Gwenaël Joret, Piotr Micek, Bruce A. Reed, Michiel Smid |
Tight Bounds on the Clique Chromatic Number. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 28(3), 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Bruno Q. Pinto, Celso C. Ribeiro, José A. Riveaux, Isabel Rosseti |
A BRKGA-based matheuristic for the maximum quasi-clique problem with an exact local search strategy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RAIRO Oper. Res. ![In: RAIRO Oper. Res. 55(Supplement), pp. S741-S763, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Felipe Glaria, Cecilia Hernández, Susana Ladra, Gonzalo Navarro 0001, Lilian Salinas |
Compact structure for sparse undirected graphs based on a clique graph partition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Sci. ![In: Inf. Sci. 544, pp. 485-499, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Bo Peng, Lifan Wu, Yang Wang 0098, Qinghua Wu 0002 |
Solving maximum quasi-clique problem by a hybrid artificial bee colony approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Sci. ![In: Inf. Sci. 578, pp. 214-235, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Tiancheng Shen, Yibo Yang, Zhouchen Lin, Mingbin Zhang |
Recurrent learning with clique structures for prostate sparse-view CT artifacts reduction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IET Image Process. ![In: IET Image Process. 15(3), pp. 648-655, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Jie Han 0002, Yoshiharu Kohayakawa, Yury Person |
Near-perfect clique-factors in sparse pseudorandom graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. Probab. Comput. ![In: Comb. Probab. Comput. 30(4), pp. 570-590, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | |
A weak clique based multi objective genetic algorithm for overlapping community detection in complex networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Ambient Intell. Humaniz. Comput. ![In: J. Ambient Intell. Humaniz. Comput. 12(6), pp. 6761-6771, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Christian Blum 0001, Marko Djukanovic, Alberto Santini, Hua Jiang, Chu-Min Li, Felip Manyà, Günther R. Raidl |
Solving longest common subsequence problems via a transformation to the maximum clique problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 125, pp. 105089, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Jiang Zhou, Changjiang Bu |
Eigenvalues and clique partitions of graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Appl. Math. ![In: Adv. Appl. Math. 129, pp. 102220, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf |
Fast approximate shortest paths in the congested clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Distributed Comput. ![In: Distributed Comput. 34(6), pp. 463-487, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Luiz Moreira |
Ramsey Goodness of Clique Versus Paths in Random Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 35(3), pp. 2210-2222, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Clément Dallard, Martin Milanic, Kenny Storgel |
Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 35(4), pp. 2618-2646, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Lu Wang 0015, Feng Vankee Lin, Martin Cole, Zhengwu Zhang |
Learning Clique Subgraphs in Structural Brain Network Classification with Application to Crystallized Cognition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NeuroImage ![In: NeuroImage 225, pp. 117493, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Xi Li 0014, Mingyou Wu, Hanwu Chen, Zhibao Liu |
Algorithms for finding the maximum clique based on continuous time quantum walks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Quantum Inf. Comput. ![In: Quantum Inf. Comput. 21(1&2), pp. 59-79, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Mathew C. Francis, Rian Neogi, Venkatesh Raman 0001 |
Recognizing k-Clique Extendible Orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(11), pp. 3338-3362, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura |
A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 874, pp. 32-41, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Yi-Wen Wei, Wei-Mei Chen, Hsin-Hung Tsai |
Accelerating the Bron-Kerbosch Algorithm for Maximal Clique Enumeration Using GPUs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 32(9), pp. 2352-2366, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Adam N. Letchford, Paolo Ventura |
Strengthened clique-family inequalities for the stable set polytope. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. Lett. ![In: Oper. Res. Lett. 49(4), pp. 586-589, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Zheng Li, Jun Li, Chaoyue Wang, Zhiyang Lu, Jun Wang 0024, Hongjian He, Jun Shi 0004 |
Meta-Learning Based Interactively Connected Clique U-Net for Quantitative Susceptibility Mapping. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computational Imaging ![In: IEEE Trans. Computational Imaging 7, pp. 1385-1399, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Shenshen Gu, Hanmei Yao |
Pointer Network Based Deep Learning Algorithm for the Maximum Clique Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Artif. Intell. Tools ![In: Int. J. Artif. Intell. Tools 30(1), pp. 2140004:1-2140004:21, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Yangdi Lyu, Prabhat Mishra 0001 |
Scalable Activation of Rare Triggers in Hardware Trojans by Repeated Maximal Clique Sampling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 40(7), pp. 1287-1300, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Jens Lange |
CliquePercolation: An R Package for conducting and visualizing results of the clique percolation network community detection algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Open Source Softw. ![In: J. Open Source Softw. 6(62), pp. 3210, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim 0002, Pawel Rzazewski, Florian Sikora, Stéphan Thomassé |
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 68(2), pp. 9:1-9:38, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Alexander A. Razborov |
Clique Is Hard on Average for Regular Resolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 68(4), pp. 23:1-23:26, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Shaowei Cai 0001, Jinkun Lin, Yiyuan Wang, Darren Strash |
A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Artif. Intell. Res. ![In: J. Artif. Intell. Res. 72, pp. 39-67, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Shuo Pang |
SOS lower bound for exact planted clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR21, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Bogdán Zaválnij, Sándor Szabó |
Estimating clique size via discarding subgraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Informatica (Slovenia) ![In: Informatica (Slovenia) 45(2), 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Zuosong Liang, Yanxia Dong, Yancai Zhao, Huiyu Xing |
Equitable Clique-Coloring in Claw-Free Graphs with Maximum Degree at Most 4. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 37(2), pp. 445-454, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Kassahun Betre, Evatt Salinger |
The Inductive Graph Dimension from the Minimum Edge Clique Cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 37(6), pp. 2637-2654, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Gal Kronenberg, Taísa Martins, Natasha Morrison |
Weak saturation numbers of complete bipartite graphs in the clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. A ![In: J. Comb. Theory, Ser. A 178, pp. 105357, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Bruno Benedetti, Davide Bolognini |
Non-ridge-chordal complexes whose clique complex has shellable Alexander dual. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. A ![In: J. Comb. Theory, Ser. A 180, pp. 105430, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Junping Zhou, Chumin Li, Yupeng Zhou, Mingyang Li, Lili Liang, Jianan Wang |
Solving diversified top-k weight clique search problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Sci. China Inf. Sci. ![In: Sci. China Inf. Sci. 64(5), 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Saeed Shahrivari, Saeed Jalili |
Efficient Distributed k-Clique Mining for Large Networks Using MapReduce. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 33(3), pp. 964-974, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Rong-Hua Li, Qiangqiang Dai, Lu Qin 0001, Guoren Wang, Xiaokui Xiao, Jeffrey Xu Yu, Shaojie Qiao |
Signed Clique Search in Signed Networks: Concepts and Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 33(2), pp. 710-727, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Gary MacGillivray, Christina M. Mynhardt, Virgélot Virgile |
Eternal Domination and Clique Covering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2110.09732, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Mohammad Almasri, Izzat El Hajj, Rakesh Nagi, Jinjun Xiong, Wen-Mei W. Hwu |
K-Clique Counting on GPUs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2104.13209, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Alexis Baudin, Maximilien Danisch, Sergey Kirgizov, Clémence Magnien, Marwan Ghanem 0001 |
Clique percolation method: memory efficient almost exact communities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2110.01213, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP 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) |
CoRR ![In: CoRR abs/2107.05198, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Keren Censor-Hillel, Yannic Maus, Volodymyr Polosukhin |
Near-Optimal Scheduling in the Congested Clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2102.07221, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Minjia Pan, Rong-Hua Li, Qi Zhang 0010, Yongheng Dai, Qun Tian, Guoren Wang |
Fairness-aware Maximal Clique Enumeration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2107.10025, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Amogh Lonkar, Scott Beamer |
Accelerating Clique Counting in Sparse Real-World Graphs via Communication-Reducing Optimizations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2112.10913, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Karthik C. S., Subhash Khot |
Almost Polynomial Factor Inapproximability for Parameterized k-Clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2112.03983, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Xuandi Ren |
A Survey on Parameterized Inapproximability: k-Clique, k-SetCover, and More. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2112.04669, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Dipayan Chakraborty, Sandip Das 0001, Soumen Nandi, Debdeep Roy, Sagnik Sen 0001 |
On clique numbers of colored mixed graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2104.07416, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim 0002, Pawel Rzazewski, Florian Sikora, Stéphan Thomassé |
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2110.15419, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Uriel Feige, Tom Ferster |
A tight bound for the clique query problem in two rounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2112.06072, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Madison Cooley, Casey S. Greene, Davis Issac, Milton Pividori, Blair D. Sullivan |
Parameterized algorithms for identifying gene co-expression modules via weighted clique decomposition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2106.00657, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Jason Van Hulse, Joshua S. Friedman |
Deep Learning Chromatic and Clique Numbers of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2108.01810, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Hossein Teimoori Faal |
On Clique Roots of Flat Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2112.09721, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Yucheng Wang, Bowen Yu 0002, Hongsong Zhu, Tingwen Liu, Nan Yu, Limin Sun |
Discontinuous Named Entity Recognition as Maximal Clique Discovery. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2106.00218, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Dongkwon Jin, Wonhui Park, Seong-Gyun Jeong, Chang-Su Kim 0001 |
Harmonious Semantic Line Detection via Maximal Weight Clique Selection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2104.06903, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Scott Payne, Edgar Fuller, George Spirou, Cun-Quan Zhang |
The Automatic Quasi-clique Merger algorithm (AQCM). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2103.04186, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Bingkai Lin |
Constant Approximating k-Clique is W[1]-hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2102.04769, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
|
|