search result

Cover von Reachability and Matching in Single Crossing Minor Free Graphs

Reachability and Matching in Single Crossing Minor Free Graphs

Author: Tewari, Raghunath
Year: 2021
Media group: LIPIcs
Cover von On the Robust Communication Complexity of Bipartite Matching

On the Robust Communication Complexity of Bipartite Matching

Year: 2021
Media group: LIPIcs
Cover von Fully Dynamic Set Cover via Hypergraph Maximal Matching

Fully Dynamic Set Cover via Hypergraph Maximal Matching

An Optimal Approximation Through a Local Approach
Year: 2021
Media group: LIPIcs
Cover von Map Matching for Semi-Restricted Trajectories

Map Matching for Semi-Restricted Trajectories

Year: 2021
Media group: LIPIcs
Cover von Griddings of Permutations and Hardness of Pattern Matching

Griddings of Permutations and Hardness of Pattern Matching

Year: 2021
Media group: LIPIcs
Cover von Efficient Haplotype Block Matching in Bi-Directional PBWT

Efficient Haplotype Block Matching in Bi-Directional PBWT

Year: 2021
Media group: LIPIcs
Cover von An Invertible Transform for Efficient String Matching in Labeled Digraphs

An Invertible Transform for Efficient String Matching in Labeled Digraphs

Year: 2021
Media group: LIPIcs
Cover von Geometric Pattern Matching Reduces to k-SUM

Geometric Pattern Matching Reduces to k-SUM

Year: 2020
Media group: LIPIcs
Cover von Engineering Fast Almost Optimal Algorithms for Bipartite Graph Matching

Engineering Fast Almost Optimal Algorithms for Bipartite Graph Matching

Year: 2020
Media group: LIPIcs
Cover von A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes

A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes

Year: 2020
Media group: LIPIcs
OPEN V 11.1.0.0