Combinatorial Algorithms Courses and Certifications

Fields Institute

Search for Combinatorial Objects Using Lattice Algorithms - Revisited

Explore advanced lattice algorithms for efficient combinatorial object searches, enhancing problem-solving techniques in discrete mathematics and computational geometry.

• YouTube
• 1 hour 8 minutes
• On-Demand
• Free Video

Fields Institute

Token Swapping

Explore token swapping algorithms and their applications in graph theory with insights from Anna Lubiw of the University of Waterloo.

• YouTube
• 1 hour 6 minutes
• On-Demand
• Free Video

Inside Livermore Lab

Algorithms and Applications of Edge-Colored Hypergraph Clustering

Explore edge-colored hypergraph clustering algorithms for categorizing individuals based on multiway interactions with categorical labels and their real-world applications.

• YouTube
• 1 hour
• On-Demand
• Free Video

CppNow

How to Design C++ Implementations of Complex Combinatorial Algorithms

Learn techniques for implementing complex combinatorial algorithms in C++, focusing on design patterns, data structures, and optimization strategies for efficient and maintainable code.

• YouTube
• 1 hour 22 minutes
• On-Demand
• Conference Talk

Comparing Genes, Proteins, and Genomes (Bioinformatics III)

138 ratings at Coursera

Explore genome comparison techniques, from aligning genes to analyzing large-scale mutations. Learn dynamic programming and combinatorial algorithms to study species evolution and genome fragility.

• Coursera
• 22 hours
• On-Demand
• Paid Course

Molecular Evolution (Bioinformatics IV)

79 ratings at Coursera

Explore evolutionary tree construction and proteomics to solve biological mysteries, from tracing virus origins to proving bird-dinosaur connections. Apply bioinformatics tools to reconstruct ebola evolutionary trees.

• Coursera
• 18 hours
• On-Demand
• Paid Course

Hausdorff Center for Mathematics

Combinatorial Polynomial Algorithms for Skew Bisubmodular Function Minimization

Explores combinatorial polynomial algorithms for skew-bisubmodular function minimization, extending previous work on bisubmodular functions and introducing new concepts in graph theory and optimization.

• YouTube
• 30 minutes
• On-Demand
• Free Video

IEEE

Approximation Algorithms for Stochastic Minimum Norm Combinatorial Optimization

Explore advanced techniques for solving stochastic minimum norm combinatorial optimization problems, focusing on approximation algorithms and their applications in complex decision-making scenarios.

• YouTube
• 22 minutes
• On-Demand
• Free Video

Institute for Pure & Applied Mathematics (IPAM)

How to Allow Deep Learning on Your Data Without Revealing Your Data

Exploring secure deep learning on private data without revealing it, discussing InstaHide and TextHide methods, their applications in Federated Learning, and addressing potential security concerns.

• YouTube
• 23 minutes
• On-Demand
• Free Video

Fields Institute

On the Oriented Coloring of the Disjoint Union of Graphs

Explore oriented graph coloring in disjoint unions, examining theoretical aspects and algorithmic implications in combinatorial algorithms.

• YouTube
• 30 minutes
• On-Demand
• Free Video

Fields Institute

Induced Subgraphs and Tree Decompositions

Explore induced subgraphs and tree decompositions in graph theory, focusing on their properties, applications, and recent advancements in combinatorial algorithms.

• YouTube
• 53 minutes
• On-Demand
• Free Video

Hausdorff Center for Mathematics

Face Structures of Tropical Polyhedra

Explore tropical polyhedra's face structures, focusing on monomial tropical polyhedra to overcome issues in classical definitions and investigate combinatorial properties.

• YouTube
• 29 minutes
• On-Demand
• Free Video

Fields Institute

Approximation Algorithms for Hitting Subgraphs

Explore approximation algorithms for hitting subgraphs, covering inapproximability, NP-hardness, and semi-symmetric cut vertices in this advanced combinatorial algorithms lecture.

• YouTube
• 29 minutes
• On-Demand
• Free Video

Fields Institute

Reconfiguring Simple ST Hamiltonian Paths in Rectangular Grid Graphs

Explore reconfiguration of Hamiltonian paths in grid graphs, focusing on algorithms, mechanisms, and structures for path transformation using switch pairs and zipping techniques.

• YouTube
• 22 minutes
• On-Demand
• Free Video

Fields Institute

Semisupervised Community Detection via Quasi-Stationary Distributions

Explore the mathematical foundations of community detection using quasi-stationary distributions in this advanced probabilistic analysis presentation by Michael Nisenzon.

• YouTube
• 26 minutes
• On-Demand
• Free Video