search result

Cover von Reachability in O(log n) Genus Graphs is in Unambiguous Logspace

Reachability in O(log n) Genus Graphs is in Unambiguous Logspace

Year: 2019
Media group: LIPIcs
Cover von A Tight Extremal Bound on the Lovász Cactus Number in Planar Graphs

A Tight Extremal Bound on the Lovász Cactus Number in Planar Graphs

Year: 2019
Media group: LIPIcs
Cover von Enumerating minimal dominating sets in Kt-free graphs and variants
article
Search for this author
Year: 2019
Publisher: Cornell University, arXiv.org
Media group: ARTICLE
Cover von Subset Feedback Vertex Set on Graphs of Bounded Independent Set Size

Subset Feedback Vertex Set on Graphs of Bounded Independent Set Size

Year: 2019
Media group: LIPIcs
Cover von Parameterized Complexity of Independent Set in H-Free Graphs

Parameterized Complexity of Independent Set in H-Free Graphs

Year: 2019
Media group: LIPIcs
Cover von Generalized Distance Domination Problems and Their Complexity on Graphs of Bounded mim-width

Generalized Distance Domination Problems and Their Complexity on Graphs of Bounded mim-width

Year: 2019
Media group: LIPIcs
Cover von Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth

Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth

Year: 2019
Media group: LIPIcs
Cover von Lower Bounds for Tolerant Junta and Unateness Testing via Rejection Sampling of Graphs

Lower Bounds for Tolerant Junta and Unateness Testing via Rejection Sampling of Graphs

Year: 2018
Media group: LIPIcs
Cover von A Framework for Searching in Graphs in the Presence of Errors

A Framework for Searching in Graphs in the Presence of Errors

Year: 2018
Media group: OASICS
Cover von Deterministic Algorithms for Maximum Matching on General Graphs in the Semi-Streaming Model

Deterministic Algorithms for Maximum Matching on General Graphs in the Semi-Streaming Model

Year: 2018
Media group: LIPIcs
OPEN V 11.1.0.0