On the public citation graph

An Exact Method for the Minimum Feedback Arc Set Problem

0 signed · 142 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/aic.690120613openalex-snapshot
Design variable selection to simplify process calculations
inferredcites →https://doi.org/10.1002/aic.690120625openalex-snapshot
On the ordering of recycle calculations
inferredcites →https://doi.org/10.1002/aic.690150122openalex-snapshot
Structuring design computations
inferredcites →https://doi.org/10.1002/aic.690160206openalex-snapshot
The structuring of process optimization
inferredcites →https://doi.org/10.1002/aic.690180312openalex-snapshot
An efficient algorithm for optimum decomposition of recycle systems
inferredcites →https://doi.org/10.1002/aic.690190614openalex-snapshot
Topics in computer‐aided design: Part I. An optimum tearing algorithm for recycle systems
inferredcites →https://doi.org/10.1002/aic.690200231openalex-snapshot
Assigning output variables to equations using linear programming
inferredcites →https://doi.org/10.1002/aic.690210403openalex-snapshot
Optimal decomposition of process networks
inferredcites →https://doi.org/10.1002/aic.690250406openalex-snapshot
Maintaining sparsity in process design calculations
inferredcites →https://doi.org/10.1002/aic.690270504openalex-snapshot
Exclusive tear sets for flowsheets
inferredcites →https://doi.org/10.1002/aic.690300412openalex-snapshot
Structural analysis and solution of systems of algebraic design equations
inferredcites →https://doi.org/10.1002/aic.690370404openalex-snapshot
Multiple steady states in ideal two‐product distillation
inferredcites →https://doi.org/10.1002/cite.201700041openalex-snapshot
Analysis and Decomposition for Improved Convergence of Nonlinear Process Models in Chemical Engineering
inferredcites →https://doi.org/10.1002/net.1975.5.3.299openalex-snapshot
GRAPH THEORY WITH APPLICATIONS TO ENGINEERING AND COMPUTER SCIENCE
inferredcites →https://doi.org/10.1002/net.3230180105openalex-snapshot
Generalized de Bruijn digraphs
inferredcites →https://doi.org/10.1002/scj.4690170803openalex-snapshot
Fault‐tolerant processor interconnection networks
inferredcites →https://doi.org/10.1007/3-540-44969-8_5openalex-snapshot
Layered Drawings of Digraphs
inferredcites →https://doi.org/10.1007/978-1-4471-5559-1openalex-snapshot
Fundamentals of Parameterized Complexity
inferredcites →https://doi.org/10.1007/978-1-4757-3216-0_14openalex-snapshot
Solving Linear Ordering Problems with a Combined Interior Point/Simplex Cutting Plane Algorithm
inferredcites →https://doi.org/10.1007/978-3-540-30141-7_45openalex-snapshot
Graph-Theoretic Analysis of Kautz Topology and DHT Schemes
inferredcites →https://doi.org/10.1007/978-3-540-45172-3_9openalex-snapshot
Koorde: A Simple Degree-Optimal Distributed Hash Table
inferredcites →https://doi.org/10.1007/978-3-540-68279-0_1openalex-snapshot
Solution of a Large-Scale Traveling-Salesman Problem
inferredcites →https://doi.org/10.1007/978-3-540-68279-0_8openalex-snapshot
Reducibility Among Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-3-642-16533-7_6openalex-snapshot
Measure & Conquer
inferredcites →https://doi.org/10.1007/978-3-642-32512-0_25openalex-snapshot
New and Improved Bounds for the Minimum Set Cover Problem
inferredcites →https://doi.org/10.1007/978-3-642-40328-6_3openalex-snapshot
On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems
inferredcites →https://doi.org/10.1007/978-94-009-5315-4_7openalex-snapshot
Acyclic Subdigraphs and Linear Orderings: Polytopes, Facets, and a Cutting Plane Algorithm
inferredcites →https://doi.org/10.1007/b11823openalex-snapshot
Peer-to-Peer Systems II
inferredcites →https://doi.org/10.1007/bf00993315openalex-snapshot
An optimal algorithm for cycle breaking in directed graphs
inferredcites →https://doi.org/10.1007/bf01200760openalex-snapshot
Packing directed circuits fractionally
inferredcites →https://doi.org/10.1007/bf01582009openalex-snapshot
On the acyclic subgraph polytope
inferredcites →https://doi.org/10.1007/bfb0067704openalex-snapshot
The decomposition of systems of procedures and algebraic equations
inferredcites →https://doi.org/10.1007/pl00009191openalex-snapshot
Approximating Minimum Feedback Sets and Multicuts in Directed Graphs
inferredcites →https://doi.org/10.1007/s00224-007-1334-2openalex-snapshot
Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques
inferredcites →https://doi.org/10.1007/s00224-017-9777-6openalex-snapshot
Exact Localisations of Feedback Sets
inferredcites →https://doi.org/10.1007/s12532-008-0001-1openalex-snapshot
SCIP: solving constraint integer programs
inferredcites →https://doi.org/10.1016/0009-2509(74)80095-3openalex-snapshot
Efficient solution of sparse sets of design equations
inferredcites →https://doi.org/10.1016/0012-365x(75)90058-8openalex-snapshot
On the ratio of optimal integral and fractional covers
inferredcites →https://doi.org/10.1016/0020-0190(93)90079-oopenalex-snapshot
A fast and effective heuristic for the feedback arc set problem
inferredcites →https://doi.org/10.1016/0022-0000(91)90023-xopenalex-snapshot
Optimization, approximation, and complexity classes
inferredcites →https://doi.org/10.1016/0098-1354(77)80011-2openalex-snapshot
Analysis of a complex plant-steady state and transient behavior
inferredcites →https://doi.org/10.1016/0098-1354(79)80057-5openalex-snapshot
A new algorithm for process flowsheeting
inferredcites →https://doi.org/10.1016/0098-1354(84)80011-3openalex-snapshot
Sparse matrix methods for equation-based chemical process flowsheeting—I
inferredcites →https://doi.org/10.1016/0098-1354(88)85006-3openalex-snapshot
Optimal computation sequence in the simulation of chemical plants
inferredcites →https://doi.org/10.1016/0098-1354(88)87007-8openalex-snapshot
A new strategy of net decomposition in process simulation
inferredcites →https://doi.org/10.1016/0098-1354(93)80026-jopenalex-snapshot
A new tearing algorithm for process flowsheeting
inferredcites →https://doi.org/10.1016/0196-6774(88)90022-3openalex-snapshot
Finding a minimum feedback arc set in reducible flow graphs
inferredcites →https://doi.org/10.1016/0300-9467(71)87003-xopenalex-snapshot
Computer-Aided Design, Part 2 An approach to convergence and tearing in the solution of sparse equation sets
inferredcites →https://doi.org/10.1016/0300-9467(72)85030-5openalex-snapshot
Decomposition of nets
inferredcites →https://doi.org/10.1016/0377-2217(81)90005-9openalex-snapshot
A branch and bound algorithm for the acyclic subgraph problem
inferredcites →https://doi.org/10.1016/b978-0-409-90175-7.50009-8openalex-snapshot
COMPUTATION SEQUENCE IN PROCESS FLOWSHEET CALCULATIONS
inferredcites →https://doi.org/10.1016/b978-0-444-62700-1.00003-6openalex-snapshot
Steady-State Flowsheeting
inferredcites →https://doi.org/10.1016/j.ejor.2006.03.071openalex-snapshot
The Linear Ordering Problem with cumulative costs
inferredcites →https://doi.org/10.1016/j.ipl.2007.05.014openalex-snapshot
Improved fixed parameter tractable algorithms for two “edge” problems: MAXCUT and MAXDAG
inferredcites →https://doi.org/10.1016/s0020-0190(02)00491-xopenalex-snapshot
Combinatorial algorithms for feedback problems in directed graphs
inferredcites →https://doi.org/10.1016/s0166-218x(00)00339-5openalex-snapshot
On enumerating all minimal solutions of feedback problems
inferredcites →https://doi.org/10.1016/s0304-3975(98)00270-9openalex-snapshot
Graph layout for applications in compiler construction
inferredcites →https://doi.org/10.1016/s1570-7946(13)70001-4openalex-snapshot
Computer-Aided Chemical Engineering
inferredcites →https://doi.org/10.1017/cbo9780511804090openalex-snapshot
Computational Complexity
inferredcites →https://doi.org/10.1017/s0963548306007887openalex-snapshot
The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
inferredcites →https://doi.org/10.1021/ie50269a005openalex-snapshot
Studies in Distillation
inferredcites →https://doi.org/10.1021/ie50279a011openalex-snapshot
Computation of Distillation Apparatus for Hydrocarbon Mixtures
inferredcites →https://doi.org/10.1057/jors.1991.155openalex-snapshot
Introduction to Algorithms
inferredcites →https://doi.org/10.1080/00986449708936616openalex-snapshot
A NEW SYNTHETIC METHOD FOR STREAM TEARING IN PROCESS SYSTEMS ANALYSIS
inferredcites →https://doi.org/10.1093/0198240341.001.0001openalex-snapshot
Mathematics without Numbers
inferredcites →https://doi.org/10.1093/biomet/48.3-4.303openalex-snapshot
Inconsistencies in a Schedule of Paired Comparisons
inferredcites →https://doi.org/10.1101/gr.074492.107openalex-snapshot
Velvet: Algorithms for de novo short read assembly using de Bruijn graphs
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/focs.2007.47openalex-snapshot
Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem
inferredcites →https://doi.org/10.1109/focs.2008.51openalex-snapshot
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
inferredcites →https://doi.org/10.1109/iscas.1992.230449openalex-snapshot
An efficient method for finding a minimal feedback arc set in directed graphs
inferredcites →https://doi.org/10.1109/proc.1975.9996openalex-snapshot
Graph theory with applications to engineering and computer science
inferredcites →https://doi.org/10.1109/sfcs.1994openalex-snapshot
Proceedings 35th Annual Symposium on Foundations of Computer Science
inferredcites →https://doi.org/10.1109/sfcs.1996.548460openalex-snapshot
A new rounding procedure for the assignment problem with applications to dense graph arrangement problems
inferredcites →https://doi.org/10.1109/tc.1981.1675809openalex-snapshot
Design to Minimize Diameter on Building-Block Network
inferredcites →https://doi.org/10.1109/tc.1983.1676323openalex-snapshot
A Design for Directed Graphs with Minimum Diameter
inferredcites →https://doi.org/10.1109/tct.1971.1083332openalex-snapshot
A note on minimal essential sets
inferredcites →https://doi.org/10.1109/tsmc.1981.4308636openalex-snapshot
Methods for Visual Understanding of Hierarchical System Structures
inferredcites →https://doi.org/10.1112/jlms/s2-17.3.369openalex-snapshot
A Minimax Theorem for Directed Graphs
inferredcites →https://doi.org/10.1137/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms
inferredcites →https://doi.org/10.1137/0204007openalex-snapshot
Finding All the Elementary Circuits of a Directed Graph
inferredcites →https://doi.org/10.1137/0208032openalex-snapshot
The Complexity of Enumeration and Reliability Problems
inferredcites →https://doi.org/10.1137/050623905openalex-snapshot
Ranking Tournaments
inferredcites →https://doi.org/10.1137/090756144openalex-snapshot
Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant
inferredcites →https://doi.org/10.1145/1250790.1250806openalex-snapshot
How to rank with few errors
inferredcites →https://doi.org/10.1145/1411509.1411511openalex-snapshot
A fixed-parameter algorithm for the directed feedback vertex set problem
inferredcites →https://doi.org/10.1145/509907.510017openalex-snapshot
On the power of unique 2-prover 1-round games
inferredcites →https://doi.org/10.1145/6462.6502openalex-snapshot
Efficient algorithms for finding maximum matching in graphs
inferredcites →https://doi.org/10.1145/800125.804034openalex-snapshot
Approximation algorithms for combinatorial problems
inferredcites →https://doi.org/10.1186/1471-2105-9-424openalex-snapshot
Detection of the dominant direction of information flow and feedback links in densely interconnected regulatory networks
inferredcites →https://doi.org/10.1214/aoms/1177706098openalex-snapshot
Random Graphs
inferredcites →https://doi.org/10.1287/mnsc.1040.0269openalex-snapshot
A Suggested Computation for Maximal Multi-Commodity Network Flows
inferredcites →https://doi.org/10.1287/mnsc.20.8.1190openalex-snapshot
Optimal Weighted Ancestry Relationships
inferredcites →https://doi.org/10.1287/mnsc.5.1.97openalex-snapshot
A Suggested Computation for Maximal Multi-Commodity Network Flows
inferredcites →https://doi.org/10.1287/moor.4.3.233openalex-snapshot
A Greedy Heuristic for the Set-Covering Problem
inferredcites →https://doi.org/10.1287/opre.2.4.393openalex-snapshot
Solution of a Large-Scale Traveling-Salesman Problem
inferredcites →https://doi.org/10.1287/opre.32.6.1195openalex-snapshot
A Cutting Plane Algorithm for the Linear Ordering Problem
inferredcites →https://doi.org/10.13140/2.1.2585.6001openalex-snapshot
SPEED-UP in Chemical Engineering Design
inferredcites →https://doi.org/10.14279/depositonce-1634openalex-snapshot
Constraint Integer Programming
inferredcites →https://doi.org/10.2307/2005950openalex-snapshot
Complexity of Computer Computations
inferredcites →https://doi.org/10.25080/tcwv9851openalex-snapshot
Exploring Network Structure, Dynamics, and Function using NetworkX
inferredcites →https://doi.org/10.4173/mic.1983.3.2openalex-snapshot
Partitioning and Tearing of Networks Applied to Process Flowsheeting
inferredcites →https://doi.org/10.5486/pmd.1959.6.3-4.12openalex-snapshot
On random graphs. I.
inferredcites →https://doi.org/10.5555/320176.320203openalex-snapshot
Approximation alogorithms for the maximum acyclic subgraph problem

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.22212openalex-snapshot
Virtual network function reconfiguration in 5G networks: An optimization perspective
inferred← citeshttps://doi.org/10.1007/978-3-031-10515-9_1openalex-snapshot
Feedback Arc Set
inferred← citeshttps://doi.org/10.1007/978-3-031-10515-9_3openalex-snapshot
Papers and Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-031-10515-9_4openalex-snapshot
Having the Right Tool
inferred← citeshttps://doi.org/10.1007/978-3-031-69257-4_1openalex-snapshot
Mixed Integer Linear Programming Based Large Neighborhood Search Approaches for the Directed Feedback Vertex Set Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-75623-8_8openalex-snapshot
Efficient Vertex Linear Orderings to Find Minimal Feedback Arc Sets (minFAS)
inferred← citeshttps://doi.org/10.1007/978-3-032-26204-2_17openalex-snapshot
Automatic Memory Management for Dataflows
inferred← citeshttps://doi.org/10.1007/978-981-99-3243-6_5openalex-snapshot
A Short Sketch of Solid Algorithms for Feedback Arc Set
inferred← citeshttps://doi.org/10.1007/s00158-018-2004-5openalex-snapshot
An automated selection algorithm for nonlinear solvers in MDO
inferred← citeshttps://doi.org/10.1007/s10878-024-01209-8openalex-snapshot
Efficient heuristics to compute minimal and stable feedback arc sets
inferred← citeshttps://doi.org/10.1007/s10958-024-07403-7openalex-snapshot
ON THE DELAY TIME IN THE ENUMERATION OF ALL SIMPLE CYCLES OF A DIRECTED GRAPH
inferred← citeshttps://doi.org/10.1007/s11227-026-08852-4openalex-snapshot
Training-free ranking from pairwise comparisons via acyclic graph construction
inferred← citeshttps://doi.org/10.1007/s13278-025-01491-2openalex-snapshot
Rocket-crane algorithm for the Feedback Arc Set problem
inferred← citeshttps://doi.org/10.1016/j.array.2026.101011openalex-snapshot
Quantum Monte Carlo randomized algorithm for the Feedback Arc Set problem
inferred← citeshttps://doi.org/10.1016/j.autcon.2020.103205openalex-snapshot
Automatic clash correction sequence optimization using a clash dependency network
inferred← citeshttps://doi.org/10.1016/j.cor.2024.106724openalex-snapshot
Finding small feedback arc sets on large graphs
inferred← citeshttps://doi.org/10.1016/j.cor.2025.107247openalex-snapshot
Minimal and stable feedback arc sets and graph centrality measures
inferred← citeshttps://doi.org/10.1016/j.eswa.2025.127744openalex-snapshot
Learning multiple coordinated agents under directed acyclic graph constraints
inferred← citeshttps://doi.org/10.1021/acs.jpca.5c08153openalex-snapshot
Electronegativity as a Ranking of Atoms’ and Functional Groups’ Ability to Take Electrons from Other Moieties in a Molecule
inferred← citeshttps://doi.org/10.1089/cmb.2017.0248openalex-snapshot
A Flow Procedure for Linearization of Genome Sequence Graphs
inferred← citeshttps://doi.org/10.1089/cmb.2019.0310openalex-snapshot
OMGS: Optical Map-Based Genome Scaffolding
inferred← citeshttps://doi.org/10.1101/2020.02.07.939454openalex-snapshot
Economic Genome Assembly from Low Coverage Illumina and Nanopore Data
inferred← citeshttps://doi.org/10.1109/dsn48987.2021.00031openalex-snapshot
PDGraph: A Large-Scale Empirical Study on Project Dependency of Security Vulnerabilities
inferred← citeshttps://doi.org/10.1109/isca59077.2024.00023openalex-snapshot
Determining the Minimum Number of Virtual Networks for Different Coherence Protocols
inferred← citeshttps://doi.org/10.1109/les.2024.3498932openalex-snapshot
Lustre, Fast First, and Fresh
inferred← citeshttps://doi.org/10.1109/rndm55901.2022.9927661openalex-snapshot
An Efficient Heuristic for the Virtual Network Function Reconfiguration Problem
inferred← citeshttps://doi.org/10.1109/rtcsa66114.2025.00015openalex-snapshot
Cycle-Removal-Based Priority Policies Coordination for Distributed Intelligent Intersection Management
inferred← citeshttps://doi.org/10.1109/rtss46320.2019.00035openalex-snapshot
On Cyclic Dependencies and Regulators in Time-Sensitive Networks
inferred← citeshttps://doi.org/10.1109/tac.2024.3351553openalex-snapshot
A Framework of Pinning Control for Nonperiodical Stable Behaviors of Large-Scale Asynchronous Boolean Networks
inferred← citeshttps://doi.org/10.1145/3447652openalex-snapshot
Tight Localizations of Feedback Sets
inferred← citeshttps://doi.org/10.1145/3545001openalex-snapshot
Comments on “An Exact Method for the Minimum Feedback Arc Set Problem”
inferred← citeshttps://doi.org/10.1186/s13015-021-00186-5openalex-snapshot
LazyB: fast and cheap genome assembly
inferred← citeshttps://doi.org/10.1371/journal.pcbi.1011904openalex-snapshot
Connectivity Matrix Seriation via Relaxation
inferred← citeshttps://doi.org/10.15607/rss.2017.xiii.051openalex-snapshot
High-Quality Tabletop Rearrangement with Overhand Grasps: Hardness Results and Fast Methods
inferred← citeshttps://doi.org/10.18690/um.feri.6.2024.5openalex-snapshot
Improvement and Evaluation of a Heuristic Method for the Minimal Feedback Arc Set Problem
inferred← citeshttps://doi.org/10.2139/ssrn.6281222openalex-snapshot
Incumbent-Protected SCC-Neighborhood Search for the Weighted Feedback Arc Set Problem
inferred← citeshttps://doi.org/10.54097/az8w1s78openalex-snapshot
Research on Minimum Feedback Arc Set Problem
inferred← citeshttps://doi.org/10.70675/e4cfcb7ez2d13z4853zb58bzb6210c9e46f2openalex-snapshot
Optimization of VNF reconfiguration problem for 5G network slicing
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.