The maximum edge biclique problem is NP-complete

Untitled work

(1979) · Cited by 43,841 · see citing works

On the Shannon capacity of a graph

Lovász, L. (1979) · IEEE Transactions on Information Theory · doi:10.1109/tit.1979.1055985 · Cited by 1,658 · see citing works

The NP-completeness column: An ongoing guide

Johnson, D. S. (1986) · Journal of Algorithms · doi:10.1016/0196-6774(86)90020-9 · Cited by 799 · see citing works

Node-and edge-deletion NP-complete problems

Yannakakis, M. (1978) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/800133.804355 · Cited by 445 · see citing works

Approximating Clique and Biclique Problems

Hochbaum, D. S. (1998) · Journal of Algorithms · doi:10.1006/jagm.1998.0964 · Cited by 113 · see citing works

The NP-completeness column: An ongoing guide

Johnson, D. S. (1987) · Journal of Algorithms · doi:10.1016/0196-6774(87)90021-6 · Cited by 75 · see citing works

Bicliques and Eigenvalues

Haemers, W. H. (2001) · Journal of Combinatorial Theory Series B · doi:10.1006/jctb.2000.2020 · Cited by 20 · see citing works

Bipartite sandwiches: bounding the size of a maximum bicliquePreprint

Ṗasechnik, D. V. (1999) · arXiv (Cornell University) · doi:10.48550/arxiv.math/9907109 · Cited by 3 · see citing works

Bipartite sandwiches: semide?nite relaxations for maximum biclique

Ṗasechnik, D. V. (1999) · Electronic Notes in Discrete Mathematics · doi:10.1016/s1571-0653(05)80046-0 · Cited by 2 · see citing works

Community detection in graphs

Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293 · see citing works

Biclustering algorithms for biological data analysis: a survey

Madeira, S. C., & Oliveira, A. L. (2004) · IEEE/ACM Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2004.2 · Cited by 2,049 · see citing works

CopyCatch: stopping group attacks by spotting lockstep behavior in social networks

Beutel, A., Xu, W., Guruswami, V., Palow, C., & Faloutsos, C. (2013) · Proceedings of the 22nd international conference on World Wide Web · doi:10.1145/2488388.2488400 · Cited by 335 · see citing works

The role mining problem

Vaidya, J. S., Atluri, V., & Guo, Q. (2007) · ACM Symposium on Access Control Models and Technologies (SACMAT) · doi:10.1145/1266840.1266870 · Cited by 281 · see citing works

Multi-objective evolutionary biclustering of gene expression data

Mitra, S., & Banka, H. (2006) · Pattern Recognition · doi:10.1016/j.patcog.2006.03.003 · Cited by 250 · see citing works

Fast exact and heuristic methods for role minimization problems

Ene, A. R., Horne, W. G., Milosavljevic, N., Rao, P., Schreiber, R., & Tarjan, R. E. (2008) · ACM Symposium on Access Control Models and Technologies (SACMAT) · doi:10.1145/1377836.1377838 · Cited by 230 · see citing works

Consensus algorithms for the generation of all maximal bicliques

Alexe, G., Alexe, S., Crama, Y., Foldes, S., Hammer, P. L., & Simeone, B. (2004) · Discrete Applied Mathematics · doi:10.1016/j.dam.2003.09.004 · Cited by 190 · see citing works

Bipartite graphs in systems biology and medicine: a survey of methods and applications

Pavlopoulos, G. A., Kontou, P. I., Pavlopoulou, A., Bouyioukos, C., Markou, E., & Bagos, P. G. (2018) · GigaScience · doi:10.1093/gigascience/giy014 · Cited by 189 · see citing works

On finding bicliques in bipartite graphs: a novel algorithm and its application to the integration of diverse biological data types

Zhang, Y., Phillips, C., Rogers, G. L., Baker, E. J., Chesler, E. J., & Langston, M. A. (2014) · BMC Bioinformatics · doi:10.1186/1471-2105-15-110 · Cited by 189 · see citing works

Tiling Databases

Geerts, F., Goethals, B., & Mielikäinen, T. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30214-8_22 · Cited by 178 · see citing works

Low-Rank Matrix Approximation with Weights or Missing Data Is NP-Hard

Gillis, N., & Glineur, F. (2011) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/110820361 · Cited by 143 · see citing works

Spectrum Opportunity-Based Control Channel Assignment in Cognitive Radio Networks

