On the public citation graph

Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization

0 signed · 180 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/11427186_22openalex-snapshot
Algorithm Engineering for Optimal Graph Bipartization
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/11758471_31openalex-snapshot
Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments
inferredcites →https://doi.org/10.1007/3-540-36136-7_22openalex-snapshot
Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set
inferredcites →https://doi.org/10.1007/3-540-45655-4_60openalex-snapshot
On Parameterized Enumeration
inferredcites →https://doi.org/10.1007/3-540-56939-1_60openalex-snapshot
The approximation of maximum subgraph problems
inferredcites →https://doi.org/10.1007/978-1-4612-0515-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1007/978-1-4757-3023-4openalex-snapshot
Handbook of Combinatorial Optimization
inferredcites →https://doi.org/10.1007/978-1-4757-3023-4_4openalex-snapshot
Feedback Set Problems
inferredcites →https://doi.org/10.1007/978-3-540-28639-4_21openalex-snapshot
Parameterized Algorithms for Feedback Vertex Set
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.1016/0022-0000(91)90023-xopenalex-snapshot
Optimization, approximation, and complexity classes
inferredcites →https://doi.org/10.1016/0304-3975(94)00097-3openalex-snapshot
Fixed-parameter tractability and completeness II: On completeness for W[1]
inferredcites →https://doi.org/10.1016/b978-0-12-821986-7.00008-1openalex-snapshot
Introduction to Algorithms
inferredcites →https://doi.org/10.1016/j.cosrev.2007.09.001openalex-snapshot
Invitation to fixed-parameter algorithms
inferredcites →https://doi.org/10.1016/j.endm.2005.05.036openalex-snapshot
Planar graph bipartization in linear time
inferredcites →https://doi.org/10.1016/j.endm.2005.05.037openalex-snapshot
Faster algorithms for feedback vertex set
inferredcites →https://doi.org/10.1016/j.orl.2003.10.009openalex-snapshot
Finding odd cycle transversals
inferredcites →https://doi.org/10.1016/j.tcs.2005.10.004openalex-snapshot
Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
inferredcites →https://doi.org/10.1016/j.tcs.2005.10.010openalex-snapshot
Parameterized algorithms for feedback set problems and their duals in tournaments
inferredcites →https://doi.org/10.1016/j.tcs.2007.02.026openalex-snapshot
The multi-multiway cut problem
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/s1571-0661(04)00301-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1057/jors.1991.155openalex-snapshot
Introduction to Algorithms
inferredcites →https://doi.org/10.1093/acprof:oso/9780198566076.001.0001openalex-snapshot
Invitation to Fixed-Parameter Algorithms
inferredcites →https://doi.org/10.1101/gr.1536204openalex-snapshot
Hierarchical Scaffolding With Bambus
inferredcites →https://doi.org/10.1137/s0097539796305109openalex-snapshot
Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
inferredcites →https://doi.org/10.1137/s0895480196305124openalex-snapshot
A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
inferredcites →https://doi.org/10.1142/s0129054194000049openalex-snapshot
ON DISJOINT CYCLES
inferredcites →https://doi.org/10.1145/1060590.1060675openalex-snapshot
O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut 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.1145/509907.510017openalex-snapshot
On the power of unique 2-prover 1-round games
inferredcites →https://doi.org/10.1613/jair.638openalex-snapshot
Randomized Algorithms for the Loop Cutset Problem

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11427186_22openalex-snapshot
Algorithm Engineering for Optimal Graph Bipartization
inferred← citeshttps://doi.org/10.1007/11758471_31openalex-snapshot
Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments
inferred← citeshttps://doi.org/10.1007/11917496_4openalex-snapshot
Chordal Deletion Is Fixed-Parameter Tractable
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_450openalex-snapshot
Undirected Feedback Vertex Set
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-4939-2864-4_450openalex-snapshot
Undirected Feedback Vertex Set
inferred← citeshttps://doi.org/10.1007/978-1-4939-6613-4_20openalex-snapshot
Parameterized Algorithmics for Finding Exact Solutions of NP-Hard Biological Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-00256-5_28openalex-snapshot
An Improved FPT Algorithm for Independent Feedback Vertex Set
inferred← citeshttps://doi.org/10.1007/978-3-030-48966-3_18openalex-snapshot
On the Complexity of Singly Connected Vertex Deletion
inferred← citeshttps://doi.org/10.1007/978-3-030-75242-2_21openalex-snapshot
Circumventing Connectivity for Kernelization
inferred← citeshttps://doi.org/10.1007/978-3-030-86838-3_10openalex-snapshot
Odd Cycle Transversal in Mixed Graphs
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-15914-5_13openalex-snapshot
Finding k-Secluded Trees Faster
inferred← citeshttps://doi.org/10.1007/978-3-031-82670-2_3openalex-snapshot
Parameterized Complexity of Feedback Vertex Set with Connectivity Constraints
inferred← citeshttps://doi.org/10.1007/978-3-031-92935-9_14openalex-snapshot
Nonpartisan Feedback Vertex Set
inferred← citeshttps://doi.org/10.1007/978-3-032-11835-6_6openalex-snapshot
Subset Feedback Vertex Set Parameterized by Multiway Cut is FPT
inferred← citeshttps://doi.org/10.1007/978-3-032-17801-5_32openalex-snapshot
Solution Discovery for Vertex Cover, Independent Set, Dominating Set, and Feedback Vertex Set
inferred← citeshttps://doi.org/10.1007/978-3-319-03780-6_14openalex-snapshot
An Improved Exact Algorithm for Undirected Feedback Vertex Set
inferred← citeshttps://doi.org/10.1007/978-3-319-03898-8_16openalex-snapshot
A Faster FPT Algorithm for Bipartite Contraction
inferred← citeshttps://doi.org/10.1007/978-3-319-03898-8_24openalex-snapshot
On the Parameterized Complexity of Reconfiguration Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-04657-0_27openalex-snapshot
Complexity of Disjoint Π-Vertex Deletion for Disconnected Forbidden Subgraphs
inferred← citeshttps://doi.org/10.1007/978-3-319-07956-1_26openalex-snapshot
A New Linear Kernel for Undirected Planar Feedback Vertex Set: Smaller and Simpler
inferred← citeshttps://doi.org/10.1007/978-3-319-19929-0openalex-snapshot
Combinatorial Pattern Matching
inferred← citeshttps://doi.org/10.1007/978-3-319-19929-0_9openalex-snapshot
On the Fixed Parameter Tractability and Approximability of the Minimum Error Correction Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-70600-7_32openalex-snapshot
A New Approximation Algorithm for the Minimum Fragment Removal Problem
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-73951-7_37openalex-snapshot
Improved Algorithms for the Feedback Vertex Set Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_25openalex-snapshot
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number
inferred← citeshttps://doi.org/10.1007/978-3-540-79723-4_16openalex-snapshot
A Linear Kernel for Planar Feedback Vertex Set
inferred← citeshttps://doi.org/10.1007/978-3-540-85238-4_27openalex-snapshot
Iterative Compression and Exact Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-01551-9_6openalex-snapshot
Querying Protein-Protein Interaction Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-02017-9_41openalex-snapshot
A Fixed-Parameter Enumeration Algorithm for the Weighted FVS Problem
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-03816-7_28openalex-snapshot
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-10217-2_14openalex-snapshot
Feedback Vertex Set on Graphs of Low Cliquewidth
inferred← citeshttps://doi.org/10.1007/978-3-642-10217-2_37openalex-snapshot
Simpler Parameterized Algorithm for OCT
inferred← citeshttps://doi.org/10.1007/978-3-642-11440-3_25openalex-snapshot
FPT Algorithms for Connected Feedback Vertex Set
inferred← citeshttps://doi.org/10.1007/978-3-642-13078-6_5openalex-snapshot
Fixed-Parameter Algorithm for General Pedigrees with a Single Pair of Sites
inferred← citeshttps://doi.org/10.1007/978-3-642-13731-0_10openalex-snapshot
On Feedback Vertex Set New Measure and New Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-15294-8_11openalex-snapshot
Fixed-Parameter Algorithm for Haplotype Inferences on General Pedigrees with Small Number of Sites
inferred← citeshttps://doi.org/10.1007/978-3-642-16926-7_19openalex-snapshot
A Quartic Kernel for Pathwidth-One Vertex Deletion
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_38openalex-snapshot
Subset Feedback Vertex Set Is Fixed-Parameter Tractable
inferred← citeshttps://doi.org/10.1007/978-3-642-22300-6_11openalex-snapshot
Feedback Vertex Set in Mixed Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-23719-5_34openalex-snapshot
Hitting and Harvesting Pumpkins
inferred← citeshttps://doi.org/10.1007/978-3-642-28050-4_11openalex-snapshot
On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal
inferred← citeshttps://doi.org/10.1007/978-3-642-28050-4_5openalex-snapshot
Contracting Graphs to Paths and Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-29700-7_21openalex-snapshot
Fixed-Parameter Tractability of almost CSP Problem with Decisive Relations
inferred← citeshttps://doi.org/10.1007/978-3-642-30891-8_19openalex-snapshot
FPT Suspects and Tough Customers: Open Problems of Downey and Fellows
inferred← citeshttps://doi.org/10.1007/978-3-642-30891-8_20openalex-snapshot
What’s Next? Future Directions in Parameterized Complexity
inferred← citeshttps://doi.org/10.1007/978-3-642-31155-0_11openalex-snapshot
A Single-Exponential FPT Algorithm for the K 4-Minor Cover Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-34611-8_21openalex-snapshot
On Group Feedback Vertex Set Parameterized by the Size of the Cutset
inferred← citeshttps://doi.org/10.1007/978-3-642-36065-7_23openalex-snapshot
Fixed-Parameter Tractability of Error Correction in Graphical Linear Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_52openalex-snapshot
Linear Kernels and Single-Exponential Algorithms via Protrusion Decompositions
inferred← citeshttps://doi.org/10.1007/978-3-662-44465-8_13openalex-snapshot
Dual Connectedness of Edge-Bicolored Graphs and Beyond
inferred← citeshttps://doi.org/10.1007/s00224-008-9130-1openalex-snapshot
Fixed-Parameter Enumerability of Cluster Editing and Related Problems
inferred← citeshttps://doi.org/10.1007/s00224-010-9262-yopenalex-snapshot
Vertex Cover Problem Parameterized Above and Below Tight Bounds
inferred← citeshttps://doi.org/10.1007/s00224-012-9415-2openalex-snapshot
Parameterized Complexity of Satisfying Almost All Linear Equations over $\mathbb{F}_{2}$
inferred← citeshttps://doi.org/10.1007/s00224-020-09973-wopenalex-snapshot
An Improved FPT Algorithm for Independent Feedback Vertex Set
inferred← citeshttps://doi.org/10.1007/s00224-021-10045-wopenalex-snapshot
A Parameterized Complexity View on Collapsing k-Cores
inferred← citeshttps://doi.org/10.1007/s00224-022-10076-xopenalex-snapshot
An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion
inferred← citeshttps://doi.org/10.1007/s00453-008-9233-8openalex-snapshot
Chordal Deletion is Fixed-Parameter Tractable
inferred← citeshttps://doi.org/10.1007/s00453-010-9412-2openalex-snapshot
The Complexity of König Subgraph Problems and Above-Guarantee Vertex Cover
inferred← citeshttps://doi.org/10.1007/s00453-012-9670-2openalex-snapshot
Contracting Graphs to Paths and Trees
inferred← citeshttps://doi.org/10.1007/s00453-014-9904-6openalex-snapshot
On Feedback Vertex Set: New Measure and New Structures
inferred← citeshttps://doi.org/10.1007/s00453-014-9966-5openalex-snapshot
On Group Feedback Vertex Set Parameterized by the Size of the Cutset
inferred← citeshttps://doi.org/10.1007/s00453-016-0159-2openalex-snapshot
On the Parameterized Complexity of Reconfiguration Problems
inferred← citeshttps://doi.org/10.1007/s00453-017-0316-2openalex-snapshot
A Polynomial Kernel for Block Graph Deletion
inferred← citeshttps://doi.org/10.1007/s00453-017-0319-zopenalex-snapshot
Edge Bipartization Faster than $$2^k$$ 2 k
inferred← citeshttps://doi.org/10.1007/s00453-019-00607-3openalex-snapshot
Mim-Width II. The Feedback Vertex Set Problem
inferred← citeshttps://doi.org/10.1007/s00453-023-01206-zopenalex-snapshot
Improved FPT Algorithms for Deletion to Forest-Like Structures
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/s10878-011-9394-2openalex-snapshot
FPT algorithms for Connected Feedback Vertex Set
inferred← citeshttps://doi.org/10.1007/s10878-014-9737-xopenalex-snapshot
An improved exact algorithm for undirected feedback vertex set
inferred← citeshttps://doi.org/10.1016/j.cosrev.2011.09.002openalex-snapshot
Confronting intractability via parameters
inferred← citeshttps://doi.org/10.1016/j.cosrev.2023.100556openalex-snapshot
A survey of parameterized algorithms and the complexity of edge modification
inferred← citeshttps://doi.org/10.1016/j.cosrev.2025.100869openalex-snapshot
Applications of flow-augmentation
inferred← citeshttps://doi.org/10.1016/j.dam.2008.11.006openalex-snapshot
Minimum fill-in and treewidth of split+ke and split+kv graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2012.02.017openalex-snapshot
A note on the parameterized complexity of unordered maximum tree orientation
inferred← citeshttps://doi.org/10.1016/j.dam.2015.06.032openalex-snapshot
An FPT algorithm for the vertex cover P4 problem
inferred← citeshttps://doi.org/10.1016/j.ejc.2012.07.023openalex-snapshot
Feedback vertex set on graphs of low clique-width
inferred← citeshttps://doi.org/10.1016/j.ic.2026.105463openalex-snapshot
Solving subset feedback vertex set in chordal graphs faster than 2k
inferred← citeshttps://doi.org/10.1016/j.ipl.2013.09.004openalex-snapshot
A faster FPT algorithm for Bipartite Contraction
inferred← citeshttps://doi.org/10.1016/j.ipl.2014.05.001openalex-snapshot
Faster deterministic Feedback Vertex Set
inferred← citeshttps://doi.org/10.1016/j.ipl.2014.06.018openalex-snapshot
A fixed-parameter algorithm for the vertex cover P3 problem
inferred← citeshttps://doi.org/10.1016/j.ipl.2018.03.016openalex-snapshot
An improved FPT algorithm for Almost Forest Deletion problem
inferred← citeshttps://doi.org/10.1016/j.jcss.2008.05.002openalex-snapshot
Improved algorithms for feedback vertex set problems
inferred← citeshttps://doi.org/10.1016/j.jcss.2014.05.001openalex-snapshot
A single-exponential FPT algorithm for the K4 -minor cover problem
inferred← citeshttps://doi.org/10.1016/j.jcss.2019.11.001openalex-snapshot
Faster Graph bipartization
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.11.001openalex-snapshot
Incompressibility of H-free edge modification problems: Towards a dichotomy
inferred← citeshttps://doi.org/10.1016/j.jcss.2023.05.006openalex-snapshot
Finding k-secluded trees faster
inferred← citeshttps://doi.org/10.1016/j.jda.2008.09.005openalex-snapshot
Parameterized complexity of finding regular induced subgraphs
inferred← citeshttps://doi.org/10.1016/j.jda.2009.08.001openalex-snapshot
Fixed-parameter tractability results for feedback set problems in tournaments
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.11.012openalex-snapshot
Iterative compression and exact algorithms
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.11.034openalex-snapshot
Extended dynamic subgraph statistics using h -index parameterized data structures
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.03.031openalex-snapshot
An improved parameterized algorithm for the independent feedback vertex set problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.08.012openalex-snapshot
On the complexity of singly connected vertex deletion
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114139openalex-snapshot
A parameterized algorithm for subset feedback vertex set in tournaments
inferred← citeshttps://doi.org/10.1016/j.vlsi.2013.09.002openalex-snapshot
Fast and scalable parallel layout decomposition in double patterning lithography
inferred← citeshttps://doi.org/10.1089/cmb.2014.0161openalex-snapshot
Simultaneous Inference of Cancer Pathways and Tumor Progression from Cross-Sectional Mutation Data
inferred← citeshttps://doi.org/10.1089/cmb.2015.0220openalex-snapshot
On the Minimum Error Correction Problem for Haplotype Assembly in Diploid and Polyploid Genomes
inferred← citeshttps://doi.org/10.1089/cmb.2016.0040openalex-snapshot
Comparing Unlabeled Pedigree Graphs via Covering with Bipartite and Path
inferred← citeshttps://doi.org/10.1093/comjnl/bxm040openalex-snapshot
Techniques for Practical Fixed-Parameter Algorithms
inferred← citeshttps://doi.org/10.1093/comjnl/bxm048openalex-snapshot
Parameterized Complexity and Approximation 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/focs.2012.62openalex-snapshot
Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms
inferred← citeshttps://doi.org/10.1109/glocom.2016.7841490openalex-snapshot
A D2D-Multicast Based Computation Offloading Framework for Interactive Applications
inferred← citeshttps://doi.org/10.1109/tcbb.2010.53openalex-snapshot
Querying Graphs in Protein-Protein Interactions Networks Using Feedback Vertex Set
inferred← citeshttps://doi.org/10.1117/12.2258156openalex-snapshot
Efficient DSA-DP hybrid lithography conflict detection and guiding template assignment
inferred← citeshttps://doi.org/10.1137/1.9781611973082.60openalex-snapshot
Slightly Superexponential Parameterized Problems
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.9781611975994.58openalex-snapshot
Detecting Feedback Vertex Sets of Size k in O*(2.7k) Time
inferred← citeshttps://doi.org/10.1137/110843071openalex-snapshot
Subset Feedback Vertex Set Is Fixed-Parameter Tractable
inferred← citeshttps://doi.org/10.1137/120883736openalex-snapshot
Hitting and Harvesting Pumpkins
inferred← citeshttps://doi.org/10.1137/130907392openalex-snapshot
Obtaining a Bipartite Graph by Contracting Few Edges
inferred← citeshttps://doi.org/10.1137/16m1100794openalex-snapshot
Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel
inferred← citeshttps://doi.org/10.1137/16m1104834openalex-snapshot
Slightly Superexponential Parameterized Problems
inferred← citeshttps://doi.org/10.1140/epjb/e2014-50289-7openalex-snapshot
Solving the undirected feedback vertex set problem by local search
inferred← citeshttps://doi.org/10.1145/1374376.1374404openalex-snapshot
A fixed-parameter algorithm for the directed feedback vertex set problem
inferred← citeshttps://doi.org/10.1145/1411509.1411511openalex-snapshot
A fixed-parameter algorithm for the directed feedback vertex set problem
inferred← citeshttps://doi.org/10.1145/1944857.1944860openalex-snapshot
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems
inferred← citeshttps://doi.org/10.1145/2500119openalex-snapshot
Finding small separators in linear time via treewidth reduction
inferred← citeshttps://doi.org/10.1145/2566616openalex-snapshot
Faster Parameterized Algorithms Using Linear Programming
inferred← citeshttps://doi.org/10.1145/2635810openalex-snapshot
Compression via Matroids
inferred← citeshttps://doi.org/10.1145/2700209openalex-snapshot
Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable
inferred← citeshttps://doi.org/10.1145/2797140openalex-snapshot
Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions
inferred← citeshttps://doi.org/10.1145/2897518.2897551openalex-snapshot
Exact Algorithms via Monotone Local Search
inferred← citeshttps://doi.org/10.1145/3447548.3467454openalex-snapshot
Boosted Second Price Auctions
inferred← citeshttps://doi.org/10.1145/3504027openalex-snapshot
Detecting Feedback Vertex Sets of Size k in O ⋆ (2.7 k ) Time
inferred← citeshttps://doi.org/10.1145/3506707openalex-snapshot
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
inferred← citeshttps://doi.org/10.1186/1748-7188-6-8openalex-snapshot
An FPT haplotyping algorithm on pedigrees with a small number of sites
inferred← citeshttps://doi.org/10.1186/1753-6561-5-s2-s6openalex-snapshot
Haplotype inference in general pedigrees with two sites
inferred← citeshttps://doi.org/10.21203/rs.3.rs-2357961/v1openalex-snapshot
Breaking the Barrier 2k for Subset Feedback Vertex Set in Chordal Graphs
inferred← citeshttps://doi.org/10.22028/d291-26018openalex-snapshot
Kernelization of generic problems : upper and lower bounds
inferred← citeshttps://doi.org/10.24425/123535openalex-snapshot
On Transformation of a Logical Circuit to a Circuit with NAND and NOR Gates Only
inferred← citeshttps://doi.org/10.3724/sp.j.1016.2010.01140openalex-snapshot
Fixed Parameter Enumeration Algorithm for Feedback Vertex Set in Weighted Undirected Graphs
inferred← citeshttps://doi.org/10.4230/dagsemproc.07281.5openalex-snapshot
Directed Feedback Vertex Set Problem is FPT
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2011.217openalex-snapshot
Obtaining a Bipartite Graph by Contracting Few Edges
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2020.59openalex-snapshot
Hitting Long Directed Cycles Is Fixed-Parameter Tractable
inferred← citeshttps://doi.org/10.4230/lipics.isaac.2020.34openalex-snapshot
Improved FPT Algorithms for Deletion to Forest-Like Structures
inferred← citeshttps://doi.org/10.48550/arxiv.1008.0213openalex-snapshot
Improved Parameterized Algorithms for Constraint Satisfaction
inferred← citeshttps://doi.org/10.48550/arxiv.1906.12298openalex-snapshot
Detecting Feedback Vertex Sets of Size $k$ in $O^\star(2.7^k)$ Time
inferred← citeshttps://doi.org/10.64898/2026.05.25.727519openalex-snapshot
Inferring Multi-Stage Pathway Progression Models from Tumor Phylogenies
inferred← citeshttps://doi.org/10.65109/gezs6576openalex-snapshot
Learning to Design Coupons in Online Advertising Markets
inferred← citeshttps://doi.org/10.70675/1216b4b1zd441z4267z9465z610d85657e27openalex-snapshot
On various graph coloring problems
inferred← citeshttps://doi.org/10.70675/b11eea53zc024z4b25z9733zabc490a88ec7openalex-snapshot
Aspects algorithmiques de la comparaison d'éléments biologiques
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.