On the public citation graph
Improved Parameterized Upper Bounds for Vertex Cover
0 signed · 153 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.1002/1097-0037(200007)35:4<253::aid-net3>3.0.co;2-kopenalex-snapshot
Improvement on vertex cover for low-degree graphs
inferredcites →https://doi.org/10.1006/jagm.2001.1186openalex-snapshot
Vertex Cover: Further Observations and Further Improvements
inferredcites →https://doi.org/10.1006/jcss.2001.1774openalex-snapshot
Which Problems Have Strongly Exponential Complexity?
inferredcites →https://doi.org/10.1007/3-540-49116-3_53openalex-snapshot
Upper Bounds for Vertex Cover Further Improved
inferredcites →https://doi.org/10.1007/978-3-540-28639-4_6openalex-snapshot
Refined Memorisation for Vertex Cover
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/bf01580444openalex-snapshot
Vertex packings: Structural properties and algorithms
inferredcites →https://doi.org/10.1016/0196-6774(86)90032-5openalex-snapshot
Algorithms for maximum independent sets
inferredcites →https://doi.org/10.1016/j.dam.2007.03.026openalex-snapshot
Crown reductions for the Minimum Weighted Vertex Cover problem
inferredcites →https://doi.org/10.1016/s0020-0190(97)00213-5openalex-snapshot
An improved fixed-parameter algorithm for vertex cover
inferredcites →https://doi.org/10.1016/s0022-0000(03)00074-6openalex-snapshot
On the existence of subexponential parameterized algorithms
inferredcites →https://doi.org/10.1016/s0022-0000(03)00075-8openalex-snapshot
Solving large FPT problems on coarse-grained parallel machines
inferredcites →https://doi.org/10.1016/s0196-6774(03)00005-1openalex-snapshot
On efficient fixed-parameter algorithms for weighted vertex cover
inferredcites →https://doi.org/10.1016/s0304-0208(08)72955-4openalex-snapshot
Pseudo-Boolean Functions and Stability of Graphs
inferredcites →https://doi.org/10.1016/s0304-0208(08)73101-3openalex-snapshot
A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem
inferredcites →https://doi.org/10.1016/s0304-0208(13)73561-8openalex-snapshot
Annals of Discrete Mathematics
inferredcites →https://doi.org/10.1016/s1571-0661(04)00301-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.3929/ethz-a-006653305openalex-snapshot
An improved fixed parameter tractable algorithm for vertex cover
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
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/978-1-4614-1168-0_13openalex-snapshot
Multivariate Complexity Theory
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_462openalex-snapshot
Vertex Cover Search Trees
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-39033-4_9openalex-snapshot
A Survey on Ant Colony Optimization for Solving Some of the Selected NP-Hard Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-58150-3_50openalex-snapshot
Parameterized Complexity of Maximum Edge Colorable Subgraph
inferred← citeshttps://doi.org/10.1007/978-3-030-86593-1_15openalex-snapshot
Parameterized Complexity of Finding Subgraphs with Hereditary Properties on Hereditary Graph Classes
inferred← citeshttps://doi.org/10.1007/978-3-030-92708-0_9openalex-snapshot
A Simplified and Effective Solution for Hybrid SDN Network Deployment
inferred← citeshttps://doi.org/10.1007/978-3-031-38906-1_7openalex-snapshot
A Parameterized Approximation Scheme for Generalized Partial Vertex Cover
inferred← citeshttps://doi.org/10.1007/978-3-031-82670-2_6openalex-snapshot
Parameterized Complexity of Generalizations of Edge Dominating Set
inferred← citeshttps://doi.org/10.1007/978-3-319-08783-2_16openalex-snapshot
Vertex Cover Gets Faster and Harder on Low Degree Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-21275-3_14openalex-snapshot
Lower Bounds Based on the Exponential-Time Hypothesis
inferred← citeshttps://doi.org/10.1007/978-3-319-33954-2_28openalex-snapshot
A New Solver for the Minimum Weighted Vertex Cover Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-44953-1_10openalex-snapshot
Propagation via Kernelization: The Vertex Cover Constraint
inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_29openalex-snapshot
The Union of Minimal Hitting Sets: Parameterized Combinatorial Bounds and Counting
inferred← citeshttps://doi.org/10.1007/978-3-540-72788-0_23openalex-snapshot
Backdoor Sets of Quantified Boolean Formulas
inferred← citeshttps://doi.org/10.1007/978-3-540-73001-9_28openalex-snapshot
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
inferred← citeshttps://doi.org/10.1007/978-3-540-74742-0_16openalex-snapshot
Distributed Memorization for the k -Vertex Cover Problem
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-78773-0_61openalex-snapshot
Fixed-Parameter Algorithms for Cluster Vertex Deletion
inferred← citeshttps://doi.org/10.1007/978-3-540-79723-4_9openalex-snapshot
Capacitated Domination and Covering: A Parameterized Perspective
inferred← citeshttps://doi.org/10.1007/978-3-540-85097-7_11openalex-snapshot
Parameterized Algorithms for Generalized Domination
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-02017-9_20openalex-snapshot
On Parameterized Exponential Time Complexity
inferred← citeshttps://doi.org/10.1007/978-3-642-03409-1_9openalex-snapshot
Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity
inferred← citeshttps://doi.org/10.1007/978-3-642-04500-4_6openalex-snapshot
Fest-Parameter-Algorithmen für ausgewählte Graphenprobleme
inferred← citeshttps://doi.org/10.1007/978-3-642-11269-0_10openalex-snapshot
What Makes Equitable Connected Partition Easy
inferred← citeshttps://doi.org/10.1007/978-3-642-13073-1_18openalex-snapshot
Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights
inferred← citeshttps://doi.org/10.1007/978-3-642-14031-0openalex-snapshot
Computing and Combinatorics
inferred← citeshttps://doi.org/10.1007/978-3-642-14031-0_6openalex-snapshot
The Curse of Connectivity: t-Total Vertex (Edge) Cover
inferred← citeshttps://doi.org/10.1007/978-3-642-14866-8_3openalex-snapshot
Chapter 3. Selected Design Issues
inferred← citeshttps://doi.org/10.1007/978-3-642-14866-8_5openalex-snapshot
Chapter 5. Realistic Computer Models
inferred← citeshttps://doi.org/10.1007/978-3-642-15155-2_48openalex-snapshot
Solving minones-2-sat as Fast as vertex cover
inferred← citeshttps://doi.org/10.1007/978-3-642-15775-2_47openalex-snapshot
Algorithmic Meta-theorems for Restrictions of Treewidth
inferred← citeshttps://doi.org/10.1007/978-3-642-17493-3_22openalex-snapshot
Proper Interval Vertex Deletion
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-19754-3_17openalex-snapshot
3-hitting set on Bounded Degree Hypergraphs: Upper and Lower Bounds on the Kernel Size
inferred← citeshttps://doi.org/10.1007/978-3-642-23719-5_32openalex-snapshot
Isomorphism of (mis)Labeled Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-30642-6_16openalex-snapshot
Finding Vertex-Surjective Graph Homomorphisms
inferred← citeshttps://doi.org/10.1007/978-3-642-30891-8_5openalex-snapshot
The Impact of Parameterized Complexity to Interdisciplinary Problem Solving
inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_30openalex-snapshot
Parameterized Approximation via Fidelity Preserving Transformations
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-81-322-2126-5_2openalex-snapshot
Vertex Cover Problem—Revised Approximation Algorithm
inferred← citeshttps://doi.org/10.1007/s00037-010-0001-1openalex-snapshot
Parameterized Proof Complexity
inferred← citeshttps://doi.org/10.1007/s00224-007-1309-3openalex-snapshot
Parameterized Complexity of Vertex Cover Variants
inferred← citeshttps://doi.org/10.1007/s00224-008-9150-xopenalex-snapshot
Fixed-Parameter Algorithms for Cluster Vertex Deletion
inferred← citeshttps://doi.org/10.1007/s00224-009-9167-9openalex-snapshot
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
inferred← citeshttps://doi.org/10.1007/s00236-007-0056-xopenalex-snapshot
Solving #SAT using vertex covers
inferred← citeshttps://doi.org/10.1007/s00236-012-0164-0openalex-snapshot
Finding vertex-surjective graph homomorphisms
inferred← citeshttps://doi.org/10.1007/s00236-025-00498-8openalex-snapshot
Parameterized lower bounds for the weighted vertex cover problem in trees
inferred← citeshttps://doi.org/10.1007/s00453-008-9199-6openalex-snapshot
A Top-Down Approach to Search-Trees: Improved Algorithmics for 3-Hitting Set
inferred← citeshttps://doi.org/10.1007/s00453-008-9223-xopenalex-snapshot
Fixed-Parameter Approximation: Conceptual Framework and Approximability Results
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-011-9554-xopenalex-snapshot
Algorithmic Meta-theorems for Restrictions of Treewidth
inferred← citeshttps://doi.org/10.1007/s00453-012-9660-4openalex-snapshot
Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem
inferred← citeshttps://doi.org/10.1007/s00453-012-9661-3openalex-snapshot
Proper Interval Vertex Deletion
inferred← citeshttps://doi.org/10.1007/s00453-022-01003-0openalex-snapshot
Parameterized Complexity of Maximum Edge Colorable Subgraph
inferred← citeshttps://doi.org/10.1007/s10817-008-9114-5openalex-snapshot
Backdoor Sets of Quantified Boolean Formulas
inferred← citeshttps://doi.org/10.1007/s10878-015-9909-3openalex-snapshot
Multi-start iterated tabu search for the minimum weight vertex cover problem
inferred← citeshttps://doi.org/10.1007/s11432-013-4845-2openalex-snapshot
On the parameterized vertex cover problem for graphs with perfect matching
inferred← citeshttps://doi.org/10.1016/j.artint.2014.12.001openalex-snapshot
Backdoors to tractable answer set programming
inferred← citeshttps://doi.org/10.1016/j.asoc.2011.05.023openalex-snapshot
An ant colony optimization algorithm with improved pheromone correction strategy for the minimum weight vertex cover problem
inferred← citeshttps://doi.org/10.1016/j.comnet.2025.111254openalex-snapshot
A demand aware services placement model in Pervasive Edge Computing
inferred← citeshttps://doi.org/10.1016/j.dam.2021.05.021openalex-snapshot
Revising Johnson’s table for the 21st century
inferred← citeshttps://doi.org/10.1016/j.dam.2023.12.012openalex-snapshot
Safe sets and in-dominating sets in digraphs
inferred← citeshttps://doi.org/10.1016/j.disopt.2010.02.006openalex-snapshot
Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover
inferred← citeshttps://doi.org/10.1016/j.ic.2013.11.006openalex-snapshot
Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2009.05.003openalex-snapshot
Exponential-time approximation of weighted set cover
inferred← citeshttps://doi.org/10.1016/j.ipl.2010.05.029openalex-snapshot
Parameterized algorithm for eternal vertex cover
inferred← citeshttps://doi.org/10.1016/j.jcss.2010.12.002openalex-snapshot
Implicit branching and parameterized partial cover problems
inferred← citeshttps://doi.org/10.1016/j.jcss.2011.10.003openalex-snapshot
Local search: Is brute-force avoidable?
inferred← citeshttps://doi.org/10.1016/j.jcss.2025.103682openalex-snapshot
Complexity framework for forbidden subgraphs IV: The Steiner Forest problem
inferred← citeshttps://doi.org/10.1016/j.jda.2005.07.005openalex-snapshot
Exact algorithms and applications for Tree-like Weighted Set Cover
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.procs.2012.04.080openalex-snapshot
A Simple NOVCA: Near Optimal Vertex Cover Algorithm
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.03.006openalex-snapshot
On parameterized exponential time complexity
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.07.003openalex-snapshot
Parameterized learnability of juntas
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.11.012openalex-snapshot
Iterative compression and exact algorithms
inferred← citeshttps://doi.org/10.1038/s44335-024-00015-zopenalex-snapshot
Computing with oscillators from theoretical underpinnings to applications and demonstrators
inferred← citeshttps://doi.org/10.1080/00207160903176868openalex-snapshot
Parameterized algorithmics for d-H itting S et
inferred← citeshttps://doi.org/10.1080/01605682.2019.1621218openalex-snapshot
NuMWVC: A novel local search for minimum weighted vertex cover problem
inferred← citeshttps://doi.org/10.1093/comjnl/bxm040openalex-snapshot
Techniques for Practical Fixed-Parameter Algorithms
inferred← citeshttps://doi.org/10.1093/comjnl/bxm056openalex-snapshot
Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems
inferred← citeshttps://doi.org/10.1093/comjnl/bxm086openalex-snapshot
Parameterized Complexity of Cardinality Constrained Optimization Problems
inferred← citeshttps://doi.org/10.1093/comjnl/bxm111openalex-snapshot
The Computer Journal Special Issue on Parameterized Complexity: Foreword by the Guest Editors
inferred← citeshttps://doi.org/10.1109/access.2020.3004964openalex-snapshot
Learning Combinatorial Optimization on Graphs: A Survey With Applications to Networking
inferred← citeshttps://doi.org/10.1109/access.2021.3051741openalex-snapshot
A Fast and Robust Heuristic Algorithm for the Minimum Weight Vertex Cover Problem
inferred← citeshttps://doi.org/10.1109/aiccsa.2007.370907openalex-snapshot
The Maximum Common Subgraph Problem: Faster Solutions via Vertex Cover
inferred← citeshttps://doi.org/10.1109/ctc.2013.12openalex-snapshot
Measuring Surveillance in Online Advertising: A Big Data Approach
inferred← citeshttps://doi.org/10.1109/focs.2007.52openalex-snapshot
Minimizing Average Flow-time : Upper and Lower Bounds
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00050openalex-snapshot
Assessing the Existence of a Function in a Dataset with the g3 Indicator
inferred← citeshttps://doi.org/10.1109/ijcbs.2009.121openalex-snapshot
Parameterized Complexity of Finding Elementary Modes in Metabolic Networks
inferred← citeshttps://doi.org/10.1109/tcbb.2013.128openalex-snapshot
Evolution and Controllability of Cancer Networks: A Boolean Perspective
inferred← citeshttps://doi.org/10.1109/tim.2018.2849433openalex-snapshot
An Efficient and Accurate Link Latency Monitoring Method for Low-Latency Software-Defined Networks
inferred← citeshttps://doi.org/10.1109/tnnls.2024.3495836openalex-snapshot
Vertex Cover of Networks and Its Related Optimization Problems: An Overview
inferred← citeshttps://doi.org/10.1137/050646354openalex-snapshot
Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size
inferred← citeshttps://doi.org/10.1142/9789812771667_0001openalex-snapshot
Fixed-Parameter Algorithms for Graph-Modeled Data Clustering
inferred← citeshttps://doi.org/10.1142/s0129054115500318openalex-snapshot
Complement, Complexity, and Symmetric Representation
inferred← citeshttps://doi.org/10.1145/1569901.1569943openalex-snapshot
Fixed-parameter evolutionary algorithms and the vertex cover problem
inferred← citeshttps://doi.org/10.1145/2818646openalex-snapshot
Backdoors to Normality for Disjunctive Logic Programs
inferred← citeshttps://doi.org/10.1145/3696451openalex-snapshot
Compound Logics for Modification Problems
inferred← citeshttps://doi.org/10.1186/s13673-020-00226-wopenalex-snapshot
Parameterized algorithms of fundamental NP-hard problems: a survey
inferred← citeshttps://doi.org/10.1287/educ.2025.0288openalex-snapshot
Five Starter Problems: Solving Quadratic Unconstrained Binary Optimization Models on Quantum Computers
inferred← citeshttps://doi.org/10.1515/gmj-2021-2090openalex-snapshot
On the induced matching problem in hamiltonian bipartite graphs
inferred← citeshttps://doi.org/10.1609/aaai.v27i1.8624openalex-snapshot
Backdoors to Normality for Disjunctive Logic Programs
inferred← citeshttps://doi.org/10.1609/aaai.v36i9.21167openalex-snapshot
Practical Fixed-Parameter Algorithms for Defending Active Directory Style Attack Graphs
inferred← citeshttps://doi.org/10.22028/d291-26018openalex-snapshot
Kernelization of generic problems : upper and lower bounds
inferred← citeshttps://doi.org/10.2316/p.2013.795-049openalex-snapshot
On the Relative Significance of Kernelization versus Branching for Parallel FPT Implementations
inferred← citeshttps://doi.org/10.24963/ijcai.2017/81openalex-snapshot
On the Kernelization of Global Constraints
inferred← citeshttps://doi.org/10.25904/1912/1694openalex-snapshot
The NP-Hardness of Covering Points with Lines, Paths and Tours and their Tractability with FPT-Algorithms
inferred← citeshttps://doi.org/10.3233/978-1-58603-929-5-425openalex-snapshot
Fixed-Parameter Tractability
inferred← citeshttps://doi.org/10.3384/diss.diva-136280openalex-snapshot
Computational Complexity of some Optimization Problems in Planning
inferred← citeshttps://doi.org/10.3390/a13060146openalex-snapshot
A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2008.1736openalex-snapshot
Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract)
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2010.2495openalex-snapshot
Reflections on Multivariate Algorithmics and Problem Parameterization
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2011.177openalex-snapshot
Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter
inferred← citeshttps://doi.org/10.48550/arxiv.0802.1722openalex-snapshot
Parameterized Algorithms for Partial Cover Problems
inferred← citeshttps://doi.org/10.48550/arxiv.0810.4934openalex-snapshot
Exponential-Time Approximation of Hard Problems
inferred← citeshttps://doi.org/10.48550/arxiv.0910.0582openalex-snapshot
Algorithmic Meta-Theorems for Graphs of Bounded Vertex Cover
inferred← citeshttps://doi.org/10.48550/arxiv.1001.0821openalex-snapshot
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1104.2788openalex-snapshot
Backdoors to Tractable Answer-Set Programming
inferred← citeshttps://doi.org/10.48550/arxiv.1301.1391openalex-snapshot
Backdoors to Normality for Disjunctive Logic Programs
inferred← citeshttps://doi.org/10.48550/arxiv.1404.5566openalex-snapshot
Vertex Cover Gets Faster and Harder on Low Degree Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1510.07188openalex-snapshot
On the Dominating Set Problem in Random Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2003.10698openalex-snapshot
Parameterized Algorithms for Red-Blue Weighted Vertex Cover on Trees
inferred← citeshttps://doi.org/10.5591/978-1-57735-516-8/ijcai11-150openalex-snapshot
Backdoors to tractable answer-set programming
inferred← citeshttps://doi.org/10.6088/ijacit.12.14003openalex-snapshot
Vertex cover using approximation approach
inferred← citeshttps://doi.org/10.70675/1216b4b1zd441z4267z9465z610d85657e27openalex-snapshot
On various graph coloring problems
inferred← citeshttps://doi.org/10.70675/4e7c000ez56eaz4b5bza55ezfaf097f06815openalex-snapshot
Domain knowledge and functions in data science, application to hydroelectricity production
inferred← citeshttps://doi.org/10.70675/590b759bz2692z4c7az8269zc41deeabe325openalex-snapshot
Combinatorial Techniques for Parameterized Algorithms and Kernels, with Applications to Multicut.
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.