| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 12 | Martin Milanic, Yushi Uno |
Upper clique transversals in graphs.  |
CoRR  |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Jesper Jansson 0001, Christos Levcopoulos, Andrzej Lingas |
Convex Hulls and Triangulations of Planar Point Sets on the Congested Clique. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner |
Clique Analysis and Bypassing in Continuous-Time Conflict-Based Search. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Martin Winter |
The clique graphs of the hexagonal lattice - an explicit construction and a short proof of divergence. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Peter Werner, Alexandre Amice, Tobia Marcucci, Daniela Rus, Russ Tedrake |
Approximating Robot Configuration Spaces with few Convex Sets using Clique Covers of Visibility Graphs. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Vladimir A. Kobzar, Krishnan Mody |
Revisiting Block-Diagonal SDP Relaxations for the Clique Number of the Paley Graphs. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Kaixin Wang, Kaiqiang Yu, Cheng Long |
Efficient k-Clique Listing: An Edge-Oriented Branching Strategy. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Narek Bojikian, Stefan Kratsch |
A tight Monte-Carlo algorithm for Steiner Tree parameterized by clique-width. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Bochuan Lyu, Illya V. Hicks |
Maximal Clique and Edge-Ranking Bounds of Biclique Cover Number. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Alexis Baudin, Lionel Tabourier, Clémence Magnien |
LSCPM: communities in massive real-world Link Streams by Clique Percolation Method. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Qi Zhang 0010, Rong-Hua Li, Zifan Zheng, Hongchao Qin, Ye Yuan 0001, Guoren Wang |
Efficient Maximum Fair Clique Search over Large Networks. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Yuto Watanabe, Kazunori Sakurama |
Distributed Optimization of Clique-wise Coupled Problems. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Elijah Pelofske |
4-clique network minor embedding for quantum annealers. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Annika Heckel, Marc Kaufmann, Noëla Müller, Matija Pasch |
The hitting time of clique factors. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Haochen Pi, Keith Burghardt, Allon G. Percus, Kristina Lerman |
Clique Densification in Networks. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Guy Bresler, Chenghao Guo, Yury Polyanskiy |
Algorithmic Decorrelation and Planted Clique in Dependent Random Graphs: The Case of Extra Triangles. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Yuto Watanabe, Kazunori Sakurama |
Distributed Optimization of Clique-Wise Coupled Problems via Three-Operator Splitting. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Mariana Escalante, Martín Matamala, Iván Rapaport, Paola B. Tolomei, Luis Miguel Torres |
The Minimum Clique Routing Problem on Cycles. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Falko Hegerfeld, Stefan Kratsch |
Tight algorithms for connectivity problems parameterized by clique-width. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Yijia Chen, Yi Feng, Bundit Laekhanukit, Yanlin Liu |
Simple Combinatorial Construction of the ko(1)-Lower Bound for Approximating the Parameterized k-Clique. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Soumen Nandi, Sagnik Sen 0001, S. Taruni |
On relative clique number of triangle-free planar (n, m)-graphs. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Krit Kanopthamakun, Panupong Vichitkunakorn |
Ramsey numbers of connected 4-clique matching. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Marcin Pilipczuk, Pawel Rzazewski |
A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Alexis Baudin, Clémence Magnien, Lionel Tabourier |
Faster maximal clique enumeration in large real-world link streams. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Kaiqiang Yu, Cheng Long |
Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Guy Bresler, Tianze Jiang |
Detection-Recovery and Detection-Refutation Gaps via Reductions from Planted Clique. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Roman Erhardt, Kathrin Hanauer, Nils M. Kriege, Christian Schulz 0003, Darren Strash |
Improved Exact and Heuristic Algorithms for Maximum Weight Clique. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | David Gamarnik, Elchanan Mossel, Ilias Zadik |
Sharp Thresholds Imply Circuit Lower Bounds: from random 2-SAT to Planted Clique. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Bingkai Lin, Xuandi Ren, Yican Sun, Xiuhan Wang |
Improved Hardness of Approximating k-Clique under ETH. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Pierre Aboulker, Guillaume Aubian, Pierre Charbit, Raul Lopes 0001 |
Clique number of tournaments. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Anthony Hevia, Benjamin Kallus, Summer McClintic, Samantha Reisner, Darren Strash, Johnathan Wilson |
Solving Edge Clique Cover Exactly via Synergistic Data Reduction. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Mircea Marin, Temur Kutsia, Cleo Pau, Mikheil Rukhaia |
Enumerating All Maximal Clique-Partitions of an Undirected Graph. |
FROM |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Brendon Forsgren, Ram Vasudevan, Michael Kaess, Timothy W. McLain, Joshua G. Mangelson |
Group-k consistent measurement set maximization via maximum clique over k-Uniform hypergraphs for robust multi-robot map merging. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Dean Leitersdorf |
The Relationship between APSP and Matrix Multiplication in Congested Clique. |
Bull. EATCS |
2023 |
DBLP BibTeX RDF |
|
| 12 | Arpita Sanyal Bhaduri, Amit Saha, Banani Saha, Amlan Chakrabarti |
Robust quantum circuit for clique problem with intermediate qudits. |
Nano Commun. Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Pablo San Segundo, Fabio Furini, David Álvarez 0001, Panos M. Pardalos |
CliSAT: A new exact algorithm for hard maximum clique problems. |
Eur. J. Oper. Res. |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Haonan Zhong, Foad Mahdavi Pajouh, Oleg A. Prokopyev |
On designing networks resilient to clique blockers. |
Eur. J. Oper. Res. |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Raka Jovanovic, Antonio Sanfilippo, Stefan Voß 0001 |
Fixed set search applied to the clique partitioning problem. |
Eur. J. Oper. Res. |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Andreas Bärmann, Patrick Gemander, Maximilian Merkert, Ann-Kathrin Wiertz, Francisco Javier Zaragoza Martínez |
Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph. |
Discret. Appl. Math. |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Dipayan Chakraborty, Sandip Das 0001, Soumen Nandi, Debdeep Roy, Sagnik Sen 0001 |
On clique numbers of colored mixed graphs. |
Discret. Appl. Math. |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Zhengping Qiu, Zikai Tang, Qiyue Li |
Eccentricity spectral radius of t-clique trees with given diameter. |
Discret. Appl. Math. |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Fanica Gavril |
Maximum max-k-clique subgraphs in cactus subtree graphs. |
Discret. Math. Algorithms Appl. |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Takumi Gomyou |
Embedding and the rotational dimension of a graph containing a clique. |
Discret. Math. Algorithms Appl. |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Joaquín A. Pacheco, Silvia Casado 0001 |
A stepped tabu search method for the clique partitioning problem. |
Appl. Intell. |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Yi Fan, Zaijun Zhang, Quan Yu, Yongxuan Lai, Kaile Su, Yiyuan Wang, Shiwei Pan, Longin Jan Latecki |
Iterated Clique Reductions in Vertex Weighted Coloring for Large Sparse Graphs. |
Entropy |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Karen L. Collins, Megan E. Heenehan, Jessica McDonald |
Clique immersion in graph products. |
Discret. Math. |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Vojtech Dvorák |
Waiter-Client clique-factor game. |
Discret. Math. |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Greg Malen |
Collapsibility of random clique complexes. |
Discret. Math. |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Rafael Villarroel-Flores |
On the clique behavior and Hellyness of the complements of regular graphs. |
Discret. Math. |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Matthew Kahle, Minghao Tian, Yusu Wang 0001 |
On the clique number of noisy random geometric graphs. |
Random Struct. Algorithms |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Lyuben Lichev, Dieter Mitsche, Lutz Warnke |
The jump of the clique chromatic number of random graphs. |
Random Struct. Algorithms |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Qiangqiang Dai, Rong-Hua Li, Meihao Liao, Guoren Wang |
Maximal Defective Clique Enumeration. |
Proc. ACM Manag. Data |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Lijun Chang |
Efficient Maximum k-Defective Clique Computation with Improved Time Complexity. |
Proc. ACM Manag. Data |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Kaiqiang Yu, Cheng Long |
Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach. |
Proc. ACM Manag. Data |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Yizhang He, Kai Wang 0037, Wenjie Zhang 0001, Xuemin Lin 0001, Ying Zhang 0001 |
Scaling Up k-Clique Densest Subgraph Detection. |
Proc. ACM Manag. Data |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Yixuan Yang, Doo-Soon Park, Fei Hao 0001, Sony Peng, Hyejung Lee, Min-Pyo Hong |
Detection of Maximal Balance Clique Using Three-way Concept Lattice. |
J. Inf. Process. Syst. |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Elijah Pelofske, Georg Hahn, Hristo N. Djidjev |
Solving larger maximum clique problems using parallel quantum annealing. |
Quantum Inf. Process. |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Kailun Yan, Jilian Zhang, Yongdong Wu |
Improving Bitcoin Transaction Propagation Efficiency through Local Clique Network. |
Comput. J. |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | B. Praba, M. Logeshwari |
Clique and Independence Number of Rough Co-Zero Divisor Graph and Its Applications in Analyzing a Twitter Data. |
New Math. Nat. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Yan Li, Yusheng Li, Ye Wang |
Maximum clique deleted from ramsey graphs of a graph and paths. |
J. Comb. Optim. |
2023 |
DBLP DOI 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. |
J. Graph Theory |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Yury Demidovich, Maksim Zhukovskii |
Tight asymptotics of clique-chromatic numbers of dense random graphs. |
J. Graph Theory |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Mohammad Almasri, Yen-Hsiang Chang, Izzat El Hajj, Rakesh Nagi, Jinjun Xiong, Wen-mei W. Hwu |
Parallelizing Maximal Clique Enumeration on GPUs. |
PACT |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Shweta Jain 0007, Yosuke Mizutani, Blair D. Sullivan |
An Exponentially Smaller Kernel for Exact Weighted Clique Decomposition. |
ACDA |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Dongqi Fu, Dawei Zhou 0003, Ross Maciejewski, Arie Croitoru, Marcus Boyd, Jingrui He |
Fairness-Aware Clique-Preserving Spectral Clustering of Temporal Graphs. |
WWW |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Bingkai Lin, Xuandi Ren, Yican Sun, Xiuhan Wang |
Improved Hardness of Approximating k-Clique under ETH. |
FOCS |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Guy Bresler, Chenghao Guo, Yury Polyanskiy |
Algorithmic Decorrelation and Planted Clique in Dependent Random Graphs: The Case of Extra Triangles. |
FOCS |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Susanna F. de Rezende, Aaron Potechin, Kilian Risse |
Clique Is Hard on Average for Unary Sherali-Adams. |
FOCS |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Anthony Hevia, Benjamin Kallus, Summer McClintic, Samantha Reisner, Darren Strash, Johnathan Wilson |
Solving Edge Clique Cover Exactly via Synergistic Data Reduction. |
ESA |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Falko Hegerfeld, Stefan Kratsch |
Tight Algorithms for Connectivity Problems Parameterized by Clique-Width. |
ESA |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Sam Coy, Artur Czumaj, Peter Davies, Gopinath Mishra |
Optimal (Degree+1)-Coloring in Congested Clique. |
ICALP |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Manish Kumar |
Fault-Tolerant Graph Realizations in the Congested Clique, Revisited. |
ICDCIT |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Jared Espenant, J. Mark Keil, Debajyoti Mondal |
Finding a Maximum Clique in a Disk Graph. |
SoCG |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Mikkel Abrahamsen, William Bille Meyling, André Nusser |
Constructing Concise Convex Covers via Clique Covers (CG Challenge). |
SoCG |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Yuto Watanabe, Kazunori Sakurama |
Distributed Optimization of Clique-Wise Coupled Problems. |
CDC |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Yufeng Zhang, Shiyuan Liu, Yanping Wu, Lu Qin 0001, Ying Zhang |
Efficient Maximum Relative Fair Clique Computation in Attributed Graphs. |
ADC |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | K. P. Naveen |
Spectrum Sharing in 5G NR-U as Network Utility Maximization with Clique Constraints. |
GLOBECOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Vera Chekan, Stefan Kratsch |
Tight Algorithmic Applications of Clique-Width Generalizations. |
MFCS |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Pratyush Arya, Nisheeth Srivastava |
Understanding Clique Formation in Social Networks - An Agent-Based Model of Social Preferences in Fixed and Dynamic Networks. |
SBP-BRiMS |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Martin Milanic, Yushi Uno |
Upper Clique Transversals in Graphs. |
WG |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Afton Geil, Serban D. Porumbescu, John D. Owens |
Maximum Clique Enumeration on the GPU. |
IPDPS Workshops |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Simon Ståhlberg |
Lifted Successor Generation by Maximum Clique Enumeration. |
ECAI |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Erika Morais Martins Coelho, H. Coelho, L. Faria, M. P. Ferreira, S. Klein |
On the absolute and relative oriented clique problems' time complexity. |
LAGOS |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Bence Bakó, Dániel Nagy, Péter Hága, Zsófia Kallus, Zoltán Zimborás |
Space-Efficient Embedding of the Clique Cover Problem for Quantum Optimization. |
QCE |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Gatis Melkus, Sandra Silina, Andrejs Sizovs, Peteris Rucevskis, Lelde Lace, Edgars Celms, Juris Viksna |
Clique-Based Topological Characterization of Chromatin Interaction Hubs. |
ISBRA |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Yuki Kashihara, Kazuaki Yamaguchi, Masahide Nakamura |
An experimental evaluation of upper bounds of clique weights based on graph coloring. |
BCD |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Elias Dahlhaus, Bernhard Ganter |
Examples of Clique Closure Systems. |
ICFCA |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Peter Robinson 0002 |
Brief Announcement: What Can We Compute in a Single Round of the Congested Clique? |
PODC |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Sebastian Forster, Tijn de Vos |
Brief Announcement: The Laplacian Paradigm in Deterministic Congested Clique. |
PODC |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Jonathan Fontaine, Mohamed Benazouz, Lilia Zaourar, Roselyne Chotin |
Improving Integrated Circuit Security Using Mathematical Model Based on Clique Covering Reformulation. |
CoDIT |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Alexis Baudin, Lionel Tabourier, Clémence Magnien |
LSCPM: Communities in Massive Real-World Link Streams by Clique Percolation Method. |
TIME |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Guy Bresler, Tianze Jiang |
Detection-Recovery and Detection-Refutation Gaps via Reductions from Planted Clique. |
COLT |
2023 |
DBLP BibTeX RDF |
|
| 12 | Pravesh Kothari, Santosh S. Vempala, Alexander S. Wein, Jeff Xu |
Is Planted Coloring Easier than Planted Clique? |
COLT |
2023 |
DBLP BibTeX RDF |
|
| 12 | Rares-Darius Buhai, Pravesh K. Kothari, David Steurer |
Algorithms Approaching the Threshold for Semi-random Planted Clique. |
STOC |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Marco D'Elia, Irene Finocchi, Maurizio Patrignani |
Clique-TF-IDF: A New Partitioning Framework Based on Dense Substructures. |
AI*IA |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Yun Young Choi, Sun Woo Park, Youngho Woo, U Jin Choi |
Cycle to Clique (Cy2C) Graph Neural Network: A Sight to See beyond Neighborhood Aggregation. |
ICLR |
2023 |
DBLP BibTeX RDF |
|
| 12 | Dmitriy Kunisky, Xifan Yu |
A Degree 4 Sum-Of-Squares Lower Bound for the Clique Number of the Paley Graph. |
CCC |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Dale Kim, Qing Zhou |
Structure Learning of Latent Factors via Clique Search on Correlation Thresholded Graphs. |
ICML |
2023 |
DBLP BibTeX RDF |
|
| 12 | Bart M. P. Jansen, Shivesh Kumar Roy |
Sunflowers Meet Sparsity: A Linear-Vertex Kernel for Weighted Clique-Packing on Sparse Graphs. |
IPEC |
2023 |
DBLP DOI BibTeX RDF |
|
| 12 | Li Qiaochen, Xuguang Bao |
A Spatial Maximal Co-location Pattern Mining Algorithm Based on Maximal Clique. |
CyberC |
2023 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license