Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
12 | Barbara Giunti, Guillaume Houry, Michael Kerber |
Average complexity of matrix reduction for clique filtrations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2111.02125, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Till Fluschnik, Klaus Heeger, Danny Hermelin |
Polynomial Turing Kernels for Clique with an Optimal Number of Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2110.03279, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Mark de Berg, Sándor Kisfaludi-Bak, Morteza Monemizadeh, Leonidas Theocharous |
Clique-Based Separators for Geometric Intersection Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2109.09874, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Ahammed Ullah |
Clique Cover of Graphs with Bounded Degeneracy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2108.09851, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Alexander Belyi, Stanislav Sobolevsky, Alexander Kurbatski, Carlo Ratti |
Subnetwork Constraints for Tighter Upper Bounds and Exact Solution of the Clique Partitioning Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2110.05627, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Hisao Tamaki |
A heuristic for listing almost-clique minimal separators of a graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2108.07551, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Sriram Bhyravarapu, Tim A. Hartmann, Subrahmanyam Kalyanasundaram, I. Vinod Reddy |
Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2105.08693, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Chris Aronis |
The Algorithmic Complexity of Tree-Clique Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2111.02200, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Giulio Burgio, Alex Arenas, Sergio Gómez, Joan T. Matamalas |
Network clique cover approximation to analyze complex contagions through group interactions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2101.03618, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Lyuben Lichev, Dieter Mitsche, Lutz Warnke |
The jump of the clique chromatic number of random graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2105.12168, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Maria Chiara Angelini, Paolo Fachin, Simone de Feo |
Mismatching as a tool to enhance algorithmic performances of Monte Carlo methods for the planted clique model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2106.05720, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP 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) |
CoRR ![In: CoRR abs/2111.14033, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Miroslaw Kowaluk, Andrzej Lingas |
Breaking the hegemony of the triangle method in clique detection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2109.14876, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Jay Mardia |
Logspace Reducibility From Secret Leakage Planted Clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2107.11886, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Lihong Han, Kuan-Ching Li, Arcangelo Castiglione, Jianxin Tang, Hengjun Huang, Qingguo Zhou |
A clique-based discrete bat algorithm for influence maximization in identifying top-k influential nodes of social networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 25(13), pp. 8223-8240, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Anushree Bhattacharya, Madhumangal Pal |
Optimization in business strategy as a part of sustainable economic growth using clique covering of fuzzy graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 25(10), pp. 7095-7118, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Fabio Furini, Ivana Ljubic, Pablo San Segundo, Yanlu Zhao |
A branch-and-cut algorithm for the Edge Interdiction Clique Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 294(1), pp. 54-69, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Yongfang Kou, Xiaomin Hu, Weihua Yang |
The clique distribution in powers of hypercubes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 305, pp. 76-85, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Fabrizio Marinelli 0001, Andrea Pizzuti, Fabrizio Rossi |
LP-based dual bounds for the maximum quasi-clique problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 296, pp. 118-140, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Aistis Atminas, Robert Brignall, Vadim V. Lozin, Juraj Stacho |
Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 295, pp. 57-69, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Richard Y. Zhang, Javad Lavaei |
Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 188(1), pp. 351-393, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Yuan Sun 0003, Xiaodong Li 0001, Andreas T. Ernst |
Using Statistical Measures and Machine Learning for Graph Reduction to Solve Maximum Weight Clique Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 43(5), pp. 1746-1760, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Satoshi Shimizu, Kazuaki Yamaguchi, Sumio Masuda |
Parallelization of a branch-and-bound algorithm for the maximum weight clique problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Optim. ![In: Discret. Optim. 41, pp. 100646, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Marcos Okamura Rodrigues |
Fast constructive and improvement heuristics for edge clique covering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Optim. ![In: Discret. Optim. 39, pp. 100628, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Sándor Szabó |
A Clique Search Problem and its Application to Machine Scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. Forum ![In: Oper. Res. Forum 2(4), 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Md. Akbar Hossain, Nurul I. Sarkar |
CCH: a clique based asymmetric rendezvous scheme for cognitive radio ad-hoc networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Wirel. Networks ![In: Wirel. Networks 27(6), pp. 4265-4274, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Priscila P. Camargo, Uéverton S. Souza, Julliano R. Nascimento |
Remarks on k-Clique, k-Independent Set and 2-Contamination in Complementary Prisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Found. Comput. Sci. ![In: Int. J. Found. Comput. Sci. 32(1), pp. 37-52, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Guang Hua 0001, Han Liao, Haijian Zhang, Dengpan Ye, Jiayi Ma 0001 |
Robust ENF Estimation Based on Harmonic Enhancement and Maximum Weight Clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Forensics Secur. ![In: IEEE Trans. Inf. Forensics Secur. 16, pp. 3874-3887, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Daniel A. Quiroz |
Clique immersions in graphs of independence number two with certain forbidden subgraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 344(6), pp. 112365, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Chun-Li Kan, Ying-Ying Tan, Jia-Bao Liu, Baohua Xing |
Some Chemistry Indices of Clique-Inserted Graph of a Strongly Regular Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Complex. ![In: Complex. 2021, pp. 7671212:1-7671212:6, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Florent Becker, Pedro Montealegre 0001, Ivan Rapaport, Ioan Todinca |
The role of randomness in the broadcast congested clique model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 281, pp. 104669, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Hendrik Molter, Rolf Niedermeier, Malte Renken |
Isolation concepts applied to temporal clique enumeration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Netw. Sci. ![In: Netw. Sci. 9(S1), pp. S83-S105, October 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Napur Patra, Tarasankar Pramanik, Madhumangal Pal, Sukumar Mondal |
Cliques and Clique Covers in Interval-Valued Fuzzy Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Comput. Intell. Syst. ![In: Int. J. Comput. Intell. Syst. 14(1), pp. 1773-1783, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Artur Czumaj, Peter Davies, Merav Parter |
Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 50(5), pp. 1603-1626, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | C. Cedillo, Miguel A. Pizaña |
Clique-convergence is undecidable for automatic graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 96(3), pp. 414-437, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Eun-Kyung Cho, Ilkyoo Choi, Ringi Kim, Boram Park |
The strong clique index of a graph with forbidden cycles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 98(2), pp. 326-341, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Pierre Charbit, Gena Hahn, Marcin Kaminski 0001, Manuel Lafond, Nicolas Lichiardopol, Reza Naserasr, Ben Seamone, Rezvan Sherkati |
Edge clique covers in graphs with independence number two. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 97(2), pp. 324-339, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels |
Minimum weighted clique cover on claw-free perfect graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 96(2), pp. 231-268, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Mark de Berg, Sándor Kisfaludi-Bak, Morteza Monemizadeh, Leonidas Theocharous |
Clique-Based Separators for Geometric Intersection Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 32nd International Symposium on Algorithms and Computation, ISAAC 2021, December 6-8, 2021, Fukuoka, Japan., pp. 22:1-22:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-214-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Mingyang Wei, Kun Guo, Ximeng Liu |
Federated Clique Percolation for Overlapping Community Detection on Attributed Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ChineseCSCW (2) ![In: Computer Supported Cooperative Work and Social Computing - 16th CCF Conference, ChineseCSCW 2021, Xiangtan, China, November 26-28, 2021, Revised Selected Papers, Part II, pp. 252-266, 2021, Springer, 978-981-19-4548-9. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Kaijie Zhu, George Fletcher 0001, Nikolay Yakovets |
Leveraging Temporal and Topological Selectivities in Temporal-clique Subgraph Query Processing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: 37th IEEE International Conference on Data Engineering, ICDE 2021, Chania, Greece, April 19-22, 2021, pp. 672-683, 2021, IEEE, 978-1-7281-9184-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Andrew Haverly, Sonia López |
Implementation of Grover's Algorithm to Solve the Maximum Clique Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISVLSI ![In: IEEE Computer Society Annual Symposium on VLSI, ISVLSI 2021, Tampa, FL, USA, July 7-9, 2021, pp. 441-446, 2021, IEEE, 978-1-6654-3946-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Pasin Manurangsi, Aviad Rubinstein, Tselil Schramm |
The Strongish Planted Clique Hypothesis and Its Consequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 12th Innovations in Theoretical Computer Science Conference, ITCS 2021, January 6-8, 2021, Virtual Conference., pp. 10:1-10:21, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-177-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Jay Mardia |
Is the Space Complexity of Planted Clique Recovery the Same as That of Detection? ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 12th Innovations in Theoretical Computer Science Conference, ITCS 2021, January 6-8, 2021, Virtual Conference., pp. 34:1-34:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-177-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI 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) |
ACDA ![In: Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms, ACDA 2021, Virtual Conference, July 19-21, 2021, pp. 111-122, 2021, SIAM, 978-1-61197-683-0. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Jessica Shi 0001, Laxman Dhulipala, Julian Shun |
Parallel Clique Counting and Peeling Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACDA ![In: Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms, ACDA 2021, Virtual Conference, July 19-21, 2021, pp. 135-146, 2021, SIAM, 978-1-61197-683-0. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Frank Gurski, Dominique Komander, Carolin Rehs |
Acyclic Coloring Parameterized by Directed Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CALDAM ![In: Algorithms and Discrete Applied Mathematics - 7th International Conference, CALDAM 2021, Rupnagar, India, February 11-13, 2021, Proceedings, pp. 95-108, 2021, Springer, 978-3-030-67898-2. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | J. Leonardo González-Ruiz, José Raymundo Marcial-Romero, José Antonio Hernández Servín, Guillermo De Ita |
Approximate the Clique-Width of a Graph Using Shortest Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MICAI (2) ![In: Advances in Soft Computing - 20th Mexican International Conference on Artificial Intelligence, MICAI 2021, Mexico City, Mexico, October 25-30, 2021, Proceedings, Part II, pp. 337-347, 2021, Springer, 978-3-030-89819-9. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Laxman Dhulipala, Quanquan C. Liu, Julian Shun, Shangdi Yu |
Parallel Batch-Dynamic k-Clique Counting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APOCS ![In: 2nd Symposium on Algorithmic Principles of Computer Systems, APOCS 2020, Virtual Conference, January 13, 2021, pp. 129-143, 2021, SIAM, 978-1-61197-648-9. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Giovanni Amendola, Giovanni Rotondaro |
Modeling Clique Coloring via ASP(Q). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICLP Workshops ![In: Proceedings of the International Conference on Logic Programming 2021 Workshops co-located with the 37th International Conference on Logic Programming (ICLP 2021), Porto, Portugal (virtual), September 20th-21st, 2021., 2021, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane, Srinivasa Rao Satti |
Succinct Data Structures for Small Clique-Width Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DCC ![In: 31st Data Compression Conference, DCC 2021, Snowbird, UT, USA, March 23-26, 2021, pp. 133-142, 2021, IEEE, 978-1-6654-0333-7. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Jiejiang Chen, Shaowei Cai 0001, Shiwei Pan, Yiyuan Wang, Qingwei Lin, Mengyu Zhao, Minghao Yin |
NuQClq: An Effective Local Search Algorithm for Maximum Quasi-Clique Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAAI ![In: Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Thirty-Third Conference on Innovative Applications of Artificial Intelligence, IAAI 2021, The Eleventh Symposium on Educational Advances in Artificial Intelligence, EAAI 2021, Virtual Event, February 2-9, 2021, pp. 12258-12266, 2021, AAAI Press, 978-1-57735-866-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Shuo Pang |
Large Clique is Hard on Average for Resolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications - 16th International Computer Science Symposium in Russia, CSR 2021, Sochi, Russia, June 28 - July 2, 2021, Proceedings, pp. 361-380, 2021, Springer, 978-3-030-79415-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Romina Torres, Nicolás González, Mathías Cabrera, Rodrigo Salas 0001 |
Taxonomies using the clique percolation method for building a threats observatory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CLEI ![In: XLVII Latin American Computing Conference, CLEI 2021, Cartago, Costa Rica, October 25-29, 2021, pp. 1-5, 2021, IEEE, 978-1-6654-9503-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Ilan Doron Arad, Ariel Kulik, Hadas Shachnai |
An APTAS for Bin Packing with Clique-Graph Conflicts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures - 17th International Symposium, WADS 2021, Virtual Event, August 9-11, 2021, Proceedings, pp. 286-299, 2021, Springer, 978-3-030-83507-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Michal Dory, Orr Fischer, Seri Khoury, Dean Leitersdorf |
Constant-Round Spanners and Shortest Paths in Congested Clique and MPC. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: PODC '21: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, July 26-30, 2021, pp. 223-233, 2021, ACM, 978-1-4503-8548-0. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Lars Jaffke, Paloma T. Lima, Daniel Lokshtanov |
b-Coloring Parameterized by Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference)., pp. 43:1-43:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-180-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI 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) |
CVPR ![In: IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2021, virtual, June 19-25, 2021, pp. 16737-16745, 2021, Computer Vision Foundation / IEEE. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Sriram Bhyravarapu, Tim A. Hartmann, Subrahmanyam Kalyanasundaram, I. Vinod Reddy |
Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWOCA ![In: Combinatorial Algorithms - 32nd International Workshop, IWOCA 2021, Ottawa, ON, Canada, July 5-7, 2021, Proceedings, pp. 92-106, 2021, Springer, 978-3-030-79986-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Bowen Yu 0002, Yucheng Wang, Tingwen Liu, Hongsong Zhu, Limin Sun, Bin Wang 0004 |
Maximal Clique Based Non-Autoregressive Open Information Extraction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EMNLP (1) ![In: Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing, EMNLP 2021, Virtual Event / Punta Cana, Dominican Republic, 7-11 November, 2021, pp. 9696-9706, 2021, Association for Computational Linguistics. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Keren Censor-Hillel, Yannic Maus, Volodymyr Polosukhin |
Near-Optimal Scheduling in the Congested Clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIROCCO ![In: Structural Information and Communication Complexity - 28th International Colloquium, SIROCCO 2021, Wrocław, Poland, June 28 - July 1, 2021, Proceedings, pp. 50-67, 2021, Springer, 978-3-030-79526-9. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Bingkai Lin |
Constant approximating k-clique is w[1]-hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021., pp. 1749-1756, 2021, ACM, 978-1-4503-8053-9. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Krzysztof Nowicki 0002 |
A deterministic algorithm for the MST problem in constant rounds of congested clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021., pp. 1154-1165, 2021, ACM, 978-1-4503-8053-9. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Pierre-Emmanuel Arduin |
Je clique ou pas ? Une étude des facteurs influençant la confiance et la défiance dans les courriels de hameçonnage. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFORSID ![In: Actes du XXXIXème Congrès INFORSID, Dijon, France, June 1-4, 2021., pp. 105-106, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
12 | Shuo Pang |
SOS Lower Bound for Exact Planted Clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 36th Computational Complexity Conference, CCC 2021, July 20-23, 2021, Toronto, Ontario, Canada (Virtual Conference)., pp. 26:1-26:63, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-193-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Sonja Kraiczy, Ciaran McCreesh |
Solving Graph Homomorphism and Subgraph Isomorphism Problems Faster Through Clique Neighbourhood Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI 2021, Virtual Event / Montreal, Canada, 19-27 August 2021., pp. 1396-1402, 2021, ijcai.org. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI 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) |
ADMA ![In: Advanced Data Mining and Applications - 17th International Conference, ADMA 2021, Sydney, NSW, Australia, February 2-4, 2022, Proceedings, Part II, pp. 113-127, 2021, Springer, 978-3-030-95407-9. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Ali Baran Tasdemir, Lale Özkahya |
Learning Heuristics for the Maximum Clique Enumeration Problem Using Higher-Order Graph Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIU ![In: 29th Signal Processing and Communications Applications Conference, SIU 2021, Istanbul, Turkey, June 9-11, 2021, pp. 1-4, 2021, IEEE, 978-1-6654-3649-6. The full citation details ...](Pics/full.jpeg) |
2021 |
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) |
IPEC ![In: 16th International Symposium on Parameterized and Exact Computation, IPEC 2021, September 8-10, 2021, Lisbon, Portugal., pp. 15:1-15:17, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-216-7. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Guillaume Ducoffe |
Optimal Centrality Computations Within Bounded Clique-Width Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPEC ![In: 16th International Symposium on Parameterized and Exact Computation, IPEC 2021, September 8-10, 2021, Lisbon, Portugal., pp. 16:1-16:16, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-216-7. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI 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) |
ACL/IJCNLP (1) ![In: Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing, ACL/IJCNLP 2021, (Volume 1: Long Papers), Virtual Event, August 1-6, 2021., pp. 764-774, 2021, Association for Computational Linguistics, 978-1-954085-52-7. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
12 | Panchali Datta Choudhury, Neha Agarwal, Tanmay De |
Traffic grooming and clique partitioning-based spectrum assignment in elastic optical networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Commun. Syst. ![In: Int. J. Commun. Syst. 33(7), 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Foad Mahdavi Pajouh |
Minimum cost edge blocker clique problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 294(1), pp. 345-376, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Zhuqi Miao, Balabhaskar Balasundaram |
An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFORMS J. Comput. ![In: INFORMS J. Comput. 32(3), pp. 763-778, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Jack H. Koolen, Ying-Ying Tan, Zheng-Jiang Xia |
A spectral characterization of the s-clique extension of the triangular graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discuss. Math. Graph Theory ![In: Discuss. Math. Graph Theory 40(2), pp. 663-676, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Yujue Wang, HweeHwa Pang, Robert H. Deng, Yong Ding 0005, Qianhong Wu, Bo Qin, Kefeng Fan |
Secure server-aided data sharing clique with attestation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Sci. ![In: Inf. Sci. 522, pp. 80-98, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Jose L. Walteros, Austin Buchanan |
Why Is Maximum Clique Often Easy in Practice? ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. ![In: Oper. Res. 68(6), pp. 1866-1895, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Heiner Oberkampf, Mathias Schacht |
On the structure of Dense graphs with bounded clique number. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. Probab. Comput. ![In: Comb. Probab. Comput. 29(5), pp. 641-649, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Neda Mohammadi, Mehdi Kadivar |
NK-MaxClique and MMCQ: Tow New Exact Branch and Bound Algorithms for the Maximum Clique Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Access ![In: IEEE Access 8, pp. 180045-180053, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Jian Ma, Jianping Fan 0006 |
Local Optimization for Clique-Based Overlapping Community Detection in Complex Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Access ![In: IEEE Access 8, pp. 5091-5103, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Adam N. Letchford, Fabrizio Rossi, Stefano Smriglio |
The stable set problem: Clique and nodal inequalities revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 123, pp. 105024, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Jun Wu 0020, Chu-Min Li, Lu Jiang 0007, Junping Zhou, Minghao Yin |
Local search for diversified Top-k clique search problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 116, pp. 104867, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Guang Ouyang, Dipak K. Dey, Panpan Zhang |
Clique-Based Method for Social Network Clustering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Classif. ![In: J. Classif. 37(1), pp. 254-274, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Honghao Liu, Liang Li, Shan Lu, Kaixing Zhang, Xianxi Liu |
3D model similarity evaluation for mechanical design reuse based on spatial correlated shape-word clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Multim. Tools Appl. ![In: Multim. Tools Appl. 79(11-12), pp. 8181-8195, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Andrej Jursa, Mária Markosová, Boris Rudolf |
About clique number estimates and exact enumeration in scale-free networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Complex Networks ![In: J. Complex Networks 8(2), 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Masayuki Takeda, Nobuyuki Yamasaki |
Codeword Set Selection for the Error-Correcting 4b/10b Line Code with Maximum Clique Enumeration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEICE Trans. Fundam. Electron. Commun. Comput. Sci. ![In: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 103-A(10), pp. 1227-1233, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson 0002, Vadim V. Lozin, Daniël Paulusma, Viktor Zamaraev |
Clique-Width for Graph Classes Closed under Complementation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 34(2), pp. 1107-1147, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Michael Lampis |
Finer Tight Bounds for Coloring on Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 34(3), pp. 1538-1558, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Florent Becker, Pedro Montealegre 0001, Ivan Rapaport, Ioan Todinca |
The Impact of Locality in the Broadcast Congested Clique Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 34(1), pp. 682-700, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Geoffrey Solano, Guillaume Blin, Mathieu Raffinot, Jhoirene B. Clemente, Jaime Caro |
On the Approximability of the Minimum Weight $t$-partite Clique Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Algorithms Appl. ![In: J. Graph Algorithms Appl. 24(3), pp. 171-190, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Yiyuan Wang, Shaowei Cai 0001, Jiejiang Chen, Minghao Yin |
SCCWalk: An efficient local search algorithm and its improvements for maximum weight clique problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Artif. Intell. ![In: Artif. Intell. 280, pp. 103230, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Anurag Bishnoi, Ferdinand Ihringer, Valentina Pepe |
A Construction for Clique-Free Pseudorandom Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 40(3), pp. 307-314, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Kazunori Sakurama, Hyo-Sung Ahn |
Multi-agent coordination over local indexes via clique-based distributed assignment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Autom. ![In: Autom. 112, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Marek Chrobak, Christoph Dürr, Aleksander Fabijan, Bengt J. Nilsson |
Online Clique Clustering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 82(4), pp. 938-965, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Alessio Conte, Roberto Grossi, Andrea Marino 0001, Luca Versari |
Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 82(6), pp. 1547-1573, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-joung Kwon |
An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 82(6), pp. 1654-1674, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Csilla Bujtás, Akbar Davoodi, Ervin Györi, Zsolt Tuza |
Clique coverings and claw-free graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 88, pp. 103114, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Noga Alon, Ryan Alweiss |
On the product dimension of clique factors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 86, pp. 103097, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Keren Censor-Hillel, Dean Leitersdorf, Elia Turner |
Sparse matrix multiplication and triangle listing in the Congested Clique model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 809, pp. 45-60, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
12 | Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy |
Polynomial-time algorithm for isomorphism of graphs with clique-width at most three. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 819, pp. 9-23, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|