On the public citation graph

Algorithm Engineering for Optimal Graph Bipartization

0 signed · 77 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.1006/jagm.1998.0996openalex-snapshot
Parameterizing above Guaranteed Values: MaxSat and MaxCut
inferredcites →https://doi.org/10.1007/11533719_87openalex-snapshot
An O(2 O(k) n 3) FPT Algorithm for the Undirected Feedback Vertex Set Problem
inferredcites →https://doi.org/10.1007/11534273_15openalex-snapshot
Improved Fixed-Parameter Algorithms for Two Feedback Set Problems
inferredcites →https://doi.org/10.1007/11758471_31openalex-snapshot
Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments
inferredcites →https://doi.org/10.1007/11807964_40openalex-snapshot
Perturbative Time and Frequency Allocations for RFID Reader Networks
inferredcites →https://doi.org/10.1007/11847250_18openalex-snapshot
The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel
inferredcites →https://doi.org/10.1007/11917496_4openalex-snapshot
Chordal Deletion Is Fixed-Parameter Tractable
inferredcites →https://doi.org/10.1007/3-540-29953-xopenalex-snapshot
Parameterized Complexity Theory
inferredcites →https://doi.org/10.1007/3-540-36478-1_17openalex-snapshot
Exact Algorithms for NP-Hard Problems: A Survey
inferredcites →https://doi.org/10.1007/3-540-45784-4_3openalex-snapshot
Practical Algorithms and Fixed-Parameter Tractability for the Single Individual SNP Haplotyping Problem
inferredcites →https://doi.org/10.1007/3-540-56939-1_60openalex-snapshot
The approximation of maximum subgraph problems
inferredcites →https://doi.org/10.1007/3-540-58201-0_92openalex-snapshot
Multiway cuts in directed and node weighted graphs
inferredcites →https://doi.org/10.1007/978-1-4612-0515-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1007/978-3-030-36826-5_4openalex-snapshot
Introduction to Algorithms
inferredcites →https://doi.org/10.1007/978-3-540-28629-5_4openalex-snapshot
Ubiquitous Parameterization — Invitation to Fixed-Parameter Algorithms
inferredcites →https://doi.org/10.1007/978-3-540-28639-4_24openalex-snapshot
Greedy Localization, Iterative Compression, and Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel 2k Kernelization for Vertex Cover
inferredcites →https://doi.org/10.1007/978-3-540-30219-3_23openalex-snapshot
Fast Hare: A Fast Heuristic for Single Individual SNP Haplotype Reconstruction
inferredcites →https://doi.org/10.1007/978-3-540-39890-5_1openalex-snapshot
Blow-Ups, Win/Win’s, and Crown Rules: Some New Directions in FPT
inferredcites →https://doi.org/10.1007/978-3-540-45078-8_44openalex-snapshot
New Directions and New Challenges in Algorithm Design and Complexity, Parameterized
inferredcites →https://doi.org/10.1007/978-3-540-70918-3_28openalex-snapshot
A Cubic Kernel for Feedback Vertex Set
inferredcites →https://doi.org/10.1016/0022-0000(80)90060-4openalex-snapshot
The node-deletion problem for hereditary properties is NP-complete
inferredcites →https://doi.org/10.1016/0022-0000(91)90023-xopenalex-snapshot
Optimization, approximation, and complexity classes
inferredcites →https://doi.org/10.1016/j.dam.2005.04.017openalex-snapshot
Polyhedral results for the bipartite induced subgraph problem
inferredcites →https://doi.org/10.1016/j.jcss.2006.02.001openalex-snapshot
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
inferredcites →https://doi.org/10.1016/j.orl.2003.10.009openalex-snapshot
Finding odd cycle transversals
inferredcites →https://doi.org/10.1016/s0166-218x(03)00361-5openalex-snapshot
Extracting pure network submatrices in linear programs using signed graphs
inferredcites →https://doi.org/10.1016/s1571-0661(04)00301-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1093/acprof:oso/9780198566076.001.0001openalex-snapshot
Invitation to Fixed-Parameter Algorithms
inferredcites →https://doi.org/10.1109/ccc.2003.1214417openalex-snapshot
Parameterized complexity for the skeptic
inferredcites →https://doi.org/10.1109/iscas.1992.230393openalex-snapshot
On graph bipartization
inferredcites →https://doi.org/10.1137/0402004openalex-snapshot
Graph Bipartization and via minimization
inferredcites →https://doi.org/10.1137/s0097539793243016openalex-snapshot
Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
inferredcites →https://doi.org/10.1145/321694.321699openalex-snapshot
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
inferredcites →https://doi.org/10.1145/370155.370304openalex-snapshot
New graph bipartizations for double-exposure, bright field alternating phase-shift mask layout
inferredcites →https://doi.org/10.2174/157489306775330570openalex-snapshot
Models and Algorithms for Haplotyping Problem
inferredcites →https://doi.org/10.2307/253980openalex-snapshot
Theory of Linear and Integer Programming
inferredcites →https://doi.org/10.5555/942806.943845openalex-snapshot
Resolving register bank conflicts for a network processor

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11534273_15openalex-snapshot
Improved Fixed-Parameter Algorithms for Two Feedback Set Problems
inferred← citeshttps://doi.org/10.1007/978-1-4471-5559-1_16openalex-snapshot
Other Width Metrics
inferred← citeshttps://doi.org/10.1007/978-1-4471-5559-1_6openalex-snapshot
Iterative Compression, and Measure and Conquer, for Minimization Problems
inferred← citeshttps://doi.org/10.1007/978-1-60327-429-6_21openalex-snapshot
Developing Fixed-Parameter Algorithms to Solve Combinatorially Explosive Biological Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-34029-2_28openalex-snapshot
Faster Biclique Mining in Near-Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_45openalex-snapshot
Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-540-72845-0_23openalex-snapshot
Optimal Edge Deletions for Signed Graph Balancing
inferred← citeshttps://doi.org/10.1007/978-3-540-79228-4_38openalex-snapshot
A Practical Parameterized Algorithm for the Individual Haplotyping Problem MLF
inferred← citeshttps://doi.org/10.1007/978-3-642-02094-0_4openalex-snapshot
Iterative Compression for Exactly Solving NP-Hard Minimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-14866-8_5openalex-snapshot
Chapter 5. Realistic Computer Models
inferred← citeshttps://doi.org/10.1007/s00453-007-9150-2openalex-snapshot
An Improved (and Practical) Parameterized Algorithm for the Individual Haplotyping Problem MFR with Mate-Pairs
inferred← citeshttps://doi.org/10.1007/s00453-009-9288-1openalex-snapshot
A Practical Exact Algorithm for the Individual Haplotyping Problem MEC/GI
inferred← citeshttps://doi.org/10.1007/s10878-009-9212-2openalex-snapshot
Separator-based data reduction for signed graph balancing
inferred← citeshttps://doi.org/10.1007/s11128-018-1863-4openalex-snapshot
Optimizing adiabatic quantum program compilation using a graph-theoretic framework
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.2011.09.002openalex-snapshot
Confronting intractability via parameters
inferred← citeshttps://doi.org/10.1016/j.endm.2006.06.065openalex-snapshot
Speeding up Exact Algorithms With High Probability
inferred← citeshttps://doi.org/10.1016/j.jcss.2006.02.001openalex-snapshot
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
inferred← citeshttps://doi.org/10.1016/j.jcss.2009.04.002openalex-snapshot
Almost 2-SAT is fixed-parameter tractable
inferred← citeshttps://doi.org/10.1017/s096012951000023xopenalex-snapshot
A practical parameterised algorithm for the individual haplotyping problem MLF
inferred← citeshttps://doi.org/10.1093/comjnl/bxm040openalex-snapshot
Techniques for Practical Fixed-Parameter Algorithms
inferred← citeshttps://doi.org/10.1093/gigascience/giy014openalex-snapshot
Bipartite graphs in systems biology and medicine: a survey of methods and applications
inferred← citeshttps://doi.org/10.1109/bmei.2008.122openalex-snapshot
A Practical Exact Algorithm for the Individual Haplotyping Problem MEC
inferred← citeshttps://doi.org/10.1137/070710275openalex-snapshot
Divide-and-Conquer Approximation Algorithm for Vertex Cover
inferred← citeshttps://doi.org/10.1137/1.9781611973099.8openalex-snapshot
Compression via Matroids: A Randomized Polynomial Kernel for Odd Cycle Transversal
inferred← citeshttps://doi.org/10.1137/1.9781611975673.37openalex-snapshot
Mining Maximal Induced Bicliques using Odd Cycle Transversals
inferred← citeshttps://doi.org/10.1137/1.9781611976007.6openalex-snapshot
Approximating V ertex C over using Structural Rounding
inferred← citeshttps://doi.org/10.1137/15m1041213openalex-snapshot
Hitting Selected (Odd) Cycles
inferred← citeshttps://doi.org/10.11606/t.45.2020.tde-10012020-200714openalex-snapshot
Transversals of graphs
inferred← citeshttps://doi.org/10.1287/ijoc.2021.1086openalex-snapshot
The Maximum k-Colorable Subgraph Problem and Related Problems
inferred← citeshttps://doi.org/10.1360/jos182070openalex-snapshot
Parameterized Algorithm of the Individual Haplotyping MSR Problem with Mate-Pairs
inferred← citeshttps://doi.org/10.1504/ijbra.2013.050746openalex-snapshot
Parameterised algorithms of the individual haplotyping problem with gaps
inferred← citeshttps://doi.org/10.2174/157489306775330570openalex-snapshot
Models and Algorithms for Haplotyping Problem
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2011.217openalex-snapshot
Obtaining a Bipartite Graph by Contracting Few Edges
inferred← citeshttps://doi.org/10.48550/arxiv.0906.1359openalex-snapshot
Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs
inferred← citeshttps://doi.org/10.48550/arxiv.1411.2680openalex-snapshot
Branch-and-Reduce Exponential/FPT Algorithms in Practice: A Case Study of Vertex Cover
inferred← citeshttps://doi.org/10.48550/arxiv.1504.08120openalex-snapshot
Parameterized Algorithms for Deletion to (r,l)-graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1507.02168openalex-snapshot
Edge Bipartization faster than $2^k$
inferred← citeshttps://doi.org/10.48550/arxiv.1909.04611openalex-snapshot
Approximating Vertex Cover using Structural Rounding
inferred← citeshttps://doi.org/10.48550/arxiv.2001.09644openalex-snapshot
The maximum $k$-colorable subgraph problem and related problems
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.