Search results

From MaRDI portal
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • Fixed-Parameter Tractability of Treewidth and Pathwidth 2012-09-05 Paper Kernel Bounds for Structural Parameterizations of Pathwidth 2012-08-14 Paper The Valve Location...
    10 bytes (19 words) - 07:47, 9 December 2023
  • tropical connected sets of minimum size 2017-05-11 Paper Treewidth and pathwidth parameterized by the vertex cover number 2016-11-24 Paper Injective colorings...
    10 bytes (16 words) - 11:54, 11 December 2023
  • directed pathwidth in \(O(1.89^n)\) time 2016-06-28 Paper On the Pathwidth of Almost Semicomplete Digraphs 2015-11-19 Paper Computing Directed Pathwidth in O(1...
    10 bytes (16 words) - 08:20, 7 October 2023
  • non-overlapping local alignments. 2004-03-14 Paper Pagenumber of pathwidth-\(k\) graphs and strong pathwidth-\(k\) graphs 2003-03-16 Paper A note on greedy algorithms...
    10 bytes (17 words) - 20:19, 8 December 2023
  • Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth 2017-06-16 Paper Bin Packing with Colocations 2017-04-04 Paper...
    10 bytes (16 words) - 23:31, 10 December 2023
  • Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth 2017-06-16 Paper Well-Balanced Designs for Data Placement 2016-05-24...
    10 bytes (16 words) - 14:29, 12 December 2023
  • Publication Type Computing directed pathwidth in \(O(1.89^n)\) time 2016-06-28 Paper Computing Directed Pathwidth in O(1.89 n ) Time 2013-01-07 Paper...
    10 bytes (16 words) - 08:20, 7 October 2023
  • Publication Type Computing directed pathwidth in \(O(1.89^n)\) time 2016-06-28 Paper Computing Directed Pathwidth in O(1.89 n ) Time 2013-01-07 Paper...
    10 bytes (16 words) - 08:20, 7 October 2023
  • the fault tolerance of the butterfly 2016-09-01 Paper Computing directed pathwidth in \(O(1.89^n)\) time 2016-06-28 Paper A faster fixed parameter algorithm...
    10 bytes (16 words) - 01:54, 9 December 2023
  • Publication Date of Publication Type Pagenumber of pathwidth-\(k\) graphs and strong pathwidth-\(k\) graphs 2003-03-16 Paper A note on greedy algorithms...
    10 bytes (16 words) - 21:45, 24 September 2023
  • reliability and 2-edge-connected reliability in linear time for bounded pathwidth graphs 2001-01-11 Paper https://portal.mardi4nfdi.de/entity/Q4251684 1999-06-17...
    10 bytes (16 words) - 18:05, 13 December 2023
  • Routing Schemes in Generalized Chordal Graphs 2010-02-24 Paper Computing Pathwidth Faster Than 2 n 2010-01-14 Paper Minimal interval completion through graph...
    10 bytes (17 words) - 02:32, 11 December 2023
  • Kernel for Pathwidth-One Vertex Deletion 2010-11-16 Paper A Parameterized Algorithm for Chordal Sandwich 2010-05-28 Paper Computing Pathwidth Faster Than...
    10 bytes (16 words) - 01:26, 11 December 2023
  • in Graphs with “few” Minimal Separators 2016-12-22 Paper Treewidth and pathwidth parameterized by the vertex cover number 2016-11-24 Paper An $$\mathcal...
    10 bytes (17 words) - 11:54, 11 December 2023
  • of bounded pathwidth/cliquewidth 2010-08-13 Paper On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth...
    10 bytes (16 words) - 11:02, 6 October 2023
  • de/entity/Q6089653 2023-11-13 Paper Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation 2023-03-22 Paper New Algorithms for Mixed...
    10 bytes (16 words) - 01:15, 25 September 2023
  • digraphs with bounded independence number 2014-11-21 Paper Tournament pathwidth and topological containment 2014-10-06 Paper Forbidden Induced Subgraphs...
    10 bytes (18 words) - 01:26, 12 December 2023
  • 2015-01-20 Paper 2-connecting outerplanar graphs without blowing up the pathwidth 2014-10-06 Paper On the Kernelization Complexity of String Problems 2014-09-26...
    10 bytes (16 words) - 16:38, 10 December 2023
  • 2020-04-06 Paper Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2 2019-05-21 Paper Classifying \(k\)-edge colouring for \(H\)-free...
    10 bytes (18 words) - 04:40, 12 December 2023
  • expressive power of permanents and perfect matchings of matrices of bounded pathwidth/cliquewidth 2010-08-13 Paper Partitions versus sets: a case of duality...
    10 bytes (16 words) - 04:01, 7 October 2023
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)