| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 12 | Pedro Montealegre 0001, Sebastian Perez-Salazar, Ivan Rapaport, Ioan Todinca |
Graph reconstruction in the congested clique.  |
J. Comput. Syst. Sci.  |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma |
Clique-width and well-quasi-ordering of triangle-free graph classes. |
J. Comput. Syst. Sci. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Xiaofen Wang, Jun Chen 0001, Kui Jiang, Zhen Han, Weijian Ruan, Zhongyuan Wang 0001, Chao Liang |
Single image de-raining via clique recursive feedback mechanism. |
Neurocomputing |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Saber Jafarizadeh |
Fastest Mixing Reversible Markov Chain: Clique Lifted Graphs and Subgraphs. |
IEEE Trans. Signal Inf. Process. over Networks |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Seyed Ali Saberali, Lutz Lampe, Ian F. Blake |
Full Characterization of Optimal Uncoded Placement for the Structured Clique Cover Delivery of Nonuniform Demands. |
IEEE Trans. Inf. Theory |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Sunyoung Kim, Masakazu Kojima, Kim-Chuan Toh |
Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures. |
J. Glob. Optim. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Artur Czumaj, Peter Davies, Merav Parter |
Simple, Deterministic, Constant-Round Coloring in the Congested Clique. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 12 | Ilan Doron Arad, Hadas Shachnai |
An APTAS for Bin Packing with Clique-graph Conflicts. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 12 | Onur Çagirici, Petr Hlinený, Filip Pokrývka, Abhisekh Sankaran |
Clique-Width of Point Configurations. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 12 | Ivan Bliznets, Danil Sagunov |
Maximizing Happiness in Graphs of Bounded Clique-Width. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 12 | Laxman Dhulipala, Quanquan C. Liu, Julian Shun |
Parallel Batch-Dynamic k-Clique Counting. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 12 | Jay Mardia |
Is the space complexity of planted clique recovery the same as that of detection? |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 12 | Yanhao Yang, Pan Shi, Yuyi Wang 0001, Kun He 0001 |
Quadratic Optimization based Clique Expansion for Overlapping Community Detection. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 12 | Yi Chu, Chuan Luo 0002, Holger H. Hoos, Qingwei Lin, Haihang You |
Improving the Performance of Stochastic Local Search for Maximum Vertex Weight Clique Problem Using Programming by Optimization. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 12 | Tiantu Xu, Kaiwen Shen, Yang Fu, Humphrey Shi, Felix Xiaozhu Lin |
Clique: Spatiotemporal Object Re-identification at the City Scale. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 12 | Gwenaël Joret, Piotr Micek, Bruce A. Reed, Michiel H. M. Smid |
Tight Bounds on The Clique Chromatic Number. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 12 | Ioannis Avramopoulos |
A polynomial algorithm for the maximum clique. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 12 | Samuel Bateman, Kyle Harlow, Christoffer Heckman |
Better Together: Online Probabilistic Clique Change Detection in 3D Landmark-Based Maps. |
CoRR |
2020 |
DBLP 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. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 12 | Guillaume Ducoffe |
Optimal diameter computation within bounded clique-width graphs. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 12 | Nicolas Grelier |
Computing a maximum clique in geometric superclasses of disk graphs. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 12 | Anuj Dawar, Abhisekh Sankaran |
MSO Undecidability for some Hereditary Classes of Unbounded Clique-Width. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 12 | Andreas Emil Feldmann, Davis Issac, Ashutosh Rai 0001 |
Fixed-Parameter Tractability of the Weighted Edge Clique Partition Problem. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 12 | Chandler Squires, Sara Magliacane, Kristjan H. Greenewald, Dmitriy Katz, Murat Kocaoglu, Karthikeyan Shanmugam |
Active Structure Learning of Causal DAGs via Directed Clique Tree. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 12 | Arpita Sanyal (Bhaduri), Amit Saha, Banani Saha, Amlan Chakrabarti |
Circuit Synthesis of Maximum Clique Problem using Combinatorial Approach of Classical-Quantum Hybrid Model. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 12 | Bruno Courcelle, Irène Durand, Michael Raskin |
A unified algorithm for colouring graphs of bounded clique-width. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 12 | Mathew C. Francis, Rian Neogi, Venkatesh Raman 0001 |
Recognizing k-Clique Extendible Orderings. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 12 | Uriel Feige, Vadim Grinberg |
How to hide a clique? |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 12 | Édouard Bonnet, Nicolas Grelier, Tillmann Miltzow |
Maximum Clique in Disk-Like Intersection Graphs. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 12 | Apurba Das, Seyed-Vahid Sanei-Mehri, Srikanta Tirthapura |
Shared-Memory Parallel Maximal Clique Enumeration from Static and Dynamic Graphs. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 12 | Michal Dory, Merav Parter |
Exponentially Faster Shortest Paths in the Congested Clique. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 12 | Jessica Shi 0001, Laxman Dhulipala, Julian Shun |
Parallel Clique Counting and Peeling Algorithms. |
CoRR |
2020 |
DBLP 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. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 12 | Lars Jaffke, Paloma T. Lima, Geevarghese Philip |
Structural Parameterizations of Clique Coloring. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 12 | Yuetian Luo, Anru R. Zhang |
Open Problem: Average-Case Hardness of Hypergraphic Planted Clique Detection. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 12 | Pasin Manurangsi, Aviad Rubinstein, Tselil Schramm |
The Strongish Planted Clique Hypothesis and Its Consequences. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 12 | Antares Chen, Jonathan Shi, Luca Trevisan |
Cut Sparsification of the Clique Beyond the Ramanujan Bound. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 12 | Clément Dallard, Martin Milanic, Kenny Storgel |
Treewidth versus clique number in graph classes with a forbidden structure. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 12 | Xiaofan Li 0004, Rui Zhou 0001, Lu Chen 0008, Chengfei Liu, Qiang He 0001, Yun Yang 0001 |
Efficiently Finding a Maximal Clique Summary via Effective Sampling. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 12 | Lars Jaffke, Paloma T. Lima, Daniel Lokshtanov |
b-Coloring Parameterized by Clique-Width. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 12 | Shweta Jain 0003, C. Seshadhri 0001 |
The Power of Pivoting for Exact Clique Counting. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 12 | Konrad K. Dabrowski, Tomás Masarík, Jana Novotná 0001, Daniël Paulusma, Pawel Rzazewski |
Clique-Width: Harnessing the Power of Atoms. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
| 12 | Ender Sevinç, Tansel Dökeroglu |
A novel parallel local search algorithm for the maximum vertex weight clique problem in large graphs. |
Soft Comput. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Alexander Zhou, Yue Wang 0012, Lei Chen 0002 |
Finding Large Diverse Communities on Networks: The Edge Maximum k*-Partite Clique. |
Proc. VLDB Endow. |
2020 |
DBLP BibTeX RDF |
|
| 12 | Bintao Sun, Maximilien Danisch, T.-H. Hubert Chan, Mauro Sozio |
KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs. (PDF / PS) |
Proc. VLDB Endow. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Ronghua Li, Sen Gao, Lu Qin 0001, Guoren Wang, Weihua Yang, Jeffrey Xu Yu |
Ordering Heuristics for k-clique Listing. |
Proc. VLDB Endow. |
2020 |
DBLP BibTeX RDF |
|
| 12 | Jovan Blanusa, Radu Stoica, Paolo Ienne, Kubilay Atasu |
Many-Core Clique Enumeration with Fast Set Intersections. |
Proc. VLDB Endow. |
2020 |
DBLP BibTeX RDF |
|
| 12 | Peizhong Yang, Lizhen Wang 0001, Xiaoxuan Wang |
A MapReduce approach for spatial co-location pattern mining via ordered-clique-growth. |
Distributed Parallel Databases |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Farzaneh Nasirian, Foad Mahdavi Pajouh, Balabhaskar Balasundaram |
Detecting a most closeness-central clique in complex networks. |
Eur. J. Oper. Res. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Qing Zhou, Una Benlic, Qinghua Wu 0002 |
An opposition-based memetic algorithm for the maximum quasi-clique problem. |
Eur. J. Oper. Res. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Matthew Hayes, Derrick Mullins |
The minimum weight clique partition problem and its application to structural variant calling. |
Int. J. Comput. Biol. Drug Des. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Akbar Davoodi, Dániel Gerbner, Abhishek Methuku, Máté Vizer |
On clique coverings of complete multipartite graphs. |
Discret. Appl. Math. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Andreas Bärmann, Patrick Gemander, Maximilian Merkert |
The clique problem with multiple-choice constraints under a cycle-free dependency graph. |
Discret. Appl. Math. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Bruno Courcelle |
On quasi-planar graphs: Clique-width and logical description. |
Discret. Appl. Math. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Miguel A. Pizaña, I. A. Robles |
On bicliques and the second clique graph of suspensions. |
Discret. Appl. Math. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Sandip Das 0001, Prantar Ghosh, Swathy Prabhu, Sagnik Sen 0001 |
Relative clique number of planar signed graphs. |
Discret. Appl. Math. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Bruno Courcelle |
Grammars and clique-width bounds from split decompositions. |
Discret. Appl. Math. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Irena Penev |
On the clique-width of (4K1, C4, C5, C7)-free graphs. |
Discret. Appl. Math. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Andrei M. Raigorodskii, Mikhail M. Koshelev |
New bounds on clique-chromatic numbers of Johnson graphs. |
Discret. Appl. Math. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Liliana Alcón, Miguel A. Pizaña, Gabriela Ravenna |
Two infinite families of critical clique-Helly graphs. |
Discret. Appl. Math. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Enrico L. Enriquez, Albert D. Ngujo |
Clique doubly connected domination in the join and lexicographic product of graphs. |
Discret. Math. Algorithms Appl. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Apurba Das, Seyed-Vahid Sanei-Mehri, Srikanta Tirthapura |
Shared-memory Parallel Maximal Clique Enumeration from Static and Dynamic Graphs. |
ACM Trans. Parallel Comput. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Satoshi Shimizu, Kazuaki Yamaguchi, Sumio Masuda |
A maximum edge-weight clique extraction algorithm based on branch-and-bound. |
Discret. Optim. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Christian Trudeau, Juan J. Vidal-Puga |
Clique games: A family of games with coincidence between the nucleolus and the Shapley value. |
Math. Soc. Sci. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Parikshit Saikia, Sushanta Karmakar |
Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE. |
Int. J. Found. Comput. Sci. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Fei Hao 0001, Zheng Pei 0001, Laurence T. Yang |
Diversified top-k maximal clique detection in Social Internet of Things. |
Future Gener. Comput. Syst. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Niusvel Acosta-Mendoza, Jesús Ariel Carrasco-Ochoa, José Francisco Martínez Trinidad, Andrés Gago Alonso, José Eladio Medina-Pagola |
Mining clique frequent approximate subgraphs from multi-graph collections. |
Appl. Intell. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Lingling Zhang, Hong Jiang 0001, Fang Wang 0001, Dan Feng 0001 |
DRaWS: A dual random-walk based sampling method to efficiently estimate distributions of degree and clique size over social networks. |
Knowl. Based Syst. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Benoit Larras, Antoine Frappé |
On the Distribution of Clique-Based Neural Networks for Edge AI. |
IEEE J. Emerg. Sel. Topics Circuits Syst. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Ana L. C. Bazzan |
I will be there for you: clique, character centrality, and community detection in Friends. |
Comput. Appl. Math. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Roberto Fellin, Mariano Ceccato |
Experimental assessment of XOR-Masking data obfuscation based on K-Clique opaque constants. |
J. Syst. Softw. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Michael Guyer, Jessica McDonald |
On clique immersions in line graphs. |
Discret. Math. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Rachel Kirsch, A. J. Radcliffe |
Maximizing the density of Kt's in graphs of bounded degree and clique number. |
Discret. Math. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Zuosong Liang, Jianliang Wu, Erfang Shan |
List-coloring clique-hypergraphs of K5-minor-free graphs strongly. |
Discret. Math. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Gang Li 0029, Biao Ma, Shuanhai He, Xueli Ren, Qiangwei Liu |
Automatic Tunnel Crack Detection Based on U-Net and a Convolutional Neural Network with Alternately Updated Clique. |
Sensors |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Ahmed Douik, Hayssam Dahrouj, Tareq Y. Al-Naffouri, Mohamed-Slim Alouini |
A Tutorial on Clique Problems in Communications and Signal Processing. |
Proc. IEEE |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Zhou Zhou 0001, Zhuopeng Xiao, Weihong Deng |
Improved community structure discovery algorithm based on combined clique percolation method and K-means algorithm. |
Peer-to-Peer Netw. Appl. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Ran Mo, Zhen Yin |
Exploring software bug-proneness based on evolutionary clique modeling and analysis. |
Inf. Softw. Technol. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Kazunori Sakurama |
Clique-Based Distributed PI Control for Multiagent Coordination With Heterogeneous, Uncertain, Time-Varying Orientations. |
IEEE Trans. Control. Netw. Syst. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Yun Peng, Yitong Xu, Huawei Zhao, Zhizheng Zhou, Huimin Han |
Most similar maximal clique query on large graphs. |
Frontiers Comput. Sci. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Derek H. Smith, Roberto Montemanni, Stephanie Perkins |
The Use of an Exact Algorithm within a Tabu Search Maximum Clique Algorithm. |
Algorithms |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Maosheng Zhong, Chao Jiang, Lan Tao, Xiong He, Yuansheng Luo |
基于局部有限搜索的无向图近似最大团快速求解算法 (Quick Algorithm to Find an Approximate Maximum Clique in Undirected Graph by Using Local-limited Search Strategy). |
计算机科学 |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Vilakone Phonexay, Khamphaphone Xinchang, Doo-Soon Park |
Movie Recommendation System Based on Users' Personal Information and Movies Rated Using the Method of k-Clique and Normalized Discounted Cumulative Gain. |
J. Inf. Process. Syst. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Alessio Conte, Roberto Grossi, Andrea Marino 0001 |
Large-scale clique cover of real-world networks. |
Inf. Comput. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Inácio de Sousa Fadigas, Marcos Grilo Rosa, Trazíbulo Henrique, Hernane Borges de Barros Pereira |
FIFA World Cup referees' networks: a constant-size clique approach. |
Soc. Netw. Anal. Min. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Yi Chu, Boxiao Liu, Shaowei Cai 0001, Chuan Luo 0002, Haihang You |
An efficient local search algorithm for solving maximum edge weight clique problem in large graphs. |
J. Comb. Optim. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Parinya Chalermsook, Marek Cygan, Guy Kortsarz, Bundit Laekhanukit, Pasin Manurangsi, Danupon Nanongkai, Luca Trevisan |
From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More. |
SIAM J. Comput. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Lijun Chang |
Efficient maximum clique computation and enumeration over large sparse graphs. |
VLDB J. |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Shin-Fang Ch'ng, Naoya Sogi, Pulak Purkait, Tat-Jun Chin, Kazuhiro Fukui |
Resolving Marker Pose Ambiguity by Robust Rotation Averaging with Clique Constraints*. |
ICRA |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Giovanna Fortez, Franco Robledo, Pablo Romero, Omar Viera |
A Fast Genetic Algorithm for the Max Cut-Clique Problem. |
LOD (1) |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Samuel Bateman, Kyle Harlow, Christoffer Heckman |
Better Together: Online Probabilistic Clique Change Detection in 3D Landmark-Based Maps. |
IROS |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Soura Sena Das, Soumen Nandi, Sagnik Sen 0001 |
The Relative Oriented Clique Number of Triangle-Free Planar Graphs Is 10. |
CALDAM |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Zi Chen, Long Yuan, Xuemin Lin 0001, Lu Qin 0001, Jianye Yang |
Efficient Maximal Balanced Clique Enumeration in Signed Networks. |
WWW |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Yangdi Lyu, Prabhat Mishra 0001 |
Automated Trigger Activation by Repeated Maximal Clique Sampling. |
ASP-DAC |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Uriel Feige, Vadim Grinberg |
How to Hide a Clique? |
ICALP |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Wei Song 0004, Qian Qiao |
Mining High Utility Co-location Patterns Using the Maximum Clique and the Subsume Index. |
BDE |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Lars Jaffke, Paloma T. Lima, Geevarghese Philip |
Structural Parameterizations of Clique Coloring. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Yujie Hu, Xiang Zhang 0006, Yexin Li, Ran Tian |
Online Multiple Object Tracking Using Single Object Tracker and Maximum Weight Clique Graph. |
MMSP |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Onur Çagirici, Petr Hlinený, Filip Pokrývka, Abhisekh Sankaran |
Clique-Width of Point Configurations. |
WG |
2020 |
DBLP DOI BibTeX RDF |
|
| 12 | Clément Dallard, Martin Milanic, Kenny Storgel |
Treewidth Versus Clique Number in Graph Classes with a Forbidden Structure. |
WG |
2020 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license