Concepedia

Peter Gartland

PG

2

Publications

29

Citations

2

H-Index

2020

Active since

Affiliations

University of California, Santa Barbara(Current)

Peter Gartland is an author at University of California, Santa Barbara specializing in computational complexity, graph theory, and engineering.

Top concepts

EngineeringGraph TheoryDiscrete MathematicsComputational ComplexityEducationPath ProblemsNetwork ScienceComputer ScienceGraph AlgorithmsNetwork Analysis

Publications per year

2020–2021

2

Publications

2

Independent Set on -Free Graphs in Quasi-Polynomial Time

Peter Gartland, Daniel Lokshtanov · 2020 · 16 citations

Mathematical Programming, Theory Of Computing, Quasi-polynomial Time +15

Finding large induced sparse subgraphs in <i> c <sub>>t</sub> </i> -free graphs in quasipolynomial time

Peter Gartland, Daniel Lokshtanov, Marcin Pilipczuk et al. · 2021 · 13 citations · Full text

Graph Sparsity, Quasipolynomial Time, Network Science +13

Rows per page

1–2 of 2