Live briefing
Everything about Algorithms and Combinatorics
Algorithms and Combinatorics is a book series in mathematics, and particularly in combinatorics and the design and analysis of algorithms. It is published by Springer Science+Business Media, and was founded in 1987. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Algorithms and CombinatoricsA 5-minute orientation
- Skim a recent paper: Local problems on grids from the perspective of distributed algorithms, finitary factors, and descriptive combinatoricsInfluential work since 2022
- Pick up a classic book: Combinatorial algorithmsThe most-reprinted book on the subject
- Read the landmark paper: Arrangements of curves in the plane—topology, combinatorics, and algorithmsCited 63 times
- Go sideways: Discrete geometryA closely related topic
- Go sideways: Outline of combinatoricsA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Arrangements of curves in the plane—topology, combinatorics, and algorithms
Repetitions in strings: Algorithms and combinatorics
Lines in space: Combinatorics and algorithms
Distributed algorithms, the Lovász Local Lemma, and descriptive combinatorics
ANALOGUE COMBINATORICS AND CELLULAR AUTOMATA—KEY ALGORITHMS AND LAY-OUT DESIGN
Probabilistic constructions in continuous combinatorics and a bridge to distributed algorithms
Combinatorics and Algorithms for Augmenting Graphs
RNA Secondary Structures with Given Motif Specification: Combinatorics and Algorithms
🆕 Influential since 2022
Local problems on grids from the perspective of distributed algorithms, finitary factors, and descriptive combinatorics
Descriptive Combinatorics and Distributed Algorithms
Mini-Workshop: Descriptive Combinatorics, LOCAL Algorithms and Random Processes
Combinatorics and Algorithms for Quasi-Chain Graphs
📚 Books worth reading
Combinatorial algorithmsDonald L. Kreher, Douglas R. Stinson · 1998
Graphs on surfaces and their applicationsS. K. Lando, Sergei K. Lando · 2003
Algebraic Complexity TheoryMichael Clausen · 2010
Mechanical theorem proving in geometriesWu, Wen-tsün., Went Sun Wu · 1994
Graph partitioning and graph clusteringGa.) DIMACS Implementation Challenge Workshop (10th 2012 Atlanta · 2013- 📕The game of cops and robbers on graphsAnthony Bonato · 2011
Some Tapas of Computer AlgebraArjeh M. Cohen · 1999
AsymptopiaJoel H. Spencer · 2014
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Discrete geometry Discrete geometry and combinatorial geometry are branches of geometry that study combinatorial properties and constructive methods of discrete geometric…
- Outline of combinatorics Combinatorics is a branch of mathematics concerning the study of finite or countable discrete structures. Matroid Greedoid Ramsey theory Van der Waerden's…
- László Lovász László Lovász (Hungarian: [ˈlovaːs ˈlaːsloː]; born March 9, 1948) is a Hungarian mathematician and professor emeritus at Eötvös Loránd University, best…
- Combinatorics Combinatorics is an area of mathematics primarily concerned with counting, both as a means and as an end to obtaining results, and certain properties of…
- Fulkerson Prize The Fulkerson Prize for outstanding papers in the area of discrete mathematics is sponsored jointly by the Mathematical Optimization Society (MOS) and…
- János Pach János Pach (born May 3, 1954) is a mathematician and computer scientist working in the fields of combinatorics and discrete and computational geometry…
- Jaroslav Nešetřil Jaroslav Nešetřil (Czech pronunciation: [ˈjaroslaf ˈnɛʃɛtr̝̊ɪl]; born 13 March 1946) is a Czech mathematician. His research areas include combinatorics…
- Alexander Schrijver Alexander (Lex) Schrijver (born 4 May 1948 in Amsterdam) is a Dutch mathematician and computer scientist, a professor of discrete mathematics and optimization…