Search results
From MaRDI portal
- enumeration 2024-04-02 Paper Neighbourhood complexity of graphs of bounded twin-width 2023-10-25 Paper Bounds and extremal graphs for total dominating identifying...10 bytes (16 words) - 17:59, 24 September 2023
- Paper Counting cliques in 1-planar graphs 2022-12-28 Paper Bounds for the Twin-Width of Graphs 2022-10-06 Paper Obstructions for Bounded Branch-depth in Matroids...10 bytes (16 words) - 19:34, 24 September 2023
- factors in graphs with given minimum degree 2023-02-21 Paper Bounds for the Twin-Width of Graphs 2022-10-06 Paper Conditional quantile analysis for realized...10 bytes (16 words) - 16:18, 10 December 2023
- Date of Publication Type Grouped domination parameterized by vertex cover, twin cover, and beyond 2024-04-04 Paper Winner determination algorithms for graph...10 bytes (16 words) - 19:28, 6 October 2023
- 2015-06-10 Paper On palindromic width of certain extensions and quotients of free nilpotent groups 2014-10-15 Paper Palindromic width of free nilpotent groups...10 bytes (17 words) - 11:52, 6 October 2023
- graphs 2024-02-20 Paper Neighbourhood complexity of graphs of bounded twin-width 2023-10-25 Paper On three domination-based identification problems in...10 bytes (16 words) - 12:19, 7 October 2023
- de/entity/Q6065423 2023-11-14 Paper Neighbourhood complexity of graphs of bounded twin-width 2023-10-25 Paper Parameterizing path partitions 2023-10-04 Paper Bounds...10 bytes (16 words) - 13:43, 7 October 2023
- https://portal.mardi4nfdi.de/entity/Q6075967 2023-09-20 Paper Graphs of bounded twin-width are quasi-polynomially \(\chi \)-bounded 2023-05-02 Paper Bounds on half...10 bytes (16 words) - 12:30, 24 September 2023
- Publication Date of Publication Type Twin-width IV: ordered graphs and matrices 2023-12-08 Paper https://portal.mardi4nfdi.de/entity/Q5094127 2022-08-02...10 bytes (16 words) - 10:06, 7 October 2023
- Date of Publication Type Grouped domination parameterized by vertex cover, twin cover, and beyond 2024-04-04 Paper Winner determination algorithms for graph...10 bytes (16 words) - 17:02, 24 September 2023
- Publication Date of Publication Type Twin-width IV: ordered graphs and matrices 2023-12-08 Paper NIP ω$\omega$‐categorical structures: The rank 1 case...10 bytes (17 words) - 11:38, 7 October 2023
- realistic cardiac electrophysiological outputs 2024-04-17 Paper A digital twin framework for civil engineering structures 2024-03-25 Paper Projection-based...10 bytes (17 words) - 11:34, 11 December 2023
- affine varieties with infinitely many real forms 2022-04-04 Paper Bracket width of simple Lie algebras 2021-11-04 Paper Equivariant extensions of $\mathbb{G}_a$-torsors...10 bytes (16 words) - 15:40, 6 October 2023
- and topological minors in tournaments 2023-05-30 Paper Graphs of bounded twin-width are quasi-polynomially \(\chi \)-bounded 2023-05-02 Paper Subexponential...10 bytes (17 words) - 02:52, 7 October 2023
- separations: in graphs, matroids, and beyond 2019-05-23 Paper Connected tree-width 2018-07-23 Paper Abstract separation systems 2018-04-10 Paper Tree sets 2018-04-10...10 bytes (17 words) - 09:07, 9 December 2023
- 2023-10-04 Paper Constant Congestion Brambles 2023-05-30 Paper Bounding twin-width for bounded-treewidth graphs, planar graphs, and bipartite graphs 2023-05-05...10 bytes (18 words) - 09:05, 7 October 2023
- and the domino problem on self-similar graphs 2023-04-04 Paper Commutator width in the first Grigorchuk group 2022-11-28 Paper https://portal.mardi4nfdi...10 bytes (16 words) - 10:44, 7 October 2023
- Contact Problem for Dissimilar Elastic Semi-Infinite Strips of Different Widths 1977-01-01 Paper The plane solution for bending of joined dissimilar elastic...10 bytes (19 words) - 09:35, 9 December 2023
- Planar Laman Graphs 2019-05-15 Paper The queue-number of posets of bounded width or height 2019-02-15 Paper Chromatic number of ordered graphs with forbidden...10 bytes (16 words) - 06:13, 25 September 2023
- Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width 2018-02-13 Paper A parameterized complexity view on non-preemptively scheduling...10 bytes (19 words) - 09:17, 25 September 2023
