On the public citation graph
Local search: Is brute-force avoidable?
0 signed · 110 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/11821069_21openalex-snapshot
Improved Parameterized Upper Bounds for Vertex Cover
inferredcites →https://doi.org/10.1007/3-540-29953-xopenalex-snapshot
Parameterized Complexity Theory
inferredcites →https://doi.org/10.1007/3-540-60618-1_74openalex-snapshot
Non-oblivious local search for graph and hypergraph coloring problems
inferredcites →https://doi.org/10.1007/978-3-540-35854-1openalex-snapshot
Theoretical Aspects of Local Search
inferredcites →https://doi.org/10.1007/978-3-540-70575-8_54openalex-snapshot
On the Hardness of Losing Weight
inferredcites →https://doi.org/10.1007/s004530010020openalex-snapshot
Diameter and Treewidth in Minor-Closed Graph Families
inferredcites →https://doi.org/10.1007/s00493-003-0037-9openalex-snapshot
Local Tree-Width, Excluded Minors, and Approximation Algorithms
inferredcites →https://doi.org/10.1007/s00493-008-2140-4openalex-snapshot
Linearity of grid minors in treewidth with applications through bidimensionality
inferredcites →https://doi.org/10.1016/0022-0000(88)90046-3openalex-snapshot
How easy is local search?
inferredcites →https://doi.org/10.1016/0095-8956(86)90030-4openalex-snapshot
Graph minors. V. Excluding a planar graph
inferredcites →https://doi.org/10.1016/0095-8956(91)90061-nopenalex-snapshot
Graph minors. X. Obstructions to tree-decomposition
inferredcites →https://doi.org/10.1016/j.cosrev.2007.09.001openalex-snapshot
Invitation to fixed-parameter algorithms
inferredcites →https://doi.org/10.1016/j.dam.2007.08.013openalex-snapshot
Planar graph bipartization in linear time
inferredcites →https://doi.org/10.1016/j.disopt.2010.07.003openalex-snapshot
The parameterized complexity of k -flip local search for SAT and MAX SAT
inferredcites →https://doi.org/10.1016/j.jcss.2011.10.003openalex-snapshot
Local search: Is brute-force avoidable?
inferredcites →https://doi.org/10.1016/j.orl.2007.02.008openalex-snapshot
Searching the k-change neighborhood for TSP is W[1]-hard
inferredcites →https://doi.org/10.1016/j.tcs.2010.06.026openalex-snapshot
Improved upper bounds for vertex cover
inferredcites →https://doi.org/10.1016/s0095-8956(03)00042-xopenalex-snapshot
Graph Minors. XVI. Excluding a non-planar graph
inferredcites →https://doi.org/10.1016/s0304-3975(01)00414-5openalex-snapshot
Parameterized complexity of finding subgraphs with hereditary properties
inferredcites →https://doi.org/10.1016/s0304-3975(97)00228-4openalex-snapshot
A partial k-arboretum of graphs with bounded treewidth
inferredcites →https://doi.org/10.1016/s1571-0661(04)00301-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1093/acprof:oso/9780198566076.001.0001openalex-snapshot
Invitation to Fixed-Parameter Algorithms
inferredcites →https://doi.org/10.1093/acprof:oso/9780198566076.003.0013openalex-snapshot
PARAMETERIZED COMPLEXITY THEORY
inferredcites →https://doi.org/10.1109/sfcs.2005.14openalex-snapshot
Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring
inferredcites →https://doi.org/10.1109/tassp.1984.1164450openalex-snapshot
Combinatorial optimization:Algorithms and complexity
inferredcites →https://doi.org/10.1137/0206005openalex-snapshot
On the Complexity of Local Search for the Traveling Salesman Problem
inferredcites →https://doi.org/10.1137/0329008openalex-snapshot
Note on the Convergence of Simulated Annealing Algorithms
inferredcites →https://doi.org/10.1137/05064299xopenalex-snapshot
Improved Approximation Algorithms for Minimum Weight Vertex Separators
inferredcites →https://doi.org/10.1137/s009753970139567xopenalex-snapshot
Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs
inferredcites →https://doi.org/10.1137/s0097539795286612openalex-snapshot
On Syntactic versus Computational Views of Approximability
inferredcites →https://doi.org/10.1137/s0097539799363359openalex-snapshot
On Local Search and Placement of Meters in Networks
inferredcites →https://doi.org/10.1145/1077464.1077468openalex-snapshot
Fixed-parameter algorithms for ( k , r )-center in planar graphs and map graphs
inferredcites →https://doi.org/10.1145/1101821.1101823openalex-snapshot
Subexponential parameterized algorithms on bounded-genus graphs and H -minor-free graphs
inferredcites →https://doi.org/10.1145/335305.335397openalex-snapshot
A constant factor approximation algorithm for a class of classification problems
inferredcites →https://doi.org/10.1287/opre.21.2.498openalex-snapshot
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
inferredcites →https://doi.org/10.1287/opre.6.6.791openalex-snapshot
A Method for Solving Traveling-Salesman Problems
inferredcites →https://doi.org/10.1515/9780691187563openalex-snapshot
Local Search in Combinatorial Optimization
inferredcites →https://doi.org/10.1609/aaai.v24i1.7557openalex-snapshot
Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments
inferredcites →https://doi.org/10.2307/2322374openalex-snapshot
Combinatorial Optimization: Algorithms and Complexity.
inferredcites →https://doi.org/10.2307/j.ctv346t9copenalex-snapshot
Local Search in Combinatorial Optimization
inferredcites →https://doi.org/10.5555/982792.982919openalex-snapshot
Equivalence of local treewidth and linear local treewidth and its algorithmic applications
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4614-1168-0_13openalex-snapshot
Multivariate Complexity Theory
inferred← citeshttps://doi.org/10.1007/978-3-030-42071-0_9openalex-snapshot
Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths
inferred← citeshttps://doi.org/10.1007/978-3-030-75242-2_25openalex-snapshot
Can Local Optimality Be Used for Efficient Data Reduction?
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-13075-0_36openalex-snapshot
Vertex Cover Reconfiguration and Beyond
inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_54openalex-snapshot
On the Hardness of Losing Weight
inferred← citeshttps://doi.org/10.1007/978-3-642-11269-0_25openalex-snapshot
Stable Assignment with Couples: Parameterized Complexity and Local Search
inferred← citeshttps://doi.org/10.1007/978-3-642-13562-0_24openalex-snapshot
Incremental List Coloring of Graphs, Parameterized by Conservation
inferred← citeshttps://doi.org/10.1007/978-3-642-25591-5_63openalex-snapshot
The Parameterized Complexity of Local Search for TSP, More Refined
inferred← citeshttps://doi.org/10.1007/978-3-642-25591-5_64openalex-snapshot
On the Parameterized Complexity of Consensus Clustering
inferred← citeshttps://doi.org/10.1007/978-3-642-28050-4_16openalex-snapshot
Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-31585-5_47openalex-snapshot
Minimizing Rosenthal Potential in Multicast Games
inferred← citeshttps://doi.org/10.1007/978-3-642-38905-4_14openalex-snapshot
Local Search for String Problems: Brute Force Is Essentially Optimal
inferred← citeshttps://doi.org/10.1007/978-3-662-53174-7_1openalex-snapshot
Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics
inferred← citeshttps://doi.org/10.1007/s00224-014-9573-5openalex-snapshot
Minimizing Rosenthal Potential in Multicast Games
inferred← citeshttps://doi.org/10.1007/s00224-024-10205-8openalex-snapshot
Can Local Optimality Be Used for Efficient Data Reduction?
inferred← citeshttps://doi.org/10.1007/s00453-012-9685-8openalex-snapshot
The Parameterized Complexity of Local Search for TSP, More Refined
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-020-00746-yopenalex-snapshot
Parameterized Dynamic Cluster Editing
inferred← citeshttps://doi.org/10.1007/s10479-026-07426-0openalex-snapshot
Parameterized Local Search for Max c-Cut
inferred← citeshttps://doi.org/10.1007/s10694-025-01859-yopenalex-snapshot
A Method to Identify Wildfire Ignition Points and Propagation Durations from Burn Scars Using Genetic Algorithms
inferred← citeshttps://doi.org/10.1007/s10845-022-01935-yopenalex-snapshot
Nature inspired algorithms for the solution of inverse heat transfer problems applied to distinct unsteady heat flux orientations in cylindrical castings
inferred← citeshttps://doi.org/10.1007/s10878-018-0342-2openalex-snapshot
On the complexity of restoring corrupted colorings
inferred← citeshttps://doi.org/10.1016/j.artint.2011.03.003openalex-snapshot
Local search with edge weighting and configuration checking heuristics for minimum vertex cover
inferred← citeshttps://doi.org/10.1016/j.cma.2020.113217openalex-snapshot
Data-driven inverse modelling through neural network (deep learning) and computational heat transfer
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2015.01.009openalex-snapshot
A review of metaheuristics in robotics
inferred← citeshttps://doi.org/10.1016/j.disopt.2010.07.003openalex-snapshot
The parameterized complexity of k -flip local search for SAT and MAX SAT
inferred← citeshttps://doi.org/10.1016/j.disopt.2010.07.004openalex-snapshot
Stable assignment with couples: Parameterized complexity and local search
inferred← citeshttps://doi.org/10.1016/j.jcss.2014.04.010openalex-snapshot
Searching for better fill-in
inferred← citeshttps://doi.org/10.1016/j.jcss.2026.103784openalex-snapshot
Graph clustering problems under the lens of parameterized local search
inferred← citeshttps://doi.org/10.1016/j.jcss.2026.103814openalex-snapshot
Temporal graph realization with bounded stretch
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.12.049openalex-snapshot
Incremental list coloring of graphs, parameterized by conservation
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.05.006openalex-snapshot
Local search for string problems: Brute-force is essentially optimal
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.05.002openalex-snapshot
On the parameterized complexity of consensus clustering
inferred← citeshttps://doi.org/10.1021/acsnano.6b05855openalex-snapshot
Plasmonic Lattice Lenses for Multiwavelength Achromatic Focusing
inferred← citeshttps://doi.org/10.1021/acsphotonics.6b00955openalex-snapshot
Evolutionary Design and Prototyping of Single Crystalline Titanium Nitride Lattice Optics
inferred← citeshttps://doi.org/10.1109/focs.2016.62openalex-snapshot
Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering
inferred← citeshttps://doi.org/10.1109/tpds.2013.74openalex-snapshot
Distributed Detection in Mobile Access Wireless Sensor Networks under Byzantine Attacks
inferred← citeshttps://doi.org/10.1109/tsc.2020.2980258openalex-snapshot
Composing Energy Services in a Crowdsourced IoT Environment
inferred← citeshttps://doi.org/10.1109/wocc63563.2025.11082171openalex-snapshot
Optimization Strategy for Power Control in C+L+S Band Transmission Using Particle Swarm Optimization
inferred← citeshttps://doi.org/10.1137/19m1262504openalex-snapshot
Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering
inferred← citeshttps://doi.org/10.1145/2151171.2151182openalex-snapshot
On the hardness of losing weight
inferred← citeshttps://doi.org/10.1145/2897518.2897551openalex-snapshot
Exact Algorithms via Monotone Local Search
inferred← citeshttps://doi.org/10.14279/depositonce-3922openalex-snapshot
Exploring parameter spaces in coping with computational intractability
inferred← citeshttps://doi.org/10.1609/aaai.v24i1.7539openalex-snapshot
EWLS: A New Local Search for Minimum Vertex Cover
inferred← citeshttps://doi.org/10.1609/aaai.v24i1.7557openalex-snapshot
Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments
inferred← citeshttps://doi.org/10.1609/aaai.v26i1.8128openalex-snapshot
Don't Be Strict in Local Search!
inferred← citeshttps://doi.org/10.1609/aaai.v31i1.10659openalex-snapshot
Systematic Exploration of Larger Local Search Neighborhoods for the Minimum Vertex Cover Problem
inferred← citeshttps://doi.org/10.1609/aaai.v35i14.17463openalex-snapshot
Efficient Bayesian Network Structure Learning via Parameterized Local Search on Topological Orderings
inferred← citeshttps://doi.org/10.1613/jair.3744openalex-snapshot
Parameterized Complexity Results for Exact Bayesian Network Structure Learning
inferred← citeshttps://doi.org/10.17706/jsw.14.11.530-547openalex-snapshot
Cross Site Scripting Vulnerabilities in JAX-RS: A Security Approach
inferred← citeshttps://doi.org/10.2139/ssrn.7370109openalex-snapshot
Pivoting Local Max-Cut: Deactivation Fan-Out and Subpolynomial Degree
inferred← citeshttps://doi.org/10.24963/ijcai.2023/620openalex-snapshot
Parameterized Local Search for Max c-Cut
inferred← citeshttps://doi.org/10.3390/a11020020openalex-snapshot
Vertex Cover Reconfiguration and Beyond
inferred← citeshttps://doi.org/10.3390/a13110306openalex-snapshot
Finding the Best 3-OPT Move in Subcubic Time
inferred← citeshttps://doi.org/10.3390/su14074218openalex-snapshot
Design Optimization of Three-Layered Metamaterial Acoustic Absorbers Based on PVC Reused Membrane and Metal Washers
inferred← citeshttps://doi.org/10.3726/b10907openalex-snapshot
Big Data in Organizations and the Role of Human Resource Management: A Complex Systems Theory-Based Conceptualization
inferred← citeshttps://doi.org/10.4108/eai.3-12-2015.2262449openalex-snapshot
On the Computational Complexity of Software (Re)Modularization: Elaborations and Opportunities
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2010.2495openalex-snapshot
Reflections on Multivariate Algorithmics and Problem Parameterization
inferred← citeshttps://doi.org/10.48550/arxiv.1308.2409openalex-snapshot
On the Parameterized Complexity of Reconfiguration Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1309.6797openalex-snapshot
Minimizing Rosenthal Potential in Multicast Games
inferred← citeshttps://doi.org/10.48550/arxiv.1810.06625openalex-snapshot
Parameterized Dynamic Cluster Editing
inferred← citeshttps://doi.org/10.48550/arxiv.2105.06058openalex-snapshot
DataExposer: Exposing Disconnect between Data and Systems
inferred← citeshttps://doi.org/10.5762/kais.2013.14.3.1451openalex-snapshot
Fast Combinatorial Programs Generating Total Data
inferred← citeshttps://doi.org/10.70675/6ee560b2zcde1z430az868ez93675c345a64openalex-snapshot
Architecture cognitive constructiviste : un modèle pour concevoir un agent automotivé capable de faire du sens et de construire des connaissances de l'environnement
showing the first 66 of 67 · page through all 67
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.