Conferences  >  Informatics  >  Algorithms and Data Structures  >  United States

Society for Industrial and Applied Mathematics (SIAM)

Society for Industrial and Applied Mathematics (SIAM)

Society for Industrial and Applied Mathematics (SIAM)

Institute for Computational and Experimental Research in Mathematics (ICERM), Brown University

Researchers working on graph algorithms use a broad range of different criteria for deciding what makes an algorithm efficient. While in theory the dominant benchmark is the asymptotic running time, in practice the story is more nuanced: an algorithm needs to be simple enough to be implementable, fast on graphs of bounded size, space efficient, cache-friendly, and easy to test. While many of these requirements motivate interesting algorithmic questions that are highly relevant in practice, they are often overlooked by the theory community. The goal of the workshop is to foster the exchange of ideas between researchers working on graph algorithms, which have high practical relevance. The workshop will include overview talks on the various perspectives, research talks, an open problem session, and structured time for collaboration.

ICERM Program Staff;     Phone: [+1 (401) 863-5030];     Email: info@icerm.brown.edu

graph algorithms, data science, networks

Graph Theory and Combinatorics,    Scientific Computing and Data Science

USENIX Association

SREcon is a gathering of engineers who care deeply about site reliability, systems engineering, and working with complex distributed systems at scale. Our purpose is to be inclusive as we bring together ideas representative of our diverse community, whether its members are focusing on a global scale, launching new products and ideas for a small business, or pivoting their approach to unite software and systems engineering. SREcon challenges both those new to the profession as well as those who have been involved in it for decades. The conference has a culture of critical thought, deep technical insights, continuous improvement, and innovation.

Software Engineering,    High Performance Computing, Supercomputing, Parallel Computing

MIP 2025 is supported by the Mixed Integer Programming Society (MIPS), which is a section of the Mathematical Optimization Society (MOS).

The Mixed Integer Programming (MIP) Workshop is a single-track workshop highlighting the latest trends in integer programming and discrete optimization, with speakers chosen by invitation. The 2025 edition of the workshop will be the twenty-second in the MIP series.

Optimization Theory, Operational Research,    Courses and Events for Math Students and Early Career Researchers

IPCO (Integer Programming and Combinatorial Optimization) is a conference that is sponsored by the Mathematical Programming Society. IPCO is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization. The aim is to present recent developments in theory, computation, and applications of integer programming and combinatorial optimization. The conference and summer school will take place at Johns Hopkins University in Baltimore, Maryland, USA.

Graph Theory and Combinatorics,    Courses and Events for Math Students and Early Career Researchers