Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request
Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request
Academic Journal

Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory

Subjects: ddc:004; ddc:519; ddc:576

  • Source: Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak MA. Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph

Record details

×
Conference

3-manifold triangulations with small treewidth ; LIPIcs

Subjects: computational 3-manifold topology; fixed-parameter tractability; layered triangulations

  • Source: Huszár K, Spreer J. 3-manifold triangulations with small treewidth. In: 35th International Symposium on Computational Geometry . Vol 129. Schloss Dagstuhl - Leibniz-Zentrum für Informatik;

Record details

×
Academic Journal

Counting perfect matchings in Dirac hypergraphs

Subjects: ddc:510

  • Source: Kwan MA, Safavi Hemami R, Wang Y. Counting perfect matchings in Dirac hypergraphs. Combinatorica . 2026;46. doi: 10.1007/s00493-025-00194-8

Record details

×
Academic Journal

The exact rank of sparse random graphs

Subjects: ddc:510

  • Source: Glasgow M, Kwan MA, Sah A, Sawhney M. The exact rank of sparse random graphs. Journal of the European Mathematical Society . 2025. doi: 10.4171/jems/1692

Record details

×
Academic Journal

Maintaining diversity in structured populations

Subjects: ddc:000

  • Source: Brewster DA, Svoboda J, Roscow D, Chatterjee K, Tkadlec J, Nowak MA. Maintaining diversity in structured populations. PNAS Nexus . 2025;4(8). doi: 10.1093/pnasnexus/pgaf252

Record details

×
Academic Journal

The inertia bound is far from tight

Subjects: ddc:510

  • Source: Kwan MA, Wigderson Y. The inertia bound is far from tight. Bulletin of the London Mathematical Society . 2024;56(10):3196-3208. doi: 10.1112/blms.13127

Record details

×
Conference

Constructing Hamilton cycles and perfect matchings efficiently

Subjects: ddc:510

  • Source: Anastos M. Constructing Hamilton cycles and perfect matchings efficiently. In: Proceedings of the 12th European Conference on Combinatorics, Graph

Record details

×
Academic Journal

Diagrammatic Monte Carlo for electronic correlation in molecules: High-order many-body perturbation theory with low scaling

  • Source: Bighin G, Ho QP, Lemeshko M, Tscherbul TV. Diagrammatic Monte Carlo for electronic correlation in molecules: High-order many-body perturbation theory with low scaling.

Record details

×
Academic Journal

Computational design of planar multistable compliant structures

Subjects: multistability; mechanism; computational design

  • Source: Zhang R, Auzinger T, Bickel B. Computational design of planar multistable compliant structures. ACM Transactions on Graphics . 2021;40(5). doi: 10.1145/3453477

Record details

×
Academic Journal

Drawings of complete graphs in the projective plane

  • Source: Arroyo Guevara AM, Mcquillan D, Richter RB, Salazar G, Sullivan M. Drawings of complete graphs in the projective plane. Journal of Graph

Record details

×
  • 1-10 of  19 results for ""graph theory""