Maximum Independent Set

Ask about this topic

Momentum

9 papers in the last four weeks, against 2 the four weeks before. 0.1% of all new papers.

Jul 13Week of Sep 28
View on map

Latest papers 56

All topics
CardsList

  1. Nearly Group-Separable Elections

    Sep 27, 2026Piotr Faliszewski, Jan Jabrocki, Stanisław Kaźmierowski +3ElectionsMaximum Independent Set

    AGH University of Krakow, Poland · University of Warsaw, Poland · Charles University, Czechia +3

  2. Neutral-Atom-based Quantum Optimization for Resource Allocation in NOMA Networks

    Sep 22, 2026Patatchona Keyela, Remon Polus, Soumaya Cherkaoui +1Quantum AnnealingOrthogonal Frequency-Division Multiplexing

    Department of Computer and Software Engineering, Polytechnique Montréal, Montréal, Québec, H3T 1J4, Canada · Thales cortAIx Labs, Montréal, Québec, H3C 0B4, Canada

  3. Dual-GNN Multilevel Coarsening for Maximum Independent Set

    Sep 21, 2026Tianfeng Chen, Xianyue LiSalesman ProblemGraph Edge Sparsification

    School of Mathematics and Statistics Lanzhou University

  4. Solving Minimum Span Antibandwidth and Cyclic Antibandwidth Labeling Problems

    Sep 17, 2026Hieu Truong Xuan, Khanh To VanMaximum Independent SetNp-Hard

    Faculty of Information Technology, VNU University of Engineering and Technology, Xuan Thuy, Cau Giay, Ha Noi, 123105, Vietnam.

  5. Revisiting the Objective of Echo Chamber Detection

    Sep 16, 2026Abylaikhan Bexeit, Kushani Perera, Shanika Karunasekera +1Community DetectionNetwork Science

    CIS, The University of Melbourne

  6. Maximum Strong Independent Sets in Hypergraphs: Reductions, Bounds, and Greedy Certificates

    Sep 16, 2026Yingquan, Wu, Jason CongMaximum Independent SetHypergraphs

    Cody · MBZUAI Institute of Foundation Models Sunnyvale, CA, USA · University of California, Los Angeles Los Angeles, CA, USA

  7. One Color Preprocessing Improves DSATUR

    Sep 15, 2026Adam Nouira, Lucas IsenmannMaximum Independent SetConvex Relaxation

    Universit´e de Strasbourg

  8. Structural Fusion of Bayesian Networks with Limited Treewidth Using Genetic Algorithms

    Sep 9, 2026Pablo Torrijos, José A. Gámez, José M. PuertaBayesian NetworksGenetic Algorithms

    Instituto de Investigaci´on en Inform´atica de Albacete (I3A). Universidad de Castilla-La Mancha. Albacete, 02071, Spain · Departamento de Sistemas Inform´aticos. Universidad de Castilla-La Mancha. Albacete, 02071, Spain

  9. Agentic Algorithm Engineering: Improving Shared-Memory Exact Minimum Cuts

    Sep 7, 2026David A. Bader, Adil Chhabra, Ernestine Großmann +3Maximum Independent SetSolvers

    New Jersey Institute of Technology, Newark, NJ, USA · Heidelberg University, Heidelberg, Germany. · Institute of Science and Technology Austria (ISTA), Klosterneuburg, Austria +1

  10. Exponential random graph models with soft clique constraints

    Aug 31, 2026Yasmin Tousinejad, Vera KoponenInhomogeneous Random GraphsMaximum Independent Set

  11. Strengthening Recursive Constructions for Zero-Error Shannon Capacity

    Aug 31, 2026Ravi TandonSource-Channel CodingInformation-Theoretic Limits

    School of Electrical, Computing and Software Engineering, University of Arizona, Tucson, AZ 85721, USA.

  12. EFX Allocation In (Multi)Hypergraphs

    Aug 4, 2026Thanasis Lianeas, Alkmini Sgouritsa, Minas Marios SotiriouMaximum Independent SetHypergraphs

    University of West Attica · Greece · Athens University of Economics and Business +1

  13. Optimal Unambiguous DNFs and Alon-Saks-Seymour

    Aug 3, 2026Chirag PabbarajuMaximum Independent SetFinite-Sample Certificates

    Stanford University.

  14. GaussianSelector: Lightweight Human-Guided Object Selection in 3D Gaussian Splatting with Graph Optimization

    Aug 2, 2026Baihan Yang, Tiexin Li, Yuheng Liu +4Gaussian Primitives3D Generation

    UC San Diego · City University of Hong Kong · UC Irvine

  15. Improved lower bounds for the Shannon capacity of odd cycles

    Jul 23, 2026Nathaniel Itty, Christopher D. Rosin, Chase Carstensen +1Maximum Independent SetLower Bounds

    Worcester Polytechnic Institute · Constructive Codes

  16. Increasing Line Outage Localization Performance with Ensemble Classifiers

    Jul 18, 2026Daniel Flores, Yuanrui Sang, Michael P. McGarryOptimal Power FlowClassifier

    Dept. of Electrical and Computer Engineering University of Massachusetts Amherst Amherst, MA, United States · Dept. of Electrical and Computer Engineering University of Texas at El Paso El Paso, TX, United States

  17. Graph Partitioning with Demands: Generalized Conductance and its Applications

    Jul 14, 2026Michał Szyfelbein, Dariusz DereniowskiMaximum Independent SetApproximation Algorithms

    Gda´nsk University of Technology

  18. Actual causality in fault trees

    Jul 2, 2026Georgiana Caltais, Milan Lopuhaä-Zwakenberg, Mariëlle StoelingaCausal ReasoningRobot Failures

    University of Twente, The Netherlands · Radboud University, The Netherlands

  19. Learning-Augmented Algorithms for Online Vertex Cover

    Jun 22, 2026Tianhang Lu, Runtian Ren, Shengcai LiuLearning-Augmented AlgorithmsMaximum Independent Set

    Guangdong Provincial Key Laboratory of Brain-Inspired Intelligent Computation, Department of Computer Science and Engineering, Southern University of Science and Technology, Shenzhen 518055, China

  20. FOSC-X: An Extended Framework for Optimal Local Cuts and Non-Horizontal Cluster Selection from Clustering Hierarchies

    Jun 17, 2026Connor Simpson, Ricardo J. G. B. CampelloClusteringCluster

    Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark.

  21. Dimensionality Reduction of QAOA Parameter Space with Kernel PCA for Max-Cut

    Jun 17, 2026Sidharth Brahmandam, Vayd RamkumarQuantum Approximate Optimization AlgorithmVariational Quantum Algorithms

    Naperville North High School · Independent Researcher

  22. Deep Reinforcement Learning for Minimum Zero-Forcing Sets

    Jun 16, 2026Steve Halley, Maurício GruppiMaximum Independent SetNetwork Science

    Department of Computing Sciences, Villanova University Villanova, Pennsylvania, USA

  23. Mask Proposal Voting Based on Geodesic Framework for Robust Image Segmentation

    Jun 12, 2026Li Liu, Mingzhu Wang, Zhenjiang Li +2GeodesicMajority Voting

    Yuanshen Rehabilitation Institute, Shanghai Jiao Tong University School of Medicine, 200025 Shanghai, China · Yueyang Hospital of Integrated Traditional Chinese and Western Medicine, Shanghai University of Traditional Chinese Medicine, 200437 Shanghai, China · Department of Radiation Oncology, Shandong Cancer Hospital and Institute, Shandong First Medical University, Shandong Academy of Medical Sciences, 250117 Jinan, China +1

  24. How Task Structure Limits Multi-Agent Success: An Information-Theoretic Analysis

    Jun 11, 2026Shi Pan, Ming LuoModel-Based Multi-Agent SystemsSingle-Agent

    University College London London, UK · University of Bristol Bristol, UK

  25. Combinatorial Landscape Analysis for Dominating Set and Vertex Coloring

    Jun 5, 2026Johanna Gasse, Antonia Heinen, Felix Knöfel +2Optimization LandscapeMaximum Independent Set

    Hasso Plattner Institute, Potsdam, Germany

  26. What Makes Majority Illusion Easy to Detect?

    Jun 2, 2026Šimon Schierreich, Ildikó SchlotterMajority VotingSocial Influence

    Czech Technical University in Prague · ELTE Centre for Economic and Regional Studies · Budapest University of Technology and Economics

  27. Graph Edit Distance Formulation for the Vehicle Routing Problem: Theory and Analysis

    Jun 1, 2026Adel DabahVehicle Routing ProblemMaximum Independent Set

    Jülich Supercomputing Centre Forschungszentrum Jülich Jülich, Germany

  28. Consistent and Distinctive: LLM Benchmark Efficiency via Maximum Independent Set Prompt Selection on Similarity Graphs

    May 31, 2026Denica Kjorvezir, Marko Djukanović, Ana Gjorgjevikj +2Large Language Model BenchmarksSimilarity and Metrics

    1Computer Systems Department, Jožef Stefan Institute, Ljubljana, Slovenia · 2Jožef Stefan International Postgraduate School, Ljubljana, Slovenia · Center for Astrophysics and Cosmology, University of Nova Gorica, Nova Gorica, Slovenia

  29. Scaling Higher-Order Graph Learning with Maximal Clique Complexes

    May 29, 2026Antoine Vialle, Aref Einizade, Fragkiskos D. Malliaros +1Graph Representation LearningGraph Neural Networks

    LTCI, Télécom Paris · Institut Polytechnique de Paris · Palaiseau, France +4

  30. A Fresh Look at Lamarckian Evolution and the Baldwin Effect

    May 27, 2026Inès Benito, Johannes F. Lutzeyer, Benjamin DoerrGenetic AlgorithmsEvolutionary Optimization Methods

    Laboratoire d’Informatique (LIX), CNRS, École Polytechnique, Institut Polytechnique de Paris, France

  31. Adversarial Training for Robust Coverage Network under Worst-case Facility Losses

    May 26, 2026Changhao Miao, Yuntian Zhang, Tongyu Wu +2Long-Run Coverage GuaranteesMixed-Integer Programming

    State Key Laboratory of Autonomous Intelligent Unmanned Systems, Beijing Institute of Technology, Beijing 100081, China · Department of Computer, Control and Management Engineering “Antonio Ruberti”, Sapienza University of Rome, Rome, 00185, Italy · School of AI, Beijing Institute of Technology, Beijing 100081, China

  32. The Communication Complexity of Instant-Runoff Voting

    May 22, 2026Élie de Panafieu, François Durand, Jérôme LangMajority VotingMaximum Independent Set

    LAMSADE, CNRS · 1Nokia Bell Labs · 2CNRS, LAMSADE, Universit´e Paris-Dauphine, PSL, France

  33. SEED: Targeted Data Selection by Weighted Independent Set

    May 15, 2026Yuan Zhang, Lifeng Guo, Junwen Pan +5Alignment-Aware SelectionAdaptive Sampling

    School of Computer Science, Peking University · Beijing University of Posts and Telecommunications · Tianjin University +2

  34. Graph Neural Networks with Triangle-Based Messages for the Multicut Problem

    May 13, 2026Jannik Irmai, Lucas Fabian Naumann, Bjoern AndresMaximum Independent SetGraph Neural Networks

    Faculty of Computer Science, TU Dresden · Center for Scalable Data Analytics and AI, Dresden/Leipzig

  35. Fast and Compact Graph Cuts for the Boykov-Kolmogorov Algorithm

    May 13, 2026Christian Møller Mikkelstrup, Anders Bjorholm Dahl, Philip Bille +2Maximum Independent SetCuts

    DTU Compute, Technical University of Denmark, 2800 Kongens Lyngby, Denmark

  36. Distance-Constrained Unlabeled Multi-Agent Pathfinding

    May 12, 2026Takahiro Suzuki, Yuma Tamura, Keisuke OkumuraMulti-Agent Path FindingCollision-Free Trajectories

    Tohoku University · National Institute of Advanced Industrial Science and Technology (AIST)

  37. Network-Based Interventions for HIV Prevention via Cascade-Aware Suppression of Transmission

    May 11, 2026Akseli Kangaslahti, Davin Choo, Milind Tambe +2SirusMaximum Independent Set

    Harvard University · University of Witwatersrand · Wits Health Consortium +1

  38. Improving Generalization by Permutation Routing Across Model Copies

    May 10, 2026Shuhei Kashiwamura, Timothee LeleuMessage Passing Neural NetworksMultilayer Perceptrons

    NTT Research, CA, USA · Stanford University, CA, USA

  39. Solving Max-Cut to Global Optimality via Feasibility-Preserving Graph Neural Networks

    May 8, 2026Hao Chen, Chendi Qian, Christopher Morris +2Maximum Independent SetConvex Relaxation

    1Davidson School of Chemical Engineering, Purdue University · Faculty of Computer Science, RWTH Aachen University · 3Jacobs Technion-Cornell Institute, Cornell Tech

  40. Accelerated Relax-and-Round for Concave Coverage Problems

    May 7, 2026Matthew Fahrbach, Mehraneh Liaee, Morteza ZadimoghaddamApproximation AlgorithmsConvex Relaxation

    Google Research

  41. Graph Normalization: Fast Binarizing Dynamics for Differentiable MWIS

    May 6, 2026Laurent GuiguesMaximum Independent SetBinarization

  42. Semi-supervised learning with max-margin graph cuts

    Apr 29, 2026Branislav Kveton, Michal Valko, Ali Rahimi +1Semi-Supervised LearningSupport Vector Machines

    Intel Labs Santa Clara · University of Pittsburgh · Intel Labs Berkeley

  43. Coverage-Based Calibration for Post-Training Quantization via Weighted Set Cover over Outlier Channels

    Apr 27, 2026Ibne Farabi Shihab, Sanjeda Akter, Anuj SharmaPost-Training QuantizationPost-Training

    Department of Computer Science, Iowa State University · Department of Civil, Construction & Environmental Engineering, Iowa State University

  44. Characterizing Admissible Objective Functions for Hierarchical Clustering

    Apr 26, 2026Ryuki Tsukuba, Kazutoshi AndoClusteringObjective Functions

    Graduate School of Integrated Science and Technology, Shizuoka University,Jun Hamamatsu, Shizuoka 432-8561, Japan · Faculty of Engineering, Shizuoka University, Johoku 3-5-1, 432-8561 Hamamatsu, Japan

  45. The CriticalSet problem: Identifying Critical Contributors in Bipartite Dependency Networks

    Apr 23, 2026Sebastiano A. Piccolo, Andrea TagarelliMaximum Independent SetMultiple Centrality Measures

    University of Calabria, DeMaCS – Dept. Mathematics and Computer Science · University of Calabria, DIMES – Dept. Computer Engineering, Modeling, Electronics, and Systems Engineering

  46. Doubly Saturated Ramsey Graphs: A Case Study in Computer-Assisted Mathematical Discovery

    Apr 23, 2026Benjamin Przybocki, John Mackey, Marijn J. H. Heule +1Theorem ProvingAcyclic Graphs

    Carnegie Mellon University, Pittsburgh, USA

  47. Is Four Enough? Automated Reasoning Approaches and Dual Bounds for Condorcet Dimensions of Elections

    Apr 21, 2026Itai Zilberstein, Ratip Emin Berker, George Li +1ElectionsMajority Voting

    Carnegie Mellon University Pittsburgh, USA

  48. Why Colors Make Clustering Harder:Global Integrality Gaps, the Price of Fairness, and Color-Coupled Algorithms in Chromatic Correlation Clustering

    Apr 17, 2026Ibne Farabi Shihab, Sanjeda Akter, Anuj SharmaMaximum Independent SetConvex Relaxation

    Department of Computer Science, Iowa State University · Department of Civil, Construction & Environmental Engineering, Iowa State University

  49. Analysis of Multitasking Pareto Optimization for Monotone Submodular Problems

    Apr 16, 2026Liam Wigney, Frank NeumannSubmodular FunctionsKnapsack Constraint

    Optimisation and Logistics School of Computer Science and Information Technology Adelaide University Adelaide, Australia

  50. Improved Upper Bounds for Slicing the Hypercube

    Feb 6, 2026Duncan Soiffer, Nathaniel Itty, Christopher D. Rosin +5SlicesUpper Bounds

    Carnegie Mellon University · Work done while at Worcester Polytechnic Institute · Constructive Codes +1

  51. Enabling Population-Based Architectures for Neural Combinatorial Optimization

    Jan 13, 2026Andoni Irazusta Garmendia, Josu Ceberio, Alexander MendiburuNeural Combinatorial OptimizationMetaheuristics

    University of the Basque Country (EHU), Department of Computer Science and Artificial Intelligence, San Sebastian, Spain.

  52. Fair Minimum Labeling: Efficient Temporal Network Activations for Reachability and Equity

    Oct 4, 2025Lutz Oettershagen, Othon MichailMaximum Independent SetAlgorithmic Fairness

    University of Liverpool

  53. Instance-Aware Algorithm Selection for Maximum Clique via a Dual-Channel Graph Neural Architecture

    Aug 11, 2025Xiang Li, Shanshan Wang, Chenglong XiaoMaximum Independent SetAlgorithm Selection

    College of Mathematics and Computer, Shantou University, Shantou, China

  54. A short review on the maximum clique problem algorithms with classical, AI, and quantum methods

    Mar 13, 2024Raffaele Marino, Lorenzo Buffoni, Bogdan ZavalnijMaximum Independent SetQuantum Annealing

    Dipartimento di Fisica e Astronomia Università degli studi di Firenze Via Giovanni Sansone 1, 50019 Sesto Fiorentino, Florence, Italy · HUN-REN Rényi Institute of Mathematics H-1053, Reáltanoda u. 13-15 Budapest, Hungary

  55. Semidefinite programming relaxations and debiasing for MAXCUT-based clustering

    Jan 16, 2024Shuheng ZhouConvex RelaxationMaximum Independent Set

    University of California, Riverside, CA 92521

  56. Adversarial Rademacher Complexity of Deep Neural Networks

    Nov 27, 2022Jiancong Xiao, Yanbo Fan, Ruoyu Sun +1Adversarial TrainingGeneralization Bounds

    The Chinese University of Hong Kong, Shenzhen Shenzhen, China · Nanjing University Suzhou, China