search result

Cover von Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width

Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width

Year: 2023
Media group: LIPIcs
Cover von Approximate Sampling and Counting of Graphs with Near-Regular Degree Intervals

Approximate Sampling and Counting of Graphs with Near-Regular Degree Intervals

Year: 2023
Media group: LIPIcs
Cover von The Impossibility of Approximate Agreement on a Larger Class of Graphs

The Impossibility of Approximate Agreement on a Larger Class of Graphs

Year: 2023
Media group: LIPIcs
Cover von Computational Power of a Single Oblivious Mobile Agent in Two-Edge-Connected Graphs

Computational Power of a Single Oblivious Mobile Agent in Two-Edge-Connected Graphs

Year: 2023
Media group: LIPIcs
Cover von Imaging Systems for GI Endoscopy, and Graphs in Biomedical Image Analysis
First MICCAI Workshop, ISGIE 2022, and Fourth MICCAI Workshop, GRAIL 2022, Held in Conjunction with MICCAI 2022, Singapore, September 18, 2022, Proceedings
Author: Manfredi, Luigi; Ahmadi, Seyed-Ahmad; Kazi, Anees Search for this author
Year: 2022
Publisher: Heidelberg, Springer
Series: Lecture notes in computer science; 13754
Media group: MONOGRAPHIE
Cover von Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond

Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond

Author: Ghosh, Subir Kumar
Year: 2022
Media group: LIPIcs
Cover von A Simple Polynomial Time Algorithm for Max Cut on Laminar Geometric Intersection Graphs

A Simple Polynomial Time Algorithm for Max Cut on Laminar Geometric Intersection Graphs

Year: 2022
Media group: LIPIcs
Cover von Packing Arc-Disjoint 4-Cycles in Oriented Graphs

Packing Arc-Disjoint 4-Cycles in Oriented Graphs

Year: 2022
Media group: LIPIcs
Cover von XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure

XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure

Year: 2022
Media group: LIPIcs
Cover von On the Complexity of Problems on Tree-Structured Graphs

On the Complexity of Problems on Tree-Structured Graphs

Year: 2022
Media group: LIPIcs
OPEN V 11.1.0.0