Search the Conference Calendar
Browse by subject
Conference Management Software
Our Conference Management Software (COMS) can be used for online:
- paper submission
- review process
- paper selection
- production of the book of abstracts
Read more ...
Try our demo online
Meetings/Workshops on Graph Theory and Combinatorics in the United States (USA)
Conference-Service.com offers, as part of our business activities, a directory of upcoming scientific and technical meetings. The calendar is published for the convenience of conference participants and we strive to support conference organisers who need to publish their upcoming events.
Although great care is being taken to ensure the correctness of all entries, we cannot accept any liability that may arise from the presence, absence or incorrectness of any particular information on this website. Always check with the meeting organiser before making arrangements to participate in an event!
Meeting organisers can submit meetings free of charge for inclusion into the listing.
Select a location:
Australia (1) - Canada (3) - France (7) - Germany (2) - India (3) - Norway (1) - Poland (1) - United Kingdom (5) - United States (3) - ALL COUNTRIES (26)
|1.8th International Conference on Lattice Path Combinatorics & Applications|
| Dates ||17 Aug 2015 → 20 Aug 2015 |
| Location||Pomona, California, United States |
| Abstract ||8th International Conference on Lattice Path Combinatorics & Applications. Researchers from all over the world come and present their work relating to lattice path combinatorics. These conferences were originally founded and organized (with loving care) by Sri Gopal Mohanty. For the most part, talks are presented sequentially over a 3-4 day period.
Sometimes tutorial sessions and special workshops are included on the program. Participants include a nice mix of regulars from past conferences and new reseachers who are warmly welcomed as part of the family.|
| Topics ||Conference Topics to be covered include (but are not limited to): • Lattice path enumeration • Plane Partitions • Young tableaux • q-calculus • Orthogonal polynomials • Random walks • Nonparametric statistical inference • Discrete distributions and urn models • Queueing theory • Analysis of algorithms • Graph Theory and Applications • Self-dual codes and unimodular lattices • Bijections between paths and other combinatoric structures|
| Weblink ||http://www.csupomona.edu/~math/CONFERENCE/index.html|
| Contact ||Email: firstname.lastname@example.org|
| Related subject(s) ||Probability and Statistics, Game Theory; Applied Maths: Operational research|
| || |
|2.Algebraic Combinatorics and Applications|
| Dates ||26 Aug 2015 → 30 Aug 2015 |
| Location||Michigan Technological University, Houghton, United States |
| Abstract ||The goal of the conference is to bring together researchers and students interested in algebraic combinatorics and its applications to communications, classical and quantum error-correcting codes, cryptography, information security, computer science, finite geometry, combinatorial designs, graphs, and other related areas, in order to promote new linkages and collaborations.|
| Weblink ||http://www.math.mtu.edu/~tonchev/aca15.htm|
| Related subject(s) ||Algebra|
| || |
|3.SAT — International Conference on Theory and Applications of Satisfiability Testing|
| Dates ||24 Sep 2015 → 27 Sep 2015 |
| Location||Austin, United States |
| Abstract ||The International Conference on Theory and Applications of Satisfiability Testing (SAT) is the premier annual meeting for researchers focusing on the theory and applications of the propositional satisfiability problem, broadly construed. Aside from plain propositional satisfiability, the scope of the meeting includes Boolean optimization (including MaxSAT and Pseudo-Boolean (PB) constraints), Quantified Boolean Formulas (QBF), Satisfiability Modulo Theories (SMT), and Constraint Programming (CP) for problems with clear connections to Boolean-level reasoning. Many hard combinatorial problems can be tackled using SAT-based techniques, including problems that arise in Formal Verification, Artificial Intelligence, Operations Research, Computational Biology, Cryptology, Data Mining, Machine Learning, Mathematics, et cetera. Indeed, the theoretical and practical advances in SAT research over the past twenty years have contributed to making SAT technology an indispensable tool in a variety of domains. SAT invites scientific contributions addressing different aspects of SAT interpreted in a broad sense, including (but not restricted to) theoretical advances (including exact algorithms, proof complexity, and other complexity issues), practical search algorithms, knowledge compilation, implementation-level details of SAT solvers and SAT-based systems, problem encodings and reformulations, applications (including both novel applications domains and improvements to existing approaches), as well as case studies and reports on findings based on rigorous experimentation.|
| Weblink ||http://www.cs.utexas.edu/~marijn/sat15/|
| Related subject(s) ||Applied Mathematics (in general)|
| || |
View all listed conferences in the United States (USA).
Last updated: 15 May 2015