On the public citation graph

An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications

0 signed · 42 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.1002/net.3230120410openalex-snapshot
Efficient algorithms for interval graphs and circular‐arc graphs
inferredcites →https://doi.org/10.1002/net.3230220103openalex-snapshot
An optimal algorithm to solve the all‐pair shortest path problem on interval graphs
inferredcites →https://doi.org/10.1016/0020-0190(77)90031-xopenalex-snapshot
Preserving order in a forest in less than logarithmic time and linear space
inferredcites →https://doi.org/10.1016/0020-0190(84)90033-4openalex-snapshot
On a circle-cover minimization problem
inferredcites →https://doi.org/10.1016/0020-0190(88)90068-3openalex-snapshot
Parallel circle-cover algorithms
inferredcites →https://doi.org/10.1016/0020-0190(89)90037-9openalex-snapshot
An optimal parallel algorithm for the minimum circle-cover problem
inferredcites →https://doi.org/10.1016/0022-0000(79)90042-4openalex-snapshot
A class of algorithms which require nonlinear time to maintain disjoint sets
inferredcites →https://doi.org/10.1016/0022-0000(85)90014-5openalex-snapshot
A linear-time algorithm for a special case of disjoint set union
inferredcites →https://doi.org/10.1016/0771-050x(80)90036-4openalex-snapshot
Algorithmic graph theory and perfect graphs
inferredcites →https://doi.org/10.1016/s0022-0000(76)80045-1openalex-snapshot
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
inferredcites →https://doi.org/10.1016/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1109/ipps.1994.288297openalex-snapshot
Solving the all-pair shortest path problem on interval and circular-arc graphs
inferredcites →https://doi.org/10.1142/s0218195994000057openalex-snapshot
RESTRICTED TRACK ASSIGNMENT WITH APPLICATIONS

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11602613_111openalex-snapshot
Localized and Compact Data-Structure for Comparability Graphs
inferred← citeshttps://doi.org/10.1007/3-540-48321-7_16openalex-snapshot
Graph automorphisms with maximal projection distances
inferred← citeshttps://doi.org/10.1007/978-3-030-17402-6_13openalex-snapshot
Complexity of Scheduling for DARP with Soft Ride Times
inferred← citeshttps://doi.org/10.1007/978-3-319-66272-5_24openalex-snapshot
Reconstructions of Noisy Digital Contours with Maximal Primitives Based on Multi-scale/Irregular Geometric Representation and Generalized Linear Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-21204-8_23openalex-snapshot
Algorithms for Interval Structures with Applications
inferred← citeshttps://doi.org/10.1007/978-981-96-8312-3_12openalex-snapshot
The Subinterval Cover Problem
inferred← citeshttps://doi.org/10.1007/bfb0038202openalex-snapshot
Smallest enclosing disks (balls and ellipsoids)
inferred← citeshttps://doi.org/10.1007/s00453-006-0187-4openalex-snapshot
Call Control in Rings
inferred← citeshttps://doi.org/10.1016/0166-218x(95)00088-9openalex-snapshot
All-pairs-shortest-length on strongly chordal graphs
inferred← citeshttps://doi.org/10.1016/j.cor.2024.106530openalex-snapshot
Revised eight-step feasibility checking procedure with linear time complexity for the Dial-a-Ride Problem (DARP)
inferred← citeshttps://doi.org/10.1016/j.disc.2007.12.091openalex-snapshot
Localized and compact data-structure for comparability graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113498openalex-snapshot
Intersection graphs of non-crossing paths
inferred← citeshttps://doi.org/10.1016/j.disopt.2006.02.002openalex-snapshot
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms
inferred← citeshttps://doi.org/10.1016/j.endm.2005.06.098openalex-snapshot
Distance Labeling for Permutation Graphs
inferred← citeshttps://doi.org/10.1016/j.engappai.2015.10.002openalex-snapshot
An ELS-based approach with dynamic probabilities management in local search for the Dial-A-Ride Problem
inferred← citeshttps://doi.org/10.1016/j.jcss.2020.04.005openalex-snapshot
Disconnected cuts in claw-free graphs
inferred← citeshttps://doi.org/10.1016/j.orl.2010.11.004openalex-snapshot
Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.12.075openalex-snapshot
Algorithms for interval structures with applications
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.113923openalex-snapshot
Impact of soft ride time constraints on the complexity of scheduling in Dial-A-Ride Problems
inferred← citeshttps://doi.org/10.1080/00207169808804754openalex-snapshot
Optimally fast shortest path algorithms for some classes of graphs
inferred← citeshttps://doi.org/10.1109/icsec.2014.6978122openalex-snapshot
On the complexity of graph clustering with bounded diameter
inferred← citeshttps://doi.org/10.1109/ipps.1994.288297openalex-snapshot
Solving the all-pair shortest path problem on interval and circular-arc graphs
inferred← citeshttps://doi.org/10.1109/iri.2015.53openalex-snapshot
City Recorder: Virtual City Tour Using Geo-referenced Videos
inferred← citeshttps://doi.org/10.1109/iscit.2009.5341282openalex-snapshot
Perimeter coverage made practical in wireless sensor networks
inferred← citeshttps://doi.org/10.1504/ijsnet.2011.038761openalex-snapshot
On perimeter coverage in wireless sensor networks with minimum cost
inferred← citeshttps://doi.org/10.25148/etd.fidc000741openalex-snapshot
Online Moving Object Visualization with Geo-Referenced Data
inferred← citeshttps://doi.org/10.34726/hss.2020.81081openalex-snapshot
Modeling and Analysis of Time-evolving Sparse Networks
inferred← citeshttps://doi.org/10.6100/ir731238openalex-snapshot
Workforce scheduling and planning:a combinatorial approach
inferred← citeshttps://doi.org/10.7151/dmgt.1220openalex-snapshot
A simple linear algorithm for the connected domination problem in circular-arc 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.