On the public citation graph
Minimizing the jump number for partially ordered sets: A graph-theoretic approach
0 signed · 40 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.1016/0012-365x(89)90295-1openalex-snapshot
Selected topics in graph theory 3
inferredcites →https://doi.org/10.1016/0020-0190(82)90080-1openalex-snapshot
A labeling algorithm to recognize a line digraph and output its root graph
inferredcites →https://doi.org/10.1016/0166-218x(84)90068-4openalex-snapshot
Optimal constructions of reversible digraphs
inferredcites →https://doi.org/10.1016/s0167-5060(08)70060-8openalex-snapshot
The Jump Number of Dags and Posets: An Introduction
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-1983-0715851-3openalex-snapshot
Optimal Linear Extensions by Interchanging Chains
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-51498-8_7openalex-snapshot
The jump number problem for biconvex graphs and rectangle covers of rectangular regions
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-319-67531-2_9openalex-snapshot
Space Efficient Breadth-First and Level Traversals of Consistent Global States of Parallel Programs
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/978-94-009-5315-4_2openalex-snapshot
Algorithmic Aspects of Comparability Graphs and Interval Graphs
inferred← citeshttps://doi.org/10.1007/978-94-009-5315-4_6openalex-snapshot
A Graph-Theoretic Approach to the Jump-Number Problem
inferred← citeshttps://doi.org/10.1007/bf00337919openalex-snapshot
Jump number problem: The role of matroids
inferred← citeshttps://doi.org/10.1007/bf00337920openalex-snapshot
On finding the jump number of a partial orber by substitution decomposition
inferred← citeshttps://doi.org/10.1007/bf00340778openalex-snapshot
A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders
inferred← citeshttps://doi.org/10.1007/bf00346129openalex-snapshot
A 3/2-approximation algorithm for the jump number of interval orders
inferred← citeshttps://doi.org/10.1007/bf00346653openalex-snapshot
Greedy linear extensions for minimizing bumps
inferred← citeshttps://doi.org/10.1007/bf00383597openalex-snapshot
On the greedy dimension of a partial order
inferred← citeshttps://doi.org/10.1007/bf00383598openalex-snapshot
Minimizing setups in ordered sets of fixed width
inferred← citeshttps://doi.org/10.1007/bf00403405openalex-snapshot
Minimizing bumps in linear extensions of ordered sets
inferred← citeshttps://doi.org/10.1007/s10878-009-9218-9openalex-snapshot
A polynomially solvable case of optimal linear extension problem of a poset
inferred← citeshttps://doi.org/10.1007/s10878-012-9456-0openalex-snapshot
Minimizing the maximum bump 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.1007/s11083-014-9321-0openalex-snapshot
Linear Extensions of N-free Orders
inferred← citeshttps://doi.org/10.1016/0012-365x(87)90006-9openalex-snapshot
On some complexity properties of N-free posets and posets with bounded decomposition diameter
inferred← citeshttps://doi.org/10.1016/0012-365x(87)90017-3openalex-snapshot
Minimizing the jump number for partially-ordered sets: a graph-theoretic approach, II
inferred← citeshttps://doi.org/10.1016/0012-365x(88)90224-5openalex-snapshot
An algorithm for solving the jump number problem
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/0166-218x(85)90030-7openalex-snapshot
N-free posets as generalizations of series-parallel posets
inferred← citeshttps://doi.org/10.1016/0197-3975(87)90052-xopenalex-snapshot
Space and the concept of planning
inferred← citeshttps://doi.org/10.1016/j.autcon.2010.02.012openalex-snapshot
Improved ant colony optimization algorithms for determining project critical paths
inferred← citeshttps://doi.org/10.1016/j.dam.2020.10.026openalex-snapshot
Greedy balanced pairs in N -free ordered sets
inferred← citeshttps://doi.org/10.1016/s0020-0255(98)10081-6openalex-snapshot
Jump number maximization for proper interval graphs and series—parallel graphs
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:1008625405476openalex-snapshot
An Optimal Algorithm to Find the Jump Number of Partially Ordered Sets
inferred← citeshttps://doi.org/10.1137/0214068openalex-snapshot
Algorithmic Approaches to Setup Minimization
inferred← citeshttps://doi.org/10.59254/sbpo-2019-106944openalex-snapshot
UMA FORMULAÇÃO MATEMÁTICA PARA O PROBLEMA DO NÚMERO DE SALTOS ARBÓREO DE UMA ORDEM PARCIAL
inferred← citeshttps://doi.org/10.7561/sacs.2013.2.229openalex-snapshot
Algorithmics of Posets Generated by Words Over Partially Commutative Alphabets (Extended Version)
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.