conftrace_

graph coloring

24 papers

Explore in graph

Co-occurring keywords

combinatorial optimization (1039) graph algorithm (178) upper bound (25) satisfiability solving (13) exact algorithm (25) approximation algorithm (630) sat solver (78) np-hard problem (43) constraint programming (95) column generation (29)

Papers

Graph Choosability via SAT: Beyond the Nullstellensatz AAAI 2026
Exact Algorithms with New Upper Bounds for the Maximum k-plex Problem IJCAI 2025
Verified Certificates via SAT and Computer Algebra Systems for the Ramsey R(3,8) and R(3,9) Problems IJCAI 2025
Order-Robust Class Incremental Learning: Graph-Driven Dynamic Similarity Grouping CVPR 2025
KD-Club: An Efficient Exact Algorithm with New Coloring-Based Upper Bound for the Maximum k-Defective Clique Problem AAAI 2024
A Reinforcement-Learning-Based Multiple-Column Selection Strategy for Column Generation AAAI 2024
Is Planted Coloring Easier than Planted Clique? COLT 2023
New Bounds and Constraint Programming Models for the Weighted Vertex Coloring Problem IJCAI 2023
Parameterized Local Search for Max c-Cut IJCAI 2023
Ordinal Hedonic Seat Arrangement under Restricted Preference Domains: Swap Stability and Popularity IJCAI 2023
Graph Coloring via Neural Networks for Haplotype Assembly and Viral Quasispecies Reconstruction NIPS 2022
Scalable design of Error-Correcting Output Codes using Discrete Optimization with Graph Coloring NIPS 2022
Enhancing Column Generation by a Machine-Learning-Based Pricing Heuristic for Graph Coloring AAAI 2022
Intervention Efficient Algorithms for Approximate Learning of Causal Graphs ALT 2021
Improving Maximum k-plex Solver via Second-Order Reduction and Graph Color Bounding AAAI 2021
Solving the Satisfiability Problem of Modal Logic S5 Guided by Graph Coloring IJCAI 2019
Sliding Window Temporal Graph Coloring AAAI 2019
Be Greedy: How Chromatic Number meets Regret Minimization in Graph Bandits UAI 2019
Clause Learning and New Bounds for Graph Coloring IJCAI 2019
Structure Learning of ${H}$-colorings ALT 2018
On Blackbox Backpropagation and Jacobian Sensing NIPS 2017
A Reduction based Method for Coloring Very Large Graphs IJCAI 2017
Parallel Gibbs Sampling: From Colored Fields to Thin Junction Trees AISTATS 2011
Counting Solution Clusters in Graph Coloring Problems Using Belief Propagation NIPS 2008