A Java solution to Yodle's Juggling Programming Puzzle

MentorMatching involves matching undergraduate students working on a project with a mentor from the industry with related experience. Bigs and Littles involves matching incoming Boston University freshmen to sophomores, juniors and seniors with related interests.

In this project are implemented algorithms for the solution of the MST, Stable Marriage and Coin Change problems.

Design and Analysis of Algorithms

Algorithm based C++ codes. Codes includes missionary and cannibal, 8 queens, Tower of Hanoi and other algorithm based coding.

Stable matching problem applied to teachers-schools allocation problem.

Determining whether the given matching for the instance is stable or not.

Refined the Gale-Shapley algorithm by recalculating stable matchings in bipartite graphs, incorporating dynamic updates for edge deletions, achieving O(N) time complexity for edge deletions, enhancing computational efficiency.

This is the repository for the code of my Computer Science bachelor's degree final paper.

This respository contains an extension to the Gale-Shapley algorithm. The extension was presented in the paper "Safety, Stability, and Efficiency of Taxi Rides" authored by Martin Aleksandrov and Tobias Labarta, and accepted for publication at the 22nd EPIA Conference on Artificial Intelligence, 5-8 September 2023, Horta, Portugal.

Here I'm posting few C++ projects which are done based on backtracking, OOP, pointers etc. These projects were done mainly focusing on solving assignment questions of Professor Jerry Waxman's CSCI-211 - Object Oriented Programming in C++ course at CUNY QC. Posting Dr. Waxman's questions, my codes & report for those assignments & their algorithms

Information system of graph, actors, allocations of actors on the graph, generates an optimal allocation, evaluates its metrics, finds shortest path for an actor from one vertex to another

The Process of College Selection Using Stable Matching Algorithm

Simple Implementation of the Stable Marriage Algorithm by Gale-Shapley

This is a Stable matching program that will take N men and N women and match them using the Gale–Shapley algorithm. This program runs in O(n^2) time.

Design by Contract mechanisms in Eiffel

SMP, Gale-Shapley algorithm

1º trabalho prático de algoritmos I, 2021/2

This system allocates students to supervisors based on their area of interest. The allocation algorithm is a custom extension of Gale Shapely's Stable Marriage Algorithm. It is a web application built using Django

Multi-preference project allocation for the students by using a customized Gale-Shapley algorithm