{"list":"other","total":63,"rows":[{"id":"1508.04874","title":"A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization","created":"2015-08-20","cited_by_count":50},{"id":"1308.0971","title":"Clustering and Community Detection in Directed Networks: A Survey","created":"2013-08-05","cited_by_count":38},{"id":"2011.10202","title":"CLIPPER: A Graph-Theoretic Framework for Robust Data Association","created":"2020-11-20","cited_by_count":28},{"id":"2006.05176","title":"Explainable Classification of Brain Networks via Contrast Subgraphs","created":"2020-06-09","cited_by_count":26},{"id":"1311.3144","title":"Recent Advances in Graph Partitioning","created":"2013-11-13","cited_by_count":25},{"id":"2205.13426","title":"AntiBenford Subgraphs: Unsupervised Anomaly Detection in Financial Networks","created":"2022-05-26","cited_by_count":18},{"id":"2001.02817","title":"Hypergraph Cuts with General Splitting Functions","created":"2020-01-09","cited_by_count":14},{"id":"1706.03374","title":"DenseAlert: Incremental Dense-Subtensor Detection in Tensor Streams","created":"2017-06-11","cited_by_count":13},{"id":"2203.14573","title":"Detection threshold for correlated Erd\\H{o}s-R\\'enyi graphs via densest subgraphs","created":"2022-03-28","cited_by_count":13},{"id":"1605.04284","title":"The Densest k-Subhypergraph Problem","created":"2016-05-13","cited_by_count":10},{"id":"2105.13287","title":"Differentially Private Densest Subgraph Detection","created":"2021-05-27","cited_by_count":7},{"id":"1506.04417","title":"Densest Subgraph in Dynamic Graph Streams","created":"2015-06-14","cited_by_count":6},{"id":"1611.02756","title":"Peeling Bipartite Networks for Dense Subgraph Discovery","created":"2016-11-08","cited_by_count":6},{"id":"1810.06230","title":"No Place to Hide: Catching Fraudulent Entities in Tensors","created":"2018-10-15","cited_by_count":6},{"id":"2002.08841","title":"Contextual Reserve Price Optimization in Auctions via Mixed-Integer Programming","created":"2020-02-20","cited_by_count":6},{"id":"2106.00508","title":"Differentially Private Densest Subgraph","created":"2021-06-01","cited_by_count":6},{"id":"2208.11200","title":"FirmCore Decomposition of Multilayer Networks","created":"2022-08-23","cited_by_count":6},{"id":"2211.06977","title":"Spade: A Real-Time Fraud Detection Framework on Evolving Graphs (Complete Version)","created":"2022-11-13","cited_by_count":6},{"id":"2211.10887","title":"Differential Privacy from Locally Adjustable Graph Algorithms: $k$-Core Decomposition, Low Out-Degree Ordering, and Densest Subgraphs","created":"2022-11-20","cited_by_count":6},{"id":"1504.02268","title":"Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams","created":"2015-04-09","cited_by_count":5},{"id":"1907.03037","title":"Near-Optimal Fully Dynamic Densest Subgraph","created":"2019-07-05","cited_by_count":5},{"id":"1912.11113","title":"EnsemFDet: An Ensemble Approach to Fraud Detection based on Bipartite Graph","created":"2019-12-23","cited_by_count":5},{"id":"2011.11500","title":"Statistical and computational thresholds for the planted $k$-densest sub-hypergraph problem","created":"2020-11-23","cited_by_count":5},{"id":"2106.00909","title":"The Generalized Mean Densest Subgraph Problem","created":"2021-06-02","cited_by_count":5},{"id":"1802.06775","title":"Mining Density Contrast Subgraphs","created":"2018-02-18","cited_by_count":4},{"id":"1808.09317","title":"Finding events in temporal networks: Segmentation meets densest-subgraph discovery","created":"2018-08-28","cited_by_count":4},{"id":"1812.08712","title":"Core Decomposition in Multilayer Networks: Theory, Algorithms, and Applications","created":"2018-12-20","cited_by_count":4},{"id":"1906.00341","title":"Efficient Algorithms for Densest Subgraph Discovery","created":"2019-06-02","cited_by_count":4},{"id":"2006.13642","title":"Online Dense Subgraph Discovery via Blurred-Graph Feedback","created":"2020-06-24","cited_by_count":4},{"id":"1411.3312","title":"Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions","created":"2014-11-12","cited_by_count":3},{"id":"1703.03603","title":"The Densest Subgraph Problem with a Convex/Concave Size Function","created":"2017-03-10","cited_by_count":3},{"id":"1904.08178","title":"Novel Dense Subgraph Discovery Primitives: Risk Aversion and Exclusion Queries","created":"2019-04-17","cited_by_count":3},{"id":"1905.08088","title":"Graph Mining Meets Crowdsourcing: Extracting Experts for Answer Aggregation","created":"2019-05-17","cited_by_count":3},{"id":"1909.12387","title":"Faster width-dependent algorithm for mixed packing and covering LPs","created":"2019-09-26","cited_by_count":3},{"id":"1910.07087","title":"Flowless: Extracting Densest Subgraphs Without Flow Computations","created":"2019-10-15","cited_by_count":3},{"id":"1506.04505","title":"Applications of Uniform Sampling: Densest Subgraph and Beyond","created":"2015-06-15","cited_by_count":2},{"id":"1612.05440","title":"Best Friends Forever (BFF): Finding Lasting Dense Subgraphs","created":"2016-12-16","cited_by_count":2},{"id":"1802.06361","title":"On Finding Dense Common Subgraphs","created":"2018-02-18","cited_by_count":2},{"id":"1807.09302","title":"Metric Sublinear Algorithms via Linear Sampling","created":"2018-07-24","cited_by_count":2},{"id":"1901.06344","title":"On solving the densest $k$-subgraph problem on large graphs","created":"2019-01-18","cited_by_count":2},{"id":"1904.03272","title":"Convex optimization for the densest subgraph and densest submatrix problems","created":"2019-04-05","cited_by_count":2},{"id":"1907.12443","title":"Distributed Dense Subgraph Detection and Low Outdegree Orientation","created":"2019-07-29","cited_by_count":2},{"id":"2002.10047","title":"Parallel Clique Counting and Peeling Algorithms","created":"2020-02-24","cited_by_count":2},{"id":"2102.03434","title":"Exploring the Subgraph Density-Size Trade-off via the Lov\\'asz Extension","created":"2021-02-05","cited_by_count":2},{"id":"2204.08106","title":"A New Dynamic Algorithm for Densest Subhypergraphs","created":"2022-04-17","cited_by_count":2},{"id":"2206.10901","title":"A Study on Modularity Density Maximization: Column Generation Acceleration and Computational Complexity Analysis","created":"2022-06-22","cited_by_count":2},{"id":"2211.03306","title":"Stochastic Solutions for Dense Subgraph Discovery in Multilayer Networks","created":"2022-11-07","cited_by_count":2},{"id":"1505.06661","title":"Towards Realistic Team Formation in Social Networks based on Densest Subgraphs","created":"2015-05-25","cited_by_count":1},{"id":"1801.03190","title":"Risk-Averse Matchings over Uncertain Graph Databases","created":"2018-01-09","cited_by_count":1},{"id":"1809.04802","title":"Robust Densest Subgraph Discovery","created":"2018-09-13","cited_by_count":1},{"id":"1904.07262","title":"Distance-generalized Core Decomposition","created":"2019-04-15","cited_by_count":1},{"id":"1907.03863","title":"The Densest k Subgraph Problem in b-Outerplanar Graphs","created":"2019-07-08","cited_by_count":1},{"id":"1911.02356","title":"In Search of Dense Subgraphs: How Good is Greedy Peeling?","created":"2019-11-06","cited_by_count":1},{"id":"2004.13978","title":"Planted Models for the Densest $k$-Subgraph Problem","created":"2020-04-29","cited_by_count":1},{"id":"2007.01533","title":"Finding Densest $k$-Connected Subgraphs","created":"2020-07-03","cited_by_count":1},{"id":"2007.03950","title":"Mining Dense Subgraphs with Similar Edges","created":"2020-07-08","cited_by_count":1},{"id":"2112.03337","title":"Dense and well-connected subgraph detection in dual networks","created":"2021-12-06","cited_by_count":1},{"id":"2207.08340","title":"Extracting Densest Sub-hypergraph with Convex Edge-weight Functions","created":"2022-07-18","cited_by_count":1},{"id":"2207.09803","title":"Computing Densest $k$-Subgraph with Structural Parameters","created":"2022-07-20","cited_by_count":1},{"id":"2208.07572","title":"Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs","created":"2022-08-16","cited_by_count":1},{"id":"2209.14087","title":"Adaptive Out-Orientations with Applications","created":"2022-09-28","cited_by_count":1},{"id":"2210.02611","title":"$(1-\\epsilon)$-approximate fully dynamic densest subgraph: linear space and faster update time","created":"2022-10-06","cited_by_count":1},{"id":"2212.08820","title":"Most Probable Densest Subgraphs","created":"2022-12-17","cited_by_count":1}],"next_cursor":null}