Search results

From MaRDI portal
View ( | ) (20 | 50 | 100 | 250 | 500)
  • Publication Type Covering edges in networks 2023-11-15 Paper Planar multifacility location problems with tree structure and finite dominating sets 2019-11-28 Paper...
    10 bytes (19 words) - 13:32, 8 December 2023
  • 3-colourable planar graphs 2017-07-28 Paper https://portal.mardi4nfdi.de/entity/Q2828893 2016-10-26 Paper On purely tree-colorable planar graphs 2016-05-10...
    10 bytes (18 words) - 21:37, 9 December 2023
  • classification 2018-08-20 Paper D 3-Tree: A Dynamic Deterministic Decentralized Structure 2015-11-19 Paper \(D^2\)-tree: a new overlay with deterministic...
    10 bytes (16 words) - 04:51, 12 December 2023
  • their relation to other Nearly Planar Graphs 2015-01-15 Paper Fitting Planar Graphs on Planar Maps 2015-01-13 Paper Planar Octilinear Drawings with One Bend...
    10 bytes (17 words) - 11:53, 11 December 2023
  • Paper Quasi-upward planar drawings with minimum curve complexity 2022-07-01 Paper Packing Trees into 1-planar Graphs 2022-06-28 Paper Planar drawings with few...
    10 bytes (19 words) - 16:15, 10 December 2023
  • multiplicity of planar Brownian motion: measures and local times 2018-09-19 Paper Scaling limit of the recurrent biased random walk on a Galton-Watson tree 2017-11-30...
    10 bytes (20 words) - 01:00, 10 December 2023
  • 1-Steiner tree problem 2021-04-21 Paper On the Area Requirements of Planar Greedy Drawings of Triconnected Planar Graphs 2020-03-01 Paper On planar greedy...
    10 bytes (16 words) - 19:21, 24 September 2023
  • vulnerable is an undirected planar graph with respect to max flow 2024-03-15 Paper Non-crossing shortest paths lengths in planar graphs in linear time 2024-02-14...
    10 bytes (18 words) - 15:23, 10 December 2023
  • space for the directed Steiner tree problem with limited number of diffusing nodes 2014-12-09 Paper Directed Steiner Tree with Branching Constraint 2014-09-26...
    10 bytes (16 words) - 12:43, 11 December 2023
  • coloring theorems on planar graphs 2014-03-25 Paper Peeling the Grid 2013-09-26 Paper The planar slope number of planar partial 3-trees of bounded degree...
    10 bytes (17 words) - 23:42, 10 December 2023
  • Bootstrapping two-loop Feynman integrals for planar \( \mathcal{N}=4 \) sYM 2018-11-22 Paper Pentagon functions for massless planar scattering amplitudes 2018-11-22...
    10 bytes (19 words) - 02:04, 10 December 2023
  • 2004-03-14 Paper Graph minors. XVI: Excluding a non-planar graph 2003-10-15 Paper Graph minors. XVIII: Tree-decompositions and well-quasi-ordering 2003-10-15...
    10 bytes (17 words) - 14:02, 8 December 2023
  • the path/tree-shaped facility location problems in trees 2009-10-23 Paper An optimal \(O(n\log n)\) algorithm for finding an enclosing planar rectilinear...
    10 bytes (16 words) - 15:36, 8 December 2023
  • embeddings of upward planar digraphs 2015-02-13 Paper Drawing Outer 1-planar Graphs with Few Slopes 2015-01-07 Paper Planar and Quasi Planar Simultaneous Geometric...
    10 bytes (17 words) - 18:14, 9 December 2023
  • Bounds for Graph Steiner Tree Approximation 2005-09-16 Paper Improved approximation algorithms for the quality of service multicast tree problem 2005-08-02 Paper...
    10 bytes (19 words) - 16:35, 12 December 2023
  • On the negative cost girth problem in planar networks 2015-11-17 Paper A new algorithm for the minimum spanning tree verification problem 2015-04-20 Paper...
    10 bytes (17 words) - 00:03, 10 December 2023
  • 2023-12-22 Paper Coloring the square of maximal Planar graphs with diameter two 2023-10-11 Paper Light edges in 1‐planar graphs 2023-10-05 Paper Local neighbor-distinguishing...
    10 bytes (17 words) - 00:34, 10 December 2023
  • in Graphs with Given Minimum Degree 2014-02-24 Paper Spanning tree congestion of planar graphs 2014-01-24 Paper On polar ovals in abelian projective planes...
    10 bytes (18 words) - 23:24, 10 December 2023
  • 2006-11-14 Paper A refined search tree technique for dominating set on planar graphs 2005-12-07 Paper Experimental evaluation of a tree decomposition-based algorithm...
    10 bytes (16 words) - 16:31, 8 December 2023
  • Triangulating planar graphs while minimizing the maximum degree 2022-12-09 Paper Testing superperfection of k-trees 2022-12-09 Paper Constructing tree decompositions...
    10 bytes (19 words) - 07:47, 9 December 2023
View ( | ) (20 | 50 | 100 | 250 | 500)