Lazos, L., Liu, S., & Krunz, M. (2009) · IEEE International Conference on Sensing, Communication, and Networking (SECON) · doi:10.1109/sahcn.2009.5168974 · Cited by 142 · see citing works

Biclique communities

Lehmann, S., Schwartz, M., & Hansen, L. K. (2008) · Physical Review E · doi:10.1103/physreve.78.016108 · Cited by 132 · see citing works

Efficient (α, β)-core Computation: an Index-based Approach

Liu, B., Yuan, L., Lin, X., Qin, L., Zhang, W., & Zhou, J. (2019) · International World Wide Web Conference (WWW) · doi:10.1145/3308558.3313522 · Cited by 130 · see citing works

Nuclear norm minimization for the planted clique and biclique problems

Ames, B., & Vavasis, S. A. (2011) · Mathematical Programming · doi:10.1007/s10107-011-0459-x · Cited by 120 · see citing works

Cooperative Games with Overlapping Coalitions

Chalkiadakis, G., Elkind, E., Markakis, E., Polukarov, M., & Jennings, N. R. (2010) · ePrints Soton (University of Southampton) · Cited by 112 · see citing works

Maximum biclique search at billion scale

Lyu, B., Qin, L., Lin, X., Zhang, Y., Qian, Z., & Zhou, J. (2020) · Proceedings of the VLDB Endowment · doi:10.14778/3397230.3397234 · Cited by 108 · see citing works

Using underapproximations for sparse nonnegative matrix factorization

Gillis, N., & Glineur, F. (2009) · Pattern Recognition · doi:10.1016/j.patcog.2009.11.013 · Cited by 106 · see citing works

Identification of Regulatory Modules in Time Series Gene Expression Data Using a Linear Time Biclustering Algorithm

Madeira, S. C., Teixeira, M. C., Sá‐Correia, I., & Oliveira, A. L. (2009) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2008.34 · Cited by 104 · see citing works

Cluster-Based Control Channel Allocation in Opportunistic Cognitive Radio Networks

Liu, S., Lazos, L., & Krunz, M. (2012) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2012.33 · Cited by 88 · see citing works

Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth

Addis, B., Summa, M. D., & Grosso, A. (2013) · Discrete Applied Mathematics · doi:10.1016/j.dam.2013.03.021 · Cited by 87 · see citing works

Efficient ($$\alpha $$, $$\beta $$)-core computation in bipartite graphs

Liu, B., Yuan, L., Lin, X., Qin, L., Zhang, W., & Zhou, J. (2020) · The VLDB Journal · doi:10.1007/s00778-020-00606-9 · Cited by 85 · see citing works

Compression, clustering, and pattern discovery in very high-dimensional discrete-attribute data sets

Koyutürk, M., Grama, A. Y., & Ramakrishnan, N. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.55 · Cited by 82 · see citing works

Graph-based data clustering with overlaps

Fellows, M. R., Guo, J., Komusiewicz, C., Niedermeier, R., & Uhlmann, J. (2010) · Discrete Optimization · doi:10.1016/j.disopt.2010.09.006 · Cited by 80 · see citing works

On the geometric interpretation of the nonnegative rank

Gillis, N., & Glineur, F. (2012) · Linear Algebra and its Applications · doi:10.1016/j.laa.2012.06.038 · Cited by 78 · see citing works

Bitruss Decomposition of Bipartite Graphs

Zou, Z. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-32049-6_14 · Cited by 75 · see citing works

The role mining problem

Vaidya, J. S., Atluri, V., & Guo, Q. (2010) · ACM Transactions on Information and System Security · doi:10.1145/1805974.1805983 · Cited by 72 · see citing works

Summarizing transactional databases with overlapped hyperrectangles

Xiang, Y., Jin, R., Fuhry, D., & Dragan, F. F. (2010) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-010-0203-9 · Cited by 70 · see citing works

A New Conceptual Clustering Framework

Mishra, N., Ron, D., & Swaminathan, R. (2004) · Machine Learning · doi:10.1023/b:mach.0000033117.77257.41 · Cited by 69 · see citing works

A structured view on pattern mining-based biclustering

Henriques, R., Antunes, C., & Madeira, S. C. (2015) · Pattern Recognition · doi:10.1016/j.patcog.2015.06.018 · Cited by 67 · see citing works

Beyond 2014

