On the public citation graph

Computing the bump number is easy

https://doi.org/10.1007/bf00337617
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.
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/bf00337618openalex-snapshot
Computing the bump number with techniques from two-processor scheduling
inferredcites →https://doi.org/10.1007/bf00337888openalex-snapshot
Greedy posets for the bump-minimizing problem
inferredcites →https://doi.org/10.1007/bf00403405openalex-snapshot
Minimizing bumps in linear extensions of ordered sets
inferredcites →https://doi.org/10.1016/0012-365x(86)90147-0openalex-snapshot
A combinatorial bijection between linear extensions of equivalent orders
inferredcites →https://doi.org/10.1016/0012-365x(89)90328-2openalex-snapshot
Minimizing bumps in ordered sets by substitution decomposition
inferredcites →https://doi.org/10.1016/0166-218x(88)90051-0openalex-snapshot
Minimizing bumps for posets of width two
inferredcites →https://doi.org/10.1016/0167-6377(87)90022-8openalex-snapshot
A comparison of algorithms for minimizing bumps in linear extensions of partial orders
inferredcites →https://doi.org/10.1109/tassp.1984.1164450openalex-snapshot
Combinatorial optimization:Algorithms and complexity
inferredcites →https://doi.org/10.1145/322326.322335openalex-snapshot
An Almost-Linear Algorithm for Two-Processor Scheduling
inferredcites →https://doi.org/10.2307/2322374openalex-snapshot
Combinatorial Optimization: Algorithms and Complexity.

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-52292-1_13openalex-snapshot
Bounds to the page number of partially ordered sets
inferred← citeshttps://doi.org/10.1007/978-1-4419-8477-7_16openalex-snapshot
Partial Order and Related Disciplines
inferred← citeshttps://doi.org/10.1007/978-1-4419-8477-7_18openalex-snapshot
Ranking and Prioritization with Partial Order for Multi-indicator Systems – An Integrative View with a Look Forward
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-540-30540-8_7openalex-snapshot
A General Framework for Coloring Problems: Old Results, New Results, and Open Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-16926-7_5openalex-snapshot
The Longest Path Problem is Polynomial on Cocomparability Graphs
inferred← citeshttps://doi.org/10.1007/bf00337618openalex-snapshot
Computing the bump number with techniques from two-processor scheduling
inferred← citeshttps://doi.org/10.1007/bf00571188openalex-snapshot
Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm
inferred← citeshttps://doi.org/10.1007/s001860300336openalex-snapshot
Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time
inferred← citeshttps://doi.org/10.1007/s00453-011-9583-5openalex-snapshot
The Longest Path Problem Is Polynomial on Cocomparability Graphs
inferred← citeshttps://doi.org/10.1007/s006070050036openalex-snapshot
Complexity Results for Single-Machine Problems with Positive Finish-Start Time-Lags
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.1016/0012-365x(95)00359-5openalex-snapshot
1-Tough cocomparability graphs are hamiltonian
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90168-aopenalex-snapshot
Hamiltonian cycle is polynomial on cocomparability graphs
inferred← citeshttps://doi.org/10.1016/0898-1221(90)90214-5openalex-snapshot
The connection between the bump number problem and flow-shop scheduling with precedence constraints
inferred← citeshttps://doi.org/10.1016/j.orl.2008.05.004openalex-snapshot
Multigraph realizations of degree sequences: Maximization is easy, minimization is hard
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115301openalex-snapshot
Hamiltonian path in permutation graphs
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:1012219816274openalex-snapshot
Linear Discrepancy and Weak Discrepancy 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.1137/11083856xopenalex-snapshot
LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs
inferred← citeshttps://doi.org/10.1137/s0097539791200375openalex-snapshot
Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs
inferred← citeshttps://doi.org/10.1137/s1052623402410181openalex-snapshot
Radio Labeling with Preassigned Frequencies
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.