On the public citation graph
Parameterized and Exact Computation
0 signed · 193 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/11847250_4openalex-snapshot
Parameterizing MAX SNP Problems Above Guaranteed Values
inferredcites →https://doi.org/10.1007/11847250_6openalex-snapshot
Fixed-Parameter Complexity of Minimum Profile Problems
inferredcites →https://doi.org/10.1007/11847250_7openalex-snapshot
On the OBDD Size for Graphs of Bounded Tree- and Clique-Width
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_10openalex-snapshot
Parameterized Counting Algorithms for General Graph Covering Problems
inferred← citeshttps://doi.org/10.1007/11534273_15openalex-snapshot
Improved Fixed-Parameter Algorithms for Two Feedback Set Problems
inferred← citeshttps://doi.org/10.1007/11577188_26openalex-snapshot
A Parallel O(n27n/8) Time-Memory-Processor Tradeoff for Knapsack-Like Problems
inferred← citeshttps://doi.org/10.1007/11602613_98openalex-snapshot
Minimum Weight Triangulation by Cutting Out Triangles
inferred← citeshttps://doi.org/10.1007/11758471_33openalex-snapshot
Fixed-Parameter Tractable Generalizations of Cluster Editing
inferred← citeshttps://doi.org/10.1007/11821069_21openalex-snapshot
Improved Parameterized Upper Bounds for Vertex Cover
inferred← citeshttps://doi.org/10.1007/11847250_18openalex-snapshot
The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel
inferred← citeshttps://doi.org/10.1007/978-1-4471-5559-1_32openalex-snapshot
Parameterized Counting and Randomization
inferred← citeshttps://doi.org/10.1007/978-1-4614-8588-9_10openalex-snapshot
Distance-Based Clique Relaxations in Networks: s-Clique and s-Club
inferred← citeshttps://doi.org/10.1007/978-3-319-03898-8_10openalex-snapshot
Contracting Few Edges to Remove Forbidden Induced Subgraphs
inferred← citeshttps://doi.org/10.1007/978-3-319-03898-8_20openalex-snapshot
The Jump Number Problem: Exact and Parameterized
inferred← citeshttps://doi.org/10.1007/978-3-319-03898-8_22openalex-snapshot
Hardness of r-dominating set on Graphs of Diameter (r + 1)
inferred← citeshttps://doi.org/10.1007/978-3-319-03898-8_9openalex-snapshot
Incompressibility of H-Free Edge Modification
inferred← citeshttps://doi.org/10.1007/978-3-319-04298-5_14openalex-snapshot
Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-04657-0_13openalex-snapshot
The ${\mathcal{G}}$ -Packing with t-Overlap Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-06089-7_24openalex-snapshot
On the Parameterized Complexity for Token Jumping on Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-06686-8_12openalex-snapshot
Notions of Metric Dimension of Corona Products: Combinatorial and Computational Results
inferred← citeshttps://doi.org/10.1007/978-3-319-06686-8_5openalex-snapshot
Vertex Disjoint Paths in Upward Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-07566-2_11openalex-snapshot
Randomized and Parameterized Algorithms for the Closest String Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-07956-1_20openalex-snapshot
Parameterized Complexity of Connected Induced Subgraph Problems
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-08783-2_14openalex-snapshot
Complexity of Dense Bicluster Editing Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-09284-3_7openalex-snapshot
Conditional Lower Bounds for Failed Literals and Related Techniques
inferred← citeshttps://doi.org/10.1007/978-3-319-11558-0_39openalex-snapshot
The D-FLAT System for Dynamic Programming on Tree Decompositions
inferred← citeshttps://doi.org/10.1007/978-3-319-13075-0_37openalex-snapshot
Approximating the Maximum Internal Spanning Tree Problem via a Maximum Path-Cycle Cover
inferred← citeshttps://doi.org/10.1007/978-3-319-13524-3_1openalex-snapshot
Lower Bounds for Kernelization
inferred← citeshttps://doi.org/10.1007/978-3-319-13524-3_10openalex-snapshot
The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration
inferred← citeshttps://doi.org/10.1007/978-3-319-15612-5_30openalex-snapshot
Logspace and FPT Algorithms for Graph Isomorphism for Subclasses of Bounded Tree-Width Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-69507-3_22openalex-snapshot
Exact Max 2-Sat: Easier and Faster
inferred← citeshttps://doi.org/10.1007/978-3-540-69507-3_31openalex-snapshot
Partial vs. Complete Domination: t-Dominating Set
inferred← citeshttps://doi.org/10.1007/978-3-540-69733-6_14openalex-snapshot
Improved Parameterized Algorithms for Weighted 3-Set Packing
inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_46openalex-snapshot
On Problems without Polynomial Kernels (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_47openalex-snapshot
Faster Algebraic Algorithms for Path and Packing Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-72504-6_64openalex-snapshot
Kernelizations for Parameterized Counting Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_33openalex-snapshot
Parameterized Approximability of the Disjoint Cycle Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-73545-8_35openalex-snapshot
A Randomized Approximation Algorithm for Parameterized 3-D Matching Counting Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-73545-8_52openalex-snapshot
Improved Algorithms for Weighted and Unweighted Set Splitting Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-73814-5_32openalex-snapshot
The Parameterized Complexity of the Induced Matching Problem in Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-73951-7_36openalex-snapshot
Fixed-Parameter Tractability for Non-Crossing Spanning Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-73951-7_38openalex-snapshot
Kernelization Algorithms for d-Hitting Set Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-74240-1_27openalex-snapshot
Efficient Parameterized Preprocessing for Cluster Editing
inferred← citeshttps://doi.org/10.1007/978-3-540-74839-7_21openalex-snapshot
Segmenting Strings Homogeneously Via Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_79openalex-snapshot
Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-77566-9_24openalex-snapshot
Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality
inferred← citeshttps://doi.org/10.1007/978-3-540-77891-2_14openalex-snapshot
Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-78671-9_9openalex-snapshot
Population Parallel GP on the G80 GPU
inferred← citeshttps://doi.org/10.1007/978-3-540-78773-0_64openalex-snapshot
Domination in Geometric Intersection Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-79228-4_19openalex-snapshot
An Improved Parameterized Algorithm for a Generalized Matching Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-79228-4_39openalex-snapshot
Improved Algorithms for Bicluster Editing
inferred← citeshttps://doi.org/10.1007/978-3-540-79228-4_42openalex-snapshot
A Moderately Exponential Time Algorithm for Full Degree Spanning Tree
inferred← citeshttps://doi.org/10.1007/978-3-540-79228-4_7openalex-snapshot
An O *(3.523k ) Parameterized Algorithm for 3-Set Packing
inferred← citeshttps://doi.org/10.1007/978-3-540-79723-4_1openalex-snapshot
Randomized Disposal of Unknowns and Implicitly Enforced Bounds on Parameters
inferred← citeshttps://doi.org/10.1007/978-3-540-79723-4_11openalex-snapshot
A Purely Democratic Characterization of W[1]
inferred← citeshttps://doi.org/10.1007/978-3-540-85097-7_1openalex-snapshot
Going Weighted: Parameterized Algorithms for Cluster Editing
inferred← citeshttps://doi.org/10.1007/978-3-540-85097-7_2openalex-snapshot
Parameterized Graph Editing with Chosen Vertex Degrees
inferred← citeshttps://doi.org/10.1007/978-3-540-85238-4_11openalex-snapshot
Clustering with Partial Information
inferred← citeshttps://doi.org/10.1007/978-3-540-87744-8_36openalex-snapshot
Faster Steiner Tree Computation in Polynomial-Space
inferred← citeshttps://doi.org/10.1007/978-3-540-92182-0_25openalex-snapshot
Firefighting on Trees: (1 − 1/e)–Approximation, Fixed Parameter Tractability and a Subexponential Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-540-92182-0_29openalex-snapshot
A Linear Kernel for the k-Disjoint Cycle Problem on Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-92248-3_22openalex-snapshot
Improved Upper Bounds for Partial Vertex Cover
inferred← citeshttps://doi.org/10.1007/978-3-540-93980-1_3openalex-snapshot
Degree-Constrained Subgraph Problems: Hardness and Approximation Results
inferred← citeshttps://doi.org/10.1007/978-3-642-00202-1_26openalex-snapshot
Parameterized Complexity of Stabbing Rectangles and Squares in the Plane
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-02017-9_7openalex-snapshot
Fixed-Parameter Algorithms for Graph-Modeled Date Clustering
inferred← citeshttps://doi.org/10.1007/978-3-642-02017-9_9openalex-snapshot
Searching Trees: An Essay
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-02270-8_25openalex-snapshot
An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set
inferred← citeshttps://doi.org/10.1007/978-3-642-02927-1_59openalex-snapshot
Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-03367-4_44openalex-snapshot
Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-03417-6_15openalex-snapshot
Minimum Interference Planar Geometric Topology in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-04128-0_55openalex-snapshot
Experimental Study of FPT Algorithms for the Directed Feedback Vertex Set Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-04241-6_2openalex-snapshot
Annotating Fragmentation Patterns
inferred← citeshttps://doi.org/10.1007/978-3-642-11269-0_2openalex-snapshot
Kernelization: New Upper and Lower Bound Techniques
inferred← citeshttps://doi.org/10.1007/978-3-642-11269-0_22openalex-snapshot
Two Edge Modification Problems without Polynomial Kernels
inferred← citeshttps://doi.org/10.1007/978-3-642-11269-0_23openalex-snapshot
On the Directed Degree-Preserving Spanning Tree Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-11269-0_24openalex-snapshot
Even Faster Algorithm for Set Splitting!
inferred← citeshttps://doi.org/10.1007/978-3-642-11269-0_4openalex-snapshot
Planar Capacitated Dominating Set Is W[1]-Hard
inferred← citeshttps://doi.org/10.1007/978-3-642-11269-0_8openalex-snapshot
Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-11440-3_26openalex-snapshot
A Simple and Fast Algorithm for Maximum Independent Set in 3-Degree Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-13073-1_8openalex-snapshot
Polynomial Space Algorithms for Counting Dominating Sets and the Domatic Number
inferred← citeshttps://doi.org/10.1007/978-3-642-13509-5_20openalex-snapshot
Extended Islands of Tractability for Parsimony Haplotyping
inferred← citeshttps://doi.org/10.1007/978-3-642-13562-0_34openalex-snapshot
Maximum Independent Set in Graphs of Average Degree at Most Three in ${\mathcal O}(1.08537^n)$
inferred← citeshttps://doi.org/10.1007/978-3-642-13562-0_5openalex-snapshot
The Complexity of Geometric Problems in High Dimension
inferred← citeshttps://doi.org/10.1007/978-3-642-13731-0_32openalex-snapshot
Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing
inferred← citeshttps://doi.org/10.1007/978-3-642-13731-0_7openalex-snapshot
A Bottom-Up Method and Fast Algorithms for max independent set
inferred← citeshttps://doi.org/10.1007/978-3-642-14031-0_18openalex-snapshot
A Note on Vertex Cover in Graphs with Maximum Degree 3
inferred← citeshttps://doi.org/10.1007/978-3-642-14186-7_27openalex-snapshot
On Moderately Exponential Time for SAT
inferred← citeshttps://doi.org/10.1007/978-3-642-15277-1_51openalex-snapshot
Robust Self-stabilizing Construction of Bounded Size Weight-Based Clusters
inferred← citeshttps://doi.org/10.1007/978-3-642-15369-3_13openalex-snapshot
PTAS for Weighted Set Cover on Unit Squares
inferred← citeshttps://doi.org/10.1007/978-3-642-16926-7_17openalex-snapshot
Generalized Graph Clustering: Recognizing (p,q)-Cluster Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-17461-2_31openalex-snapshot
Exact and Parameterized Algorithms for Edge Dominating Set in 3-Degree Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-17493-3_20openalex-snapshot
Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting
inferred← citeshttps://doi.org/10.1007/978-3-642-17493-3_6openalex-snapshot
Enumerate and Measure: Improving Parameter Budget Management
inferred← citeshttps://doi.org/10.1007/978-3-642-17514-5_34openalex-snapshot
Induced Subgraph Isomorphism on Interval and Proper Interval Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-17517-6_33openalex-snapshot
Parameterized Algorithms for Boxicity
inferred← citeshttps://doi.org/10.1007/978-3-642-17517-6_35openalex-snapshot
Combining Two Worlds: Parameterised Approximation for Vertex Cover
inferred← citeshttps://doi.org/10.1007/978-3-642-18381-2_10openalex-snapshot
On Making a Distinguished Vertex Minimum Degree by Vertex Deletion
inferred← citeshttps://doi.org/10.1007/978-3-642-18381-2_29openalex-snapshot
Alternative Parameterizations for Cluster Editing
inferred← citeshttps://doi.org/10.1007/978-3-642-19222-7_1openalex-snapshot
Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes
inferred← citeshttps://doi.org/10.1007/978-3-642-19222-7_34openalex-snapshot
Ranking and Drawing in Subexponential Time
inferred← citeshttps://doi.org/10.1007/978-3-642-19391-0_1openalex-snapshot
Improved Approximations for Hard Optimization Problems via Problem Instance Classification
inferred← citeshttps://doi.org/10.1007/978-3-642-20877-5_8openalex-snapshot
An Improved Kernel for Planar Connected Dominating Set
inferred← citeshttps://doi.org/10.1007/978-3-642-21204-8_14openalex-snapshot
Parameterized Edge Dominating Set in Cubic Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-21527-8_66openalex-snapshot
A Tabu Search Heuristic Based on k-Diamonds for the Weighted Feedback Vertex Set Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-22300-6_24openalex-snapshot
Parameterized Reductions and Algorithms for Another Vertex Cover Generalization
inferred← citeshttps://doi.org/10.1007/978-3-642-22685-4_10openalex-snapshot
Cograph Editing: Complexity and Parameterized Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-22993-0_19openalex-snapshot
Pattern-Guided Data Anonymization and Clustering
inferred← citeshttps://doi.org/10.1007/978-3-642-22993-0_45openalex-snapshot
Conflict Packing Yields Linear Vertex-Kernels for k -FAST, k -dense RTI and a Related Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-22993-0_53openalex-snapshot
Linear Problem Kernels for Planar Graph Problems with Small Distance Property
inferred← citeshttps://doi.org/10.1007/978-3-642-23786-7_25openalex-snapshot
Symmetry Breaking in Numeric Constraint Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-25591-5_51openalex-snapshot
Capacitated Domination: Constant Factor Approximations for Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-25870-1_10openalex-snapshot
Approximability of Economic Equilibrium for Housing Markets with Duplicate Houses
inferred← citeshttps://doi.org/10.1007/978-3-642-25870-1_21openalex-snapshot
Counting Independent Sets in Claw-Free Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-25870-1_24openalex-snapshot
Planar k-Path in Subexponential Time and Polynomial Space
inferred← citeshttps://doi.org/10.1007/978-3-642-27660-6_27openalex-snapshot
Counting Maximal Independent Sets in Subcubic Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-28050-4_14openalex-snapshot
Safe Approximation and Its Relation to Kernelization
inferred← citeshttps://doi.org/10.1007/978-3-642-28050-4_17openalex-snapshot
Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width
inferred← citeshttps://doi.org/10.1007/978-3-642-28050-4_21openalex-snapshot
Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics
inferred← citeshttps://doi.org/10.1007/978-3-642-28332-1_4openalex-snapshot
A Parameterized Complexity Tutorial
inferred← citeshttps://doi.org/10.1007/978-3-642-29116-6_6openalex-snapshot
Parameterized Approximation Algorithms for Hitting Set
inferred← citeshttps://doi.org/10.1007/978-3-642-29116-6_7openalex-snapshot
Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs
inferred← citeshttps://doi.org/10.1007/978-3-642-29344-3_35openalex-snapshot
New Lower Bound on Max Cut of Hypergraphs with an Application to r -Set Splitting
inferred← citeshttps://doi.org/10.1007/978-3-642-30191-9_7openalex-snapshot
Error Propagation in Sparse Linear Systems with Peptide-Protein Incidence Matrices
inferred← citeshttps://doi.org/10.1007/978-3-642-30347-0_19openalex-snapshot
Making Life Easier for Firefighters
inferred← citeshttps://doi.org/10.1007/978-3-642-30891-8_10openalex-snapshot
Kernelization – Preprocessing with a Guarantee
inferred← citeshttps://doi.org/10.1007/978-3-642-30891-8_16openalex-snapshot
Studies in Computational Aspects of Voting
inferred← citeshttps://doi.org/10.1007/978-3-642-30891-8_17openalex-snapshot
A Parameterized Halting Problem
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_2openalex-snapshot
The Birth and Early Years of Parameterized Complexity
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-30891-8_9openalex-snapshot
A Basic Parameterized Complexity Primer
inferred← citeshttps://doi.org/10.1007/978-3-642-31149-9_28openalex-snapshot
Computing #2SAT and #2UNSAT by Binary Patterns
inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_54openalex-snapshot
The Parameterized Complexity of k-Edge Induced Subgraphs
inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_63openalex-snapshot
Parameterized Tractability of Multiway Cut with Parity Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-32241-9_38openalex-snapshot
On the Kernelization Complexity of Problems on Graphs without Long Odd Cycles
inferred← citeshttps://doi.org/10.1007/978-3-642-32589-2_2openalex-snapshot
New Races in Parameterized Algorithmics
inferred← citeshttps://doi.org/10.1007/978-3-642-32589-2_32openalex-snapshot
Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width
inferred← citeshttps://doi.org/10.1007/978-3-642-32589-2_38openalex-snapshot
When Trees Grow Low: Shrubs and Fast MSO1
inferred← citeshttps://doi.org/10.1007/978-3-642-32589-2_44openalex-snapshot
Kernels for Edge Dominating Set: Simpler or Smaller
inferred← citeshttps://doi.org/10.1007/978-3-642-33293-7_14openalex-snapshot
Polynomial Time and Parameterized Approximation Algorithms for Boxicity
inferred← citeshttps://doi.org/10.1007/978-3-642-33293-7_21openalex-snapshot
On Tractable Parameterizations of Graph Isomorphism
inferred← citeshttps://doi.org/10.1007/978-3-642-33293-7_23openalex-snapshot
Finding Dense Subgraphs of Sparse Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-33293-7_4openalex-snapshot
The Exponential Time Hypothesis and the Parameterized Clique Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-35452-6_10openalex-snapshot
Balancing a Complete Signed Graph by Editing Edges and Deleting Nodes
inferred← citeshttps://doi.org/10.1007/978-3-642-35452-6_16openalex-snapshot
On the Min-Max 2-Cluster Editing Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-36046-6_9openalex-snapshot
Fast Algorithm for Rank-Width
inferred← citeshttps://doi.org/10.1007/978-3-642-36065-7_12openalex-snapshot
Exact and Approximation Algorithms for Densest k-Subgraph
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-36065-7_25openalex-snapshot
Improved Fixed-Parameter Algorithm for the Minimum Weight 3-SAT Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-36065-7_26openalex-snapshot
On Directed Tree Realizations of Degree Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-37064-9_25openalex-snapshot
A Multivariate Analysis of Some DFA Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-38233-8_10openalex-snapshot
Exponential Complexity of Satisfiability Testing for Linear-Size Boolean Formulas
inferred← citeshttps://doi.org/10.1007/978-3-642-38236-9_28openalex-snapshot
Linear Vertex-kernels for Several Dense Ranking r -Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-38768-5_10openalex-snapshot
Random Methods for Parameterized Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-38768-5_49openalex-snapshot
An Effective Branching Strategy for Some Parameterized Edge Modification Problems with Multiple Forbidden Induced Subgraphs
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_30openalex-snapshot
Counting Matchings of Size k Is $\sharp$ W[1]-Hard
inferred← citeshttps://doi.org/10.1007/978-3-642-40104-6_18openalex-snapshot
On Explaining Integer Vectors by Few Homogenous Segments
inferred← citeshttps://doi.org/10.1007/978-3-642-40104-6_44openalex-snapshot
Parameterized Enumeration of (Locally-) Optimal Aggregations
inferred← citeshttps://doi.org/10.1007/978-3-642-40313-2_44openalex-snapshot
On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-40313-2_72openalex-snapshot
Parameterized Algorithms for Module Motif
inferred← citeshttps://doi.org/10.1007/978-3-642-45043-3_8openalex-snapshot
On the Parameterized Complexity of Computing Graph Bisections
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_4openalex-snapshot
Consequences of Faster Alignment of Sequences
inferred← citeshttps://doi.org/10.1007/978-3-662-44320-0_19openalex-snapshot
The Firefighter Problem: Application of Hybrid Ant Colony Optimization Algorithms
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/978-3-662-44465-8_25openalex-snapshot
A Reconfigurations Analogue of Brooks’ Theorem
inferred← citeshttps://doi.org/10.1007/978-3-662-44522-8_16openalex-snapshot
Bounded Variable Logic, Parameterized Logarithmic Space, and Savitch’s Theorem
inferred← citeshttps://doi.org/10.1007/978-3-662-44602-7_7openalex-snapshot
Treewidth Computation and Kernelization in the Parallel External Memory Model
inferred← citeshttps://doi.org/10.1007/s00453-007-9147-xopenalex-snapshot
Improved Algorithms and Complexity Results for Power Domination in Graphs
inferred← citeshttps://doi.org/10.1007/s00453-012-9619-5openalex-snapshot
On the (Non-)Existence of Polynomial Kernels for P l -Free Edge Modification Problems
inferred← citeshttps://doi.org/10.1007/s00453-014-9937-xopenalex-snapshot
Incompressibility of $$H$$ H -Free Edge Modification Problems
inferred← citeshttps://doi.org/10.1007/s13369-014-1159-7openalex-snapshot
Maximum Independent Set Approximation Based on Bellman-Ford Algorithm
inferred← citeshttps://doi.org/10.1016/j.asoc.2022.109607openalex-snapshot
Stochastic simulated annealing for directed feedback vertex set
inferred← citeshttps://doi.org/10.1016/j.comgeo.2024.102148openalex-snapshot
Parameterized inapproximability of Morse matching
inferred← citeshttps://doi.org/10.1016/j.cosrev.2011.09.002openalex-snapshot
Confronting intractability via parameters
inferred← citeshttps://doi.org/10.1016/j.dam.2010.01.007openalex-snapshot
On maximum independent sets in P5 -free graphs
inferred← citeshttps://doi.org/10.1016/j.disopt.2013.02.001openalex-snapshot
Two edge modification problems without polynomial kernels
inferred← citeshttps://doi.org/10.1016/j.ejor.2016.05.010openalex-snapshot
On solving manufacturing cell formation via Bicluster Editing
inferred← citeshttps://doi.org/10.1016/j.endm.2012.10.006openalex-snapshot
Hybrid Metaheuristic for Bicluster Editing Problem
inferred← citeshttps://doi.org/10.1016/j.ic.2016.10.004openalex-snapshot
The parameterized complexity of k-edge induced subgraphs
inferred← citeshttps://doi.org/10.1016/j.ic.2017.07.007openalex-snapshot
The complexity of degree anonymization by graph contractions
inferred← citeshttps://doi.org/10.1016/j.jcss.2015.08.003openalex-snapshot
Meta-kernelization with structural parameters
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.05.006openalex-snapshot
Going weighted: Parameterized algorithms for cluster editing
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.10.042openalex-snapshot
Improved deterministic algorithms for weighted matching and packing problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.113864openalex-snapshot
An improved fixed-parameter algorithm for 2-Club Cluster Edge Deletion
inferred← citeshttps://doi.org/10.1063/1.3660379openalex-snapshot
Gröbner bases for finite-temperature quantum computing and their complexity
inferred← citeshttps://doi.org/10.1145/2885499openalex-snapshot
LIMITS and Applications of Group Algebras for Parameterized 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.