Conflict-Based Local Search for Minimum Partition into Plane Subgraphs (CG Challenge)

No abstract is available for this paper.

• Publication year

  2022

• Venue

  International Symposium on Computational Geometry

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.4230/LIPIcs.SoCG.2022.72
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Shadoks Approach to Minimum Partition into Plane Subgraphs (CG Challenge)

  2022cited by this paper
• Local Search with Weighting Schemes for the CG: SHOP 2022 Competition (CG Challenge)

  2022cited by this paper
• SAT-Based Local Search for Plane Subgraph Partitions

  2022cited by this paper
• Minimum Partition into Plane Subgraphs: The CG:SHOP Challenge 2022

  2022cited by this paper
• Shadoks Approach to Low-Makespan Coordinated Motion Planning

  2021cited by this paper
• A deep learning guided memetic framework for graph coloring problems

  2021cited by this paper
• Variations on memetic algorithms for graph coloring problems

  2014cited by this paper
• Parameter Tuning Patterns for Random Graph Coloring with Quantum Annealing

  2012cited by this paper
• Quantum annealing of the graph coloring problem

  2011cited by this paper
• An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring

  2010cited by this paper
• Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11-13, 1993

  1996cited by this paper
• Using tabu search techniques for graph coloring

  1987cited by this paper
• New methods to color the vertices of a graph

  1979cited by this paper
• A lower bound for the smallest eigenvalue of the Laplacian

  1969cited by this paper
• An upper bound for the chromatic number of a graph and its application to timetabling problems

  1967cited by this paper

• Minimum Non-Obtuse Triangulations: The CG:SHOP Challenge 2025

  2025cites this paper
• Maximum Polygon Packing: The CG: SHOP Challenge 2024

  2024cites this paper
• Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring

  2023cites this paper
• SAT-boosted Tabu Search for Coloring Massive Graphs

  2023cites this paper
• Minimum Partition into Plane Subgraphs: The CG:SHOP Challenge 2022

  2022cites this paper
• SAT-Based Local Search for Plane Subgraph Partitions

  2022cites this paper
• Local Search with Weighting Schemes for the CG: SHOP 2022 Competition (CG Challenge)

  2022cites this paper
• Shadoks Approach to Minimum Partition into Plane Subgraphs (CG Challenge)

  2022cites this paper