Find link

language:

Find link is a tool written by Edward Betts.

searching for Algorithms and Combinatorics 119 found (127 total)

alternate case: algorithms and Combinatorics

Kristina Vušković (301 words) [view diff] exact match in snippet view article find links to article

computer scientist working in graph theory. She is Professor in Algorithms and Combinatorics in the School of Computing at the University of Leeds, and a

Ron Rivest (1,533 words) [view diff] case mismatch in snippet view article find links to article

and computer scientist whose work has spanned the fields of algorithms and combinatorics, cryptography, machine learning, and election integrity. He is

Alexander Schrijver (872 words) [view diff] exact match in snippet view article find links to article

(1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag, Berlin, doi:10.1007/978-3-642-78240-4

Jaroslav Nešetřil (728 words) [view diff] exact match in snippet view article find links to article

Patrice (2012). Sparsity - Graphs, Structures, and Algorithms (Algorithms and Combinatorics, Vol. 28). Springer. ISBN 978-3-642-27874-7. Nešetřil, Jaroslav;

ACM SIGACT (398 words) [view diff] exact match in snippet view article find links to article

Workshop on Algorithms and Experiments ANALCO: Workshop on Analytic Algorithms and Combinatorics SPAA: ACM Symposium on Parallelism in Algorithms and Architectures

János Pach (1,297 words) [view diff] exact match in snippet view article find links to article

(1993), New Trends in Discrete and Computational Geometry, Algorithms and Combinatorics, vol. 10, Springer-Verlag, ISBN 978-3-540-55713-5. Pach, János;

Digital topology (874 words) [view diff] exact match in snippet view article find links to article

Objects, and Functions in Zn{\displaystyle \mathbb {Z} ^{n}}. Algorithms and Combinatorics. Vol. 11. Berlin: Springer-Verlag. doi:10.1007/978-3-642-46779-0

Core (graph theory) (399 words) [view diff] exact match in snippet view article

"Proposition 3.5", Sparsity: Graphs, Structures, and Algorithms, Algorithms and Combinatorics, vol. 28, Heidelberg: Springer, p. 43, doi:10.1007/978-3-642-27875-4

Probabilistic analysis of algorithms (303 words) [view diff] exact match in snippet view article find links to article

Probabilistic Methods for Algorithmic Discrete Mathematics, Algorithms and Combinatorics, vol. 16, Springer, pp. 36–92, doi:10.1007/978-3-662-12788-9_2

Orientation (graph theory) (960 words) [view diff] exact match in snippet view article

"Theorem 3.13", Sparsity: Graphs, Structures, and Algorithms, Algorithms and Combinatorics, vol. 28, Heidelberg: Springer, p. 42, doi:10.1007/978-3-642-27875-4

Geometry of numbers (1,023 words) [view diff] exact match in snippet view article find links to article

(1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag, Berlin, doi:10.1007/978-3-642-78240-4

Discrepancy theory (423 words) [view diff] case mismatch in snippet view article find links to article

ISBN 0-521-77093-9. Matousek, Jiri (1999). Geometric Discrepancy: An Illustrated Guide. Algorithms and combinatorics. Vol. 18. Berlin: Springer. ISBN 3-540-65528-X.

Graph property (1,170 words) [view diff] exact match in snippet view article find links to article

Graph Parameters", Sparsity: Graphs, Structures, and Algorithms, Algorithms and Combinatorics, vol. 28, Springer, pp. 54–56, doi:10.1007/978-3-642-27875-4

Cut (graph theory) (1,132 words) [view diff] exact match in snippet view article

Gomory–Hu Trees", Combinatorial Optimization: Theory and Algorithms, Algorithms and Combinatorics, vol. 21, Springer, pp. 180–186, ISBN 978-3-540-71844-4.

John ellipsoid (892 words) [view diff] exact match in snippet view article find links to article

(1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag, Berlin, doi:10.1007/978-3-642-78240-4

Approximation error (1,153 words) [view diff] exact match in snippet view article find links to article

(1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag, Berlin, doi:10.1007/978-3-642-78240-4

Comparability graph (1,383 words) [view diff] exact match in snippet view article find links to article

Reed, Bruce A.; Sales, Cláudia L. (eds.), Recent Advances in Algorithms and Combinatorics, CMS Books in Mathematics, vol. 11, Springer-Verlag, pp. 65–84

Continuous knapsack problem (504 words) [view diff] exact match in snippet view article find links to article

Median", Combinatorial Optimization: Theory and Algorithms, Algorithms and Combinatorics, vol. 21, Springer, pp. 459–461, ISBN 9783642244889. Dantzig

Line perfect graph (300 words) [view diff] exact match in snippet view article find links to article

(1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag, Berlin, doi:10.1007/978-3-642-78240-4

Mirsky's theorem (1,115 words) [view diff] exact match in snippet view article find links to article

"Theorem 3.13", Sparsity: Graphs, Structures, and Algorithms, Algorithms and Combinatorics, vol. 28, Heidelberg: Springer, p. 42, doi:10.1007/978-3-642-27875-4

Dual matroid (946 words) [view diff] exact match in snippet view article find links to article

Polyhedra and Efficiency. Vol. B: Matroids, Trees, Stable Sets, Algorithms and Combinatorics, vol. 24, Berlin: Springer-Verlag, p. 652, ISBN 3-540-44389-4

Almost surely (1,423 words) [view diff] exact match in snippet view article find links to article

Two Starting Examples". The Strange Logic of Random Graphs. Algorithms and Combinatorics. Vol. 22. Springer. p. 4. ISBN 978-3540416548. Rogers, L. C.

Dense graph (1,165 words) [view diff] exact match in snippet view article find links to article

Patrice (2012), Sparsity: Graphs, Structures, and Algorithms, Algorithms and Combinatorics, vol. 28, Heidelberg: Springer, doi:10.1007/978-3-642-27875-4

Bounded expansion (982 words) [view diff] exact match in snippet view article find links to article

Bounded Expansion", Sparsity: Graphs, Structures, and Algorithms, Algorithms and Combinatorics, vol. 28, Springer, pp. 104–107, doi:10.1007/978-3-642-27875-4

Bruce Reed (mathematician) (487 words) [view diff] exact match in snippet view article

Reed, Bruce (2002), Graph Colouring and the Probabilistic Method, Algorithms and Combinatorics, vol. 23, Berlin: Springer-Verlag, ISBN 978-3-540-42139-9.

Dinic's algorithm (1,624 words) [view diff] exact match in snippet view article find links to article

Algorithm". Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics, 21). Springer Berlin Heidelberg. pp. 174–176. ISBN 978-3-540-71844-4

Conflict-free coloring (554 words) [view diff] exact match in snippet view article find links to article

and Computational Geometry: The Goodman-Pollack Festschrift, Algorithms and Combinatorics, vol. 25, Berlin, Heidelberg: Springer, pp. 665–671, doi:10

Mohammad Hajiaghayi (588 words) [view diff] exact match in snippet view article find links to article

Logic". 2013. "FOCS 2013 Workshop on Bidimensional Structures: Algorithms and Combinatorics". 2013. "CS Team Wins Award at ACM ICPC Finals". 2013. 2011 Young

Shallow minor (851 words) [view diff] exact match in snippet view article find links to article

Patrice (2012), Sparsity: Graphs, Structures, and Algorithms, Algorithms and Combinatorics, vol. 28, Springer, doi:10.1007/978-3-642-27875-4, ISBN 978-3-642-27874-7

Perfectly orderable graph (1,149 words) [view diff] exact match in snippet view article find links to article

Reed, Bruce A.; Sales, Cláudia L. (eds.), Recent Advances in Algorithms and Combinatorics, CMS Books in Mathematics, vol. 11, Springer-Verlag, pp. 65–84

W. G. Brown (403 words) [view diff] exact match in snippet view article find links to article

Dedicated to Jarik Nešetřil on the occasion of his 60th birthday, Algorithms and Combinatorics, vol. 26, Berlin: Springer, pp. 247–278, doi:10.1007/3-540-33700-8_16

Grötzsch's theorem (1,145 words) [view diff] exact match in snippet view article find links to article

Mendez, Patrice (2012), "2.5 Homomorphism Dualities", Sparsity, Algorithms and Combinatorics, vol. 28, Heidelberg: Springer, pp. 15–16, doi:10.1007/978-3-642-27875-4

Dual polyhedron (2,221 words) [view diff] exact match in snippet view article find links to article

and Computational Geometry: The Goodman–Pollack Festschrift, Algorithms and Combinatorics, vol. 25, Berlin: Springer, pp. 461–488, CiteSeerX 10.1.1.102

Pointed set (1,046 words) [view diff] exact match in snippet view article find links to article

Bernhard; Lovász, László; Schrader, Rainer (1991), Greedoids, Algorithms and Combinatorics, vol. 4, New York, Berlin: Springer-Verlag, chapter 3, ISBN 3-540-18190-3

Martin Grötschel (994 words) [view diff] exact match in snippet view article find links to article

(1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag, Berlin, doi:10.1007/978-3-642-78240-4

Almost all (2,559 words) [view diff] exact match in snippet view article find links to article

Spencer, Joel (9 August 2001). The Strange Logic of Random Graphs. Algorithms and Combinatorics. Vol. 22. Springer. pp. 3–4. ISBN 978-3-540-41654-8. Bollobás

Richard M. Pollack (827 words) [view diff] exact match in snippet view article find links to article

and Computational Geometry: The Goodman-Pollack Festschrift. Algorithms and Combinatorics. Springer. 2003. ISBN 9783540003717. List of Fellows of the American

Maria Hasse (594 words) [view diff] exact match in snippet view article find links to article

"Theorem 3.13", Sparsity: Graphs, Structures, and Algorithms, Algorithms and Combinatorics, vol. 28, Heidelberg: Springer, p. 42, doi:10.1007/978-3-642-27875-4

Behrend's theorem (756 words) [view diff] exact match in snippet view article find links to article

Nešetřil, Jaroslav (eds.), The mathematics of Paul Erdős, I, Algorithms and Combinatorics, vol. 13 (2nd ed.), Berlin: Springer, pp. 221–232, doi:10

Burnside ring (1,143 words) [view diff] exact match in snippet view article find links to article

1007/BF01110213 Kerber, Adalbert (1999), Applied finite group actions, Algorithms and Combinatorics, vol. 19 (2nd ed.), Berlin, New York: Springer-Verlag, ISBN 978-3-540-65941-9

Combinatorial optimization (1,882 words) [view diff] exact match in snippet view article find links to article

(2003). Combinatorial Optimization: Polyhedra and Efficiency. Algorithms and Combinatorics. Vol. 24. Springer. ISBN 9783540443896. Schrijver, Alexander

Graham scan (1,714 words) [view diff] exact match in snippet view article find links to article

and Computational Geometry: The Goodman-Pollack Festschrift. Algorithms and Combinatorics. Vol. 25. Berlin: Springer. pp. 139–156. doi:10.1007/978-3-642-55566-4_6

Tardos function (447 words) [view diff] exact match in snippet view article find links to article

(2012), Boolean Function Complexity: Advances and Frontiers, Algorithms and Combinatorics, vol. 27, Springer, p. 272, ISBN 9783642245084 Grötschel, M.;

Tardos function (447 words) [view diff] exact match in snippet view article find links to article

(2012), Boolean Function Complexity: Advances and Frontiers, Algorithms and Combinatorics, vol. 27, Springer, p. 272, ISBN 9783642245084 Grötschel, M.;

Corners theorem (1,022 words) [view diff] exact match in snippet view article find links to article

János; et al. (eds.). Discrete and computational geometry. Algorithms and Combinatorics. Vol. 25. Berlin: Springer-Verlag. pp. 825–827. doi:10

Subgraph isomorphism problem (1,851 words) [view diff] exact match in snippet view article find links to article

Boolean queries", Sparsity: Graphs, Structures, and Algorithms, Algorithms and Combinatorics, vol. 28, Springer, pp. 400–401, doi:10.1007/978-3-642-27875-4

Hermite normal form (1,736 words) [view diff] exact match in snippet view article find links to article

(1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag, Berlin, doi:10.1007/978-3-642-78240-4

László Lovász (1,323 words) [view diff] exact match in snippet view article find links to article

(1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag, Berlin, doi:10.1007/978-3-642-78240-4

Induced path (1,486 words) [view diff] exact match in snippet view article find links to article

and tree-depth". Sparsity: Graphs, Structures, and Algorithms. Algorithms and Combinatorics. Vol. 28. Heidelberg: Springer. pp. 115–144. doi:10.1007/978-3-642-27875-4

Gammoid (1,433 words) [view diff] exact match in snippet view article find links to article

Polyhedra and Efficiency. Vol. B: Matroids, Trees, Stable Sets, Algorithms and Combinatorics, vol. 24, Berlin: Springer-Verlag, pp. 659–661, ISBN 3-540-44389-4

Chordal graph (2,164 words) [view diff] exact match in snippet view article find links to article

Reed, Bruce A.; Sales, Cláudia L. (eds.), Recent Advances in Algorithms and Combinatorics, CMS Books in Mathematics, vol. 11, Springer-Verlag, pp. 65–84

Acyclic orientation (1,068 words) [view diff] exact match in snippet view article find links to article

"Theorem 3.13", Sparsity: Graphs, Structures, and Algorithms, Algorithms and Combinatorics, vol. 28, Heidelberg: Springer, p. 42, doi:10.1007/978-3-642-27875-4

Greedoid (1,721 words) [view diff] exact match in snippet view article find links to article

Bernhard; Lovász, László; Schrader, Rainer (1991), Greedoids, Algorithms and Combinatorics, vol. 4, New York, Berlin: Springer-Verlag, ISBN 3-540-18190-3

Erdős–Faber–Lovász conjecture (1,563 words) [view diff] exact match in snippet view article find links to article

Matchings, Covers and Colorings", The Mathematics of Paul Erdös I, Algorithms and Combinatorics, vol. 13, Springer Berlin Heidelber, pp. 345–371, doi:10

Michel Deza (1,298 words) [view diff] exact match in snippet view article find links to article

Deza, M.; Laurent, M. (1997), Geometry of cuts and metrics, Algorithms and Combinatorics, vol. 15, Springer, doi:10.1007/978-3-642-04295-9, ISBN 3-540-61611-X

Klee–Minty cube (1,565 words) [view diff] exact match in snippet view article find links to article

Karl-Heinz (1987). The simplex method: A probabilistic analysis. Algorithms and Combinatorics (Study and Research Texts). Vol. 1. Berlin: Springer-Verlag.

Felix Behrend (880 words) [view diff] exact match in snippet view article find links to article

Nešetřil, Jaroslav (eds.), The mathematics of Paul Erdős, I, Algorithms and Combinatorics, vol. 13 (2nd ed.), Berlin: Springer, pp. 221–232, doi:10

Dilworth's theorem (2,369 words) [view diff] exact match in snippet view article find links to article

"Theorem 3.13", Sparsity: Graphs, Structures, and Algorithms, Algorithms and Combinatorics, vol. 28, Heidelberg: Springer, p. 42, doi:10.1007/978-3-642-27875-4

Universal graph (865 words) [view diff] exact match in snippet view article find links to article

Hans Jürgen; et al. (eds.). Paths, Flows, and VLSI-Layout. Algorithms and Combinatorics. Vol. 9. Springer-Verlag. pp. 17–34. ISBN 978-0-387-52685-0.

Polyhedron (9,737 words) [view diff] exact match in snippet view article find links to article

and Computational Geometry: The Goodman–Pollack Festschrift, Algorithms and Combinatorics, vol. 25, Berlin: Springer, pp. 461–488, CiteSeerX 10.1.1.102

Logic of graphs (4,985 words) [view diff] exact match in snippet view article find links to article

Patrice (2012), Sparsity: Graphs, Structures, and Algorithms, Algorithms and Combinatorics, vol. 28, Springer-Verlag, doi:10.1007/978-3-642-27875-4,

Longest path problem (2,662 words) [view diff] exact match in snippet view article find links to article

Combinatorial Optimization: Polyhedra and Efficiency, Volume 1, Algorithms and Combinatorics, vol. 24, Springer, p. 114, ISBN 9783540443896. Cormen, Thomas

Blossom algorithm (2,021 words) [view diff] exact match in snippet view article find links to article

(2003). Combinatorial Optimization: Polyhedra and Efficiency. Algorithms and Combinatorics. Berlin Heidelberg: Springer-Verlag. ISBN 9783540443896. Lovász

Gallai–Hasse–Roy–Vitaver theorem (1,643 words) [view diff] exact match in snippet view article find links to article

Homomorphisms", Sparsity: Graphs, Structures, and Algorithms, Algorithms and Combinatorics, vol. 28, Heidelberg: Springer, pp. 39–46, doi:10.1007/978-3-642-27875-4

1105 (number) (667 words) [view diff] exact match in snippet view article

Nešetřil, Jaroslav (eds.). The mathematics of Paul Erdős, I. Algorithms and Combinatorics. Vol. 13. Berlin: Springer. pp. 268–275. doi:10.1007/978-3-642-60408-9_21

Erdős–Dushnik–Miller theorem (659 words) [view diff] exact match in snippet view article find links to article

"Paul Erdős' set theory", The mathematics of Paul Erdős, II, Algorithms and Combinatorics, vol. 14, Berlin: Springer, pp. 352–393, doi:10.1007/978-3-642-60406-5_33

Factor-critical graph (1,791 words) [view diff] exact match in snippet view article find links to article

Graphs", Combinatorial Optimization: Theory and Algorithms, Algorithms and Combinatorics, vol. 21 (4th ed.), Springer-Verlag, pp. 235–241, ISBN 978-3-540-71843-7

Criss-cross algorithm (2,432 words) [view diff] exact match in snippet view article find links to article

Karl-Heinz (1987). The simplex method: A probabilistic analysis. Algorithms and Combinatorics (Study and Research Texts). Vol. 1. Berlin: Springer-Verlag.

Ramsey's theorem (7,887 words) [view diff] exact match in snippet view article find links to article

Similarities and Differences", Mathematics of Ramsey Theory, Algorithms and Combinatorics, Berlin, Heidelberg: Springer, pp. 12–28, doi:10.1007/978-3-642-72905-8_2

Grundy number (1,355 words) [view diff] exact match in snippet view article find links to article

Boolean Queries", Sparsity: Graphs, Structures, and Algorithms, Algorithms and Combinatorics, vol. 28, Springer, pp. 400–401, doi:10.1007/978-3-642-27875-4

Queue number (2,706 words) [view diff] exact match in snippet view article find links to article

Patrice (2012), Sparsity: Graphs, Structures, and Algorithms, Algorithms and Combinatorics, vol. 28, Springer, doi:10.1007/978-3-642-27875-4, ISBN 978-3-642-27874-7

Hadwiger–Nelson problem (1,853 words) [view diff] exact match in snippet view article find links to article

Computational Geometry: The Goodman–Pollack Festschrift (PDF), Algorithms and Combinatorics, vol. 25, Berlin: Springer, pp. 695–698, doi:10.1007/978-3-642-55566-4_32

Independent set (graph theory) (3,553 words) [view diff] exact match in snippet view article

(1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag, Berlin, doi:10.1007/978-3-642-78240-4

Lovász number (2,120 words) [view diff] exact match in snippet view article find links to article

(1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag, Berlin, doi:10.1007/978-3-642-78240-4

Davenport–Erdős theorem (574 words) [view diff] exact match in snippet view article find links to article

cross-primitive sequences", The Mathematics of Paul Erdős, I, Algorithms and Combinatorics, vol. 13, Berlin: Springer, Theorem 1.11, p. 107, doi:10

Gram–Schmidt process (4,060 words) [view diff] exact match in snippet view article find links to article

(1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag, Berlin, doi:10.1007/978-3-642-78240-4

Weighted matroid (1,659 words) [view diff] exact match in snippet view article find links to article

(1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag, Berlin, doi:10.1007/978-3-642-78240-4

Smoothed analysis (1,720 words) [view diff] exact match in snippet view article find links to article

Karl-Heinz (1987), The Simplex Method: A Probabilistic Analysis, Algorithms and Combinatorics, vol. 1, Springer-Verlag, doi:10.1007/978-3-642-61578-8, ISBN 978-3-540-17096-9

Gomory–Hu tree (1,547 words) [view diff] exact match in snippet view article find links to article

Gomory–Hu Trees". Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics, 21). Springer Berlin Heidelberg. pp. 180–186. ISBN 978-3-540-71844-4

Ellipsoid method (3,656 words) [view diff] exact match in snippet view article find links to article

(1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag, Berlin, doi:10.1007/978-3-642-78240-4

Matching polytope (1,556 words) [view diff] exact match in snippet view article find links to article

(1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag, Berlin, doi:10.1007/978-3-642-78240-4

Separation oracle (1,623 words) [view diff] exact match in snippet view article find links to article

(1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag, Berlin, doi:10.1007/978-3-642-78240-4

Well-quasi-ordering (3,049 words) [view diff] exact match in snippet view article find links to article

"Lemma 6.13", Sparsity: Graphs, Structures, and Algorithms, Algorithms and Combinatorics, vol. 28, Heidelberg: Springer, p. 137, doi:10.1007/978-3-642-27875-4

Verifiable computing (1,887 words) [view diff] exact match in snippet view article find links to article

Modern Cryptography, Probabilistic Proofs and Pseudorandomness. Algorithms and Combinatorics series, 17, Springer J. Kilian (1992). "A note on efficient zero-knowledge

Gaussian elimination (4,219 words) [view diff] exact match in snippet view article find links to article

(1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag, Berlin, doi:10.1007/978-3-642-78240-4

Beckman–Quarles theorem (2,384 words) [view diff] exact match in snippet view article find links to article

Patrice (2012), Sparsity: Graphs, Structures, and Algorithms, Algorithms and Combinatorics, vol. 28, Heidelberg: Springer, p. 43, doi:10.1007/978-3-642-27875-4

Ellipsoid (5,809 words) [view diff] exact match in snippet view article find links to article

(1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag, Berlin, doi:10.1007/978-3-642-78240-4

Combinatorial species (2,905 words) [view diff] exact match in snippet view article find links to article

(1998). Kerber, Adalbert (1999), Applied finite group actions, Algorithms and Combinatorics, 19 (2nd ed.), Berlin, New York: Springer-Verlag, ISBN 978-3-540-65941-9

Graph minor (4,046 words) [view diff] exact match in snippet view article find links to article

Patrice (2012), Sparsity: Graphs, Structures, and Algorithms, Algorithms and Combinatorics, vol. 28, Springer, pp. 62–65, doi:10.1007/978-3-642-27875-4

Farkas' lemma (2,986 words) [view diff] exact match in snippet view article find links to article

(1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag, Berlin, doi:10.1007/978-3-642-78240-4

1-planar graph (2,716 words) [view diff] exact match in snippet view article find links to article

Patrice (2012), Sparsity: Graphs, Structures, and Algorithms, Algorithms and Combinatorics, vol. 28, Springer, Theorem 14.4, p. 321, doi:10.1007/978-3-642-27875-4

Upward planar drawing (2,316 words) [view diff] case mismatch in snippet view article find links to article

graphs in small area", Thirty Essays on Geometric Graph Theory, Algorithms and combinatorics, vol. 29, Springer, pp. 121–165, doi:10.1007/978-1-4614-0110-0_9

Trémaux tree (2,301 words) [view diff] exact match in snippet view article find links to article

and tree-depth", Sparsity: Graphs, Structures, and Algorithms, Algorithms and Combinatorics, vol. 28, Heidelberg: Springer, pp. 115–144, doi:10.1007/978-3-642-27875-4

Quantum refereed game (3,110 words) [view diff] exact match in snippet view article find links to article

(1988). Geometric Algorithms and Combinatorial Optimization. Algorithms and Combinatorics. Springer. ISBN 978-3-642-97883-8. Nesterov, Yurii; Nemirovskii

Simplex algorithm (6,160 words) [view diff] exact match in snippet view article find links to article

Karl-Heinz (1987). The simplex method: A probabilistic analysis. Algorithms and Combinatorics (Study and Research Texts). Vol. 1. Berlin: Springer-Verlag.

Diophantine approximation (4,058 words) [view diff] exact match in snippet view article find links to article

(1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag, Berlin, doi:10.1007/978-3-642-78240-4

Lovász–Woodall conjecture (995 words) [view diff] exact match in snippet view article find links to article

held at the University of Bonn, Bonn, June 20–July 1, 1988, Algorithms and Combinatorics, vol. 9, Berlin: Springer-Verlag, pp. 215–234, ISBN 3-540-52685-4

Strongly-polynomial time (1,011 words) [view diff] exact match in snippet view article find links to article

(1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag, Berlin, doi:10.1007/978-3-642-78240-4

Minimum spanning tree (5,421 words) [view diff] exact match in snippet view article find links to article

(1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag, Berlin, doi:10.1007/978-3-642-78240-4

Tree-depth (2,760 words) [view diff] exact match in snippet view article find links to article

and tree-depth", Sparsity: Graphs, Structures, and Algorithms, Algorithms and Combinatorics, vol. 28, Heidelberg: Springer, pp. 115–144, doi:10.1007/978-3-642-27875-4

Shortest path problem (4,092 words) [view diff] exact match in snippet view article find links to article

(2004). Combinatorial Optimization — Polyhedra and Efficiency. Algorithms and Combinatorics. Vol. 24. Springer. vol.A, sect.7.5b, p. 103. ISBN 978-3-540-20456-5

Polygonalization (2,744 words) [view diff] exact match in snippet view article find links to article

and Computational Geometry: The Goodman-Pollack Festschrift, Algorithms and Combinatorics, vol. 25, Berlin: Springer, pp. 139–156, doi:10.1007/978-3-642-55566-4_6

Linear programming (6,567 words) [view diff] exact match in snippet view article find links to article

Karl-Heinz (1987). The Simplex Algorithm: A Probabilistic Analysis. Algorithms and Combinatorics. Vol. 1. Springer-Verlag. (Average behavior on random problems)

Tree contraction (2,215 words) [view diff] exact match in snippet view article find links to article

and tree-depth", Sparsity: Graphs, Structures, and Algorithms, Algorithms and Combinatorics, vol. 28, Heidelberg: Springer, pp. 115–144, doi:10.1007/978-3-642-27875-4

Greedy coloring (3,873 words) [view diff] exact match in snippet view article find links to article

Reed, Bruce A.; Sales, Cláudia L. (eds.), Recent Advances in Algorithms and Combinatorics, CMS Books in Mathematics, vol. 11, Springer-Verlag, pp. 65–84

Turing machine (9,581 words) [view diff] exact match in snippet view article find links to article

(1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag, Berlin, doi:10.1007/978-3-642-78240-4

Hypergraph (6,289 words) [view diff] exact match in snippet view article find links to article

and Hypergraphs". Optimal Interconnection Trees in the Plane. Algorithms and Combinatorics. Vol. 29. Springer. pp. 301–317. doi:10.1007/978-3-319-13915-9_5

Metric space (11,077 words) [view diff] exact match in snippet view article find links to article

Marie; Laurent, Monique (1997), Geometry of Cuts and Metrics, Algorithms and Combinatorics, vol. 15, Springer-Verlag, Berlin, p. 27, doi:10.1007/978-3-642-04295-9

Graph coloring (7,842 words) [view diff] exact match in snippet view article find links to article

"Theorem 3.13", Sparsity: Graphs, Structures, and Algorithms, Algorithms and Combinatorics, vol. 28, Heidelberg: Springer, p. 42, doi:10.1007/978-3-642-27875-4

Matroid (8,673 words) [view diff] exact match in snippet view article find links to article

its Applications in Electric Network Theory and in Statics. Algorithms and Combinatorics. Vol. 6. Berlin, DE & Budapest, HU: Springer-Verlag and Akademiai

N-dimensional polyhedron (1,578 words) [view diff] exact match in snippet view article find links to article

(1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag, Berlin, doi:10.1007/978-3-642-78240-4

Arrangement of lines (5,913 words) [view diff] exact match in snippet view article find links to article

János (ed.), New Trends in Discrete and Computational Geometry, Algorithms and Combinatorics, vol. 10, Berlin: Springer, pp. 103–134, doi:10.1007/978-3-642-58043-7_6

Graph removal lemma (4,764 words) [view diff] exact match in snippet view article find links to article

generalization of Roth's theorem", Discrete and Computational Geometry, Algorithms and Combinatorics, 25: 825–827, doi:10.1007/978-3-642-55566-4_39, ISBN 978-3-642-62442-1

Bin packing problem (7,139 words) [view diff] exact match in snippet view article find links to article

"Bin-Packing". Combinatorial Optimization: Theory and Algorithms. Algorithms and Combinatorics 21. Springer. pp. 426–441. doi:10.1007/3-540-29297-7_18. ISBN 978-3-540-25684-7

Clique problem (9,876 words) [view diff] exact match in snippet view article find links to article

Graphs", Geometric Algorithms and Combinatorial Optimization, Algorithms and Combinatorics, vol. 2, Springer-Verlag, pp. 296–298, ISBN 0-387-13624-X. Gutin

Book embedding (8,017 words) [view diff] exact match in snippet view article find links to article

Patrice (2012), Sparsity: Graphs, Structures, and Algorithms, Algorithms and Combinatorics, vol. 28, Springer, pp. 321–328, doi:10.1007/978-3-642-27875-4

Fully polynomial-time approximation scheme (5,014 words) [view diff] exact match in snippet view article find links to article

(1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag, Berlin, doi:10.1007/978-3-642-78240-4

Planar separator theorem (9,917 words) [view diff] exact match in snippet view article find links to article

Hans Jürgen; et al. (eds.), Paths, Flows, and VLSI-Layout, Algorithms and Combinatorics, vol. 9, Springer-Verlag, pp. 17–34, ISBN 978-0-387-52685-0 Deĭneko

Algorithmic problems on convex sets (3,992 words) [view diff] exact match in snippet view article find links to article

(1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag, Berlin, doi:10.1007/978-3-642-78240-4