Wideł, W., Audinot, M., Fila, B., & Pinchinat, S. (2019) · ACM Computing Surveys · doi:10.1145/3331524 · Cited by 65 · see citing works

Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut

Ambühl, C., Mastrolilli, M., & Svensson, O. (2011) · SIAM Journal on Computing · doi:10.1137/080729256 · Cited by 65 · see citing works

Biclustering of gene expression data

Žalik, K. R. (2005) · Cited by 64 · see citing works

A polynomial time biclustering algorithm for finding approximate expression patterns in gene expression time series

Madeira, S. C., & Oliveira, A. L. (2009) · Algorithms for Molecular Biology · doi:10.1186/1748-7188-4-8 · Cited by 63 · see citing works

Energy-Efficient k-Hop Clustering in Cognitive Radio Sensor Network for Internet of Things

Prajapat, R., Yadav, R. N., & Misra, R. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3065691 · Cited by 57 · see citing works

Inapproximability of Maximum Biclique Problems, Minimum k-Cut and Densest At-Least-k-Subgraph from the Small Set Expansion Hypothesis

Manurangsi, P. (2018) · Algorithms · doi:10.3390/a11010010 · Cited by 54 · see citing works

Nonnegative Factorization and The Maximum Edge Biclique ProblemPreprint

Gillis, N., & Glineur, F. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0810.4225 · Cited by 58 · see citing works

Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions

Fang, Y., Wang, K., Lin, X., & Zhang, W. (2021) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/3448016.3457538 · Cited by 52 · see citing works

A new biclustering technique based on crossing minimization

Abdullah, A., & Hussain, A. (2006) · Neurocomputing · doi:10.1016/j.neucom.2006.02.018 · Cited by 50 · see citing works

On the Size and Recovery of Submatrices of Ones in a Random Binary Matrix

Nobel, A. B., & Sun, X. (2021) · Carolina Digital Repository (University of North Carolina at Chapel Hill) · doi:10.17615/ss7d-qe88 · Cited by 49 · see citing works

Incremental Maintenance of 2-Hop Labeling of Large Graphs

Bramandia, R., Choi, B. K. K., & Ng, W. K. (2009) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2009.117 · Cited by 49 · see citing works

Verification of Binarized Neural Networks via Inter-neuron Factoring

Cheng, C., Nührenberg, G., Huang, C.-H., & Rueß, H. (2018) · Lecture notes in computer science · doi:10.1007/978-3-030-03592-1_16 · Cited by 49 · see citing works

BARTMAP: A viable structure for biclustering

Xu, R., & Wunsch, D. C. (2011) · Neural Networks · doi:10.1016/j.neunet.2011.03.020 · Cited by 48 · see citing works

Enumerating Maximal Bicliques from a Large Graph Using MapReduce

Mukherjee, A. P., & Tirthapura, S. (2016) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2016.2523997 · Cited by 47 · see citing works

Approximation algorithms for co-clustering

Anagnostopoulos, A., Dasgupta, A., & Kumar, R. (2008) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/1376916.1376945 · Cited by 47 · see citing works

On Independent Sets and Bicliques in Graphs

Gaspers, S., Kratsch, D., & Liedloff, M. (2010) · Algorithmica · doi:10.1007/s00453-010-9474-1 · Cited by 47 · see citing works

Exploring biological interaction networks with tailored weighted quasi-bicliques

Chang, W.-C., Vakati, S. R., Krause, R., & Eulenstein, O. (2012) · BMC Bioinformatics · doi:10.1186/1471-2105-13-s10-s16 · Cited by 44 · see citing works

Generating bicliques of a graph in lexicographic order

Dias, V. M. F., de Figueiredo, C. M. H., & SZWARCFITER, J. L. (2005) · Theoretical Computer Science · doi:10.1016/j.tcs.2005.01.014 · Cited by 44 · see citing works

Error Compensation in Leaf Power Problems

Dom, M., Guo, J., Hüffner, F., & Niedermeier, R. (2005) · Algorithmica · doi:10.1007/s00453-005-1180-z · Cited by 44 · see citing works

A new measure for gene expression biclustering based on non-parametric correlation

Flores, J. L., Inza, I., Larrañaga, P., & Calvo, B. (2013) · Computer Methods and Programs in Biomedicine · doi:10.1016/j.cmpb.2013.07.025 · Cited by 43 · see citing works

A Linear Time Biclustering Algorithm for Time Series Gene Expression Data

