Discrete Applied Mathematics and Combinatorial Optimization (ICDAMCO-27)

This track focuses on recent developments in graph theory, including new algorithms and applications. Participants are encouraged to present innovative approaches to classic problems and their implications in various fields.

This session invites contributions on the design and analysis of combinatorial algorithms. Emphasis will be placed on practical applications in optimization, network design, and data analysis.

This track explores various enumeration techniques used in discrete mathematics, including generating functions and combinatorial identities. Researchers are invited to share their findings on counting problems and their applications.

This session will delve into extremal combinatorics, focusing on the maximum or minimum size of a collection of finite objects. Contributions that bridge theory with practical applications are particularly welcome.

This track examines the structure and properties of ordered sets, including posets and lattices. Discussions will highlight their applications in computer science, optimization, and other areas.

This session emphasizes the interplay between algebra and combinatorics, showcasing algebraic methods used to solve combinatorial problems. Participants are encouraged to present novel approaches and results.

This track focuses on the application of topological techniques in combinatorial optimization problems. Researchers are invited to discuss how topology can provide insights into discrete structures and optimization challenges.

This session explores the use of probabilistic techniques in combinatorial problems, including random graphs and probabilistic counting. Contributions that demonstrate the effectiveness of these methods are highly encouraged.

This track investigates the intersection of combinatorics and number theory, focusing on problems related to integers and their properties. Researchers are invited to share their findings on combinatorial aspects of number theory.

This session highlights research in discrete geometry, including geometric combinatorics and computational geometry. Participants are encouraged to present applications in fields such as computer graphics and robotics.

This track focuses on Ramsey theory and its implications for combinatorial structures. Researchers are invited to discuss new results, techniques, and applications related to this area of study.