On the public citation graph
Tackling the jump number of interval orders
0 signed · 34 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/978-94-009-2639-4_4openalex-snapshot
Computationally Tractable Classes of Ordered Sets
inferredcites →https://doi.org/10.1007/978-94-009-2639-4_6openalex-snapshot
The Calculation of Invariants for Ordered Sets
inferredcites →https://doi.org/10.1007/978-94-009-7798-3_25openalex-snapshot
Some Social Science Applications of Ordered Sets
inferredcites →https://doi.org/10.1007/bf00337693openalex-snapshot
NP-completeness properties about linear extensions
inferredcites →https://doi.org/10.1007/bf00346129openalex-snapshot
A 3/2-approximation algorithm for the jump number of interval orders
inferredcites →https://doi.org/10.1007/bf02253744openalex-snapshot
Interval orders without odd crowns are defect optimal
inferredcites →https://doi.org/10.1016/0012-365x(91)90016-uopenalex-snapshot
The jump number and the lattice of maximal antichains
inferredcites →https://doi.org/10.1016/0167-6377(82)90016-5openalex-snapshot
Packing subgraphs in a graph
inferredcites →https://doi.org/10.1016/s0304-0208(13)73561-8openalex-snapshot
Annals of Discrete Mathematics
inferredcites →https://doi.org/10.1137/0604016openalex-snapshot
Minimizing Setups for Ordered Sets: A Linear Algebraic Approach
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-0-387-34897-1_66openalex-snapshot
The Traveling Salesman Problem with Precedence Constraints and Binary Costs
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-3-642-00202-1_22openalex-snapshot
Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings
inferred← citeshttps://doi.org/10.1007/978-3-642-02882-3_9openalex-snapshot
Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_89openalex-snapshot
Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs
inferred← citeshttps://doi.org/10.1007/978-3-642-79459-9_27openalex-snapshot
Exact and Heuristic Algorithms for the Jump Number Problem
inferred← citeshttps://doi.org/10.1007/bfb0019433openalex-snapshot
Minimal representation of semiorders with intervals of same length
inferred← citeshttps://doi.org/10.1007/s00236-009-0109-4openalex-snapshot
Embedding mappings and splittings with applications
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(94)90111-2openalex-snapshot
Computing the jump number on semi-orders is polynomial
inferred← citeshttps://doi.org/10.1016/j.ejor.2013.11.011openalex-snapshot
Scheduling with few changes
inferred← citeshttps://doi.org/10.1016/j.endm.2013.05.035openalex-snapshot
Improved approximation algorithm for the jump number of interval orders
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.tcs.2013.10.011openalex-snapshot
An improved approximation ratio for the jump number problem on interval orders
inferred← citeshttps://doi.org/10.1017/cbo9780511662119.009openalex-snapshot
New Perspectives on Interval Orders and Interval Graphs
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:1024417802690openalex-snapshot
A Weighted Version of the Jump Number Problem on Two-Dimensional Orders is NP-Complete
inferred← citeshttps://doi.org/10.2478/v10065-011-0025-4openalex-snapshot
The database of interval orders difficult for the jump number minimizing algorithms
inferred← citeshttps://doi.org/10.37236/325openalex-snapshot
Ascent Sequences and Upper Triangular Matrices Containing Non-Negative Integers
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.