On the public citation graph
The Parameterized Complexity of the k -Biclique Problem
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.1007/11847250_11openalex-snapshot
Parameterized Approximation Problems
inferredcites →https://doi.org/10.1007/11847250_9openalex-snapshot
Fixed-Parameter Approximation: Conceptual Framework and Approximability Results
inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_19openalex-snapshot
Graph Theory and Probability
inferredcites →https://doi.org/10.1007/978-1-4471-5559-1openalex-snapshot
Fundamentals of Parameterized Complexity
inferredcites →https://doi.org/10.1007/978-3-642-31155-0_13openalex-snapshot
Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths
inferredcites →https://doi.org/10.1007/978-94-015-9239-0openalex-snapshot
Finite Fields: Theory and Computation: The Meeting Point of Number Theory, Computer Science, Coding Theory and Cryptography
inferredcites →https://doi.org/10.1007/bf01261323openalex-snapshot
Norm-graphs and bipartite tur�n numbers
inferredcites →https://doi.org/10.1007/bfb0080437openalex-snapshot
Equations over Finite Fields An Elementary Approach
inferredcites →https://doi.org/10.1007/s00453-010-9474-1openalex-snapshot
On Independent Sets and Bicliques in Graphs
inferredcites →https://doi.org/10.1016/0196-6774(86)90020-9openalex-snapshot
The NP-completeness column: An ongoing guide
inferredcites →https://doi.org/10.1016/0196-6774(86)90023-4openalex-snapshot
Graph minors. II. Algorithmic aspects of tree-width
inferredcites →https://doi.org/10.1016/0196-6774(87)90021-6openalex-snapshot
The NP-completeness column: An ongoing guide
inferredcites →https://doi.org/10.1016/j.ipl.2010.10.020openalex-snapshot
Exact exponential-time algorithms for finding bicliques
inferredcites →https://doi.org/10.1016/j.ipl.2012.01.010openalex-snapshot
Bicolored independent sets and bicliques
inferredcites →https://doi.org/10.1016/j.ipl.2012.03.007openalex-snapshot
A note on a Maximum k-Subset Intersection problem
inferredcites →https://doi.org/10.1016/j.ipl.2012.04.001openalex-snapshot
An exact exponential time algorithm for counting bipartite cliques
inferredcites →https://doi.org/10.1016/s1571-0661(04)00301-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1093/comjnl/bxm048openalex-snapshot
Parameterized Complexity and Approximation Algorithms
inferredcites →https://doi.org/10.1109/focs.2016.61openalex-snapshot
The Constant Inapproximability of the Parameterized Dominating Set Problem
inferredcites →https://doi.org/10.1109/sfcs.1998.743516openalex-snapshot
Which problems have strongly exponential complexity?
inferredcites →https://doi.org/10.1112/jlms/s1-9.4.282openalex-snapshot
A Theorem of Sylvester and Schur
inferredcites →https://doi.org/10.1137/080729256openalex-snapshot
Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
inferredcites →https://doi.org/10.1137/120882160openalex-snapshot
Constraint Satisfaction Parameterized by Solution Size
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/1007352.1007391openalex-snapshot
Linear FPT reductions and computational lower bounds
inferredcites →https://doi.org/10.1145/1206035.1206036openalex-snapshot
The complexity of homomorphism and constraint satisfaction problems seen from the other side
inferredcites →https://doi.org/10.1145/12130.12166openalex-snapshot
Finding irreducible polynomials over finite fields
inferredcites →https://doi.org/10.1145/237814.238010openalex-snapshot
Extremal bipartite graphs and superpolynomial lower bounds for monotone span programs
inferredcites →https://doi.org/10.1145/276698.276784openalex-snapshot
The approximability of NP-hard problems
inferredcites →https://doi.org/10.1145/509907.509985openalex-snapshot
Relations between average case complexity and approximation complexity
inferredcites →https://doi.org/10.6092/issn.1972-5787/3406openalex-snapshot
A proof of Bertrand's postulate
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-19955-5_17openalex-snapshot
Parameterized Complexity of Conflict-Free Set Cover
inferred← citeshttps://doi.org/10.1007/978-3-030-38919-2_20openalex-snapshot
Parameterized Dynamic Variants of Red-Blue Dominating Set
inferred← citeshttps://doi.org/10.1007/978-3-031-26390-3_1openalex-snapshot
Algorithmic Tools for Understanding the Motif Structure of Networks
inferred← citeshttps://doi.org/10.1007/978-3-032-11835-6_4openalex-snapshot
When Does FTP Become FPT?
inferred← citeshttps://doi.org/10.1007/978-981-92-3309-0_1openalex-snapshot
Bi-Perfect Graphs and the Approximability of Maximum Balanced Biclique
inferred← citeshttps://doi.org/10.1007/s00453-021-00805-yopenalex-snapshot
Parameterized Counting of Partially Injective Homomorphisms
inferred← citeshttps://doi.org/10.1007/s00453-022-01090-zopenalex-snapshot
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs
inferred← citeshttps://doi.org/10.1007/s00453-025-01338-4openalex-snapshot
On Equivalence of Parameterized Inapproximability of k-Median, k-Max-Coverage, and 2-CSP
inferred← citeshttps://doi.org/10.1007/s00493-019-4113-1openalex-snapshot
On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic
inferred← citeshttps://doi.org/10.1007/s11856-025-2732-3openalex-snapshot
Applications of random algebraic constructions to hardness of approximation
inferred← citeshttps://doi.org/10.1016/j.ipl.2021.106105openalex-snapshot
Hardness and tractability of the γ-Complete Subgraph problem
inferred← citeshttps://doi.org/10.1016/j.jcss.2024.103574openalex-snapshot
Minimum separator reconfiguration
inferred← citeshttps://doi.org/10.1016/j.knosys.2023.110561openalex-snapshot
Detecting maximum k-durable structures on temporal graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114783openalex-snapshot
The parameterized complexity of welfare guarantees in Schelling segregation
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.116060openalex-snapshot
Parameterized approximation scheme for feedback vertex set
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.116071openalex-snapshot
Biclique reconfiguration in bipartite graphs
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00032openalex-snapshot
Applications of Random Algebraic Constructions to Hardness of Approximation
inferred← citeshttps://doi.org/10.1137/1.9781611976465.11openalex-snapshot
Solving hard cut problems via flow-augmentation
inferred← citeshttps://doi.org/10.1137/1.9781611976465.14openalex-snapshot
FPT-approximation for FPT Problems
inferred← citeshttps://doi.org/10.1137/1.9781611976472.24openalex-snapshot
On Hardness of Approximation of Parameterized Set Cover and Label Cover: Threshold Graphs from Error Correcting Codes
inferred← citeshttps://doi.org/10.1137/1.9781611977073.95openalex-snapshot
Improved Algorithms for Low Rank Approximation from Sparsity
inferred← citeshttps://doi.org/10.1137/22m1479804openalex-snapshot
Parameterized Counting and Cayley Graph Expanders
inferred← citeshttps://doi.org/10.1137/23m1553698openalex-snapshot
Flow-Augmentation III: Complexity Dichotomy for Boolean CSPs Parameterized by the Number of Unsatisfied Constraints
inferred← citeshttps://doi.org/10.1137/23m1573021openalex-snapshot
Parameterized Inapproximability of the Minimum Distance Problem over All Fields and the Shortest Vector Problem in All \({\ell_{{p}}}\) Norms
inferred← citeshttps://doi.org/10.1145/3406325.3451016openalex-snapshot
Constant approximating k-clique is w[1]-hard
inferred← citeshttps://doi.org/10.1145/3444942openalex-snapshot
Parameterized Intractability of Even Set and Shortest Vector Problem
inferred← citeshttps://doi.org/10.1145/3564246.3585214openalex-snapshot
Parameterized Inapproximability of the Minimum Distance Problem over All Fields and the Shortest Vector Problem in All ℓ p Norms
inferred← citeshttps://doi.org/10.1145/3618260.3649771openalex-snapshot
Parameterized Inapproximability Hypothesis under Exponential Time Hypothesis
inferred← citeshttps://doi.org/10.1145/3717823.3718257openalex-snapshot
Near Optimal Constant Inapproximability under ETH for Fundamental Problems in Parameterized Complexity
inferred← citeshttps://doi.org/10.1145/3749982openalex-snapshot
Parameterized Inapproximability Hypothesis under ETH
inferred← citeshttps://doi.org/10.1145/3767710openalex-snapshot
A Unifying Algorithm for Hierarchical Queries
inferred← citeshttps://doi.org/10.1145/3798129.3800813openalex-snapshot
Oracle Subset Problems: A Meta-algorithm for FPT Approximation via Random Walks
inferred← citeshttps://doi.org/10.14778/3529337.3529341openalex-snapshot
Efficient maximal biclique enumeration for large sparse bipartite graphs
inferred← citeshttps://doi.org/10.3390/a13060146openalex-snapshot
A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms
inferred← citeshttps://doi.org/10.4208/aam.oa-2025-0015openalex-snapshot
A Criterion for Andrásfai–Erdős–Sόs Type Theorems and Applications
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2020.27openalex-snapshot
Finding Small Satisfying Assignments Faster Than Brute Force: A Fine-Grained Perspective into Boolean Constraint Satisfaction
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2019.81openalex-snapshot
A Simple Gap-Producing Reduction for the Parameterized Set Cover Problem
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2021.108openalex-snapshot
Detecting and Counting Small Subgraphs, and Evaluating a Parameterized Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph Expanders
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2019.17openalex-snapshot
On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic
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.