On the public citation graph

Polynomial Complete Consecutive Information Retrieval Problems

0 signed · 76 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1016/0020-0255(73)90023-6openalex-snapshot
On the theory of consecutive storage of relevant records
inferredcites →https://doi.org/10.1145/360933.360991openalex-snapshot
Consecutive storage of relevant records with redundancy
inferredcites →https://doi.org/10.1145/361573.361578openalex-snapshot
File organization
inferredcites →https://doi.org/10.2140/pjm.1965.15.835openalex-snapshot
Incidence matrices and interval graphs

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.1975.5.1.45openalex-snapshot
On the Computational Complexity of Combinatorial Problems
inferred← citeshttps://doi.org/10.1007/3-540-07854-1_191openalex-snapshot
On consecutive storage of records
inferred← citeshttps://doi.org/10.1007/3-540-08442-8_115openalex-snapshot
Two NP-Complete Problems Related to Information Retrieval
inferred← citeshttps://doi.org/10.1007/3-540-48452-3_5openalex-snapshot
Physical Mapping with Repeated Probes: The Hypergraph Superstring Problem
inferred← citeshttps://doi.org/10.1007/978-1-4939-0808-0_10openalex-snapshot
The Shortest Superstring Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-15146-0_2openalex-snapshot
On Computing Optimal Linear Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-319-14974-5_15openalex-snapshot
Tree Path Labeling of Hypergraphs – A Generalization of the Consecutive Ones Property
inferred← citeshttps://doi.org/10.1007/978-3-540-73053-8_33openalex-snapshot
Efficient BP Algorithms for General Feedforward Neural Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-04329-1_14openalex-snapshot
Labeling RDF Graphs for Linear Time and Space Querying
inferred← citeshttps://doi.org/10.1007/978-3-642-11120-4_3openalex-snapshot
Computational Complexity of Combinatorial and Graph-Theoretic Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-13962-8_8openalex-snapshot
A Faster Algorithm for Finding Minimum Tucker Submatrices
inferred← citeshttps://doi.org/10.1007/978-3-642-20712-9_29openalex-snapshot
A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row
inferred← citeshttps://doi.org/10.1007/bf01265320openalex-snapshot
Page-query compaction of secondary memory auxiliary databases
inferred← citeshttps://doi.org/10.1007/bf01324874openalex-snapshot
Minimizing the number of tool switches on a flexible machine
inferred← citeshttps://doi.org/10.1007/s00224-012-9388-1openalex-snapshot
A Faster Algorithm for Finding Minimum Tucker Submatrices
inferred← citeshttps://doi.org/10.1016/0012-365x(78)90157-7openalex-snapshot
On strings containing all subsets as substrings
inferred← citeshttps://doi.org/10.1016/0020-0190(76)90055-7openalex-snapshot
On the storage space requirement of consecutive retrieval with redundancy
inferred← citeshttps://doi.org/10.1016/0020-0190(77)90034-5openalex-snapshot
One more polynomial complete consecutive retrieval problem
inferred← citeshttps://doi.org/10.1016/0020-0190(80)90052-6openalex-snapshot
Consecutive retrieval with redundancy: an optimal linear and an optimal cyclic arrangement and their storage space requirements
inferred← citeshttps://doi.org/10.1016/0020-0190(80)90116-7openalex-snapshot
Once more on storage for consecutive retrieval
inferred← citeshttps://doi.org/10.1016/0020-0255(93)90041-jopenalex-snapshot
Page-queries as a tool for organizing secondary memory auxiliary databases. I. Algorithmic aspects and architectural framework of query processing
inferred← citeshttps://doi.org/10.1016/0020-0255(93)90042-kopenalex-snapshot
Page-queries as a tool for organizing secondary memory auxiliary databases. II. Optimal selection of SADB contents
inferred← citeshttps://doi.org/10.1016/0097-8485(94)85015-1openalex-snapshot
The chimeric mapping problem: Algorithmic strategies and performance evaluation on synthetic genomic data
inferred← citeshttps://doi.org/10.1016/0166-218x(84)90127-6openalex-snapshot
Recognizing graphs with fixed interval number is NP-complete
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90105-8openalex-snapshot
Algorithmic characterizations of interval ordered hypergraphs and applications
inferred← citeshttps://doi.org/10.1016/0304-3975(76)90023-2openalex-snapshot
Information storage and retrieval — mathematical foundations II (combinatorial problems)
inferred← citeshttps://doi.org/10.1016/0304-3975(92)00074-2openalex-snapshot
More on the complexity of common superstring and supersequence problems
inferred← citeshttps://doi.org/10.1016/b978-0-12-289260-8.50015-7openalex-snapshot
Interval Graphs
inferred← citeshttps://doi.org/10.1016/j.cola.2022.101136openalex-snapshot
Minimising line segments in linear diagrams is NP-hard
inferred← citeshttps://doi.org/10.1016/j.cor.2020.104948openalex-snapshot
Heuristic methods to consecutive block minimization
inferred← citeshttps://doi.org/10.1016/j.cor.2021.105273openalex-snapshot
Iterated local search for consecutive block minimization
inferred← citeshttps://doi.org/10.1016/j.dam.2007.06.009openalex-snapshot
Hamiltonicity of regular graphs and blocks of consecutive ones in symmetric matrices
inferred← citeshttps://doi.org/10.1016/j.dam.2008.05.036openalex-snapshot
Preemptive scheduling and antichain polyhedra
inferred← citeshttps://doi.org/10.1016/j.ejor.2013.01.028openalex-snapshot
Minimising the number of gap-zeros in binary matrices
inferred← citeshttps://doi.org/10.1016/j.ic.2012.08.005openalex-snapshot
Consecutive ones property and PQ-trees for multisets: Hardness of counting their orderings
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.04.009openalex-snapshot
Consecutive block minimization is 1.5-approximable
inferred← citeshttps://doi.org/10.1016/j.ipl.2015.02.010openalex-snapshot
Polynomial-time local-improvement algorithm for Consecutive Block Minimization
inferred← citeshttps://doi.org/10.1016/j.jcss.2009.07.001openalex-snapshot
Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00325-8openalex-snapshot
A note on the Consecutive Ones Submatrix problem
inferred← citeshttps://doi.org/10.1016/s0166-218x(96)00055-8openalex-snapshot
On Physical Mapping and the consecutive ones property for sparse matrices
inferred← citeshttps://doi.org/10.1016/s0167-5060(04)80056-6openalex-snapshot
Interval graphs
inferred← citeshttps://doi.org/10.1016/s0377-2217(02)00796-8openalex-snapshot
Heuristic methods for gang-rip saw arbor design
inferred← citeshttps://doi.org/10.1016/s0377-2217(96)00388-8openalex-snapshot
Combinatorial optimization models for production scheduling in automated manufacturing systems
inferred← citeshttps://doi.org/10.1016/s0898-1221(00)00057-2openalex-snapshot
A multichannel storage arrangement scheme of pictorial databases for concurrent spatial match retrieval
inferred← citeshttps://doi.org/10.1016/s0925-5273(99)00055-9openalex-snapshot
A new heuristic based on a hypergraph representation for the tool switching problem
inferred← citeshttps://doi.org/10.1051/ro:2008024openalex-snapshot
Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results
inferred← citeshttps://doi.org/10.1080/00207543.2020.1748906openalex-snapshot
A new multicommodity flow model for the job sequencing and tool switching problem
inferred← citeshttps://doi.org/10.1089/cmb.1995.2.139openalex-snapshot
Four Strikes Against Physical Mapping of DNA
inferred← citeshttps://doi.org/10.1089/cmb.1995.2.219openalex-snapshot
Physical Mapping by STS Hybridization: Algorithmic Strategies and the Challenge of Software Evaluation
inferred← citeshttps://doi.org/10.1089/cmb.1997.4.449openalex-snapshot
Algorithms for Computing and Integrating Physical Maps Using Unique Probes
inferred← citeshttps://doi.org/10.1109/acit53391.2021.9677316openalex-snapshot
Heuristic for the Consecutive Block Minimization Algorithms And Results
inferred← citeshttps://doi.org/10.1109/icdm.2007.34openalex-snapshot
Optimizing Frequency Queries for Data Mining Applications
inferred← citeshttps://doi.org/10.1109/icsmc.1997.635351openalex-snapshot
A Petri net approach to load and control a flexible machine
inferred← citeshttps://doi.org/10.1109/tvcg.2023.3261934openalex-snapshot
LinSets.zip: Compressing Linear Set Diagrams
inferred← citeshttps://doi.org/10.1111/1475-3995.00387openalex-snapshot
A note on the NP–hardness of the consecutive block minimization problem
inferred← citeshttps://doi.org/10.1111/itor.13065openalex-snapshot
Exponential neighborhood search for consecutive block minimization
inferred← citeshttps://doi.org/10.1111/j.1540-5915.1991.tb00360.xopenalex-snapshot
An Evaluation of Tour Scheduling Heuristics with Differences in Employee Productivity and Cost
inferred← citeshttps://doi.org/10.1137/0214052openalex-snapshot
Approximation of the Consecutive Ones Matrix Augmentation Problem
inferred← citeshttps://doi.org/10.1137/s0097539792235487openalex-snapshot
On the Consecutive-Retrieval Problem
inferred← citeshttps://doi.org/10.1145/146931.146933openalex-snapshot
Intelligent database caching through the use of page-answers and page-traces
inferred← citeshttps://doi.org/10.1145/267521.267542openalex-snapshot
Algorithms for computing and integrating physical maps using unique probes
inferred← citeshttps://doi.org/10.1145/322108.322111openalex-snapshot
Bounds on Storage for Consecutive Retrieval
inferred← citeshttps://doi.org/10.1145/3448016.3452837openalex-snapshot
Graphsurge
inferred← citeshttps://doi.org/10.1287/opre.29.3.501openalex-snapshot
A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering
inferred← citeshttps://doi.org/10.14288/1.0052159openalex-snapshot
Variants of the Consecutive-Ones Property motivated by the reconstruction of ancestral species
inferred← citeshttps://doi.org/10.1609/aaai.v29i1.9368openalex-snapshot
Complexity Results for Compressing Optimal Paths
inferred← citeshttps://doi.org/10.1613/jair.4931openalex-snapshot
Compressing Optimal Paths with Run Length Encoding
inferred← citeshttps://doi.org/10.24996/ijs.2021.62.1.20openalex-snapshot
A Metaheuristic Approach to the C1S Problem
inferred← citeshttps://doi.org/10.26481/dis.19921009aoopenalex-snapshot
Production planning for flexible manufacturing systems
inferred← citeshttps://doi.org/10.3233/fi-1983-6104openalex-snapshot
Generalizations of the Consecutive Ones Property and Related NP-Complete Problems1
inferred← citeshttps://doi.org/10.4230/lipics.icdt.2021.3openalex-snapshot
Box Covers and Domain Orderings for Beyond Worst-Case Join Processing
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.