Madeira, S. C., & Oliveira, A. L. (2005) · Lecture notes in computer science · doi:10.1007/11557067_4 · Cited by 43 · see citing works

Modeling Protein Interacting Groups by Quasi-Bicliques: Complexity, Algorithm, and Application

Liu, X., Li, J., & Wang, L. (2009) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2008.61 · Cited by 41 · see citing works

On the generation of bicliques of a graph

Dias, V. M. F., de Figueiredo, C. M. H., & SZWARCFITER, J. L. (2007) · Discrete Applied Mathematics · doi:10.1016/j.dam.2007.03.017 · Cited by 40 · see citing works

On-Demand Hybrid Routing for Cognitive Radio Ad-Hoc Network

Zareei, M., Mohamed, E. M., Anisi, M. H., Vargas‐Rosales, C., Tsukamoto, K., & Khan, M. K. (2016) · IEEE Access · doi:10.1109/access.2016.2626721 · Cited by 40 · see citing works

The Discrete Basis Problem

Miettinen, P., Mielikäinen, T., Gionis, A., Das, G., & Mannila, H. (2006) · Lecture notes in computer science · doi:10.1007/11871637_33 · Cited by 40 · see citing works

Graph-based criteria for spectrum-aware clustering in cognitive radio networks

Bradonjić, M., & Lazos, L. (2011) · Ad Hoc Networks · doi:10.1016/j.adhoc.2011.05.009 · Cited by 39 · see citing works

Mind the gap! Machine Learning, ESG Metrics and Sustainable InvestmentPreprint

Lanza, A., Bernardini, E., & Faiella, I. (2020) · SSRN Electronic Journal · doi:10.2139/ssrn.3659584 · Cited by 39 · see citing works

Butterfly counting on uncertain bipartite graphs

Zhou, A., Wang, Y., & Chen, L. (2021) · Proceedings of the VLDB Endowment · doi:10.14778/3489496.3489502 · Cited by 38 · see citing works

Nonorthogonal decomposition of binary matrices for bounded-error data compression and analysis

Koyutürk, M., Grama, A. Y., & Ramakrishnan, N. (2006) · ACM Transactions on Mathematical Software · doi:10.1145/1132973.1132976 · Cited by 37 · see citing works

On incremental maintenance of 2-hop labeling of graphs

Bramandia, R., Choi, B. K. K., & Ng, W. K. (2008) · International World Wide Web Conference (WWW) · doi:10.1145/1367497.1367611 · Cited by 36 · see citing works

Gene interaction – An evolutionary biclustering approach

Mitra, S., Das, R., Banka, H., & Mukhopadhyay, S. (2008) · Information Fusion · doi:10.1016/j.inffus.2008.11.006 · Cited by 33 · see citing works

A New Approach for Association Rule Mining and Bi-clustering Using Formal Concept Analysis

Mondal, K. C., Nicolas Pasquier, D., Mukhopadhyay, A., Maulik, U., & Bandhopadyay, S. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-31537-4_8 · Cited by 33 · see citing works

Biclique graphs and biclique matrices

Groshaus, M., & SZWARCFITER, J. L. (2009) · Journal of Graph Theory · doi:10.1002/jgt.20442 · Cited by 33 · see citing works

Mining patterns for clustering on numerical datasets using unsupervised decision trees

Gutierrez-Rodríguez, A. E., Martínez-Trinidad, J. F., García-Borroto, M., & Carrasco-Ochoa, J. A. (2015) · Knowledge-Based Systems · doi:10.1016/j.knosys.2015.02.019 · Cited by 32 · see citing works

BiC2PAM: constraint-guided biclustering for biological data analysis with domain knowledge

Henriques, R., & Madeira, S. C. (2016) · Algorithms for Molecular Biology · doi:10.1186/s13015-016-0085-5 · Cited by 32 · see citing works

A New Evolutionary Algorithm with Structure Mutation for the Maximum Balanced Biclique Problem

Yuan, B., Li, B., Chen, H., & Yao, X. (2014) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2014.2343966 · Cited by 32 · see citing works

A note on a Maximum k-Subset Intersection problem

Xavier, E. C. (2012) · Information Processing Letters · doi:10.1016/j.ipl.2012.03.007 · Cited by 32 · see citing works

Evolutionary biclustering of gene expressions

