Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
12 | Martin Milanic, Yushi Uno |
Upper clique transversals in graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2309.14103, 2023. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2305.09987, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner |
Clique Analysis and Bypassing in Continuous-Time Conflict-Based Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2312.16106, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Martin Winter |
The clique graphs of the hexagonal lattice - an explicit construction and a short proof of divergence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2307.11238, 2023. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2310.02875, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Vladimir A. Kobzar, Krishnan Mody |
Revisiting Block-Diagonal SDP Relaxations for the Clique Number of the Paley Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2304.08615, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Kaixin Wang, Kaiqiang Yu, Cheng Long |
Efficient k-Clique Listing: An Edge-Oriented Branching Strategy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2311.13798, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Narek Bojikian, Stefan Kratsch |
A tight Monte-Carlo algorithm for Steiner Tree parameterized by clique-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2307.14264, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Bochuan Lyu, Illya V. Hicks |
Maximal Clique and Edge-Ranking Bounds of Biclique Cover Number. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2302.12775, 2023. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2308.10801, 2023. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2312.04088, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Yuto Watanabe, Kazunori Sakurama |
Distributed Optimization of Clique-wise Coupled Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2304.10904, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Elijah Pelofske |
4-clique network minor embedding for quantum annealers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2301.08807, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Annika Heckel, Marc Kaufmann, Noëla Müller, Matija Pasch |
The hitting time of clique factors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2302.08340, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Haochen Pi, Keith Burghardt, Allon G. Percus, Kristina Lerman |
Clique Densification in Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2304.03479, 2023. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2305.09995, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Yuto Watanabe, Kazunori Sakurama |
Distributed Optimization of Clique-Wise Coupled Problems via Three-Operator Splitting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2310.18625, 2023. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2311.10055, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Falko Hegerfeld, Stefan Kratsch |
Tight algorithms for connectivity problems parameterized by clique-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2302.03627, 2023. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2304.07516, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Soumen Nandi, Sagnik Sen 0001, S. Taruni |
On relative clique number of triangle-free planar (n, m)-graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2306.08052, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Krit Kanopthamakun, Panupong Vichitkunakorn |
Ramsey numbers of connected 4-clique matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2306.08412, 2023. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2310.11573, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Alexis Baudin, Clémence Magnien, Lionel Tabourier |
Faster maximal clique enumeration in large real-world link streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2302.00360, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Kaiqiang Yu, Cheng Long |
Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2305.14047, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Guy Bresler, Tianze Jiang |
Detection-Recovery and Detection-Refutation Gaps via Reductions from Planted Clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2306.17719, 2023. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2302.00458, 2023. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2311.04204, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Bingkai Lin, Xuandi Ren, Yican Sun, Xiuhan Wang |
Improved Hardness of Approximating k-Clique under ETH. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2304.02943, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Pierre Aboulker, Guillaume Aubian, Pierre Charbit, Raul Lopes 0001 |
Clique number of tournaments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2310.04265, 2023. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2306.17804, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Mircea Marin, Temur Kutsia, Cleo Pau, Mikheil Rukhaia |
Enumerating All Maximal Clique-Partitions of an Undirected Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FROM ![In: Proceedings 7th Symposium on Working Formal Methods, FROM 2023, Bucharest, Romania, 21-22 September 2023., pp. 65-79, 2023. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2308.02674, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Dean Leitersdorf |
The Relationship between APSP and Matrix Multiplication in Congested Clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Bull. EATCS ![In: Bull. EATCS 141, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
12 | Arpita Sanyal Bhaduri, Amit Saha, Banani Saha, Amlan Chakrabarti |
Robust quantum circuit for clique problem with intermediate qudits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Nano Commun. Networks ![In: Nano Commun. Networks 37, pp. 100466, September 2023. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 307(3), pp. 1008-1025, June 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Haonan Zhong, Foad Mahdavi Pajouh, Oleg A. Prokopyev |
On designing networks resilient to clique blockers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 307(1), pp. 20-32, May 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Raka Jovanovic, Antonio Sanfilippo, Stefan Voß 0001 |
Fixed set search applied to the clique partitioning problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 309(1), pp. 65-81, August 2023. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 324, pp. 145-166, 2023. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 324, pp. 29-40, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Zhengping Qiu, Zikai Tang, Qiyue Li |
Eccentricity spectral radius of t-clique trees with given diameter. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 337, pp. 202-217, October 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Fanica Gavril |
Maximum max-k-clique subgraphs in cactus subtree graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. Algorithms Appl. ![In: Discret. Math. Algorithms Appl. 15(6), pp. 2250147:1-2250147:16, August 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Takumi Gomyou |
Embedding and the rotational dimension of a graph containing a clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. Algorithms Appl. ![In: Discret. Math. Algorithms Appl. 15(1), pp. 2250061:1-2250061:13, January 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Joaquín A. Pacheco, Silvia Casado 0001 |
A stepped tabu search method for the clique partitioning problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Intell. ![In: Appl. Intell. 53(12), pp. 16275-16292, June 2023. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Entropy ![In: Entropy 25(10), pp. 1376, October 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Karen L. Collins, Megan E. Heenehan, Jessica McDonald |
Clique immersion in graph products. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 346(8), pp. 113421, August 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Vojtech Dvorák |
Waiter-Client clique-factor game. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 346(1), pp. 113191, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Greg Malen |
Collapsibility of random clique complexes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 346(3), pp. 113267, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Rafael Villarroel-Flores |
On the clique behavior and Hellyness of the complements of regular graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 346(2), pp. 113230, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Matthew Kahle, Minghao Tian, Yusu Wang 0001 |
On the clique number of noisy random geometric graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Random Struct. Algorithms ![In: Random Struct. Algorithms 63(1), pp. 242-279, August 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI 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) |
Random Struct. Algorithms ![In: Random Struct. Algorithms 62(4), pp. 1016-1034, July 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Qiangqiang Dai, Rong-Hua Li, Meihao Liao, Guoren Wang |
Maximal Defective Clique Enumeration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proc. ACM Manag. Data ![In: Proc. ACM Manag. Data 1(1), pp. 77:1-77:26, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Lijun Chang |
Efficient Maximum k-Defective Clique Computation with Improved Time Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proc. ACM Manag. Data ![In: Proc. ACM Manag. Data 1(3), pp. 209:1-209:26, September 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Kaiqiang Yu, Cheng Long |
Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proc. ACM Manag. Data ![In: Proc. ACM Manag. Data 1(3), pp. 211:1-211:26, September 2023. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proc. ACM Manag. Data ![In: Proc. ACM Manag. Data 1(1), pp. 69:1-69:26, 2023. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Inf. Process. Syst. ![In: J. Inf. Process. Syst. 19(2), pp. 189-202, April 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Elijah Pelofske, Georg Hahn, Hristo N. Djidjev |
Solving larger maximum clique problems using parallel quantum annealing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Quantum Inf. Process. ![In: Quantum Inf. Process. 22(5), pp. 219, May 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Kailun Yan, Jilian Zhang, Yongdong Wu |
Improving Bitcoin Transaction Propagation Efficiency through Local Clique Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. J. ![In: Comput. J. 66(2), pp. 318-332, February 2023. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
New Math. Nat. Comput. ![In: New Math. Nat. Comput. 19(2), pp. 473-487, July 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Yan Li, Yusheng Li, Ye Wang |
Maximum clique deleted from ramsey graphs of a graph and paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 46(1), pp. 2, August 2023. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 104(4), pp. 769-810, December 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Yury Demidovich, Maksim Zhukovskii |
Tight asymptotics of clique-chromatic numbers of dense random graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 103(3), pp. 451-461, July 2023. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PACT ![In: 32nd International Conference on Parallel Architectures and Compilation Techniques, PACT 2023, Vienna, Austria, October 21-25, 2023, pp. 162-175, 2023, IEEE, 979-8-3503-4254-3. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Shweta Jain 0007, Yosuke Mizutani, Blair D. Sullivan |
An Exponentially Smaller Kernel for Exact Weighted Clique Decomposition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACDA ![In: SIAM Conference on Applied and Computational Discrete Algorithms, ACDA 2023, Seattle, WA, USA, May 31 - June 2, 2023, pp. 119-133, 2023, SIAM, 978-1-61197-771-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WWW ![In: Proceedings of the ACM Web Conference 2023, WWW 2023, Austin, TX, USA, 30 April 2023 - 4 May 2023, pp. 3755-3765, 2023, ACM, 978-1-4503-9416-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Bingkai Lin, Xuandi Ren, Yican Sun, Xiuhan Wang |
Improved Hardness of Approximating k-Clique under ETH. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023, Santa Cruz, CA, USA, November 6-9, 2023, pp. 285-306, 2023, IEEE, 979-8-3503-1894-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023, Santa Cruz, CA, USA, November 6-9, 2023, pp. 2149-2158, 2023, IEEE, 979-8-3503-1894-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Susanna F. de Rezende, Aaron Potechin, Kilian Risse |
Clique Is Hard on Average for Unary Sherali-Adams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023, Santa Cruz, CA, USA, November 6-9, 2023, pp. 12-25, 2023, IEEE, 979-8-3503-1894-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 31st Annual European Symposium on Algorithms, ESA 2023, September 4-6, 2023, Amsterdam, The Netherlands, pp. 61:1-61:19, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-295-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Falko Hegerfeld, Stefan Kratsch |
Tight Algorithms for Connectivity Problems Parameterized by Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 31st Annual European Symposium on Algorithms, ESA 2023, September 4-6, 2023, Amsterdam, The Netherlands, pp. 59:1-59:19, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-295-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Sam Coy, Artur Czumaj, Peter Davies, Gopinath Mishra |
Optimal (Degree+1)-Coloring in Congested Clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, July 10-14, 2023, Paderborn, Germany, pp. 46:1-46:20, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-278-5. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Manish Kumar |
Fault-Tolerant Graph Realizations in the Congested Clique, Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCIT ![In: Distributed Computing and Intelligent Technology - 19th International Conference, ICDCIT 2023, Bhubaneswar, India, January 18-22, 2023, Proceedings, pp. 84-97, 2023, Springer, 978-3-031-24847-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Jared Espenant, J. Mark Keil, Debajyoti Mondal |
Finding a Maximum Clique in a Disk Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 39th International Symposium on Computational Geometry, SoCG 2023, June 12-15, 2023, Dallas, Texas, USA, pp. 30:1-30:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-273-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Mikkel Abrahamsen, William Bille Meyling, André Nusser |
Constructing Concise Convex Covers via Clique Covers (CG Challenge). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 39th International Symposium on Computational Geometry, SoCG 2023, June 12-15, 2023, Dallas, Texas, USA, pp. 66:1-66:9, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-273-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Yuto Watanabe, Kazunori Sakurama |
Distributed Optimization of Clique-Wise Coupled Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CDC ![In: 62nd IEEE Conference on Decision and Control, CDC 2023, Singapore, December 13-15, 2023, pp. 296-302, 2023, IEEE, 979-8-3503-0124-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ADC ![In: Databases Theory and Applications - 34th Australasian Database Conference, ADC 2023, Melbourne, VIC, Australia, November 1-3, 2023, Proceedings, pp. 301-312, 2023, Springer, 978-3-031-47842-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | K. P. Naveen |
Spectrum Sharing in 5G NR-U as Network Utility Maximization with Clique Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GLOBECOM ![In: IEEE Global Communications Conference, GLOBECOM 2023, Kuala Lumpur, Malaysia, December 4-8, 2023, pp. 381-387, 2023, IEEE, 979-8-3503-1090-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Vera Chekan, Stefan Kratsch |
Tight Algorithmic Applications of Clique-Width Generalizations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: 48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023, August 28 to September 1, 2023, Bordeaux, France, pp. 35:1-35:15, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-292-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SBP-BRiMS ![In: Social, Cultural, and Behavioral Modeling - 16th International Conference, SBP-BRiMS 2023, Pittsburgh, PA, USA, September 20-22, 2023, Proceedings, pp. 231-240, 2023, Springer, 978-3-031-43128-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Martin Milanic, Yushi Uno |
Upper Clique Transversals in Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers, pp. 432-446, 2023, Springer, 978-3-031-43379-5. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Afton Geil, Serban D. Porumbescu, John D. Owens |
Maximum Clique Enumeration on the GPU. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS Workshops ![In: IEEE International Parallel and Distributed Processing Symposium, IPDPS 2023 - Workshops, St. Petersburg, FL, USA, May 15-19, 2023, pp. 234-244, 2023, IEEE, 979-8-3503-1199-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Simon Ståhlberg |
Lifted Successor Generation by Maximum Clique Enumeration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECAI ![In: ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland - Including 12th Conference on Prestigious Applications of Intelligent Systems (PAIS 2023), pp. 2194-2201, 2023, IOS Press, 978-1-64368-436-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LAGOS ![In: Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, LAGOS 2023, Huatulco, Mexico, September 18-22, 2023., pp. 275-282, 2023, Elsevier. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
QCE ![In: IEEE International Conference on Quantum Computing and Engineering, QCE 2023, Bellevue, WA, USA, September 17-22, 2023, pp. 409-410, 2023, IEEE, 979-8-3503-4323-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISBRA ![In: Bioinformatics Research and Applications - 19th International Symposium, ISBRA 2023, Wrocław, Poland, October 9-12, 2023, Proceedings, pp. 476-486, 2023, Springer, 978-981-99-7073-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BCD ![In: 8th IEEE/ACIS International Conference on Big Data, Cloud Computing, and Data Science, BCD 2023, Hochimin City, Vietnam, December 14-16, 2023, pp. 222-230, 2023, IEEE, 979-8-3503-7361-5. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Elias Dahlhaus, Bernhard Ganter |
Examples of Clique Closure Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFCA ![In: Formal Concept Analysis - 17th International Conference, ICFCA 2023, Kassel, Germany, July 17-21, 2023, Proceedings, pp. 143-151, 2023, Springer, 978-3-031-35948-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Peter Robinson 0002 |
Brief Announcement: What Can We Compute in a Single Round of the Congested Clique? ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, PODC 2023, Orlando, FL, USA, June 19-23, 2023, pp. 168-171, 2023, ACM. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Sebastian Forster, Tijn de Vos |
Brief Announcement: The Laplacian Paradigm in Deterministic Congested Clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, PODC 2023, Orlando, FL, USA, June 19-23, 2023, pp. 75-78, 2023, ACM. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoDIT ![In: 9th International Conference on Control, Decision and Information Technologies, CoDIT 2023, Rome, Italy, July 3-6, 2023, pp. 1717-1722, 2023, IEEE, 979-8-3503-1140-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TIME ![In: 30th International Symposium on Temporal Representation and Reasoning, TIME 2023, September 25-26, 2023, NCSR Demokritos, Athens, Greece, pp. 3:1-3:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-298-3. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Guy Bresler, Tianze Jiang |
Detection-Recovery and Detection-Refutation Gaps via Reductions from Planted Clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: The Thirty Sixth Annual Conference on Learning Theory, COLT 2023, 12-15 July 2023, Bangalore, India., pp. 5850-5889, 2023, PMLR. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
12 | Pravesh Kothari, Santosh S. Vempala, Alexander S. Wein, Jeff Xu |
Is Planted Coloring Easier than Planted Clique? ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: The Thirty Sixth Annual Conference on Learning Theory, COLT 2023, 12-15 July 2023, Bangalore, India., pp. 5343-5372, 2023, PMLR. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
12 | Rares-Darius Buhai, Pravesh K. Kothari, David Steurer |
Algorithms Approaching the Threshold for Semi-random Planted Clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, Orlando, FL, USA, June 20-23, 2023, pp. 1918-1926, 2023, ACM, 978-1-4503-9913-5. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Marco D'Elia, Irene Finocchi, Maurizio Patrignani |
Clique-TF-IDF: A New Partitioning Framework Based on Dense Substructures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AI*IA ![In: AIxIA 2023 - Advances in Artificial Intelligence - XXIInd International Conference of the Italian Association for Artificial Intelligence, AIxIA 2023, Rome, Italy, November 6-9, 2023, Proceedings, pp. 396-410, 2023, Springer, 978-3-031-47545-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICLR ![In: The Eleventh International Conference on Learning Representations, ICLR 2023, Kigali, Rwanda, May 1-5, 2023, 2023, OpenReview.net. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK, pp. 30:1-30:25, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-282-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Dale Kim, Qing Zhou |
Structure Learning of Latent Factors via Clique Search on Correlation Thresholded Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICML ![In: International Conference on Machine Learning, ICML 2023, 23-29 July 2023, Honolulu, Hawaii, USA., pp. 16978-16996, 2023, PMLR. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPEC ![In: 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, September 6-8, 2023, Amsterdam, The Netherlands, pp. 29:1-29:13, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-305-8. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Li Qiaochen, Xuguang Bao |
A Spatial Maximal Co-location Pattern Mining Algorithm Based on Maximal Clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CyberC ![In: International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, CyberC 2023, Jiangsu, China, November 2-4, 2023, pp. 18-26, 2023, IEEE, 979-8-3503-0869-3. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|