Algorithm for solving the Hamiltonian cycle problem deterministically and in linear time on all instances of discocube graphs (tested for graphs with over 8 billion vertices). Discocube graphs are 3-dimensional grid graphs derived from: a polycube of an octahedron | a Hauy construction of an octahedron with cubes as identical building blocks...

Scala library for solving NP-hard probems

With this project we researched, implemented and analyzed different algorithms to effectively and efficiently solve an NP-Complete problem such as the Minimum Vertex Cover (MVC).

Position-Candidate-Hypothesis (PCH) is a theoretical paradigm for structural-statistical analysis of NP-complete problems.

A Lean library for descriptive complexity: NP-completeness and the polynomial hierarchy by first-order reductions, stronger than polynomial-time (Karp) reductions. Machine-free Cook–Levin, all 21 Karp problems, on Mathlib's ModelTheory

Strip Packing Written in C++

An algorithm for solving the Hamiltonian cycle problem deterministically and in linear time on all instances of discocube graphs (tested for over graphs with 1 billion vertices).

The Milagro Experiment

Strip Packing Problem Visualizer

The Valiente Experiment

A verified constructive reduction of the Cook-Levin Theorem in Lean 4.

Solution au challenge de Winamax de 2016 hébergé sur la plateforme Codingame.

Semestrální práce KIV/PT - Programovací Techniky

Stanford Algorithms Courses in Coursera 課程筆記

Set of problems from the contents of Design and Analysis of Algorithms. Complexity Theory, Dynamic Programming, Greedy, Flow, Divide and Conquer

Minimal Hitting Set Solver with and without optimizations

This repository contains a collection of problems and their solutions for the subject Design and Analysis of Algorithms from the Computer Science degree

The Resistire Experiment

This repository contains the files related to the paper 'Using genetic algorithms for advertising campaigns', carried out by Álvaro Seco, Natalia López and Fernando Rubio.

Projects in Java and Python from class assignments