Banka, H., & Mitra, S. (2006) · Ubiquity · doi:10.1145/1183081.1183082 · Cited by 31 · see citing works

Nonnegative matrix factorization via rank-one downdate

Biggs, M., Ghodsi, A., & Vavasis, S. A. (2008) · International Conference on Machine Learning · doi:10.1145/1390156.1390165 · Cited by 31 · see citing works

On Finding Large Conjunctive Clusters

Mishra, N., Ron, D., & Swaminathan, R. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45167-9_33 · Cited by 31 · see citing works

Mining the tissue-tissue gene co-expression network for tumor microenvironment study and biomarker prediction

Xiang, Y., Zhang, J., & Huang, K. (2013) · BMC Genomics · doi:10.1186/1471-2164-14-s5-s4 · Cited by 31 · see citing works

Efficient Personalized Maximum Biclique Search

Wang, K., Zhang, W., Lin, X., Qin, L., & Zhou, A. (2022) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde53745.2022.00042 · Cited by 29 · see citing works

Inapproximability of Maximum Weighted Edge Biclique and Its Applications

Tan, J. (2008) · Springer eBooks · doi:10.1007/978-3-540-79228-4_25 · Cited by 29 · see citing works

Parallel scheduling of complex dags under uncertainty

Malewicz, G. G. (2005) · ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) · doi:10.1145/1073970.1073981 · Cited by 29 · see citing works

Refinement-Aware Generation of Attack Trees

Gadyatskaya, O., Jhawar, R., Mauw, S., Trujillo-Rasúa, R., & Willemse, T. A. C. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-68063-7_11 · Cited by 29 · see citing works

Uncovering Genomic Reassortments among Influenza Strains by Enumerating Maximal Bicliques

Nagarajan, N., & Kingsford, C. (2008) · IEEE International Conference on Bioinformatics and Biomedicine (BIBM) · doi:10.1109/bibm.2008.78 · Cited by 29 · see citing works

Nearly Tight Approximability Results for Minimum Biclique Cover and Partition

Chalermsook, P., Heydrich, S., Holm, E., & Karrenbauer, A. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-44777-2_20 · Cited by 28 · see citing works

Biclique completion problems for multicast network design

Faure, N., Chrétienne, P., Gourdin, É., & Sourd, F. (2007) · Discrete Optimization · doi:10.1016/j.disopt.2007.09.005 · Cited by 27 · see citing works

Finding Maximum Edge Bicliques in Convex Bipartite Graphs

Nussbaum, D., Pu, S., Sack, J.-R., Uno, T., & Zarrabi-Zadeh, H. (2011) · Algorithmica · doi:10.1007/s00453-010-9486-x · Cited by 27 · see citing works

Exponential Time Algorithms: Structures, Measures, and Bounds

Gaspers, S. (2010) · Cited by 27 · see citing works

Catching Worms, Trojan Horses and PUPs: Unsupervised Detection of Silent Delivery Campaigns

Kwon, B. J., Srinivas, V., Deshpande, A., & Dumitraş, T. (2017) · Network and Distributed System Security Symposium · doi:10.14722/ndss.2017.23220 · Cited by 26 · see citing works

Multi-tuple deletion propagation

Kimelfeld, B., Vondrák, J., & Woodruff, D. P. (2013) · Proceedings of the VLDB Endowment · doi:10.14778/2536258.2536267 · Cited by 26 · see citing works

Quasi-bicliques: Complexity and Binding Pairs

Liu, X., Li, J., & Wang, L. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-69733-6_26 · Cited by 25 · see citing works

Finding the most interesting correlations in a database: how hard can it be?

Jermaine, C. (2003) · Information Systems · doi:10.1016/j.is.2003.08.004 · Cited by 25 · see citing works

Finding large diverse communities on networks

Zhou, A., Wang, Y., & Chen, L. (2020) · Proceedings of the VLDB Endowment · doi:10.14778/3407790.3407846 · Cited by 24 · see citing works

Maximum and top-k diversified biclique search at scale

Lyu, B., Qin, L., Lin, X., Zhang, Y., Qian, Z., & Zhou, J. (2022) · The VLDB Journal · doi:10.1007/s00778-021-00681-6 · Cited by 24 · see citing works

Error Compensation in Leaf Root Problems

Dom, M., Guo, J., Hüffner, F., & Niedermeier, R. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30551-4_35 · Cited by 24 · see citing works

