COMS

Calendar of upcoming scientific conferences

Home | Conference Management System | Conference Listings | Advertise | Contact | About
German French English
You are in: HomeConference ListingsMathematics → Graph Theory and Combinatorics in the United States (USA)

Conference Management Software

Our Conference Management Software (COMS) can be used for online:

  • registration
  • payment
  • 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.

1.24th British Combinatorial Conference
 Dates 30 Jun 2013 → 05 Jul 2013
[ID=497810] Go to top of page
 LocationEgham, United States
 Weblink http://www.ma.rhul.ac.uk/BCC24/
2.AIM Workshop: Generalizations of chip-firing and the critical group
 Dates 08 Jul 2013 → 12 Jul 2013
[ID=507834] Go to top of page
 LocationAmerican Institute of Mathematics, Palo Alto, United States
 Abstract This workshop, sponsored by AIM and the NSF, will center around the abelian sandpile model and related chip-firing games on graphs, including generalizations to higher dimension, abelian networks, and pattern formation.
 Weblink http://www.aimath.org/ARCC/workshops/chipfiring.html
3.APPROX'2013 — 16th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems
 Dates 21 Aug 2013 → 23 Aug 2013
[ID=533340] Go to top of page
 LocationBerkeley, California, United States
 Abstract APPROX'2013 focuses on algorithmic and complexity theoretic issues relevant to the development of efficient approximate solutions to computationally difficult problems.
 Weblink http://cui.unige.ch/tcs/random-approx/2013/index.php
 Related subject(s) Algorithms
  
4.ICERM Semester Program on "Network Science and Graph Algorithms"
 Dates 03 Feb 2014 → 09 May 2014
[ID=517191] Go to top of page
 LocationICERM, Providence, Rhode Island, United States
 Abstract The study of computational problems on graphs has long been a central area of research in computer science. However, recent years have seen qualitative changes in both the problems to be solved and the tools available to do so. Application areas such as computational biology, the web, social networks, and machine learning give rise to large graphs and complex statistical questions that demand new algorithmic ideas and computational models. At the same time, techniques such as semidefinite programming and combinatorial preconditioners have been emerging for addressing these challenges.
 Weblink http://icerm.brown.edu/sp-s14
 Related subject(s) Courses and Events for Math Students; Applied Maths: Complex Networks
  
5.ICERM Workshop: Semidefinite Programming and Graph Algorithms
 Dates 10 Feb 2014 → 14 Feb 2014
[ID=542036] Go to top of page
 LocationProvidence, United States
 Abstract Semidefinite programming is playing an ever increasing role in many areas of computer science and mathematics, including complexity theory, approximation algorithms for hard graph problems, discrete geometry, machine learning, and extremal combinatorics.

This workshop will bring together researchers from these different fields. The goal is to explore connections, learn and share techniques, and build bridges.

 Weblink http://icerm.brown.edu/sp-s14-w1
 Related subject(s) Courses and Events for Math Students
  
6.ICERM Workshop: Stochastic Graph Models
 Dates 17 Mar 2014 → 21 Mar 2014
[ID=542004] Go to top of page
 LocationProvidence, United States
 Abstract Random graphs, stochastic processes on graphs and algorithms for computations on these structures continue to play a dominant role in algorithmic research and discrete mathematics, with recent applications ranging from web search and recommendation engines to social networks and system biology.

This workshop will be an opportunity for researchers from diverse fields to get together and share problems and techniques for handling and analyzing graphs structures. The connections---mathematical, computational, and practical---that arise between these seemingly-diverse problems and approaches will be emphasized.

 Weblink http://icerm.brown.edu/sp-s14-w2
 Related subject(s) Courses and Events for Math Students
  
7.ICERM Workshop: Electrical Flows, Graph Laplacians, and Algorithms: Spectral Graph Theory and Beyond
 Dates 07 Apr 2014 → 11 Apr 2014
[ID=542027] Go to top of page
 LocationProvidence, United States
 Abstract Spectral graph theory, which studies how the eigenvalues and eigenvectors of the graph Laplacian (and other related matrices) interact with the combinatorial structure of a graph, is a classical tool in both the theory and practice of algorithm design. The success of this approach has been rooted in the efficiency with which eigenvalues and eigenvectors can be computed, and in the surprisingly large number of ways that a graph's properties are connected to the Laplacian's spectrum---particularly to the value of its second smallest eigenvalue, ?2.

However, while the eigenvalues and eigenvectors of the Laplacian capture a striking amount of the structure of the graph, they certainly do not capture all of it. Recent work in the field suggests that we have only scratched the surface of what can be done if we are willing to broaden our investigation to include more general linear-algebraic properties of the matrices we associate to graphs.

A particularly fruitful example of this has been the study of Laplacian linear systems, where the interplay between linear algebra and graph theory has led to progress in both fields. On the one hand, researchers have used the combinatorial structure of the corresponding graphs to facilitate the solution of these linear systems, resulting in solvers that run in nearly-linear time. On the other hand, one can use these linear systems to describe the behavior of electrical flows on a graph, which has provided a powerful new primitive for algorithmic graph theory. This interaction has already led to improved algorithmic results for many of the basic problems in algorithmic graph theory, including finding maximum flows and minimum cuts, solving traveling salesman problems, sampling random trees, sparsifying graphs, computing multicommodity flows, and approximately solving a wide range of general clustering and partitioning problems. In addition, researchers have recently shown how to exploit a wide range of other algebraic properties of matrices associated to graphs, such as the threshold rank, cut norm, sensitivity to perturbation, or hypercontractivity of the eigenspaces, to achieve impressive algorithmic results.

In this workshop, we will bring researchers together to study and advance this new emerging frontier in algorithmic graph theory.

 Weblink http://icerm.brown.edu/sp-s14-w3
 Related subject(s) Courses and Events for Math Students
  
8.FPSAC — 26th International Conference on Formal Power Series and Algebraic Combinatorics
 Dates 29 Jun 2014 → 03 Jul 2014
[ID=488398] Go to top of page
 LocationChicago, IL, United States
 Topics Topics include all aspects of combinatorics and their relations with other parts of mathematics, physics, computer science, and biology.
 Weblink https://sites.google.com/site/fpsac2014/
 Contact Bridget Tenner; Email: fpsac2014@gmail.com
  

View all listed conferences in the United States (USA).

Last updated: 13 March 2013