vertex cover

A Graph-Theoretical Perspective on Law Design for Multiagent Systems AAAI 2026 Exact Algorithms for Distance to Unique Vertex Cover AAAI 2026 Learning with Structure: Computing Consistent Subsets on Structurally-Regular Graphs AAAI 2026 Approximation algorithms for combinatorial optimization with predictions ICLR 2025 Improved Approximations for Hard Graph Problems using Predictions ICML 2025 Pre-Assignment Problem for Unique Minimum Vertex Cover on Bounded Clique-Width Graphs AAAI 2025 On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions? AAAI 2024 Slack-Free Spiking Neural Network Formulation for Hypergraph Minimum Vertex Cover NeurIPS 2024 Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover AAAI 2024 Revisiting Bayesian network learning with small vertex cover UAI 2023 Disentangling the Computational Complexity of Network Untangling IJCAI 2022 LeNSE: Learning To Navigate Subgraph Embeddings for Large-Scale Combinatorial Optimisation ICML 2022 The Complexity of Temporal Vertex Cover in Small-Degree Graphs AAAI 2022 NN-Baker: A Neural-network Infused Algorithmic Framework for Optimization Problems on Geometric Intersection Graphs NeurIPS 2021 Submodular Maximization beyond Non-negativity: Guarantees, Fast Algorithms, and Applications ICML 2019 Found Graph Data and Planted Vertex Covers NeurIPS 2018 Improving Local Search for Minimum Weight Vertex Cover by Dynamic Strategies IJCAI 2018 Learning Combinatorial Optimization Algorithms over Graphs NeurIPS 2017 On the Kernelization of Global Constraints IJCAI 2017 Learning and inference in the presence of corrupted inputs COLT 2015 Tractable Bayesian Network Structure Learning with Bounded Vertex Cover Number NeurIPS 2015 Minimizing Sparse High-Order Energies by Submodular Vertex-Cover NeurIPS 2012