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.
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.
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.
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.
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.
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.
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.
Token Swapping
Explore token swapping algorithms and their applications in graph theory with insights from Anna Lubiw of the University of Waterloo.
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.