search result

Cover von On the Fine-Grained Complexity of Parity Problems

On the Fine-Grained Complexity of Parity Problems

Year: 2020
Media group: LIPIcs
Cover von Optimal Packed String Matching

Optimal Packed String Matching

Author: Ben-Kiki, Oren; Bille, Philip; Breslauer, Dany
Year: 2011
Media group: ARTICLE
Cover von Õptimal Fault-Tolerant Reachability Labeling in Planar Graphs
Search for this author
Year: 2023
Publisher: Cornell University, arXiv.org
Media group: ARTICLE
Cover von What Else Can Voronoi Diagrams Do for Diameter in Planar Graphs?

What Else Can Voronoi Diagrams Do for Diameter in Planar Graphs?

Year: 2023
Media group: LIPIcs
Cover von Improved Compression of the Okamura-Seymour Metric

Improved Compression of the Okamura-Seymour Metric

Year: 2022
Media group: LIPIcs
Cover von Minimum Cut in O(m log² n) Time

Minimum Cut in O(m log² n) Time

Year: 2020
Media group: LIPIcs
Cover von Front Matter, Table of Contents, Preface, Conference Organization

Front Matter, Table of Contents, Preface, Conference Organization

Year: 2020
Media group: LIPIcs
Cover von 31st Annual Symposium on Combinatorial Pattern Matching
CPM 2020 : June 17 - 19, 2020, Copenhagen, Denmark
Search for this author
Year: 2020
Publisher: Wadern, LZI
Series: Leibniz International Proceedings in Informatics; 161
Media group: LIPIcs
Cover von A Faster FPTAS for #Knapsack

A Faster FPTAS for #Knapsack

Year: 2018
Media group: LIPIcs
Cover von Improved Bounds for Online Preemptive Matching

Improved Bounds for Online Preemptive Matching

Year: 2013
Media group: ARTICLE
OPEN V 11.1.0.0