search result

Cover von A Unified FPT Framework for Crossing Number Problems

A Unified FPT Framework for Crossing Number Problems

Year: 2025
Media group: LIPIcs
Cover von LIPIcs, Volume 189, SoCG 2021, Complete Volume

LIPIcs, Volume 189, SoCG 2021, Complete Volume

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

Front Matter, Table of Contents, Preface, Conference Organization

Year: 2021
Media group: LIPIcs
Cover von 37th International Symposium on Computational Geometry
SoCG 2021 : June 7 - 11, 2021, Buffalo, NY, USA (Virtual Conference)
Search for this author
Year: 2021
Publisher: Wadern, LZI
Series: Leibniz International Proceedings in Informatics; 189
Media group: LIPIcs
Cover von Computing Shortest Closed Curves on Non-Orientable Surfaces

Computing Shortest Closed Curves on Non-Orientable Surfaces

Year: 2024
Media group: LIPIcs
Cover von An FPT Algorithm for the Embeddability of Graphs into Two-Dimensional Simplicial Complexes

An FPT Algorithm for the Embeddability of Graphs into Two-Dimensional Simplicial Complexes

Year: 2021
Media group: LIPIcs
Cover von Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs

Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs

Year: 2008
Media group: ARTICLE
Cover von Embedding Graphs into Two-Dimensional Simplicial Complexes

Embedding Graphs into Two-Dimensional Simplicial Complexes

Year: 2018
Media group: LIPIcs
Cover von Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs

Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs

Year: 2019
Media group: LIPIcs
Cover von Finding a Shortest Curve That Separates Few Objects from Many

Finding a Shortest Curve That Separates Few Objects from Many

Year: 2025
Media group: LIPIcs
OPEN V 11.1.0.0