search result

Cover von Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs

Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs

Year: 2021
Media group: LIPIcs
Cover von Sublinear Average-Case Shortest Paths in Weighted Unit-Disk Graphs

Sublinear Average-Case Shortest Paths in Weighted Unit-Disk Graphs

Year: 2021
Media group: LIPIcs
Cover von Computing Zigzag Persistence on Graphs in Near-Linear Time

Computing Zigzag Persistence on Graphs in Near-Linear Time

Year: 2021
Media group: LIPIcs
Cover von A Family of Metrics from the Truncated Smoothing of Reeb Graphs

A Family of Metrics from the Truncated Smoothing of Reeb Graphs

Year: 2021
Media group: LIPIcs
Cover von An Asymptotically Fast Polynomial Space Algorithm for Hamiltonicity Detection in Sparse Directed Graphs

An Asymptotically Fast Polynomial Space Algorithm for Hamiltonicity Detection in Sparse Directed Graphs

Year: 2021
Media group: LIPIcs
Cover von First-Order Transductions of Graphs (Invited Talk)

First-Order Transductions of Graphs (Invited Talk)

Year: 2021
Media group: LIPIcs
Cover von Uniform Bipartition in the Population Protocol Model with Arbitrary Communication Graphs

Uniform Bipartition in the Population Protocol Model with Arbitrary Communication Graphs

Year: 2021
Media group: LIPIcs
Cover von On the Activities and Partitions of the Vertex Subsets of Graphs
article
Search for this author
Year: 2020
Publisher: Cornell University, arXiv.org
Media group: ARTICLE
Cover von Counting 4-Patterns in Permutations Is Equivalent to Counting 4-Cycles in Graphs

Counting 4-Patterns in Permutations Is Equivalent to Counting 4-Cycles in Graphs

Year: 2020
Media group: LIPIcs
Cover von Contracting to a Longest Path in H-Free Graphs

Contracting to a Longest Path in H-Free Graphs

Year: 2020
Media group: LIPIcs
OPEN V 11.1.0.0