On the public citation graph

Polynomial kernels for weighted problems

0 signed · 50 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/jcss.2001.1774openalex-snapshot
Which Problems Have Strongly Exponential Complexity?
inferredcites →https://doi.org/10.1007/978-3-642-32589-2_62openalex-snapshot
Reducing a Target Interval to a Few Exact Queries
inferredcites →https://doi.org/10.1007/978-3-642-39206-1_61openalex-snapshot
Fixed-Parameter Algorithms for Minimum Cost Edge-Connectivity Augmentation
inferredcites →https://doi.org/10.1007/978-3-642-40450-4_55openalex-snapshot
On Polynomial Kernels for Integer Linear Programs: Covering, Packing and Feasibility
inferredcites →https://doi.org/10.1007/bf02579200openalex-snapshot
An application of simultaneous diophantine approximation in combinatorial optimization
inferredcites →https://doi.org/10.1007/s00224-011-9367-yopenalex-snapshot
Parameterizing by the Number of Numbers
inferredcites →https://doi.org/10.1016/0167-6377(89)90049-7openalex-snapshot
On simultaneous approximation in quadratic integer programming
inferredcites →https://doi.org/10.1016/j.jcss.2009.04.001openalex-snapshot
On problems without polynomial kernels
inferredcites →https://doi.org/10.1016/j.jcss.2012.04.004openalex-snapshot
Bin packing with fixed number of bins revisited
inferredcites →https://doi.org/10.1016/j.tcs.2011.04.039openalex-snapshot
Kernel bounds for disjoint cycles and disjoint paths
inferredcites →https://doi.org/10.1109/focs.2006.54openalex-snapshot
On the Compressibility of NP Instances and Cryptographic Applications
inferredcites →https://doi.org/10.1109/focs.2012.71openalex-snapshot
New Limits to Classical and Quantum Instance Compression
inferredcites →https://doi.org/10.1112/jlms/s1-35.1.85openalex-snapshot
Intersection Theorems for Systems of Sets
inferredcites →https://doi.org/10.1137/060668092openalex-snapshot
On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications
inferredcites →https://doi.org/10.1137/120880240openalex-snapshot
Kernelization Lower Bounds by Cross-Composition
inferredcites →https://doi.org/10.1287/moor.12.3.415openalex-snapshot
Minkowski's Convex Body Theorem and Integer Programming
inferredcites →https://doi.org/10.1287/moor.8.4.538openalex-snapshot
Integer Programming with a Fixed Number of Variables
inferredcites →https://doi.org/10.4230/dagrep.2.6.26openalex-snapshot
Data Reduction and Problem Kernels (Dagstuhl Seminar 12241)
inferredcites →https://doi.org/10.48550/arxiv.1208.4225openalex-snapshot
Reducing a Target Interval to a Few Exact Queries

What points at this work

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

inferred← citeshttps://doi.org/10.1002/clen.202300441openalex-snapshot
Which Machine Learning Algorithm Is Best Suited for Estimating Reference Evapotranspiration in Humid Subtropical Climate?
inferred← citeshttps://doi.org/10.1002/net.21904openalex-snapshot
Parameterized algorithms and data reduction for the short secluded s‐t‐path problem
inferred← citeshttps://doi.org/10.1002/net.21985openalex-snapshot
On approximate data reduction for the Rural Postman Problem: Theory and experiments
inferred← citeshttps://doi.org/10.1007/978-3-030-22629-9_20openalex-snapshot
On $$(1+\varepsilon )$$ -approximate Data Reduction for the Rural Postman Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-24766-9_22openalex-snapshot
Kernelization of Graph Hamiltonicity: Proper H-Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-25005-8_8openalex-snapshot
Parameterized Complexity of Min-Power Asymmetric Connectivity
inferred← citeshttps://doi.org/10.1007/978-3-030-86838-3_11openalex-snapshot
Preventing Small $$\mathbf {(s,t)}$$-Cuts by Protecting Edges
inferred← citeshttps://doi.org/10.1007/978-3-030-86838-3_5openalex-snapshot
On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-46826-1_9openalex-snapshot
A Multivariate Complexity Analysis of the Generalized Noah’s Ark Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-49275-4_13openalex-snapshot
Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-92932-8_1openalex-snapshot
Exact and Approximate High-Multiplicity Scheduling on Identical Machines
inferred← citeshttps://doi.org/10.1007/978-3-032-17801-5_14openalex-snapshot
Weighted Food Webs Make Computing Phylogenetic Diversity So Much Harder
inferred← citeshttps://doi.org/10.1007/978-3-319-57586-5_15openalex-snapshot
Parameterized Resiliency Problems via Integer Linear Programming
inferred← citeshttps://doi.org/10.1007/978-981-96-2845-2_7openalex-snapshot
Parameterized Complexity of (d, r)-Domination via Modular Decomposition
inferred← citeshttps://doi.org/10.1007/s00453-021-00822-xopenalex-snapshot
Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs
inferred← citeshttps://doi.org/10.1007/s10951-024-00818-9openalex-snapshot
Serial batching to minimize the weighted number of tardy jobs
inferred← citeshttps://doi.org/10.1016/j.cor.2018.07.020openalex-snapshot
Parameterized complexity of machine scheduling: 15 open problems
inferred← citeshttps://doi.org/10.1016/j.dam.2022.11.018openalex-snapshot
Polynomial-time data reduction for weighted problems beyond additive goal functions
inferred← citeshttps://doi.org/10.1016/j.dam.2024.03.009openalex-snapshot
Parameterized complexity for iterated type partitions and modular-width
inferred← citeshttps://doi.org/10.1016/j.dam.2025.11.037openalex-snapshot
A multivariate complexity analysis of the Generalized Noah’s Ark Problem
inferred← citeshttps://doi.org/10.1016/j.disopt.2026.100944openalex-snapshot
Better and simpler reducibility bounds over the integers
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.12.019openalex-snapshot
Knapsack problems: A parameterized point of view
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.08.002openalex-snapshot
Parameterized resiliency problems
inferred← citeshttps://doi.org/10.1063/5.0165220openalex-snapshot
Yellowness index prediction using locally weighted kernel partial least square regression model
inferred← citeshttps://doi.org/10.1109/access.2019.2924542openalex-snapshot
Using Low-Rank Approximations to Speed Up Kernel Logistic Regression Algorithm
inferred← citeshttps://doi.org/10.1137/19m1299001openalex-snapshot
Kernelization of Graph Hamiltonicity: Proper $H$-Graphs
inferred← citeshttps://doi.org/10.1137/22m1478112openalex-snapshot
A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics
inferred← citeshttps://doi.org/10.1145/3765285openalex-snapshot
Packing Short Cycles
inferred← citeshttps://doi.org/10.15480/882.4134openalex-snapshot
Single Machine Batch Scheduling to Minimize the Weighted Number of Tardy Jobs
inferred← citeshttps://doi.org/10.3390/a10010024openalex-snapshot
Problems on Finite Automata and the Exponential Time Hypothesis
inferred← citeshttps://doi.org/10.48550/arxiv.1611.07724openalex-snapshot
Knapsack Problems: A Parameterized Point of View
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.