language:
Find link is a tool written by Edward Betts.searching for algorithms and Combinatorics 123 found (131 total)
alternate case: Algorithms and Combinatorics
Kristina Vušković
(310 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 aRon Rivest (1,543 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 isAlexander Schrijver (941 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-4Jaroslav Nešetřil (726 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;János Pach (1,299 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;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 ArchitecturesOctagonal tiling (403 words) [view diff] exact match in snippet view article find links to article
as My Polyhedra?" (PDF). Discrete and Computational Geometry. Algorithms and Combinatorics. Vol. 25. pp. 461–488. doi:10.1007/978-3-642-55566-4_21. ISBN 978-3-642-62442-1Core (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-4Digital topology (939 words) [view diff] exact match in snippet view article find links to article
Objects, and Functions in Z n {\displaystyle \mathbb {Z} ^{n}} . Algorithms and Combinatorics. Vol. 11. Berlin: Springer-Verlag. doi:10.1007/978-3-642-46779-0Probabilistic 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_2Discrepancy theory (459 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.Orientation (graph theory) (961 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-4Graph property (1,182 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-4Geometry of numbers (1,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-4Bruce Reed (mathematician) (499 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.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.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-4Continuous knapsack problem (518 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. DantzigComparability graph (1,398 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–84Mirsky's theorem (1,119 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-4Martin Grötschel (998 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-4Dual matroid (972 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-4John ellipsoid (968 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-4Almost surely (1,425 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.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-4Mohammad Hajiaghayi (597 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 YoungW. G. Brown (405 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_161105 (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_21Richard 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 AmericanMaria 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-4Shallow minor (857 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-7Dense graph (1,252 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-4Dinic's algorithm (1,693 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-4Conflict-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:10Combinatorial optimization (1,848 words) [view diff] exact match in snippet view article find links to article
Combinatorial Optimization: Polyhedra and Efficiency (PDF). Algorithms and Combinatorics. Vol. 24. Springer. ISBN 9783540443896. Schrijver, AlexanderHazel Perfect (805 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. 659, ISBN 3-540-44389-4Pointed set (1,029 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-3Dual polyhedron (2,276 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.102László Lovász (1,325 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-4Grötzsch's theorem (1,189 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-4Michel 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-XAlmost all (2,577 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ásPerfectly 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–84Burnside ring (1,174 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-9Behrend's theorem (784 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:10Graham scan (1,738 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_6Pseudotriangle (2,058 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, Springer-Verlag, pp. 699–736, arXiv:math.CO/0206027Felix 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:10Subgraph isomorphism problem (1,857 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-4Linear separability (1,625 words) [view diff] exact match in snippet view article find links to article
(2012). Boolean Function Complexity: Advances and Frontiers. Algorithms and Combinatorics. Berlin, Heidelberg: Springer Berlin Heidelberg. ISBN 978-3-642-24507-7Induced 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-4Corners theorem (1,060 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:10Chordal 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–84Greedoid (1,736 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-3Tardos function (449 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.;Acyclic orientation (1,081 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-4Gammoid (1,453 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-4Dilworth's theorem (2,445 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-4Hermite normal form (1,870 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-4Universal 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.Logic of graphs (5,029 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,Klee–Minty cube (1,613 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.Erdős–Faber–Lovász conjecture (1,617 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:10Blossom algorithm (2,022 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ászFactor-critical graph (1,801 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-7Approximation error (2,701 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-4Longest 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, ThomasCriss-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.Hadwiger–Nelson problem (1,860 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_32Polyhedron (10,656 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.102Lová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-4Well-quasi-ordering (3,050 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-4Independent set (graph theory) (3,564 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-4Grundy 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-4Ramsey's theorem (8,534 words) [view diff] exact match in snippet view article find links to article
Similarities and Differences", Mathematics of Ramsey Theory, Algorithms and Combinatorics, vol. 5, Berlin, Heidelberg: Springer, pp. 12–28, doi:10Queue number (2,715 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-7Weighted matroid (1,652 words) [view diff] exact match in snippet view article find links to article
(1993). Geometric algorithms and combinatorial optimization. Algorithms and Combinatorics. Vol. 2 (Second ed.). Springer-Verlag, Berlin. p. 212. doi:10Erdős–Dushnik–Miller theorem (677 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_33Smoothed analysis (1,727 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-9Matching polytope (1,552 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-4Gomory–Hu tree (1,553 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-4Separation oracle (1,626 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-4Verifiable 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-knowledgeEllipsoid method (3,704 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-4Beckman–Quarles theorem (2,473 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-4Davenport–Erdős theorem (638 words) [view diff] exact match in snippet view article find links to article
sequences: Theorem 1.11", The Mathematics of Paul Erdős, I, Algorithms and Combinatorics, vol. 13, Berlin: Springer, p. 107, doi:10.1007/978-3-642-60408-9_9Gram–Schmidt process (4,423 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-4Graph minor (4,045 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-4Gaussian elimination (4,369 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-4Upward planar drawing (2,328 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_9Ellipsoid (5,909 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-4Gallai–Hasse–Roy–Vitaver theorem (1,869 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-41-planar graph (2,757 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-4Farkas' lemma (3,003 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-4Trémaux tree (2,302 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-4Combinatorial species (2,937 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-9Lovász–Woodall conjecture (1,001 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-4Diophantine approximation (4,072 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-4Strongly-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-4Quantum refereed game (3,254 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; NemirovskiiTree-depth (2,817 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-4Simplex algorithm (6,261 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.Polygonalization (2,758 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_6Minimum spanning tree (5,460 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-4TC0 (4,920 words) [view diff] exact match in snippet view article find links to article
(2012). Boolean Function Complexity: Advances and Frontiers. Algorithms and Combinatorics. Berlin, Heidelberg: Springer Berlin Heidelberg. ISBN 978-3-642-24507-7Turing machine (9,386 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-4Tree 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-4Shortest path problem (4,790 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-5Linear programming (6,690 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)Greedy coloring (3,887 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–84Hypergraph (6,847 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_5Graph coloring (8,460 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-4Matroid (8,803 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 AkademiaiMetric space (11,429 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-9N-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-4Graph removal lemma (5,077 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-1Bin packing problem (7,098 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-7Clique problem (9,905 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. GutinBook embedding (8,167 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-4Arrangement of lines (6,723 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_6Fully polynomial-time approximation scheme (5,030 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-4Planar separator theorem (10,072 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ĭnekoAlgorithmic 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