On the public citation graph

A synthesis on partition refinement: A useful routine for strings, graphs, boolean matrices and automata

0 signed · 38 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/3-540-56279-6_98openalex-snapshot
A simple test for the consecutive ones property
inferredcites →https://doi.org/10.1016/b978-0-12-417750-5.50022-1openalex-snapshot
AN n log n ALGORITHM FOR MINIMIZING STATES IN A FINITE AUTOMATON
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/s0304-3975(97)00241-7openalex-snapshot
Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
inferredcites →https://doi.org/10.1137/0205021openalex-snapshot
Algorithmic Aspects of Vertex Elimination on Graphs
inferredcites →https://doi.org/10.1137/0216057openalex-snapshot
Doubly Lexical Orderings of Matrices
inferredcites →https://doi.org/10.1137/0216062openalex-snapshot
Three Partition Refinement Algorithms
inferredcites →https://doi.org/10.1137/0218005openalex-snapshot
An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
inferredcites →https://doi.org/10.1145/321879.321884openalex-snapshot
Efficiency of a Good But Not Linear Set Union Algorithm
inferredcites →https://doi.org/10.14279/depositonce-14267openalex-snapshot
Efficient and practical modular decomposition
inferredcites →https://doi.org/10.5555/314464.314641openalex-snapshot
Linear-time modular decomposition and efficient transitive orientation of comparability graphs
inferredcites →https://doi.org/10.5555/314613.314697openalex-snapshot
The ultimate interval graph recognition algorithm

What points at this work

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

inferred← citeshttps://doi.org/10.1002/net.21904openalex-snapshot
Parameterized algorithms and data reduction for the short secluded s‐t‐path problem
inferred← citeshttps://doi.org/10.1002/rsa.20025openalex-snapshot
Data structures for maintaining set partitions
inferred← citeshttps://doi.org/10.1007/3-540-44985-x_9openalex-snapshot
Data Structures for Maintaining Set Partitions
inferred← citeshttps://doi.org/10.1007/978-3-031-92932-8_13openalex-snapshot
Structural Parameterization of Locating-Dominating Set and Test Cover
inferred← citeshttps://doi.org/10.1007/978-3-032-17801-5_44openalex-snapshot
Counting Large Patterns in Degenerate Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_52openalex-snapshot
Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_39openalex-snapshot
Domination When the Stars Are Out
inferred← citeshttps://doi.org/10.1007/978-3-642-31155-0_14openalex-snapshot
Induced Disjoint Paths in AT-Free Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-33090-2_45openalex-snapshot
Induced Disjoint Paths in Claw-Free Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-55751-8_9openalex-snapshot
Parameterized Aspects of Triangle Enumeration
inferred← citeshttps://doi.org/10.1007/s00453-022-01073-0openalex-snapshot
Complexity and Approximation for Discriminating and Identifying Code Problems in Geometric Setups
inferred← citeshttps://doi.org/10.1007/s11083-009-9135-7openalex-snapshot
The Complexity of Embedding Orders into Small Products of Chains
inferred← citeshttps://doi.org/10.1016/j.cosrev.2010.01.001openalex-snapshot
A survey of the algorithmic aspects of modular decomposition
inferred← citeshttps://doi.org/10.1016/j.dam.2006.02.005openalex-snapshot
Fast algorithms for identifying maximal common connected sets of interval graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2017.04.013openalex-snapshot
Recognition and characterization of unit interval graphs with integer endpoints
inferred← citeshttps://doi.org/10.1016/j.endm.2015.07.074openalex-snapshot
On unit interval graphs with integer endpoints
inferred← citeshttps://doi.org/10.1016/j.jcss.2019.02.004openalex-snapshot
Parameterized aspects of triangle enumeration
inferred← citeshttps://doi.org/10.1023/a:1021243928374openalex-snapshot
Recognition of Simple Enlarged Horn Formulas and Simple Extended Horn Formulas
inferred← citeshttps://doi.org/10.1137/24m1677885openalex-snapshot
The Complexity of Diameter on \({H}\)-Free Graphs
inferred← citeshttps://doi.org/10.1142/9789814513418_0006openalex-snapshot
Fundamental data structures
inferred← citeshttps://doi.org/10.1145/2390176.2390187openalex-snapshot
Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond
inferred← citeshttps://doi.org/10.1145/3301445openalex-snapshot
Domination When the Stars Are Out
inferred← citeshttps://doi.org/10.2298/fil1909809sopenalex-snapshot
Improved algorithms for computing the greatest right and left invariant Boolean matrices and their application
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2019.40openalex-snapshot
Domination Above r-Independence: Does Sparseness Help?
inferred← citeshttps://doi.org/10.48550/arxiv.2105.08610openalex-snapshot
Whitney's Theorem for Line Graphs of Multi-Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2105.08637openalex-snapshot
Quasi-Clifford algebras, Quadratic forms over $\mathbb{F}_2$, and Lie Algebras
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.