Tez Dosyaları 18
Unit disk graph coloring and its reoptimization
A decomposition approach to solve the selective graph coloring problem
Network-based methods for anti-money laundering
Minimum split coloring
Convexity in graphs
Graphs of edge-intersecting non-splitting paths
Defective Ramsey numbers and defective cocolorings
Solving perfect graph modification problems and generating perfect graphs
Edge-extremal graphs under degree and matching number restrictions
Priority matching with cost consideration for ride-hailingservices
Constructing edge extremal triangle-free graphs withbounded maximum degree and matching number using integerprogramming
Designing a two-player majority coloring game with a user interface
Money laundering detection in cryptocurrency networks
The maximum acyclic matching problem
The maximum stable set problem in perfect graphs
The selective graph coloring problem
Integer programming formulations and benders decomposition for maximum induced matching problem
Integer programming formulations and cutting plane algorithms for the maximum selective tree problem