On the public citation graph
Graph Bipartization and via minimization
0 signed · 70 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bfb0039624openalex-snapshot
On the contact-minimization-problem
inferredcites →https://doi.org/10.1016/0022-0000(85)90004-2openalex-snapshot
A linear algorithm for embedding planar graphs using PQ-trees
inferredcites →https://doi.org/10.1016/0304-3975(76)90059-1openalex-snapshot
Some simplified NP-complete graph problems
inferredcites →https://doi.org/10.1109/tcs.1983.1085357openalex-snapshot
A graph-theoretic via minimization algorithm for two-layer printed circuit boards
inferredcites →https://doi.org/10.1137/0132071openalex-snapshot
The Rectilinear Steiner Tree Problem is $NP$-Complete
inferredcites →https://doi.org/10.1137/0204019openalex-snapshot
Finding a Maximum Cut of a Planar Graph in Polynomial Time
inferredcites →https://doi.org/10.1137/0206007openalex-snapshot
Comments on F. Hadlock’s Paper: “Finding a Maximum Cut of a Planar Graph in Polynomial Time”
inferredcites →https://doi.org/10.1145/800133.804355openalex-snapshot
Node-and edge-deletion NP-complete problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4837079openalex-extracted
The Independent Set Problem on Circulant Graphs Cn(A,B)
inferred← citeshttps://doi.org/10.1007/11427186_22openalex-snapshot
Algorithm Engineering for Optimal Graph Bipartization
inferred← citeshttps://doi.org/10.1007/11560586_30openalex-snapshot
Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-04651-4_14openalex-snapshot
Bipartizing with a Matching
inferred← citeshttps://doi.org/10.1007/978-3-030-39881-1_14openalex-snapshot
Maximum Bipartite Subgraph of Geometric Intersection Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-64843-5_53openalex-snapshot
Inductive Graph Invariants and Algorithmic Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-07557-0_8openalex-snapshot
Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs
inferred← citeshttps://doi.org/10.1007/bf01200755openalex-snapshot
An approximate max-flow min-cut relation for undirected multicommodity flow, with applications
inferred← citeshttps://doi.org/10.1007/s10479-021-03966-9openalex-snapshot
On the computational complexity of the bipartizing matching problem
inferred← citeshttps://doi.org/10.1007/s10589-010-9355-1openalex-snapshot
Solving VLSI design and DNA sequencing problems using bipartization of graphs
inferred← citeshttps://doi.org/10.1016/0026-2692(92)90064-8openalex-snapshot
A signed hypergraph model of the constrained via minimization problem
inferred← citeshttps://doi.org/10.1016/j.akcej.2018.01.011openalex-snapshot
Negative (and positive) circles in signed graphs: A problem collection
inferred← citeshttps://doi.org/10.1016/j.cor.2015.12.004openalex-snapshot
A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem
inferred← citeshttps://doi.org/10.1016/j.cosrev.2018.02.002openalex-snapshot
The Critical Node Detection Problem in networks: A survey
inferred← citeshttps://doi.org/10.1016/j.dam.2005.04.017openalex-snapshot
Polyhedral results for the bipartite induced subgraph problem
inferred← citeshttps://doi.org/10.1016/j.dam.2008.08.020openalex-snapshot
Finding a maximum-weight induced k -partite subgraph of an i -triangulated graph
inferred← citeshttps://doi.org/10.1016/j.dam.2015.10.036openalex-snapshot
On bipartization of cubic graphs by removal of an independent set
inferred← citeshttps://doi.org/10.1016/j.dam.2026.02.005openalex-snapshot
The Maximum Independent Set problem on circulant graphs C n ( a , b )
inferred← citeshttps://doi.org/10.1016/j.disc.2015.08.026openalex-snapshot
Strong edge-coloring of (3,Δ) -bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.disopt.2011.04.002openalex-snapshot
The maximum k -colorable subgraph problem and orbitopes
inferred← citeshttps://doi.org/10.1016/j.jcss.2019.11.001openalex-snapshot
Faster Graph bipartization
inferred← citeshttps://doi.org/10.1016/j.laa.2018.12.019openalex-snapshot
New bounds for the signless Laplacian spread
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.02.041openalex-snapshot
Conditional matching preclusion for hypercube-like interconnection networks
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00092-4openalex-snapshot
A characterization of signed hypergraphs and its applications to VLSI via minimization and logic synthesis
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80112-4openalex-snapshot
Chapter 8 VLSI network design
inferred← citeshttps://doi.org/10.1017/9781107477063openalex-snapshot
Complexity Dichotomies for Counting Problems
inferred← citeshttps://doi.org/10.1023/a:1009683110027openalex-snapshot
Performance-Driven Layer Assignment by Integer Linear Programming and Path-Constrained Hypergraph Partitioning
inferred← citeshttps://doi.org/10.1023/a:1022428917827openalex-snapshot
Distance in stratified graphs
inferred← citeshttps://doi.org/10.1109/43.229751openalex-snapshot
A neural network approach to topological via-minimization problems
inferred← citeshttps://doi.org/10.1109/43.41502openalex-snapshot
Exact algorithms for multilayer topological via minimization
inferred← citeshttps://doi.org/10.1109/43.759077openalex-snapshot
An efficient approach to multilayer layer assignment with an application to via minimization
inferred← citeshttps://doi.org/10.1109/aspdac.2015.7059082openalex-snapshot
Layout decomposition co-optimization for hybrid e-beam and multiple patterning lithography
inferred← citeshttps://doi.org/10.1109/codit62066.2024.10708414openalex-snapshot
Finding Important Nodes in Chordal Graphs*
inferred← citeshttps://doi.org/10.1109/fscs.1990.89595openalex-snapshot
Approximation through multicommodity flow
inferred← citeshttps://doi.org/10.1109/glsv.1991.143969openalex-snapshot
Topological via minimization and routing
inferred← citeshttps://doi.org/10.1109/glsv.1992.218350openalex-snapshot
A signed hypergraph model of constrained via minimization
inferred← citeshttps://doi.org/10.1109/tcad.2015.2512903openalex-snapshot
Layout Decomposition Co-Optimization for Hybrid E-Beam and Multiple Patterning Lithography
inferred← citeshttps://doi.org/10.1109/tcad.2018.2859255openalex-snapshot
Fixed-Parameter Tractable Algorithms for Optimal Layout Decomposition and Beyond
inferred← citeshttps://doi.org/10.1109/tencon.1994.369174openalex-snapshot
Placement of logic schematics and topological via minimization
inferred← citeshttps://doi.org/10.1109/tpds.2006.37openalex-snapshot
Many-to-many disjoint path covers in hypercube-like interconnection networks with faulty elements
inferred← citeshttps://doi.org/10.1137/060650015openalex-snapshot
The Maximum Induced Bipartite Subgraph Problem with Edge Weights
inferred← citeshttps://doi.org/10.1137/1.9781611973402.126openalex-snapshot
Linear Time Parameterized Algorithms via Skew-Symmetric Multicuts
inferred← citeshttps://doi.org/10.1137/1.9781611975031.177openalex-snapshot
Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms
inferred← citeshttps://doi.org/10.1137/1.9781611975994.134openalex-snapshot
Parameterized Complexity and Approximability of Directed Odd Cycle Transversal
inferred← citeshttps://doi.org/10.1137/140980053openalex-snapshot
Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs
inferred← citeshttps://doi.org/10.1142/s0129054122500198openalex-snapshot
Graph Bipartization Problem with Applications to Via Minimization in VLSI Design
inferred← citeshttps://doi.org/10.1142/s021819592350005xopenalex-snapshot
Maximum Bipartite Subgraphs of Geometric Intersection Graphs
inferred← citeshttps://doi.org/10.1142/s0219265924500063openalex-snapshot
Graph Bipartization and Via Minimization for Intersection Graphs
inferred← citeshttps://doi.org/10.1142/s021963361450014xopenalex-snapshot
A fast algorithm for computing bipartite edge frustration number of (3,6)-fullerenes
inferred← citeshttps://doi.org/10.1142/s1793830922500197openalex-snapshot
Inductive graph invariants and approximation algorithms
inferred← citeshttps://doi.org/10.1145/266021.266294openalex-snapshot
An efficient approach to multi-layer layer assignment with application to via minimization
inferred← citeshttps://doi.org/10.1145/3128600openalex-snapshot
Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts
inferred← citeshttps://doi.org/10.1145/3749740.3749756openalex-snapshot
Valiant’s Contributions to Counting Complexity
inferred← citeshttps://doi.org/10.1541/ieejeiss.124.1305openalex-snapshot
A Neural-based Algorithm for Topological Via-minimization Problem
inferred← citeshttps://doi.org/10.3929/ethz-a-004832472openalex-snapshot
On the design and operation of high-performance optical networks
inferred← citeshttps://doi.org/10.48550/arxiv.1406.2728openalex-snapshot
On bipartization of cubic graphs by removal of an independent set
inferred← citeshttps://doi.org/10.48550/arxiv.1807.10277openalex-snapshot
On a reduction of the weighted induced bipartite subgraph problem to the weighted independent set problem
inferred← citeshttps://doi.org/10.7155/jgaa.00177openalex-snapshot
Algorithm Engineering for Optimal Graph Bipartization
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.