Search results for "biclique"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
96	Stefano Gualandi	k-Clustering Minimum Biclique Completion via a Hybrid CP and SDP Approach.	CPAIOR	2009	DBLP DOI BibTeX RDF
86	Stefan Szeider	Generalizations of matched CNF formulas.	Ann. Math. Artif. Intell.	2005	DBLP DOI BibTeX RDF	matched formula, deficiency, biclique cover, P 2 -completeness, NP-completeness, bipartite graph, polynomial hierarchy, SAT problem
77	Shuo Zhou, Bo Yao, Hongyu Chen, Yi Zhu 0002, Michael D. Hutton, Truman Collins, Sridhar Srinivasan, Nan-Chi Chou, Peter Suaris, Chung-Kuan Cheng	Efficient Timing Analysis With Known False Paths Using Biclique Covering.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2007	DBLP DOI BibTeX RDF
76	Nina Mishra, Dana Ron, Ram Swaminathan	On Finding Large Conjunctive Clusters.	COLT	2003	DBLP DOI BibTeX RDF
66	Brenda F. Miles, Vir V. Phoha	The bipartite clique: a topological paradigm for WWWeb user search customization.	ACM Southeast Regional Conference (1)	2005	DBLP DOI BibTeX RDF	bipartite clique or biclique graph, combined log format, web neighborhood, web user customization, web user search, link analysis, web usage mining, web structure mining
58	Jinyan Li 0001, Guimei Liu, Haiquan Li, Limsoon Wong	Maximal Biclique Subgraphs and Closed Pattern Pairs of the Adjacency Matrix: A One-to-One Correspondence and Mining Algorithms.	IEEE Trans. Knowl. Data Eng.	2007	DBLP DOI BibTeX RDF	Graph algorithms, Mining methods and algorithms
57	Xiaowen Liu, Jinyan Li 0001, Lusheng Wang 0001	Quasi-bicliques: Complexity and Binding Pairs.	COCOON	2008	DBLP DOI BibTeX RDF
47	Jeonghee Yi, Farzin Maghoul	Query clustering using click-through graph.	WWW	2009	DBLP DOI BibTeX RDF	biclique, click-through graph, equivalence set, maximal bipartite clique, query clustring, query intent
47	Shuo Zhou, Yi Zhu 0002, Yuanfang Hu, Ronald L. Graham, Mike Hutton, Chung-Kuan Cheng	Timing model reduction for hierarchical timing analysis.	ICCAD	2006	DBLP DOI BibTeX RDF	biclique-star replacement, hierarchical timing analysis
40	R. Krithika 0001, V. K. Kutty Malu, Roohani Sharma, Prafullkumar Tale	Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction.	CoRR	2023	DBLP DOI BibTeX RDF
40	Marina Groshaus, Juan Carlos Terragno	Biclique transversal and biclique independen set.	LAGOS	2023	DBLP DOI BibTeX RDF
40	R. Krithika 0001, V. K. Kutty Malu, Roohani Sharma, Prafullkumar Tale	Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction.	FSTTCS	2023	DBLP DOI BibTeX RDF
40	Leandro Montero, Sylvain Legay	On the edge-biclique graph and the iterated edge-biclique operator.	J. Graph Theory	2022	DBLP DOI BibTeX RDF
40	Sylvain Legay, Leandro Montero	On the edge-biclique graph and the iterated edge-biclique operator.	CoRR	2019	DBLP BibTeX RDF
40	Pasin Manurangsi	Inapproximability of Maximum Edge Biclique, Maximum Balanced Biclique and Minimum k-Cut from the Small Set Expansion Hypothesis.	ICALP	2017	DBLP DOI BibTeX RDF
40	Hélio B. Macêdo Filho, Simone Dantas, Raphael C. S. Machado, Celina M. H. de Figueiredo	Biclique-colouring verification complexity and biclique-colouring power graphs.	Discret. Appl. Math.	2015	DBLP DOI BibTeX RDF
40	Martiniano Eguía, Francisco J. Soulignac	Hereditary biclique-Helly graphs: recognition and maximal biclique enumeration.	Discret. Math. Theor. Comput. Sci.	2013	DBLP DOI BibTeX RDF
40	Martiniano Eguía, Francisco J. Soulignac	Hereditary biclique-Helly graphs: recognition and maximal biclique enumeration	CoRR	2011	DBLP BibTeX RDF
40	Marina Groshaus, Jayme Luiz Szwarcfiter	Biclique graphs and biclique matrices.	J. Graph Theory	2010	DBLP DOI BibTeX RDF
40	Jérôme Amilhastre, Marie-Catherine Vilarem, Philippe Janssen	Complexity of Minimum Biclique Cover and Minimum Biclique Decomposition for Bipartite Domino-free Graphs.	Discret. Appl. Math.	1998	DBLP DOI BibTeX RDF
39	Jinsong Tan	Inapproximability of Maximum Weighted Edge Biclique and Its Applications.	TAMC	2008	DBLP DOI BibTeX RDF
39	Michael Hirsch, Henk Meijer, David Rappaport	Biclique Edge Cover Graphs and Confluent Drawings.	GD	2006	DBLP DOI BibTeX RDF
38	Ruoming Jin, Yang Xiang, Lin Liu 0001	Cartesian contour: a concise representation for a collection of frequent sets.	KDD	2009	DBLP DOI BibTeX RDF	concise pattern representation, frequent itemsets, set cover, cartesian product
38	Hermann Gruber, Markus Holzer 0001	Inapproximability of Nondeterministic State and Transition Complexity Assuming P=!NP.	Developments in Language Theory	2007	DBLP DOI BibTeX RDF
38	Herbert Fleischner, Egbert Mujuni, Daniël Paulusma, Stefan Szeider	Covering Graphs with Few Complete Bipartite Subgraphs.	FSTTCS	2007	DBLP DOI BibTeX RDF
38	Guimei Liu, Kelvin Sim, Jinyan Li 0001	Efficient Mining of Large Maximal Bicliques.	DaWaK	2006	DBLP DOI BibTeX RDF
38	Oliver Kullmann	The Combinatorics of Conflicts between Clauses.	SAT	2003	DBLP DOI BibTeX RDF
38	Milind Dawande	A Notion of Cross-Perfect Bipartite Graphs.	COCOON	2001	DBLP DOI BibTeX RDF	integral polytope, bipartite graph, perfect graph
28	Shuo Zhou, Bo Yao, Hongyu Chen, Yi Zhu 0002, Chung-Kuan Cheng, Michael D. Hutton	Efficient static timing analysis using a unified framework for false paths and multi-cycle paths.	ASP-DAC	2006	DBLP DOI BibTeX RDF	biclique covering, false subgraphs, multi-cycle subgraphs, static timing analysis, time shifting
20	Abner Perez-Haro, Arturo Diaz-Perez	ABAC Policy Mining through Affiliation Networks and Biclique Analysis.	Inf.	2024	DBLP DOI BibTeX RDF
20	Renjie Sun, Yanping Wu, Xiaoyang Wang 0002, Chen Chen 0017, Wenjie Zhang 0001, Xuemin Lin 0001	Efficient Balanced Signed Biclique Search in Signed Bipartite Graphs.	IEEE Trans. Knowl. Data Eng.	2024	DBLP DOI BibTeX RDF
20	Chou-Ying Hsieh, Chia-Ming Chang, Po-Hsiu Cheng, Sy-Yen Kuo	Accelerating Maximal Biclique Enumeration on GPUs.	CoRR	2024	DBLP DOI BibTeX RDF
20	Pankaj K. Agarwal, Esther Ezra, Micha Sharir	Semi-Algebraic Off-line Range Searching and Biclique Partitions in the Plane.	CoRR	2024	DBLP DOI BibTeX RDF
20	Linshan Qiu, Zhonggen Li, Xiangyu Ke, Lu Chen, Yunjun Gao	Accelerating Biclique Counting on GPU.	CoRR	2024	DBLP DOI BibTeX RDF
20	Pasin Manurangsi	Improved FPT Approximation Scheme and Approximate Kernel for Biclique-Free Max k-Weight SAT: Greedy Strikes Back.	CoRR	2024	DBLP DOI BibTeX RDF
20	Yanfang Liang, Baoyindureng Wu	On some conjectures on biclique graphs.	Discret. Appl. Math.	2024	DBLP DOI BibTeX RDF
20	Himadry Sekhar Roy, Prakash Dey, Sandip Kumar Mondal, Avishek Adhikari	Cryptanalysis of full round FUTURE with multiple biclique structures.	Peer Peer Netw. Appl.	2024	DBLP DOI BibTeX RDF
20	Mhand Hifi, Shohre Sadeghsa	A rounding strategy-based algorithm for the k-clustering minimum biclique completion problem.	J. Oper. Res. Soc.	2023	DBLP DOI BibTeX RDF
20	Yiwei Zhao, Zi Chen, Chen Chen 0017, Xiaoyang Wang 0002, Xuemin Lin 0001, Wenjie Zhang 0001	Finding the Maximum $k$-Balanced Biclique on Weighted Bipartite Graphs.	IEEE Trans. Knowl. Data Eng.	2023	DBLP DOI BibTeX RDF
20	Jianhua Wang, Jianye Yang, Chengyuan Zhang 0001, Xuemin Lin 0001	Efficient Maximum Edge-Weighted Biclique Search on Large Bipartite Graphs.	IEEE Trans. Knowl. Data Eng.	2023	DBLP DOI BibTeX RDF
20	Jianhua Wang, Jianye Yang, Ziyi Ma, Chengyuan Zhang 0001, Shiyu Yang, Wenjie Zhang 0001	Efficient Maximal Biclique Enumeration on Large Uncertain Bipartite Graphs.	IEEE Trans. Knowl. Data Eng.	2023	DBLP DOI BibTeX RDF
20	Ziqi Yin, Qi Zhang 0010, Wentao Zhang, Rong-Hua Li, Guoren Wang	Fairness-aware Maximal Biclique Enumeration on Bipartite Graphs.	CoRR	2023	DBLP DOI BibTeX RDF
20	Bochuan Lyu, Illya V. Hicks	Maximal Clique and Edge-Ranking Bounds of Biclique Cover Number.	CoRR	2023	DBLP DOI BibTeX RDF
20	Fábio Botler, A. Jiménez, Carla Negri Lintzmayer, Adrián Pastine, Daniel A. Quiroz, Maycon Sambinelli	Biclique immersions in graphs with independence number 2.	CoRR	2023	DBLP DOI BibTeX RDF
20	Xiaofan Li 0004, Prasenjit Mitra, Rui Zhou 0001, Wolfgang Nejdl	Quantum Algorithm for Maximum Biclique Problem.	CoRR	2023	DBLP DOI BibTeX RDF
20	Lito Goldmann, Leon Kellerhals, Tomohiro Koana	Structural Parameterizations of the Biclique-Free Vertex Deletion Problem.	CoRR	2023	DBLP DOI BibTeX RDF
20	Wilder P. Mendes, Simone Dantas, Sylvain Gravier	A combinatorial game over biclique-hypergraphs of powers of paths and of powers of cycles through monochromatic transversals.	Discret. Appl. Math.	2023	DBLP DOI BibTeX RDF
20	Bochuan Lyu, Illya V. Hicks	Finding biclique partitions of co-chordal graphs.	Discret. Appl. Math.	2023	DBLP DOI BibTeX RDF
20	Xiaowei Ye, Rong-Hua Li, Qiangqiang Dai, Hongchao Qin, Guoren Wang	Efficient Biclique Counting in Large Bipartite Graphs.	Proc. ACM Manag. Data	2023	DBLP DOI BibTeX RDF
20	Jianye Yang, Yun Peng, Dian Ouyang, Wenjie Zhang 0001, Xuemin Lin 0001, Xiang Zhao 0002	(p,q)-biclique counting and enumeration for large sparse bipartite graphs.	VLDB J.	2023	DBLP DOI BibTeX RDF
20	Alexander D. Scott, Paul D. Seymour, Sophie Spirkl	Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree.	J. Graph Theory	2023	DBLP DOI BibTeX RDF
20	Pallavi Jain 0001, Lawqueen Kanesh, Fahad Panolan, Souvik Saha 0002, Abhishek Sahu, Saket Saurabh 0001, Anannya Upasana	Parameterized Approximation Scheme for Biclique-free Max k-Weight SAT and Max Coverage.	SODA	2023	DBLP DOI BibTeX RDF
20	Timothy M. Chan, Sariel Har-Peled	On the Number of Incidences When Avoiding an Induced Biclique in Geometric Settings.	SODA	2023	DBLP DOI BibTeX RDF
20	Zi Chen, Yiwei Zhao, Long Yuan, Xuemin Lin 0001, Kai Wang 0037	Index-Based Biclique Percolation Communities Search on Bipartite Graphs.	ICDE	2023	DBLP DOI BibTeX RDF
20	Renjie Sun, Chen Chen 0017, Xiaoyang Wang 0002, Wenjie Zhang 0001, Ying Zhang 0001, Xuemin Lin 0001	Efficient Maximum Signed Biclique Identification.	ICDE	2023	DBLP DOI BibTeX RDF
20	Ziqi Yin, Qi Zhang 0010, Wentao Zhang, Rong-Hua Li, Guoren Wang	Fairness-aware Maximal Biclique Enumeration on Bipartite Graphs.	ICDE	2023	DBLP DOI BibTeX RDF
20	Pasin Manurangsi	Improved Inapproximability of VC Dimension and Littlestone's Dimension via (Unbalanced) Biclique.	ITCS	2023	DBLP DOI BibTeX RDF
20	Abner Perez-Haro, Arturo Diaz-Perez	Attribute-based access control rules supported by biclique patterns.	BigDataService	2023	DBLP DOI BibTeX RDF
20	Paola T. P. Huaynoca, Simone Dantas, Daniel F. D. Posner	Biclique coloring game (Brief Announcement).	LAGOS	2023	DBLP DOI BibTeX RDF
20	Edmilson Pereira da Cruz, Marina Groshaus, André Luiz Pires Guedes	Edge and non-edge differentiated biclique graphs.	LAGOS	2023	DBLP DOI BibTeX RDF
20	Oliver Kullmann, Ankit Shukla	Transforming Quantified Boolean Formulas Using Biclique Covers.	TACAS (2)	2023	DBLP DOI BibTeX RDF
20	Zhe Pan, Shuibing He, Xu Li, Xuechen Zhang 0001, Rui Wang 0076, Gang Chen 0001	Efficient Maximal Biclique Enumeration on GPUs.	SC	2023	DBLP DOI BibTeX RDF
20	Pasin Manurangsi	Improved Inapproximability of VC Dimension and Littlestone's Dimension via (Unbalanced) Biclique.	CoRR	2022	DBLP DOI BibTeX RDF
20	Lu Chen 0008, Chengfei Liu, Rui Zhou 0001, Jiajie Xu 0001, Jianxin Li 0001	Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs. (PDF / PS)	Proc. VLDB Endow.	2022	DBLP DOI BibTeX RDF
20	Marina Groshaus, André Luiz Pires Guedes, Juan Pablo Puppo	Biclique graphs of split graphs.	Discret. Appl. Math.	2022	DBLP DOI BibTeX RDF
20	Leandro Montero	Vertex removal in biclique graphs.	Discret. Appl. Math.	2022	DBLP DOI BibTeX RDF
20	Sara Omranian, Zoran Nikoloski	CUBCO+: prediction of protein complexes based on min-cut network partitioning into biclique spanned subgraphs.	Appl. Netw. Sci.	2022	DBLP DOI BibTeX RDF
20	Bingqing Lyu, Lu Qin 0001, Xuemin Lin 0001, Ying Zhang 0001, Zhengping Qian, Jingren Zhou	Maximum and top-k diversified biclique search at scale.	VLDB J.	2022	DBLP DOI BibTeX RDF
20	Renjie Sun, Yanping Wu, Chen Chen 0017, Xiaoyang Wang 0002, Wenjie Zhang 0001, Xuemin Lin 0001	Maximal Balanced Signed Biclique Enumeration in Signed Bipartite Graphs.	ICDE	2022	DBLP DOI BibTeX RDF
20	Kai Wang 0037, Wenjie Zhang 0001, Xuemin Lin 0001, Lu Qin 0001, Alexander Zhou	Efficient Personalized Maximum Biclique Search.	ICDE	2022	DBLP DOI BibTeX RDF
20	Gérard-Michel Cochard, Mhand Hifi, E.-S. Samod, Labib Yousef	A Population-Based Algorithm for the k-Clustering Minimum Biclique Completion Problem.	CoDIT	2022	DBLP DOI BibTeX RDF
20	Dhruv Rohatgi, John C. Urschel, Jake Wellens	Regarding Two Conjectures on Clique and Biclique Partitions.	Electron. J. Comb.	2021	DBLP DOI BibTeX RDF
20	K. B. Jithendra, Shahana Thottathikkulam Kassim	New results in biclique cryptanalysis of full round GIFT.	J. Intell. Fuzzy Syst.	2021	DBLP DOI BibTeX RDF
20	Christophe Crespelle, Matthieu Latapy, Thi Ha Duong Phan	On the Termination of Some Biclique Operators on Multipartite Graphs.	CoRR	2021	DBLP BibTeX RDF
20	Jianye Yang, Yun Peng, Wenjie Zhang 0001	(p, q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs. (PDF / PS)	Proc. VLDB Endow.	2021	DBLP DOI BibTeX RDF
20	Gilberto Farias de Sousa Filho, Teobaldo Bulhões, Lucídio dos Anjos F. Cabral, Luiz Satoru Ochi, Fábio Protti, Rian G. S. Pinheiro	The biclique partitioning polytope.	Discret. Appl. Math.	2021	DBLP DOI BibTeX RDF
20	Sara Omranian, Zoran Nikoloski	CUBCO: Prediction of Protein Complexes Based on Min-cut Network Partitioning into Biclique Spanned Subgraphs.	COMPLEX NETWORKS	2021	DBLP DOI BibTeX RDF
20	Lu Chen 0008, Chengfei Liu, Rui Zhou 0001, Jiajie Xu 0001, Jianxin Li 0001	Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs.	SIGMOD Conference	2021	DBLP DOI BibTeX RDF
20	Wilder P. Mendes, Simone Dantas, Sylvain Gravier	The (a, b)-monochromatic transversal game on biclique-hypergraphs of powers of paths and of powers of cycles.	LAGOS	2021	DBLP DOI BibTeX RDF
20	Marina Groshaus, André Luiz Pires Guedes	Biclique Graphs of K3-free Graphs and Bipartite Graphs.	LAGOS	2021	DBLP DOI BibTeX RDF
20	Cristina Maier, Dan A. Simovici	On Biclique Connectivity in Bipartite Graphs and Recommendation Systems.	ICISDM	2021	DBLP DOI BibTeX RDF
20	K. B. Jithendra, Shahana Thottathikkulam Kassim	New Biclique Cryptanalysis on Full-Round PRESENT-80 Block Cipher.	SN Comput. Sci.	2020	DBLP DOI BibTeX RDF
20	Mingjie Li, Jin-Kao Hao, Qinghua Wu 0002	General swap-based multiple neighborhood adaptive search for the maximum balanced biclique problem.	Comput. Oper. Res.	2020	DBLP DOI BibTeX RDF
20	Chu Pan, Jiawei Luo 0001, Jiao Zhang 0003, Xin Li	BiModule: Biclique Modularity Strategy for Identifying Transcription Factor and microRNA Co-Regulatory Modules.	IEEE ACM Trans. Comput. Biol. Bioinform.	2020	DBLP DOI BibTeX RDF
20	Hideaki Otsuki	A New Polynomial-Time Solvable Graph Class for the Minimum Biclique Edge Cover Problem.	IEICE Trans. Fundam. Electron. Commun. Comput. Sci.	2020	DBLP DOI BibTeX RDF
20	Marina Groshaus, André Luiz Pires Guedes	Biclique Graphs of K3-free Graphs and Bipartite Graphs.	CoRR	2020	DBLP BibTeX RDF
20	Lu Chen 0008, Chengfei Liu, Rui Zhou 0001, Jiajie Xu 0001, Jianxin Li 0001	Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs.	CoRR	2020	DBLP BibTeX RDF
20	Leandro Montero	Vertex removal in biclique graphs.	CoRR	2020	DBLP BibTeX RDF
20	Bingqing Lyu, Lu Qin 0001, Xuemin Lin 0001, Ying Zhang 0001, Zhengping Qian, Jingren Zhou	Maximum Biclique Search at Billion Scale. (PDF / PS)	Proc. VLDB Endow.	2020	DBLP DOI BibTeX RDF
20	Edmilson Pereira da Cruz, Marina Groshaus, André Luiz Pires Guedes, Juan Pablo Puppo	Biclique graphs of interval bigraphs.	Discret. Appl. Math.	2020	DBLP DOI BibTeX RDF
20	Arti Pandey, Gopika Sharma, Nivedit Jain	Maximum Weighted Edge Biclique Problem on Bipartite Graphs.	CALDAM	2020	DBLP DOI BibTeX RDF
20	Aman Abidi, Rui Zhou 0001, Lu Chen 0008, Chengfei Liu	Pivot-based Maximal Biclique Enumeration.	IJCAI	2020	DBLP DOI BibTeX RDF
20	Krystal Guo, Tony Huynh, Marco Macchia	The Biclique Covering Number of Grids.	Electron. J. Comb.	2019	DBLP DOI BibTeX RDF
20	Sylvain Legay, Leandro Montero	On the Iterated Edge-Biclique Operator.	LAGOS	2019	DBLP DOI BibTeX RDF
20	Sebastian Siebertz	Greedy domination on biclique-free graphs.	Inf. Process. Lett.	2019	DBLP DOI BibTeX RDF
20	Siavash Ahmadi, Zahra Ahmadian, Javad Mohajeri, Mohammad Reza Aref	Biclique Cryptanalysis of Block Ciphers LBlock and TWINE-80 with Practical Data Complexity.	ISC Int. J. Inf. Secur.	2019	DBLP DOI BibTeX RDF
20	Guoyong Han, Hongluan Zhao, Chunquan Zhao	Unbalanced Biclique Cryptanalysis of Full-Round GIFT.	IEEE Access	2019	DBLP DOI BibTeX RDF
20	Hongluan Zhao, Guoyong Han	Biclique cryptanalysis on Midori block cipher.	Int. J. Embed. Syst.	2019	DBLP DOI BibTeX RDF
20	Blair D. Sullivan, Andrew van der Poel, Trey Woodlief	Faster Biclique Mining in Near-Bipartite Graphs.	CoRR	2019	DBLP BibTeX RDF
20	Guoyong Han, Wenying Zhang, Zhaohui Xing, Hongluan Zhao, Jian Lian	Unbalanced biclique cryptanalysis of a full round Midori.	IET Commun.	2019	DBLP DOI BibTeX RDF