On the public citation graph

Algorithmic aspects of the substitution decomposition in optimization over relations, set systems and Boolean functions

https://doi.org/10.1007/bf02022041
0 signed · 127 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.3230120305openalex-snapshot
Modular decomposition and reliability computation in stochastic transportation networks having cutnodes
inferredcites →https://doi.org/10.1007/978-3-642-87617-2_13openalex-snapshot
On Committees
inferredcites →https://doi.org/10.1007/978-3-642-99747-1_18openalex-snapshot
Reduktion von Flußnetzplänen
inferredcites →https://doi.org/10.1007/bf01901974openalex-snapshot
Counting finite posets
inferredcites →https://doi.org/10.1016/0012-365x(78)90097-3openalex-snapshot
Lower bounds on the worst-case complexity of some oracle algorithms
inferredcites →https://doi.org/10.1016/0012-365x(81)90138-2openalex-snapshot
Partitive hypergraphs
inferredcites →https://doi.org/10.1016/0038-1101(63)90092-3openalex-snapshot
A new approach to the design of switching circuits
inferredcites →https://doi.org/10.1016/0095-8956(71)90033-5openalex-snapshot
On the composition and decomposition of clutters
inferredcites →https://doi.org/10.1016/0095-8956(75)90041-6openalex-snapshot
On certain polytopes associated with graphs
inferredcites →https://doi.org/10.1016/0166-218x(79)90043-xopenalex-snapshot
On the X-join decomposition for undirected graphs
inferredcites →https://doi.org/10.1016/0378-4754(79)90148-4openalex-snapshot
Discrete and switching functions.
inferredcites →https://doi.org/10.1016/c2013-0-10739-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1016/s0021-9800(68)80017-1openalex-snapshot
The group of an X-join of graphs
inferredcites →https://doi.org/10.1016/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1016/s0167-5060(08)70323-6openalex-snapshot
Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
inferredcites →https://doi.org/10.1016/s0304-0208(08)72966-9openalex-snapshot
Substitution Decomposition for Discrete Structures and Connections with Combinatorial Optimization
inferredcites →https://doi.org/10.1057/jors.1975.161openalex-snapshot
Optimization Methods for Resource Allocation.
inferredcites →https://doi.org/10.1109/t-c.1970.222903openalex-snapshot
An Algorithm for the Disjunctive Decomposition of Switching Functions
inferredcites →https://doi.org/10.1109/t-c.1971.223235openalex-snapshot
A Fast Algorithm for the Disjunctive Decomposition of Switching Functions
inferredcites →https://doi.org/10.1111/j.1749-6632.1970.tb45114.xopenalex-snapshot
Clutter Decomposition and Monotonic Boolean Functions
inferredcites →https://doi.org/10.1137/0113027openalex-snapshot
Modules of Coherent Binary Systems
inferredcites →https://doi.org/10.1137/0122055openalex-snapshot
A Set Theoretic Treatment of Coherent Systems
inferredcites →https://doi.org/10.1137/0603021openalex-snapshot
Decomposition of Directed Graphs
inferredcites →https://doi.org/10.1145/321707.321711openalex-snapshot
Graph Structures
inferredcites →https://doi.org/10.1287/moor.4.3.215openalex-snapshot
Sequencing with Series-Parallel Precedence Constraints
inferredcites →https://doi.org/10.1287/moor.8.2.170openalex-snapshot
A Fast Algorithm for the Decomposition of Graphs and Posets
inferredcites →https://doi.org/10.1515/9781400882014-016openalex-snapshot
15. Solutions of Compound Simple Games
inferredcites →https://doi.org/10.2307/1268641openalex-snapshot
Statistical Theory of Reliability and Life Testing-Probability Models
inferredcites →https://doi.org/10.24517/00011543openalex-snapshot
On the Dimension of Partially Ordered Sets.
inferredcites →https://doi.org/10.4153/cjm-1980-057-7openalex-snapshot
A Combinatorial Decomposition Theory
inferredcites →https://doi.org/10.6028/jres.069b.001openalex-snapshot
Lectures on matroids

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jagm.1999.1016openalex-snapshot
An Algorithm for the Modular Decomposition of Hypergraphs
inferred← citeshttps://doi.org/10.1006/jagm.2001.1185openalex-snapshot
Efficient and Practical Algorithms for Sequential Modular Decomposition
inferred← citeshttps://doi.org/10.1007/0-387-25036-0_4openalex-snapshot
Decompositions and Forcing Relations in Graphs and Other Combinatorial Structures
inferred← citeshttps://doi.org/10.1007/11604686_37openalex-snapshot
Algebraic Operations on PQ Trees and Modular Decomposition Trees
inferred← citeshttps://doi.org/10.1007/11604686_4openalex-snapshot
Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs
inferred← citeshttps://doi.org/10.1007/3-540-44634-6_28openalex-snapshot
Higher-Dimensional Packing with Order Constraints
inferred← citeshttps://doi.org/10.1007/3-540-46784-x_12openalex-snapshot
NLC2-Decomposition in Polynomial Time
inferred← citeshttps://doi.org/10.1007/3-540-60618-1_84openalex-snapshot
Modular decomposition of hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-030-25005-8_21openalex-snapshot
A General Algorithmic Scheme for Modular Decompositions of Hypergraphs and Applications
inferred← citeshttps://doi.org/10.1007/978-3-030-39219-2_5openalex-snapshot
Approximating Modular Decomposition Is Hard
inferred← citeshttps://doi.org/10.1007/978-3-319-94830-0_2openalex-snapshot
On Graphs Whose Maximal Cliques and Stable Sets Intersect
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-540-85097-7_33openalex-snapshot
A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-02029-2_16openalex-snapshot
O(m logn) Split Decomposition of Strongly Connected Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-46631-1_14openalex-snapshot
M-Machine Unit Time Scheduling: A Report on Ongoing Research
inferred← citeshttps://doi.org/10.1007/978-3-642-72831-0_49openalex-snapshot
Zur Bedeutung der diskreten Mathematik für die Konstruktion hochintegrierter Schaltkreise
inferred← citeshttps://doi.org/10.1007/bf01206330openalex-snapshot
AnO(n 2) incremental algorithm for modular decomposition of graphs and 2-structures
inferred← citeshttps://doi.org/10.1007/bf03651336openalex-snapshot
Notes on CD-independent subsets
inferred← citeshttps://doi.org/10.1007/bfb0017474openalex-snapshot
A new linear algorithm for Modular Decomposition
inferred← citeshttps://doi.org/10.1007/bfb0054325openalex-snapshot
A linear time algorithm to recognize clustered planar graphs and its parallelization
inferred← citeshttps://doi.org/10.1007/s00285-016-1084-3openalex-snapshot
The mathematics of xenology: di-cographs, symbolic ultrametrics, 2-structures and tree-representable systems of binary relations
inferred← citeshttps://doi.org/10.1007/s00373-014-1436-yopenalex-snapshot
Critically Twin Primitive 2-Structures
inferred← citeshttps://doi.org/10.1007/s00453-003-1032-7openalex-snapshot
Linear-Time Recognition of Circular-Arc Graphs
inferred← citeshttps://doi.org/10.1007/s00453-008-9273-0openalex-snapshot
Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs
inferred← citeshttps://doi.org/10.1007/s10013-025-00747-wopenalex-snapshot
Network Representation and Modular Decomposition of Combinatorial Structures: A Galled-Tree Perspective
inferred← citeshttps://doi.org/10.1007/s10479-014-1537-2openalex-snapshot
Restricted coloring problems on Graphs with few P 4’s
inferred← citeshttps://doi.org/10.1007/s10618-016-0451-4openalex-snapshot
An efficient exact algorithm for triangle listing in large graphs
inferred← citeshttps://doi.org/10.1007/s10878-009-9235-8openalex-snapshot
Edge-colouring of joins of regular graphs, I
inferred← citeshttps://doi.org/10.1007/s10878-011-9420-4openalex-snapshot
Edge-colouring of joins of regular graphs II
inferred← citeshttps://doi.org/10.1007/s11083-022-09612-8openalex-snapshot
Symmetric Maximal Condorcet Domains
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90180-iopenalex-snapshot
P4-trees and substitution decomposition
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90233-xopenalex-snapshot
A k-structure generalization of the theory of 2-structures
inferred← citeshttps://doi.org/10.1016/b978-0-444-87358-3.50006-7openalex-snapshot
THE ORDER-THEORETIC APPROACH TO SCHEDULING: THE DETERMINISTIC CASE
inferred← citeshttps://doi.org/10.1016/j.aam.2022.102377openalex-snapshot
Complete edge-colored permutation graphs
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.2003.12.010openalex-snapshot
The complexity of modular decomposition of Boolean functions
inferred← citeshttps://doi.org/10.1016/j.dam.2004.02.017openalex-snapshot
Linear-time modular decomposition of directed graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2008.06.031openalex-snapshot
Phylogenetic graph models beyond trees
inferred← citeshttps://doi.org/10.1016/j.dam.2008.11.001openalex-snapshot
Algorithmic aspects of a general modular decomposition theory
inferred← citeshttps://doi.org/10.1016/j.dam.2009.06.026openalex-snapshot
Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
inferred← citeshttps://doi.org/10.1016/j.dam.2009.10.008openalex-snapshot
O(mlogn) split decomposition of strongly-connected graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2018.06.036openalex-snapshot
An $O(n^2)$ time algorithm for the minimal permutation completion problem
inferred← citeshttps://doi.org/10.1016/j.dam.2019.03.019openalex-snapshot
Modular decomposition of graphs and the distance preserving property
inferred← citeshttps://doi.org/10.1016/j.dam.2022.06.042openalex-snapshot
From modular decomposition trees to level-1 networks: Pseudo-cographs, polar-cats and prime polar-cats
inferred← citeshttps://doi.org/10.1016/j.dam.2026.01.028openalex-snapshot
More on discrete convexity
inferred← citeshttps://doi.org/10.1016/j.disc.2009.11.006openalex-snapshot
Not complementary connected and not CIS d -graphs form weakly monotone families
inferred← citeshttps://doi.org/10.1016/j.jcta.2007.06.007openalex-snapshot
Simple permutations and algebraic generating functions
inferred← citeshttps://doi.org/10.1016/j.patcog.2014.03.014openalex-snapshot
A distance measure for large graphs based on prime graphs
inferred← citeshttps://doi.org/10.1016/j.sysarc.2003.11.002openalex-snapshot
General decomposition of incompletely specified sequential machines with multi-state behavior realization
inferred← citeshttps://doi.org/10.1016/j.sysarc.2004.07.003openalex-snapshot
Information-driven circuit synthesis with the pre-characterized gate libraries
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.07.046openalex-snapshot
Edge-colouring of regular graphs of large degree
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.12.031openalex-snapshot
An O(n2) -time algorithm for the minimal interval completion problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.11.036openalex-snapshot
(Nearly-)tight bounds on the contiguity and linearity of cographs
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.01.007openalex-snapshot
Fully dynamic representations of interval graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.04.052openalex-snapshot
A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00319-7openalex-snapshot
Modular decomposition and transitive orientation
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00499-7openalex-snapshot
Recognition of some perfectly orderable graph classes
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00017-7openalex-snapshot
Nesting of prime substructures in k-ary relations
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00435-8openalex-snapshot
PC trees and circular-ones arrangements
inferred← citeshttps://doi.org/10.1017/cbo9780511902499.003openalex-snapshot
A survey of simple permutations
inferred← citeshttps://doi.org/10.1109/71.238300openalex-snapshot
A theory of coteries: mutual exclusion in distributed systems
inferred← citeshttps://doi.org/10.1109/aspdac.2003.1195015openalex-snapshot
A BDD-based fast heuristic algorithm for disjoint decomposition
inferred← citeshttps://doi.org/10.1109/date.2002.998440openalex-snapshot
Composition trees in finding best variable orderings for ROBDDs
inferred← citeshttps://doi.org/10.1109/ismvl.1997.601368openalex-snapshot
Finding composition trees for multiple-valued functions
inferred← citeshttps://doi.org/10.1109/sfcs.2001.959913openalex-snapshot
Linear-time recognition of circular-arc graphs
inferred← citeshttps://doi.org/10.1137/0402051openalex-snapshot
Prime Testing for the Split Decomposition of a Graph
inferred← citeshttps://doi.org/10.1137/060665713openalex-snapshot
Higher‐Dimensional Packing with Order Constraints
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch77openalex-snapshot
Linear Recognition of Almost Interval Graphs
inferred← citeshttps://doi.org/10.1137/10080052xopenalex-snapshot
Linear Time Split Decomposition Revisited
inferred← citeshttps://doi.org/10.1137/21m1443534openalex-snapshot
\(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs
inferred← citeshttps://doi.org/10.1142/s0129054100000223openalex-snapshot
NLC 2-DECOMPOSITION IN POLYNOMIAL TIME
inferred← citeshttps://doi.org/10.1145/1119772.1119810openalex-snapshot
A BDD-based fast heuristic algorithm for disjoint decomposition
inferred← citeshttps://doi.org/10.1145/2229012.2229050openalex-snapshot
Clone structures in voters' preferences
inferred← citeshttps://doi.org/10.1186/gb-2004-5-8-r57openalex-snapshot
Modular decomposition of protein-protein interaction networks
inferred← citeshttps://doi.org/10.1186/s13015-025-00285-7openalex-snapshot
Orthology and near-cographs in the context of phylogenetic networks
inferred← citeshttps://doi.org/10.1515/dema-2016-0023openalex-snapshot
Interval Decomposition Lattices are Balanced
inferred← citeshttps://doi.org/10.1515/math-2017-0078openalex-snapshot
Classification lattices are geometric for complete atomistic lattices
inferred← citeshttps://doi.org/10.23638/lmcs-15(1:24)2019openalex-snapshot
Capturing Polynomial Time using Modular Decomposition
inferred← citeshttps://doi.org/10.26493/2590-9770.1252.e71openalex-snapshot
Cograph editing: Merging modules is equivalent to editing P_4s
inferred← citeshttps://doi.org/10.3233/fi-2016-1347openalex-snapshot
A Generalization of Join and an Algorithmic Recognition Problem
inferred← citeshttps://doi.org/10.46298/dmtcs.303openalex-snapshot
Partially complemented representations of digraphs
inferred← citeshttps://doi.org/10.48550/arxiv.0902.1700openalex-snapshot
Linear Time Split Decomposition Revisited
inferred← citeshttps://doi.org/10.48550/arxiv.0912.1457openalex-snapshot
A survey on algorithmic aspects of modular decomposition
inferred← citeshttps://doi.org/10.48550/arxiv.1110.3939openalex-snapshot
Clone Structures in Voters' Preferences
inferred← citeshttps://doi.org/10.48550/arxiv.1702.07499openalex-snapshot
Cograph Editing: Merging Modules is equivalent to Editing P4's
inferred← citeshttps://doi.org/10.48550/arxiv.1805.09853openalex-snapshot
Modular Decomposition of Graphs and the Distance Preserving Property
inferred← citeshttps://doi.org/10.48550/arxiv.1811.10705openalex-snapshot
Modular decomposition of graphs and hierarchical modeling
inferred← citeshttps://doi.org/10.48550/arxiv.2101.08881openalex-snapshot
(α, β)-Modules in Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0308006openalex-snapshot
Higher-Dimensional Packing with Order Constraints
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0604065openalex-snapshot
Unifying two Graph Decompositions with Modular Decomposition
inferred← citeshttps://doi.org/10.5555/314464.314641openalex-snapshot
Linear-time modular decomposition and efficient transitive orientation of comparability graphs
inferred← citeshttps://doi.org/10.5555/545381.545494openalex-snapshot
Construction of probe interval models
inferred← citeshttps://doi.org/10.5555/882452.874417openalex-snapshot
Composition Trees in Finding Best Variable Orderings for ROBDDs
inferred← citeshttps://doi.org/10.5555/982792.982909openalex-snapshot
A certifying algorithm for the consecutive-ones property
inferred← citeshttps://doi.org/10.70675/5eb19187zd0cfz4cc1za8d5zc8103d05c086openalex-snapshot
Aspects of efficiency in selected problems of computation on large graphs
inferred← citeshttps://doi.org/10.7151/dmgaa.1078openalex-snapshot
On interval decomposition lattices
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.