On the public citation graph
Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
0 signed · 78 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jagm.2001.1199openalex-snapshot
On Bipartite and Multipartite Clique Problems
inferredcites →https://doi.org/10.1007/s00037-006-0210-9openalex-snapshot
ON THE HARDNESS OF APPROXIMATING MULTICUT AND SPARSEST-CUT
inferredcites →https://doi.org/10.1016/0166-218x(90)90133-wopenalex-snapshot
Sparsest cuts and bottlenecks in graphs
inferredcites →https://doi.org/10.1016/0890-5401(92)90056-lopenalex-snapshot
On the complexity of approximating the independent set problem
inferredcites →https://doi.org/10.1016/j.ipl.2006.07.009openalex-snapshot
An improved approximation ratio for the minimum linear arrangement problem
inferredcites →https://doi.org/10.1016/s0166-218x(03)00333-0openalex-snapshot
The maximum edge biclique problem is NP-complete
inferredcites →https://doi.org/10.1109/ccc.2003.1214436openalex-snapshot
A strong inapproximability gap for a generalization of minimum bisection
inferredcites →https://doi.org/10.1109/ccc.2012.43openalex-snapshot
Reductions between Expansion Problems
inferredcites →https://doi.org/10.1109/focs.2007.40openalex-snapshot
Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling
inferredcites →https://doi.org/10.1109/sfcs.2005.74openalex-snapshot
The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into \ell 1
inferredcites →https://doi.org/10.1137/s0097539702413197openalex-snapshot
New Approximation Techniques for Some Linear Ordering Problems
inferredcites →https://doi.org/10.1137/s0097539705447037openalex-snapshot
Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique
inferredcites →https://doi.org/10.1145/1361192.1361199openalex-snapshot
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut
inferredcites →https://doi.org/10.1145/1806689.1806792openalex-snapshot
Graph expansion and the unique games conjecture
inferredcites →https://doi.org/10.1145/273865.273901openalex-snapshot
Probabilistic checking of proofs
inferredcites →https://doi.org/10.1145/278298.278306openalex-snapshot
Proof verification and the hardness of approximation problems
inferredcites →https://doi.org/10.1145/331524.331526openalex-snapshot
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
inferredcites →https://doi.org/10.1145/568522.568523openalex-snapshot
A survey of graph layout problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/sam.11192openalex-snapshot
Mining Compressing Sequential Patterns
inferred← citeshttps://doi.org/10.1007/978-3-030-03592-1_16openalex-snapshot
Verification of Binarized Neural Networks via Inter-neuron Factoring
inferred← citeshttps://doi.org/10.1007/978-3-030-22629-9_27openalex-snapshot
Less Is More: Tabu Search for Bipartite Quadratic Programming Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-39219-2_10openalex-snapshot
Maximum Weighted Edge Biclique Problem on Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-48966-3_17openalex-snapshot
Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges
inferred← citeshttps://doi.org/10.1007/978-3-030-60440-0_19openalex-snapshot
On Finding Balanced Bicliques via Matchings
inferred← citeshttps://doi.org/10.1007/978-3-030-79987-8_18openalex-snapshot
On an Ordering Problem in Weighted Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-319-32049-6_14openalex-snapshot
Bitruss Decomposition of Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-59605-1_5openalex-snapshot
Maximum Edge Bicliques in Tree Convex Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-32512-0_27openalex-snapshot
Approximation Guarantees for the Minimum Linear Arrangement Problem by Higher Eigenvalues
inferred← citeshttps://doi.org/10.1007/978-3-642-40164-0_26openalex-snapshot
Domination Analysis of Algorithms for Bipartite Boolean Quadratic Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-40450-4_39openalex-snapshot
Tractable Parameterizations for the Minimum Linear Arrangement Problem
inferred← citeshttps://doi.org/10.1007/978-3-662-44777-2_20openalex-snapshot
Nearly Tight Approximability Results for Minimum Biclique Cover and Partition
inferred← citeshttps://doi.org/10.1007/s00446-014-0217-4openalex-snapshot
Adversarial topology discovery in network virtualization environments: a threat for ISPs?
inferred← citeshttps://doi.org/10.1007/s00454-012-9440-6openalex-snapshot
Hardness of Approximation for Crossing Number
inferred← citeshttps://doi.org/10.1007/s00778-021-00681-6openalex-snapshot
Maximum and top-k diversified biclique search at scale
inferred← citeshttps://doi.org/10.1007/s00778-024-00882-9openalex-snapshot
Accelerating maximum biplex search over large bipartite graphs
inferred← citeshttps://doi.org/10.1007/s10107-023-02038-zopenalex-snapshot
Hardness and approximation of submodular minimum linear ordering problems
inferred← citeshttps://doi.org/10.1016/j.cor.2014.05.019openalex-snapshot
Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem
inferred← citeshttps://doi.org/10.1016/j.dam.2015.04.004openalex-snapshot
The bipartite unconstrained 0–1 quadratic programming problem: Polynomially solvable cases
inferred← citeshttps://doi.org/10.1016/j.ejor.2014.09.036openalex-snapshot
Integrating tabu search and VLSN search to develop enhanced algorithms: A case study using bipartite boolean quadratic programs
inferred← citeshttps://doi.org/10.1016/j.ejor.2017.01.001openalex-snapshot
Markov Chain methods for the Bipartite Boolean Quadratic Programming Problem
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104514openalex-snapshot
Minimum fill-in: Inapproximability and almost tight lower bounds
inferred← citeshttps://doi.org/10.1016/j.ipl.2012.03.007openalex-snapshot
A note on a Maximum k-Subset Intersection problem
inferred← citeshttps://doi.org/10.1016/j.ipl.2013.04.003openalex-snapshot
d-dimensional arrangement revisited
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.11.008openalex-snapshot
Average value of solutions for the bipartite boolean quadratic programs and rounding algorithms
inferred← citeshttps://doi.org/10.1109/icdcs60910.2024.00025openalex-snapshot
Learning Minimum Linear Arrangement of Cliques and Lines
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00072openalex-snapshot
Maximum Biplex Search over Bipartite Graphs
inferred← citeshttps://doi.org/10.1109/tkde.2022.3220901openalex-snapshot
Efficient Maximum Edge-Weighted Biclique Search on Large Bipartite Graphs
inferred← citeshttps://doi.org/10.1137/1.9781611974782.55openalex-snapshot
Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds
inferred← citeshttps://doi.org/10.1137/13093025xopenalex-snapshot
Constant Factor Lasserre Integrality Gaps for Graph Partitioning Problems
inferred← citeshttps://doi.org/10.1137/16m1082421openalex-snapshot
Bi-Covering: Covering Edges with Two Small Subsets of Vertices
inferred← citeshttps://doi.org/10.1145/2488608.2488644openalex-snapshot
Sparsest cut on bounded treewidth graphs
inferred← citeshttps://doi.org/10.1145/2897518.2897639openalex-snapshot
Weighted low rank approximations with provable guarantees
inferred← citeshttps://doi.org/10.1145/2898352openalex-snapshot
Tractable Parameterizations for the Minimum Linear Arrangement Problem
inferred← citeshttps://doi.org/10.1145/2996799openalex-snapshot
Cheeger-Type Approximation for Sparsest st -Cut
inferred← citeshttps://doi.org/10.1145/3212622openalex-snapshot
The Parameterized Complexity of the k -Biclique Problem
inferred← citeshttps://doi.org/10.1145/3228342openalex-snapshot
Approximation Guarantees for the Minimum Linear Arrangement Problem by Higher Eigenvalues
inferred← citeshttps://doi.org/10.1145/3292500.3330829openalex-snapshot
Optimizing Impression Counts for Outdoor Advertising
inferred← citeshttps://doi.org/10.11606/t.45.2012.tde-26112012-161435openalex-snapshot
Empacotamento de bicliques em grafos bipartidos
inferred← citeshttps://doi.org/10.1287/ijoc.2018.0871openalex-snapshot
Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking
inferred← citeshttps://doi.org/10.1287/moor.1110.0520openalex-snapshot
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
inferred← citeshttps://doi.org/10.14778/2536258.2536267openalex-snapshot
Multi-tuple deletion propagation
inferred← citeshttps://doi.org/10.14778/3397230.3397234openalex-snapshot
Maximum biclique search at billion scale
inferred← citeshttps://doi.org/10.14778/3836663.3836687openalex-snapshot
Maximum Defective Biclique Search in Large Bipartite Graphs
inferred← citeshttps://doi.org/10.1609/aaai.v35i17.17781openalex-snapshot
Using Unsupervised Learning for Data-driven Procurement Demand Aggregation
inferred← citeshttps://doi.org/10.3390/a10040113openalex-snapshot
Scale Reduction Techniques for Computing Maximum Induced Bicliques
inferred← citeshttps://doi.org/10.3390/a11010010openalex-snapshot
Inapproximability of Maximum Biclique Problems, Minimum k-Cut and Densest At-Least-k-Subgraph from the Small Set Expansion Hypothesis
inferred← citeshttps://doi.org/10.3390/math13010088openalex-snapshot
Maximum Butterfly Generators Search in Bipartite Networks
inferred← citeshttps://doi.org/10.3934/jimo.2025131openalex-snapshot
Maximum edge bi-clique via matrix decomposition
inferred← citeshttps://doi.org/10.4230/lipics.approx-random.2015.361openalex-snapshot
A Tight Approximation Bound for the Stable Marriage Problem with Restricted Ties
inferred← citeshttps://doi.org/10.48550/arxiv.1210.3684openalex-snapshot
Heuristic algorithms for the bipartite unconstrained 0-1 quadratic programming problem
inferred← citeshttps://doi.org/10.48550/arxiv.1404.5236openalex-snapshot
Sum-of-squares proofs and the quest toward optimal algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1406.3700openalex-snapshot
The Parameterized Complexity of k-Biclique
inferred← citeshttps://doi.org/10.48550/arxiv.1410.3889openalex-snapshot
Cheeger-type approximation for sparsest $st$-cut
inferred← citeshttps://doi.org/10.48550/arxiv.1503.08946openalex-snapshot
Workload-Driven Vertical Partitioning for Effective Query Processing over Raw Data
inferred← citeshttps://doi.org/10.48550/arxiv.1511.00310openalex-snapshot
Parameterized Integer Quadratic Programming: Variables and Coefficients
inferred← citeshttps://doi.org/10.48550/arxiv.1804.09699openalex-snapshot
Towards Fast Computation of Certified Robustness for ReLU Networks
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.