| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 12 | Barbara Giunti, Guillaume Houry, Michael Kerber |
Average complexity of matrix reduction for clique filtrations.  |
CoRR  |
2021 |
DBLP BibTeX RDF |
|
| 12 | Till Fluschnik, Klaus Heeger, Danny Hermelin |
Polynomial Turing Kernels for Clique with an Optimal Number of Queries. |
CoRR |
2021 |
DBLP BibTeX RDF |
|
| 12 | Mark de Berg, Sándor Kisfaludi-Bak, Morteza Monemizadeh, Leonidas Theocharous |
Clique-Based Separators for Geometric Intersection Graphs. |
CoRR |
2021 |
DBLP BibTeX RDF |
|
| 12 | Ahammed Ullah |
Clique Cover of Graphs with Bounded Degeneracy. |
CoRR |
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. |
CoRR |
2021 |
DBLP BibTeX RDF |
|
| 12 | Hisao Tamaki |
A heuristic for listing almost-clique minimal separators of a graph. |
CoRR |
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. |
CoRR |
2021 |
DBLP BibTeX RDF |
|
| 12 | Chris Aronis |
The Algorithmic Complexity of Tree-Clique Width. |
CoRR |
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. |
CoRR |
2021 |
DBLP BibTeX RDF |
|
| 12 | Lyuben Lichev, Dieter Mitsche, Lutz Warnke |
The jump of the clique chromatic number of random graphs. |
CoRR |
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. |
CoRR |
2021 |
DBLP BibTeX RDF |
|
| 12 | Bingkai Lin, Xuandi Ren, Yican Sun, Xiuhan Wang |
On Lower Bounds of Approximating Parameterized k-Clique. |
CoRR |
2021 |
DBLP BibTeX RDF |
|
| 12 | Miroslaw Kowaluk, Andrzej Lingas |
Breaking the hegemony of the triangle method in clique detection. |
CoRR |
2021 |
DBLP BibTeX RDF |
|
| 12 | Jay Mardia |
Logspace Reducibility From Secret Leakage Planted Clique. |
CoRR |
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. |
Soft Comput. |
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. |
Soft Comput. |
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. |
Eur. J. Oper. Res. |
2021 |
DBLP DOI BibTeX RDF |
|
| 12 | Yongfang Kou, Xiaomin Hu, Weihua Yang |
The clique distribution in powers of hypercubes. |
Discret. Appl. Math. |
2021 |
DBLP DOI BibTeX RDF |
|
| 12 | Fabrizio Marinelli 0001, Andrea Pizzuti, Fabrizio Rossi |
LP-based dual bounds for the maximum quasi-clique problem. |
Discret. Appl. Math. |
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. |
Discret. Appl. Math. |
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. |
Math. Program. |
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. |
IEEE Trans. Pattern Anal. Mach. Intell. |
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. |
Discret. Optim. |
2021 |
DBLP DOI BibTeX RDF |
|
| 12 | Marcos Okamura Rodrigues |
Fast constructive and improvement heuristics for edge clique covering. |
Discret. Optim. |
2021 |
DBLP DOI BibTeX RDF |
|
| 12 | Sándor Szabó |
A Clique Search Problem and its Application to Machine Scheduling. |
Oper. Res. Forum |
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. |
Wirel. Networks |
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. |
Int. J. Found. Comput. Sci. |
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. |
IEEE Trans. Inf. Forensics Secur. |
2021 |
DBLP DOI BibTeX RDF |
|
| 12 | Daniel A. Quiroz |
Clique immersions in graphs of independence number two with certain forbidden subgraphs. |
Discret. Math. |
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. |
Complex. |
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. |
Inf. Comput. |
2021 |
DBLP DOI BibTeX RDF |
|
| 12 | Hendrik Molter, Rolf Niedermeier, Malte Renken |
Isolation concepts applied to temporal clique enumeration. |
Netw. Sci. |
2021 |
DBLP DOI BibTeX RDF |
|
| 12 | Napur Patra, Tarasankar Pramanik, Madhumangal Pal, Sukumar Mondal |
Cliques and Clique Covers in Interval-Valued Fuzzy Graphs. |
Int. J. Comput. Intell. Syst. |
2021 |
DBLP DOI BibTeX RDF |
|
| 12 | Artur Czumaj, Peter Davies, Merav Parter |
Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC. |
SIAM J. Comput. |
2021 |
DBLP DOI BibTeX RDF |
|
| 12 | C. Cedillo, Miguel A. Pizaña |
Clique-convergence is undecidable for automatic graphs. |
J. Graph Theory |
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. |
J. Graph Theory |
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. |
J. Graph Theory |
2021 |
DBLP DOI BibTeX RDF |
|
| 12 | Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels |
Minimum weighted clique cover on claw-free perfect graphs. |
J. Graph Theory |
2021 |
DBLP DOI BibTeX RDF |
|
| 12 | Mark de Berg, Sándor Kisfaludi-Bak, Morteza Monemizadeh, Leonidas Theocharous |
Clique-Based Separators for Geometric Intersection Graphs. |
ISAAC |
2021 |
DBLP DOI BibTeX RDF |
|
| 12 | Mingyang Wei, Kun Guo, Ximeng Liu |
Federated Clique Percolation for Overlapping Community Detection on Attributed Networks. |
ChineseCSCW (2) |
2021 |
DBLP DOI BibTeX RDF |
|
| 12 | Kaijie Zhu, George Fletcher 0001, Nikolay Yakovets |
Leveraging Temporal and Topological Selectivities in Temporal-clique Subgraph Query Processing. |
ICDE |
2021 |
DBLP DOI BibTeX RDF |
|
| 12 | Andrew Haverly, Sonia López |
Implementation of Grover's Algorithm to Solve the Maximum Clique Problem. |
ISVLSI |
2021 |
DBLP DOI BibTeX RDF |
|
| 12 | Pasin Manurangsi, Aviad Rubinstein, Tselil Schramm |
The Strongish Planted Clique Hypothesis and Its Consequences. |
ITCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 12 | Jay Mardia |
Is the Space Complexity of Planted Clique Recovery the Same as That of Detection? |
ITCS |
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. |
ACDA |
2021 |
DBLP DOI BibTeX RDF |
|
| 12 | Jessica Shi 0001, Laxman Dhulipala, Julian Shun |
Parallel Clique Counting and Peeling Algorithms. |
ACDA |
2021 |
DBLP DOI BibTeX RDF |
|
| 12 | Frank Gurski, Dominique Komander, Carolin Rehs |
Acyclic Coloring Parameterized by Directed Clique-Width. |
CALDAM |
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. |
MICAI (2) |
2021 |
DBLP DOI BibTeX RDF |
|
| 12 | Laxman Dhulipala, Quanquan C. Liu, Julian Shun, Shangdi Yu |
Parallel Batch-Dynamic k-Clique Counting. |
APOCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 12 | Giovanni Amendola, Giovanni Rotondaro |
Modeling Clique Coloring via ASP(Q). |
ICLP Workshops |
2021 |
DBLP BibTeX RDF |
|
| 12 | Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane, Srinivasa Rao Satti |
Succinct Data Structures for Small Clique-Width Graphs. |
DCC |
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. |
AAAI |
2021 |
DBLP DOI BibTeX RDF |
|
| 12 | Shuo Pang |
Large Clique is Hard on Average for Resolution. |
CSR |
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. |
CLEI |
2021 |
DBLP DOI BibTeX RDF |
|
| 12 | Ilan Doron Arad, Ariel Kulik, Hadas Shachnai |
An APTAS for Bin Packing with Clique-Graph Conflicts. |
WADS |
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. |
PODC |
2021 |
DBLP DOI BibTeX RDF |
|
| 12 | Lars Jaffke, Paloma T. Lima, Daniel Lokshtanov |
b-Coloring Parameterized by Clique-Width. |
STACS |
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. |
CVPR |
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. |
IWOCA |
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. |
EMNLP (1) |
2021 |
DBLP DOI BibTeX RDF |
|
| 12 | Keren Censor-Hillel, Yannic Maus, Volodymyr Polosukhin |
Near-Optimal Scheduling in the Congested Clique. |
SIROCCO |
2021 |
DBLP DOI BibTeX RDF |
|
| 12 | Bingkai Lin |
Constant approximating k-clique is w[1]-hard. |
STOC |
2021 |
DBLP DOI BibTeX RDF |
|
| 12 | Krzysztof Nowicki 0002 |
A deterministic algorithm for the MST problem in constant rounds of congested clique. |
STOC |
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. |
INFORSID |
2021 |
DBLP BibTeX RDF |
|
| 12 | Shuo Pang |
SOS Lower Bound for Exact Planted Clique. |
CCC |
2021 |
DBLP DOI BibTeX RDF |
|
| 12 | Sonja Kraiczy, Ciaran McCreesh |
Solving Graph Homomorphism and Subgraph Isomorphism Problems Faster Through Clique Neighbourhood Constraints. |
IJCAI |
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. |
ADMA |
2021 |
DBLP DOI BibTeX RDF |
|
| 12 | Ali Baran Tasdemir, Lale Özkahya |
Learning Heuristics for the Maximum Clique Enumeration Problem Using Higher-Order Graph Structures. |
SIU |
2021 |
DBLP DOI BibTeX RDF |
|
| 12 | Guillaume Ducoffe |
Maximum Matching in Almost Linear Time on Graphs of Bounded Clique-Width. |
IPEC |
2021 |
DBLP DOI BibTeX RDF |
|
| 12 | Guillaume Ducoffe |
Optimal Centrality Computations Within Bounded Clique-Width Graphs. |
IPEC |
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. |
ACL/IJCNLP (1) |
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. |
Int. J. Commun. Syst. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Foad Mahdavi Pajouh |
Minimum cost edge blocker clique problem. |
Ann. Oper. Res. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Zhuqi Miao, Balabhaskar Balasundaram |
An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph. |
INFORMS J. Comput. |
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. |
Discuss. Math. Graph Theory |
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. |
Inf. Sci. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Jose L. Walteros, Austin Buchanan |
Why Is Maximum Clique Often Easy in Practice? |
Oper. Res. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Heiner Oberkampf, Mathias Schacht |
On the structure of Dense graphs with bounded clique number. |
Comb. Probab. Comput. |
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. |
IEEE Access |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Jian Ma, Jianping Fan 0006 |
Local Optimization for Clique-Based Overlapping Community Detection in Complex Networks. |
IEEE Access |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Adam N. Letchford, Fabrizio Rossi, Stefano Smriglio |
The stable set problem: Clique and nodal inequalities revisited. |
Comput. Oper. Res. |
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. |
Comput. Oper. Res. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Guang Ouyang, Dipak K. Dey, Panpan Zhang |
Clique-Based Method for Social Network Clustering. |
J. Classif. |
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. |
Multim. Tools Appl. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Andrej Jursa, Mária Markosová, Boris Rudolf |
About clique number estimates and exact enumeration in scale-free networks. |
J. Complex Networks |
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. |
IEICE Trans. Fundam. Electron. Commun. Comput. Sci. |
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. |
SIAM J. Discret. Math. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Michael Lampis |
Finer Tight Bounds for Coloring on Clique-Width. |
SIAM J. Discret. Math. |
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. |
SIAM J. Discret. Math. |
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. |
J. Graph Algorithms Appl. |
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. |
Artif. Intell. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Anurag Bishnoi, Ferdinand Ihringer, Valentina Pepe |
A Construction for Clique-Free Pseudorandom Graphs. |
Comb. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Kazunori Sakurama, Hyo-Sung Ahn |
Multi-agent coordination over local indexes via clique-based distributed assignment. |
Autom. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Marek Chrobak, Christoph Dürr, Aleksander Fabijan, Bengt J. Nilsson |
Online Clique Clustering. |
Algorithmica |
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. |
Algorithmica |
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. |
Algorithmica |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Csilla Bujtás, Akbar Davoodi, Ervin Györi, Zsolt Tuza |
Clique coverings and claw-free graphs. |
Eur. J. Comb. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Noga Alon, Ryan Alweiss |
On the product dimension of clique factors. |
Eur. J. Comb. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Keren Censor-Hillel, Dean Leitersdorf, Elia Turner |
Sparse matrix multiplication and triangle listing in the Congested Clique model. |
Theor. Comput. Sci. |
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. |
Theor. Comput. Sci. |
2020 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license