These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.
2. Parameterized Complexity of Eulerian Deletion Problems. Cygan M; Marx D; Pilipczuk M; Pilipczuk M; Schlotter I Algorithmica; 2014; 68(1):41-61. PubMed ID: 24415818 [TBL] [Abstract][Full Text] [Related]
3. Faster algorithms for counting subgraphs in sparse graphs. Bressan M Algorithmica; 2021; 83(8):2578-2605. PubMed ID: 34720296 [TBL] [Abstract][Full Text] [Related]
4. Parameterized Complexity and Inapproximability of Dominating Set Problem in Chordal and Near Chordal Graphs. Liu C; Song Y J Comb Optim; 2010 Apr; 20(2):1-15. PubMed ID: 23874144 [TBL] [Abstract][Full Text] [Related]
5. Complexity of Secure Sets. Bliem B; Woltran S Algorithmica; 2018; 80(10):2909-2940. PubMed ID: 29937611 [TBL] [Abstract][Full Text] [Related]
6. Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. Novotná J; Okrasa K; Pilipczuk M; Rzążewski P; van Leeuwen EJ; Walczak B Algorithmica; 2021; 83(8):2634-2650. PubMed ID: 34720297 [TBL] [Abstract][Full Text] [Related]
8. The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths. Ganian R; Ordyniak S Algorithmica; 2021; 83(2):726-752. PubMed ID: 33707803 [TBL] [Abstract][Full Text] [Related]
10. Extremal (n,m)-Graphs w.r.t General Multiplicative Zagreb Indices. Javed A; Jamil MK; Liu JB; Ali A Comb Chem High Throughput Screen; 2022; 25(3):476-482. PubMed ID: 35038981 [TBL] [Abstract][Full Text] [Related]
11. Faster Cut Sparsification of Weighted Graphs. Forster S; de Vos T Algorithmica; 2023; 85(4):929-964. PubMed ID: 37008076 [TBL] [Abstract][Full Text] [Related]
12. On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan. Nederlof J; Swennenhuis CMF Algorithmica; 2022; 84(8):2309-2334. PubMed ID: 35880200 [TBL] [Abstract][Full Text] [Related]
13. Dynamic Graph Stream Algorithms in Huang Z; Peng P Algorithmica; 2019; 81(5):1965-1987. PubMed ID: 31057194 [TBL] [Abstract][Full Text] [Related]
14. The average distances in random graphs with given expected degrees. Chung F; Lu L Proc Natl Acad Sci U S A; 2002 Dec; 99(25):15879-82. PubMed ID: 12466502 [TBL] [Abstract][Full Text] [Related]
15. On Finding and Enumerating Maximal and Maximum Phillips CA; Wang K; Baker EJ; Bubier JA; Chesler EJ; Langston MA Algorithms; 2019 Jan; 12(1):. PubMed ID: 31448059 [TBL] [Abstract][Full Text] [Related]
17. On the centrality of vertices of molecular graphs. Randić M; Novič M; Vračko M; Plavšić D J Comput Chem; 2013 Nov; 34(29):2514-23. PubMed ID: 23955387 [TBL] [Abstract][Full Text] [Related]