On the public citation graph
Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems
0 signed · 69 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.1006/jagm.2001.1186openalex-snapshot
Vertex Cover: Further Observations and Further Improvements
inferredcites →https://doi.org/10.1006/jctb.1995.1006openalex-snapshot
Graph Minors .XIII. The Disjoint Paths Problem
inferredcites →https://doi.org/10.1016/0196-6774(91)90006-kopenalex-snapshot
Easy problems for tree-decomposable graphs
inferredcites →https://doi.org/10.1016/0890-5401(90)90043-hopenalex-snapshot
The monadic second-order logic of graphs. I. Recognizable sets of finite graphs
inferredcites →https://doi.org/10.1016/s1571-0661(04)00301-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1017/s0960129500070079openalex-snapshot
Linear time computable problems and first-order descriptions
inferredcites →https://doi.org/10.1093/comjnl/bxm086openalex-snapshot
Parameterized Complexity of Cardinality Constrained Optimization Problems
inferredcites →https://doi.org/10.1109/sfcs.1995.492475openalex-snapshot
Splitters and near-optimal derandomization
inferredcites →https://doi.org/10.1137/0219054openalex-snapshot
The Spatial Complexity of Oblivious k -Probe Hash Functions
inferredcites →https://doi.org/10.1137/s0097539793251219openalex-snapshot
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
inferredcites →https://doi.org/10.1145/504794.504798openalex-snapshot
Deciding first-order properties of locally tree-decomposable structures
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11940128_60openalex-snapshot
Intuitive Algorithms and t-Vertex Cover
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-4939-6613-4_20openalex-snapshot
Parameterized Algorithmics for Finding Exact Solutions of NP-Hard Biological Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-03898-8_17openalex-snapshot
On the Ordered List Subgraph Embedding Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-03898-8_7openalex-snapshot
Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization
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-12340-0_32openalex-snapshot
Parameterized Algorithms for Graph Partitioning Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-13524-3_17openalex-snapshot
Editing to a Graph of Given Degrees
inferred← citeshttps://doi.org/10.1007/978-3-319-17142-5_23openalex-snapshot
The Complexity of Degree Anonymization by Graph Contractions
inferred← citeshttps://doi.org/10.1007/978-3-319-34171-2_13openalex-snapshot
Graph Editing to a Given Degree Sequence
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-73545-8_39openalex-snapshot
Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs
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-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-92248-3_22openalex-snapshot
Improved Upper Bounds for Partial Vertex Cover
inferred← citeshttps://doi.org/10.1007/978-3-540-92248-3_26openalex-snapshot
Parameterized Graph Cleaning Problems
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-13073-1_9openalex-snapshot
Parameterized Complexity of Even/Odd Subgraph Problems
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_36openalex-snapshot
Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time
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-33293-7_23openalex-snapshot
Finding Dense Subgraphs of Sparse Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-38768-5_48openalex-snapshot
Parameterized Approximability of Maximizing the Spread of Influence in Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-40313-2_38openalex-snapshot
On the Parameterized Complexity of Cutting a Few Vertices from a Graph
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-49529-2_51openalex-snapshot
$$(k,n-k)$$ ( k , n - k ) -Max-Cut: An $${\mathcal O}^*(2^p)$$ O ∗ ( 2 p ) -Time Algorithm and a Polynomial Kernel
inferred← citeshttps://doi.org/10.1007/978-3-662-55751-8_28openalex-snapshot
Listing All Fixed-Length Simple Cycles in Sparse Graphs in Optimal Time
inferred← citeshttps://doi.org/10.1007/978-981-92-3309-0_13openalex-snapshot
Parameterized Complexity of Odd Domination and its Generalization
inferred← citeshttps://doi.org/10.1007/s00224-011-9381-0openalex-snapshot
Parameterized Random Complexity
inferred← citeshttps://doi.org/10.1007/s00224-016-9706-0openalex-snapshot
Parameterized Algorithms for Graph Partitioning Problems
inferred← citeshttps://doi.org/10.1007/s00224-016-9717-xopenalex-snapshot
Parameterized Complexity of Secluded Connectivity Problems
inferred← citeshttps://doi.org/10.1007/s00453-007-9008-7openalex-snapshot
Algorithm Engineering for Color-Coding with Applications to Signaling Pathway Detection
inferred← citeshttps://doi.org/10.1007/s00453-008-9204-0openalex-snapshot
Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs
inferred← citeshttps://doi.org/10.1007/s00453-008-9225-8openalex-snapshot
Homogeneous String Segmentation using Trees and Weighted Independent Sets
inferred← citeshttps://doi.org/10.1007/s00453-015-9980-2openalex-snapshot
On the Ordered List Subgraph Embedding Problems
inferred← citeshttps://doi.org/10.1007/s00453-018-0418-5openalex-snapshot
$$(k,n-k)$$ ( k , n - k ) -Max-Cut: An $$\mathcal{O}^*(2^p)$$ O ∗ ( 2 p ) -Time Algorithm and a Polynomial Kernel
inferred← citeshttps://doi.org/10.1007/s00453-020-00684-9openalex-snapshot
Parameterized Aspects of Strong Subgraph Closure
inferred← citeshttps://doi.org/10.1007/s00453-020-00720-8openalex-snapshot
Parameterized Leaf Power Recognition via Embedding into Graph Products
inferred← citeshttps://doi.org/10.1007/s00453-020-00730-6openalex-snapshot
Parameterized Complexity of Independent Set in H-Free Graphs
inferred← citeshttps://doi.org/10.1007/s00453-021-00911-xopenalex-snapshot
Parameterized Complexity of Directed Spanner Problems
inferred← citeshttps://doi.org/10.1007/s00453-022-01001-2openalex-snapshot
Grundy Coloring and Friends, Half-Graphs, Bicliques
inferred← citeshttps://doi.org/10.1007/s11432-021-3334-1openalex-snapshot
Quantum algorithm and experimental demonstration for the subset sum problem
inferred← citeshttps://doi.org/10.1016/j.disopt.2018.05.002openalex-snapshot
The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.09.013openalex-snapshot
Parameterized and approximation complexity of Partial VC Dimension
inferred← citeshttps://doi.org/10.1109/access.2019.2939161openalex-snapshot
An Approximate Quadratic Programming for Efficient Bellman Equation Solution
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470540openalex-snapshot
Parameterized Complexity of Elimination Distance to First-Order Logic Properties
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch141openalex-snapshot
Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes
inferred← citeshttps://doi.org/10.1142/s0129054120500069openalex-snapshot
Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree
inferred← citeshttps://doi.org/10.1145/2543629openalex-snapshot
Listing All Maximal Cliques in Large Sparse Real-World Graphs
inferred← citeshttps://doi.org/10.1145/3329863openalex-snapshot
Faster Pseudopolynomial Time Algorithms for Subset Sum
inferred← citeshttps://doi.org/10.1145/3355629openalex-snapshot
Spanning Circuits in Regular Matroids
inferred← citeshttps://doi.org/10.1145/3395037openalex-snapshot
Dynamic Parameterized Problems and Algorithms
inferred← citeshttps://doi.org/10.1145/3517129openalex-snapshot
Parameterized Complexity of Elimination Distance to First-Order Logic Properties
inferred← citeshttps://doi.org/10.3390/a11020020openalex-snapshot
Vertex Cover Reconfiguration and Beyond
inferred← citeshttps://doi.org/10.70675/114cd144z3d78z4885za9d0zfe7861dddfd1openalex-snapshot
Algorithms for elementary path problem : application to kidney exchange
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.