Search results

From MaRDI portal
View ( | ) (20 | 50 | 100 | 250 | 500)
  • Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size 2023-10-31 Paper On the Advice Complexity of Online Edge- and Node-Deletion Problems...
    10 bytes (17 words) - 04:34, 9 December 2023
  • Eigenvalues of K1,k-Free Graphs and the Connectivity of Their Independence Complexes 2016-11-17 Paper Many \(T\) copies in \(H\)-free graphs 2016-10-14 Paper...
    10 bytes (17 words) - 19:58, 8 December 2023
  • claw-free graphs 2006-09-14 Paper https://portal.mardi4nfdi.de/entity/Q5714874 2005-12-16 Paper Hamilton connectivity of line graphs and claw‐free graphs...
    10 bytes (16 words) - 22:35, 8 December 2023
  • Random Graphs 2006-06-01 Paper \(H\)-free graphs of large minimum degree 2006-03-22 Paper MaxCut in ${\bm H)$-Free Graphs 2005-11-14 Paper Disjoint representability...
    10 bytes (17 words) - 10:55, 9 December 2023
  • Turán Problem and its Applications 2021-12-09 Paper Constructing dense grid-free linear $3$-graphs 2021-11-09 Paper On Erdős’s Method for Bounding the Partition...
    10 bytes (17 words) - 13:25, 6 October 2023
  • 2-connected deletion-minors of binary matroids 2013-12-02 Paper Strongly rigid tensegrity graphs on the line 2013-04-25 Paper Complex zero-free regions at...
    10 bytes (16 words) - 02:17, 10 December 2023
  • 3-domination critical graphs 2012-08-13 Paper Girth of \(\{C_3, \ldots, C_s\}\)-free extremal graphs 2012-05-30 Paper Restricted arc-connectivity of generalized...
    10 bytes (17 words) - 02:58, 10 December 2023
  • https://portal.mardi4nfdi.de/entity/Q5417619 2014-05-22 Paper On Switching to H‐Free Graphs 2014-05-22 Paper Determining the \(L(2,1)\)-span in polynomial space...
    10 bytes (17 words) - 13:39, 8 December 2023
  • Constraint Satisfaction 2023-01-09 Paper Parameterized complexity of envy-free resource allocation in social networks 2023-01-04 Paper https://portal.mardi4nfdi...
    10 bytes (17 words) - 02:43, 25 September 2023
  • Graphs 2011-08-17 Paper Scale‐free graphs of increasing degree 2011-08-09 Paper Random Walks with Look-Ahead in Scale-Free Random Graphs 2011-06-17 Paper...
    10 bytes (16 words) - 03:27, 10 December 2023
  • Paper Subpolynomial trace reconstruction for random strings and arbitrary deletion probability 2021-06-25 Paper Diagonal asymptotics for symmetric rational...
    10 bytes (17 words) - 19:36, 8 December 2023
  • Paper Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs 2019-09-02 Paper Metric embedding via shortest path decompositions...
    10 bytes (16 words) - 19:29, 11 December 2023
  • Preferential Attachment Model of Networks 2007-08-20 Paper Adversarial Deletion in a Scale-Free Random Graph Process 2007-07-30 Paper Product rule wins a competitive...
    10 bytes (19 words) - 17:12, 9 December 2023
  • allometric laws 2014-09-08 Paper On the rank of the intersection of free subgroups in virtually free groups. 2014-09-08 Paper On the space of players in idealized...
    10 bytes (16 words) - 12:14, 7 October 2023
  • relaxation time scheme 2018-11-13 Paper Corrigendum to ``Particle-free bodies and point-free spaces 2018-11-13 Paper Global existence of the classical solutions...
    10 bytes (15 words) - 16:16, 24 September 2023
  • allometric laws 2014-09-08 Paper On the rank of the intersection of free subgroups in virtually free groups. 2014-09-08 Paper On the space of players in idealized...
    10 bytes (15 words) - 12:42, 7 October 2023
  • \(\mathcal{F} \)-minor-free deletion, Sparse obstructions for minor-covering parameters, Quick but odd growth of cacti, Generalized Pseudoforest Deletion: Algorithms...
    15 bytes (373 words) - 16:00, 2 May 2024
  • kernelization dichotomy for structural parameterizations of \(\mathcal{F} \)-minor-free deletion, Kernelization of Two Path Searching Problems on Split Graphs, Approximate...
    15 bytes (397 words) - 15:25, 29 April 2024
  • chordal/distance-hereditary vertex deletion, A Turing kernelization dichotomy for structural parameterizations of \(\mathcal{F} \)-minor-free deletion, A polynomial kernel...
    15 bytes (168 words) - 16:15, 7 February 2024
  • kernelizationstructural parameterizationtreedepth modulator\(\mathcal{F}\)-minor free deletion Mathematics Subject Classification ID Algorithms in computer science...
    15 bytes (209 words) - 11:16, 8 February 2024
View ( | ) (20 | 50 | 100 | 250 | 500)