GCS-Q is a coalition structure generation algorithm for induced subgraph games

Complexity

Hvala: Approximate Vertex Cover Solver

Naive and optimized greedy solutions to the NP-Hard Vertex cover problem with a basic GUI

Algorithm for finding maximal cliques in hamming graph using brute force.

This project contains 3 implementations to solving the maximal clique problem.

⚛️ MIT iquHACK QuEra Challenge Submission (Winner of challenge)

Proof of concept for "TSP Escapes the O(2^n n^2) Curse" -- First improvement after more than 60 years

This repository contains a Java implementation of algorithms for computing Maximum Agreement Forests (MAF) on unrooted phylogenetic trees. The project is based on Chen’s classical FPT branching algorithm and extends it with the Split-or-Decompose technique introduced by Mestel et al. (2024)

Implementation of lower and upper bound approximation algorithms for an NP-hard problem, with heuristics (Greedy, Layout) and metaheuristics (Genetic Algorithm, Simulated Annealing) to balance solution quality and efficiency