On the public citation graph
Combinatorial Search on Graphs Motivated by Bioinformatics Applications: A Brief Survey
0 signed · 71 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/11428848_130openalex-snapshot
Optimal Group Testing Strktegies with Interval Queries and Their Application to Splice Site Detection
inferredcites →https://doi.org/10.1007/11809678_34openalex-snapshot
Improved On-Line Broadcast Scheduling with Deadlines
inferredcites →https://doi.org/10.1007/3-540-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
inferredcites →https://doi.org/10.1007/3-540-68535-9_23openalex-snapshot
On the Power of Additive Combinatorial Search Model
inferredcites →https://doi.org/10.1007/978-3-540-27836-8_12openalex-snapshot
Learning a Hidden Subgraph
inferredcites →https://doi.org/10.1007/s004530010033openalex-snapshot
Optimal Reconstruction of Graphs under the Additive Model
inferredcites →https://doi.org/10.1016/0022-314x(72)90052-2openalex-snapshot
On B2-sequences of vectors
inferredcites →https://doi.org/10.1016/0097-3165(94)90064-7openalex-snapshot
Kolmogorov complexity arguments in combinatorics
inferredcites →https://doi.org/10.1016/s0021-9800(69)80038-4openalex-snapshot
Determination of two vectors from the sum
inferredcites →https://doi.org/10.1016/s0166-218x(98)00070-5openalex-snapshot
Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping
inferredcites →https://doi.org/10.1080/00401706.1975.10489386openalex-snapshot
A Survey of Statistical Design and Linear Models
inferredcites →https://doi.org/10.1093/bioinformatics/bth936openalex-snapshot
Optimal robust non-unique probe selection using Integer Linear Programming
inferredcites →https://doi.org/10.1137/1.9780898716474openalex-snapshot
Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
inferredcites →https://doi.org/10.1142/1936openalex-snapshot
Combinatorial Group Testing and Its Applications
inferredcites →https://doi.org/10.1142/9789812798107openalex-snapshot
Combinatorial Group Testing and Its Applications
inferredcites →https://doi.org/10.1504/ijbra.2005.008441openalex-snapshot
Optimal group testing algorithms with interval queries and their application to splice site detection
inferredcites →https://doi.org/10.4153/cjm-1966-007-2openalex-snapshot
Determination of a Subset from Certain Combinatorial Properties
inferredcites →https://doi.org/10.4153/cmb-1965-034-2openalex-snapshot
On a Combinatorial Problem in Number Theory
inferredcites →https://doi.org/10.4153/cmb-1971-092-9openalex-snapshot
On Möbius Functions and a Problem in Combinatorial Number Theory
inferredcites →https://doi.org/10.48550/arxiv.math/9505211openalex-snapshot
Group testing problems in experimental molecular biology
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/net.20404openalex-snapshot
Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries
inferred← citeshttps://doi.org/10.1007/978-3-030-30278-8_1openalex-snapshot
Distributed Computation of Top-k Degrees in Hidden Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-11662-4_9openalex-snapshot
On Exact Learning Monotone DNF from Membership Queries
inferred← citeshttps://doi.org/10.1007/978-3-319-18173-8_5openalex-snapshot
Linear Time Constructions of Some $$d$$-Restriction Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-24486-0_6openalex-snapshot
Non-adaptive Learning of a Hidden Hypergraph
inferred← citeshttps://doi.org/10.1007/978-3-540-75225-7_24openalex-snapshot
Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
inferred← citeshttps://doi.org/10.1007/978-3-642-03409-1_9openalex-snapshot
Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity
inferred← citeshttps://doi.org/10.1007/978-3-642-04414-4_12openalex-snapshot
Reconstructing Weighted Graphs with Minimal Query Complexity
inferred← citeshttps://doi.org/10.1007/978-3-642-15155-2_21openalex-snapshot
Toward a Deterministic Polynomial Time Algorithm with Optimal Additive Query Complexity
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_62openalex-snapshot
Graph Reconstruction via Distance Oracles
inferred← citeshttps://doi.org/10.1007/s10878-010-9291-0openalex-snapshot
Reconstruction of hidden graphs and threshold group testing
inferred← citeshttps://doi.org/10.1007/s11590-017-1131-zopenalex-snapshot
Learning a hidden uniform hypergraph
inferred← citeshttps://doi.org/10.1016/b978-0-444-52936-7.50018-5openalex-snapshot
Mechanizing Induction
inferred← citeshttps://doi.org/10.1016/j.artint.2010.02.003openalex-snapshot
Optimal query complexity bounds for finding graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2008.06.003openalex-snapshot
Nonadaptive algorithms for threshold group testing
inferred← citeshttps://doi.org/10.1016/j.dam.2015.06.035openalex-snapshot
Reconstructing Markov processes from independent and anonymous experiments
inferred← citeshttps://doi.org/10.1016/j.datak.2018.12.004openalex-snapshot
Core discovery in hidden networks
inferred← citeshttps://doi.org/10.1016/j.jcss.2010.08.011openalex-snapshot
Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.12.055openalex-snapshot
Reconstructing weighted graphs with minimal query complexity
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.09.005openalex-snapshot
Toward a deterministic polynomial time algorithm with optimal additive query complexity
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.11.019openalex-snapshot
Non-adaptive learning of a hidden hypergraph
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.04.034openalex-snapshot
Exact learning from an honest teacher that answers membership queries
inferred← citeshttps://doi.org/10.1109/allerton49937.2022.9929414openalex-snapshot
On Learning a Hidden Directed Graph with Path Queries
inferred← citeshttps://doi.org/10.1109/infcomw.2009.5072135openalex-snapshot
Efficient Measurement of Complex Networks Using Link Queries
inferred← citeshttps://doi.org/10.1109/isit.2016.7541485openalex-snapshot
On multistage learning a hidden hypergraph
inferred← citeshttps://doi.org/10.1109/isit54713.2023.10206632openalex-snapshot
On Constant-Weight Binary B 2 -Sequences
inferred← citeshttps://doi.org/10.1109/synasc.2011.44openalex-snapshot
An Upper Bound on Checking Test Complexity for Almost All Cographs
inferred← citeshttps://doi.org/10.1109/tkde.2012.178openalex-snapshot
Identifying the Most Connected Vertices in Hidden Bipartite Graphs Using Group Testing
inferred← citeshttps://doi.org/10.1109/tpami.2023.3283784openalex-snapshot
Learning Hidden Graphs From Samples
inferred← citeshttps://doi.org/10.1137/1.9781611973075.51openalex-snapshot
Optimally Reconstructing Weighted Graphs Using Queries: (Extended Abstract)
inferred← citeshttps://doi.org/10.1145/1374376.1374484openalex-snapshot
Optimal query complexity bounds for finding graphs
inferred← citeshttps://doi.org/10.1145/3409964.3461822openalex-snapshot
Parallel Network Mapping Algorithms
inferred← citeshttps://doi.org/10.20381/ruor-5890openalex-snapshot
Error Locating Arrays, Adaptive Software Testing, and Combinatorial Group Testing
inferred← citeshttps://doi.org/10.48550/arxiv.1201.3793openalex-snapshot
Finding Weighted Graphs by Combinatorial Search
inferred← citeshttps://doi.org/10.48550/arxiv.1502.04137openalex-snapshot
Non-Adaptive Learning a Hidden Hipergraph
inferred← citeshttps://doi.org/10.48550/arxiv.1508.06336openalex-snapshot
SPRIGHT: A Fast and Robust Framework for Sparse Walsh-Hadamard Transform
inferred← citeshttps://doi.org/10.48550/arxiv.1607.00507openalex-snapshot
Adaptive Learning a Hidden Hypergraph
inferred← citeshttps://doi.org/10.48550/arxiv.1905.03410openalex-snapshot
Learning Erdős-Rényi Random Graphs via Edge Detecting Queries
inferred← citeshttps://doi.org/10.48550/arxiv.2011.08611openalex-snapshot
Quantum algorithms for learning a hidden graph and beyond
inferred← citeshttps://doi.org/10.5555/1873601.1873652openalex-snapshot
Optimally reconstructing weighted graphs using queries
inferred← citeshttps://doi.org/10.5555/2133036.2133142openalex-snapshot
On parity check (0, 1)-matrix over Zp
inferred← citeshttps://doi.org/10.70675/599c608bz9f80z4d28za6c4zb85acff92df5openalex-snapshot
Graph algorithms : network inference and planar graph optimization
inferred← citeshttps://doi.org/10.70675/8c9d31e6z7c29z4b35zb83bz77ab97548071openalex-snapshot
Efficiency of distributed queueing games and of path discovery algorithms
inferred← citeshttps://doi.org/10.70675/d1ed6f08z1af9z410bzb56bz9edd52f845dfopenalex-snapshot
Enumeration of polyominoes defined in terms of pattern avoidance or convexity constraints
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.