On the public citation graph

Scalable Kernelization for Maximum Independent Sets

https://doi.org/10.1145/3355502
0 signed · 86 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.1002/spe.587openalex-snapshot
UbiCrawler: a scalable fully distributed Web crawler
inferredcites →https://doi.org/10.1006/jagm.2001.1186openalex-snapshot
Vertex Cover: Further Observations and Further Improvements
inferredcites →https://doi.org/10.1007/978-0-387-98096-6_12openalex-snapshot
Estimating the size of correcting codes using extremal graph problems
inferredcites →https://doi.org/10.1007/978-1-4614-6170-8_23openalex-snapshot
Benchmarking for Graph Clustering and Partitioning
inferredcites →https://doi.org/10.1007/978-1-4939-7131-2openalex-snapshot
Encyclopedia of Social Network Analysis and Mining
inferredcites →https://doi.org/10.1007/978-3-319-07959-2_20openalex-snapshot
Evaluation of Labeling Strategies for Rotating Maps
inferredcites →https://doi.org/10.1007/978-3-319-38851-9_9openalex-snapshot
Accelerating Local Search for the Maximum Independent Set Problem
inferredcites →https://doi.org/10.1007/978-3-319-42634-1_28openalex-snapshot
On the Power of Simple Reductions for the Maximum Independent Set Problem
inferredcites →https://doi.org/10.1007/978-3-642-11440-3_18openalex-snapshot
A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
inferredcites →https://doi.org/10.1007/978-3-642-13193-6_8openalex-snapshot
Distributed Time-Dependent Contraction Hierarchies
inferredcites →https://doi.org/10.1007/978-3-642-16533-7openalex-snapshot
Exact Exponential Algorithms
inferredcites →https://doi.org/10.1007/978-3-642-38527-8_16openalex-snapshot
Think Locally, Act Globally: Highly Balanced Graph Partitioning
inferredcites →https://doi.org/10.1007/978-3-642-40450-4_45openalex-snapshot
Kernelization Using Structural Parameters on Sparse Graph Classes
inferredcites →https://doi.org/10.1007/bf01580444openalex-snapshot
Vertex packings: Structural properties and algorithms
inferredcites →https://doi.org/10.1007/s00224-007-1328-0openalex-snapshot
Crown Structures for Vertex Cover Kernelization
inferredcites →https://doi.org/10.1007/s00224-007-1345-zopenalex-snapshot
An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem
inferredcites →https://doi.org/10.1007/s10732-012-9196-4openalex-snapshot
Fast local search for the maximum independent set problem
inferredcites →https://doi.org/10.1007/s10732-016-9315-8openalex-snapshot
Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering
inferredcites →https://doi.org/10.1007/s10732-017-9337-xopenalex-snapshot
Finding Near-Optimal Independent Sets at Scale
inferredcites →https://doi.org/10.1007/s10878-012-9592-6openalex-snapshot
Improvements to MCS algorithm for the maximum clique problem
inferredcites →https://doi.org/10.1007/s11590-011-0431-yopenalex-snapshot
An improved bit parallel exact maximum clique algorithm
inferredcites →https://doi.org/10.1016/j.cor.2010.07.019openalex-snapshot
An exact bit-parallel algorithm for the maximum clique problem
inferredcites →https://doi.org/10.1016/j.cor.2015.07.013openalex-snapshot
A new exact maximum clique algorithm for large and massive sparse graphs
inferredcites →https://doi.org/10.1016/j.ic.2013.08.005openalex-snapshot
Data reduction for graph coloring problems
inferredcites →https://doi.org/10.1016/j.ic.2017.06.001openalex-snapshot
Exact algorithms for maximum independent set
inferredcites →https://doi.org/10.1016/j.orl.2006.07.004openalex-snapshot
Using critical sets to solve the maximum independent set problem
inferredcites →https://doi.org/10.1016/j.tcs.2012.09.022openalex-snapshot
Confining sets and avoiding bottleneck cases: A simple maximum independent set algorithm in degree-3 graphs
inferredcites →https://doi.org/10.1016/j.tcs.2015.09.023openalex-snapshot
Branch-and-reduce exponential/FPT algorithms in practice: A case study of vertex cover
inferredcites →https://doi.org/10.1090/dimacs/074openalex-snapshot
The Shortest Path Problem
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/hpec.2016.7761644openalex-snapshot
Generating massive complex networks with hyperbolic geometry faster in practice
inferredcites →https://doi.org/10.1109/ictai.2013.143openalex-snapshot
Combining MaxSAT Reasoning and Incremental Upper Bound for the Maximum Clique Problem
inferredcites →https://doi.org/10.1109/ipdps.2000.845957openalex-snapshot
Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000
inferredcites →https://doi.org/10.1109/ipdps.2010.5470485openalex-snapshot
Engineering a scalable high quality graph partitioner
inferredcites →https://doi.org/10.1109/ipdps.2015.18openalex-snapshot
Parallel Graph Partitioning for Complex Networks
inferredcites →https://doi.org/10.1109/tpds.2016.2546258openalex-snapshot
Computing Maximum Cardinality Matchings in Parallel on Bipartite Graphs via Tree-Grafting
inferredcites →https://doi.org/10.1137/0206038openalex-snapshot
Finding a Maximum Independent Set
inferredcites →https://doi.org/10.1137/1.9781611973402.127openalex-snapshot
Linear-Time FPT Algorithms via Network Flow
inferredcites →https://doi.org/10.1137/1.9781611975055.19openalex-snapshot
Scalable Kernelization for Maximum Independent Sets
inferredcites →https://doi.org/10.1145/1233481.1233493openalex-snapshot
Invitation to data reduction and problem kernelization
inferredcites →https://doi.org/10.1145/1409060.1409097openalex-snapshot
Efficient traversal of mesh edges using adjacency primitives
inferredcites →https://doi.org/10.1145/3035918.3035939openalex-snapshot
Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling
inferredcites →https://doi.org/10.1145/3097983.3098031openalex-snapshot
Fast Enumeration of Large k-Plexes
inferredcites →https://doi.org/10.1145/508791.508897openalex-snapshot
Finding maximum independent sets in graphs arising from coding theory
inferredcites →https://doi.org/10.1287/opre.42.5.860openalex-snapshot
A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set

