On the public citation graph

NP-completeness properties about linear extensions

https://doi.org/10.1007/bf00337693
0 signed · 32 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-0-8176-4842-8_10openalex-snapshot
A Decomposition Theorem for Partially Ordered Sets
inferredcites →https://doi.org/10.1007/bf00390103openalex-snapshot
NP-Completeness results concerning greedy and super greedy linear extensions
inferredcites →https://doi.org/10.1051/ita/1979130100031openalex-snapshot
Nombre de sauts et graphes série-parallèles
inferredcites →https://doi.org/10.1090/s0002-9939-1982-0660592-3openalex-snapshot
Minimizing Setups for Cycle-Free Ordered Sets
inferredcites →https://doi.org/10.1090/s0002-9939-1983-0715851-3openalex-snapshot
Optimal Linear Extensions by Interchanging Chains
inferredcites →https://doi.org/10.1137/0214068openalex-snapshot
Algorithmic Approaches to Setup Minimization
inferredcites →https://doi.org/10.1137/0603036openalex-snapshot
The Complexity of the Partial Order Dimension Problem
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
inferredcites →https://doi.org/10.2307/1969503openalex-snapshot
A Decomposition Theorem for Partially Ordered Sets

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-1-4471-5559-1_3openalex-snapshot
Bounded Search Trees
inferred← citeshttps://doi.org/10.1007/978-1-4615-0487-0_8openalex-snapshot
Process Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-319-03898-8_20openalex-snapshot
The Jump Number Problem: Exact and Parameterized
inferred← citeshttps://doi.org/10.1007/978-94-009-2639-4_6openalex-snapshot
The Calculation of Invariants for Ordered Sets
inferred← citeshttps://doi.org/10.1007/bf00383200openalex-snapshot
On minimizing jumps for ordered sets
inferred← citeshttps://doi.org/10.1007/bf00383398openalex-snapshot
Tackling the jump number of interval orders
inferred← citeshttps://doi.org/10.1007/s10878-009-9237-6openalex-snapshot
Minimizing the sum cost in linear extensions of a poset
inferred← citeshttps://doi.org/10.1007/s11083-012-9246-4openalex-snapshot
The Arboreal Jump Number of an Order
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00290-yopenalex-snapshot
The jump number problem on interval orders: A 32 approximation algorithm
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90255-topenalex-snapshot
On a setup optimization problem for interval orders
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90297-nopenalex-snapshot
A greedy reduction algorithm for setup optimization
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90111-2openalex-snapshot
Computing the jump number on semi-orders is polynomial
inferred← citeshttps://doi.org/10.1016/j.ipl.2015.06.002openalex-snapshot
A refined analysis on the jump number problem of interval orders
inferred← citeshttps://doi.org/10.1016/j.jcss.2026.103777openalex-snapshot
Width notions for ordering-related problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.10.011openalex-snapshot
An improved approximation ratio for the jump number problem on interval orders
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00172-1openalex-snapshot
An improved algorithm for the jump number problem
inferred← citeshttps://doi.org/10.1016/s0166-218x(97)00044-9openalex-snapshot
The setup polyhedron of series-parallel posets
inferred← citeshttps://doi.org/10.1023/a:1006069500025openalex-snapshot
Genetic Algorithm for the Jump Number Scheduling Problem
inferred← citeshttps://doi.org/10.1023/a:1008625405476openalex-snapshot
An Optimal Algorithm to Find the Jump Number of Partially Ordered Sets
inferred← citeshttps://doi.org/10.1023/a:1018926512983openalex-snapshot
The setup polytope of N‐sparse posets
inferred← citeshttps://doi.org/10.1109/43.503943openalex-snapshot
Process compilation of thin film microdevices
inferred← citeshttps://doi.org/10.1109/memsys.1994.555615openalex-snapshot
The automatic synthesis of planar fabrication process flows for surface micromachined devices
inferred← citeshttps://doi.org/10.1137/15m1012396openalex-snapshot
On the Power of Graph Searching for Cocomparability Graphs
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.