Improved Optimal and Approximate Power Graph Compression for Clearer Visualisation of Dense Graphs

Dwyer, T., Mears, C., Morgan, K. J., Niven, T., Marriott, K., & Wallace, M. G. (2014) · IEEE Pacific Visualization Symposium · doi:10.1109/pacificvis.2014.46 · Cited by 23 · see citing works

Entanglement in Multiplex Networks: Understanding Group Cohesion in Homophily Networks

Renoust, B., Melançon, G., & Viaud, M.-L. (2014) · Social Network Analysis · doi:10.1007/978-3-319-12188-8_5 · Cited by 22 · see citing works

Possibilistic Approach to Biclustering: An Application to Oligonucleotide Microarray Data Analysis

Filippone, M., Masulli, F., Stefano Rovetta, A., Mitra, S., & Banka, H. (2006) · Lecture notes in computer science · doi:10.1007/11885191_22 · Cited by 23 · see citing works

Weighted Rank-One Binary Matrix Factorization

Lu, H., Vaidya, J. S., Atluri, V., Shin, H., & Jiang, L. (2011) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972818.25 · Cited by 23 · see citing works

CMCS: a cross-layer mobility-aware MAC protocol for cognitive radio sensor networks

Zareei, M., Islam, A. K. M. M., Mansoor, N., Baharun, S., Mohamed, E. M., & Sampei, S. (2016) · EURASIP Journal on Wireless Communications and Networking · doi:10.1186/s13638-016-0652-y · Cited by 23 · see citing works

Security analysis of cyber‐physical systems using norm

Shames, I., Farokhi, F., & Summers, T. H. (2017) · IET Control Theory and Applications · doi:10.1049/iet-cta.2016.1391 · Cited by 23 · see citing works

A Graph-Theoretic Approach to Randomization Tests of Causal Effects under General Interference

Puelz, D., Basse, G., Feller, A., & Toulis, P. (2021) · Journal of the Royal Statistical Society Series B (Statistical Methodology) · doi:10.1111/rssb.12478 · Cited by 22 · see citing works

Spike-and-slab Lasso biclustering

Moran, G. E., Ročková, V., & George, E. I. (2021) · The Annals of Applied Statistics · doi:10.1214/20-aoas1385 · Cited by 21 · see citing works

Densest k-Subgraph Approximation on Intersection Graphs

Chen, D. Z., Fleischer, R., & Li, J. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-18318-8_8 · Cited by 21 · see citing works

A continuous characterization of the maximum-edge biclique problem

Gillis, N., & Glineur, F. (2013) · Journal of Global Optimization · doi:10.1007/s10898-013-0053-2 · Cited by 21 · see citing works

BLIND: A privacy preserving truth discovery system for mobile crowdsensing

Agate, V., Ferraro, P., Re, G. L., & Das, S. K. (2023) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2023.103811 · Cited by 20 · see citing works

On Independent Sets and Bicliques in Graphs

Gaspers, S., Kratsch, D., & Liedloff, M. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-92248-3_16 · Cited by 20 · see citing works

Mapping between Spin-Glass Three-Dimensional (3D) Ising Model and Boolean Satisfiability Problem

Zhi-dong, Z. (2023) · Mathematics · doi:10.3390/math11010237 · Cited by 19 · see citing works

Finding Maximum Edge Biclique in Bipartite Networks by Integer Programming

Sözdinler, M., & Özturan, C. (2018) · IEEE International Conference on Computational Science and Engineering (CSE) · doi:10.1109/cse.2018.00025 · Cited by 15 · see citing works

Maximum Edge Bicliques in Tree Convex Bipartite Graphs

Chen, H., & Liu, T. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-59605-1_5 · Cited by 6 · see citing works

On bipartite and multipartite . . .

Dawande, M., Keskinocak, P., Swaminathan, J. M., & Tayur, S. (2000)

Finding Maximum Edge Bicliques in Convex Bipartite Graphs

NussbaumDoron, PuShuye, SackJörg-Rüdiger, UnoTakeaki, & Zarrabi-ZadehHamid (2012) · Algorithmica · doi:10.5555/3118237.3118545 · Cited by 1 · see citing works

Maximizing edge-ratio is NP-complete

Noble, S. D., Hansen, P., & Mladenović, N. (2011) · Discrete Applied Mathematics · doi:10.1016/j.dam.2011.07.016 · Cited by 2 · see citing works