Search results
From MaRDI portal
- Cédric Bentz (section List of research outcomes)in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes 2014-12-09 Paper Directed Steiner Tree with Branching...10 bytes (16 words) - 12:43, 11 December 2023
- Raphael Yuster (section List of research outcomes)perfect separation dimension of complete and random graphs 2024-02-05 Paper Packing and Covering a Given Directed Graph in a Directed Graph 2024-01-10 Paper...10 bytes (17 words) - 11:59, 9 December 2023
- Anders Yeo (section List of research outcomes)Size of Maximum Independent Sets and Matchings in Hypergraphs of Rank Three 2013-03-07 Paper Partitioning the arcs of a digraph into a star forest of the...10 bytes (16 words) - 10:09, 8 December 2023
- Zsolt Tuza (section List of research outcomes)models of graph-bin packing 2016-07-05 Paper Circular coloring of graphs via linear programming and tabu search 2016-07-04 Paper Maximum number of colors...10 bytes (17 words) - 14:43, 8 December 2023
- Michael A. Henning (section List of research outcomes)number of graphs with minimum degree at least three 2021-12-13 Paper Connected domination critical graphs with a block having maximum number of cut vertices...10 bytes (19 words) - 20:52, 8 December 2023
- Benjamin Sudakov (section List of research outcomes)largest eigenvalue of a random subgraph of the hypercube 2003-08-21 Paper Induced subgraphs of prescribed size 2003-08-20 Paper Maximum cuts and judicious partitions...10 bytes (17 words) - 10:55, 9 December 2023
- On a packing problem of Alon and Yuster 2016-07-05 Paper Toward Żak's conjecture on graph packing 2016-05-25 Paper A list version of graph packing 2016-05-18...10 bytes (19 words) - 20:00, 8 December 2023
- Noga Alon (section List of research outcomes)The number of small semispaces of a finite set of points in the plane 1986-01-01 Paper Explicit construction of exponential sized families of k-independent...10 bytes (17 words) - 19:58, 8 December 2023
- Ignasi Sau (section List of research outcomes)\mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\) 2018-05-23 Paper On the number of labeled graphs of bounded treewidth 2018-05-18 Paper...10 bytes (17 words) - 14:13, 6 October 2023
- Jenő Lehel (section List of research outcomes)numbers 2010-11-10 Paper Tight embeddings of partial quadrilateral packings 2010-04-21 Paper Maximum directed cuts in digraphs with degree restriction 2009-06-16...10 bytes (17 words) - 20:14, 8 December 2023
- Alexander Schrijver (section List of research outcomes)Paper On the Size of Systems of Sets Every t of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems 1989-01-01...10 bytes (17 words) - 14:33, 7 December 2023
- Hiroshi Nagamochi (section List of research outcomes)certain planar directed networks 1990-01-01 Paper On max-flow min-cut and integral flow properties for multicommodity flows in directed networks 1989-01-01...10 bytes (17 words) - 21:59, 24 September 2023
- Sandi Klavžar (section List of research outcomes)Paper On the packing chromatic number of Cartesian products, hexagonal lattice, and trees 2008-06-05 Paper On the Packing Chromatic Number of Trees, Cartesian...10 bytes (17 words) - 21:52, 9 December 2023
- Charles J. Colbourn (section List of research outcomes)1992-06-28 Paper Directed star decompositions of directed multigraphs 1992-06-28 Paper A new class of group divisible designs with block size three 1992-06-28...10 bytes (19 words) - 10:36, 8 December 2023
- András Gyárfás (section List of research outcomes)2008-03-13 Paper Maximum directed cuts in acyclic digraphs 2007-06-11 Paper Tripartite Ramsey numbers for paths 2007-06-11 Paper On the Maximum Size of (p, Q)—free...10 bytes (17 words) - 17:12, 9 December 2023
- Rico Zenklusen (section List of research outcomes)Computational complexity of impact size estimation for spreading processes on networks 2010-06-23 Paper Blockers and transversals in some subclasses of bipartite graphs:...10 bytes (16 words) - 23:44, 10 December 2023
- Marcin Pilipczuk (section List of research outcomes)2020-05-27 Paper Directed Multicut is W[1-hard, Even for Four Terminal Pairs] 2019-12-06 Paper Hardness of Approximation for Strip Packing 2019-12-06 Paper...10 bytes (18 words) - 09:05, 7 October 2023
- Meirav Zehavi (section List of research outcomes)polynomial kernel for \textsc{Max-Cut Above Spanning Tree} 2020-02-27 Paper The parameterized complexity of cycle packing: indifference is not an issue 2020-02-12...10 bytes (16 words) - 09:40, 7 October 2023
- Saket Saurabh (section List of research outcomes)complexity of multi-node hubs 2022-10-13 Paper On the Complexity of Singly Connected Vertex Deletion 2022-10-13 Paper Parameterized complexity of maximum edge...10 bytes (17 words) - 02:43, 25 September 2023
- Béla Bollobás (section List of research outcomes)The distribution of the maximum degree of a random graph 1980-01-01 Paper A probabilistic proof of an asymptotic formula for the number of labelled regular...10 bytes (17 words) - 10:53, 8 December 2023