What points at this work

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

inferred← citeshttps://doi.org/10.1002/cpe.6681openalex-snapshot
Simple iterative trial search for the maximum independent set problem optimized for the GPUs
inferred← citeshttps://doi.org/10.1007/978-3-030-34223-4_45openalex-snapshot
Computing Maximum Independent Sets over Large Sparse Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-86838-3_1openalex-snapshot
Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set
inferred← citeshttps://doi.org/10.1007/978-3-031-21534-6openalex-snapshot
Algorithms for Big Data
inferred← citeshttps://doi.org/10.1007/978-3-031-21534-6_6openalex-snapshot
Recent Advances in Practical Data Reduction
inferred← citeshttps://doi.org/10.1007/978-3-032-34519-6_11openalex-snapshot
A Machine Learning Framework for Dominating Set Variants in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-981-92-0375-8_10openalex-snapshot
Mining Large Independent Sets on Massive Graphs
inferred← citeshttps://doi.org/10.1016/j.asoc.2023.110474openalex-snapshot
Automatic generation of a hybrid algorithm for the maximum independent set problem using genetic programming
inferred← citeshttps://doi.org/10.1016/j.jcss.2024.103532openalex-snapshot
Preprocessing to reduce the search space: Antler structures for feedback vertex set
inferred← citeshttps://doi.org/10.1016/j.jestch.2025.101995openalex-snapshot
A greedy approach to solve maximum independent set problem: Differential Malatya independent set algorithm
inferred← citeshttps://doi.org/10.1016/j.rineng.2024.103224openalex-snapshot
Efficient identification of maximum independent sets in stochastic multilayer graphs with learning automata
inferred← citeshttps://doi.org/10.1038/s42005-026-02606-7openalex-snapshot
A short review on the maximum clique problem algorithms with classical, AI, and quantum methods
inferred← citeshttps://doi.org/10.1038/s42256-025-01141-4openalex-snapshot
Reusability report: A distributed strategy for solving combinatorial optimization problems with hypergraph neural networks
inferred← citeshttps://doi.org/10.1080/01605682.2022.2056533openalex-snapshot
The gradual minimum covering location problem
inferred← citeshttps://doi.org/10.1080/17445760.2026.2684509openalex-snapshot
Scalable maximum independent set computation for conflict graphs using kernelization and greedy inference
inferred← citeshttps://doi.org/10.1103/7dkh-crjjopenalex-snapshot
Quantum compilation toolkit for Rydberg atom arrays with implications for problem hardness and quantum speedups
inferred← citeshttps://doi.org/10.1103/nh3b-1wv5openalex-snapshot
qReduMIS: A Quantum-Informed Reduction Algorithm for the Maximum Independent Set Problem
inferred← citeshttps://doi.org/10.1103/prxquantum.5.020327openalex-snapshot
Quantum-Informed Recursive Optimization Algorithms
inferred← citeshttps://doi.org/10.1109/candar51075.2020.00012openalex-snapshot
Efficient GPU Implementation for Solving the Maximum Independent Set Problem
inferred← citeshttps://doi.org/10.1109/hipc53243.2021.00021openalex-snapshot
Shared-memory implementation of the Karp-Sipser kernelization process
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00195openalex-snapshot
Distributed Near-Maximum Independent Set Maintenance over Large-scale Dynamic Graphs
inferred← citeshttps://doi.org/10.1109/ipdps53621.2022.00035openalex-snapshot
Parallel, Portable Algorithms for Distance-2 Maximal Independent Set and Graph Coarsening
inferred← citeshttps://doi.org/10.1109/iros45743.2020.9340853openalex-snapshot
Max orientation coverage: efficient path planning to avoid collisions in the CNC milling of 3D objects
inferred← citeshttps://doi.org/10.1109/qce60285.2024.00070openalex-snapshot
Scaling Up the Quantum Divide and Conquer Algorithm for Combinatorial Optimization
inferred← citeshttps://doi.org/10.1109/qce65121.2025.00015openalex-snapshot
Combinatorial Optimization with Few Qubits
inferred← citeshttps://doi.org/10.1137/1.9781611976007.3openalex-snapshot
Engineering Kernelization for Maximum Cut
inferred← citeshttps://doi.org/10.1137/1.9781611976472.10openalex-snapshot
Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations
inferred← citeshttps://doi.org/10.1137/1.9781611976472.13openalex-snapshot
SAT-and-Reduce for Vertex Cover: Accelerating Branch-and-Reduce by SAT Solving
inferred← citeshttps://doi.org/10.1137/1.9781611976830.10openalex-snapshot
Faster Parallel Multiterminal Cuts
inferred← citeshttps://doi.org/10.1142/s1793830925500314openalex-snapshot
On lower bounds of the density of planar periodic sets without unit distances
inferred← citeshttps://doi.org/10.1145/3658617.3697778openalex-snapshot
Compilation for Dynamically Field-Programmable Qubit Arrays with Efficient and Provably Near-Optimal Scheduling
inferred← citeshttps://doi.org/10.23919/isita60732.2024.10858234openalex-snapshot
The Tight Upper Bound for the Size of Single Deletion Error Correcting Codes of Length 11
inferred← citeshttps://doi.org/10.3390/a17030112openalex-snapshot
Exploratory Data Analysis and Searching Cliques in Graphs
inferred← citeshttps://doi.org/10.3390/e21121202openalex-snapshot
Nonasymptotic Upper Bounds on Binary Single Deletion Codes via Mixed Integer Linear Programming
inferred← citeshttps://doi.org/10.3390/math13182951openalex-snapshot
An Implementation of the Python Code for Computing the Independent Number of Genus Graphs
inferred← citeshttps://doi.org/10.4230/lipics.esa.2020.59openalex-snapshot
Finding All Global Minimum Cuts In Practice
inferred← citeshttps://doi.org/10.4230/lipics.sea.2021.17openalex-snapshot
Targeted Branching for the Maximum Independent Set Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1909.08387openalex-snapshot
Graph Neural Networks for Maximum Constraint Satisfaction
inferred← citeshttps://doi.org/10.48550/arxiv.1912.00245openalex-snapshot
Scalable Graph Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.2003.06639openalex-snapshot
Graph Profiling for Vertex Cover: Targeted Reductions in a Branch and Reduce Solver
inferred← citeshttps://doi.org/10.48550/arxiv.2108.04566openalex-snapshot
Algorithm Engineering for Cut 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.