search result

Cover von Routing Symmetric Demands in Directed Minor-Free Graphs with Constant Congestion

Routing Symmetric Demands in Directed Minor-Free Graphs with Constant Congestion

Year: 2019
Media group: LIPIcs
Cover von Min-Cost Flow in Unit-Capacity Planar Graphs

Min-Cost Flow in Unit-Capacity Planar Graphs

Year: 2019
Media group: LIPIcs
Cover von Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs

Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs

Year: 2019
Media group: LIPIcs
Cover von Efficient Approximation Schemes for Uniform-Cost Clustering Problems in Planar Graphs

Efficient Approximation Schemes for Uniform-Cost Clustering Problems in Planar Graphs

Year: 2019
Media group: LIPIcs
Cover von Complexity of C_k-Coloring in Hereditary Classes of Graphs

Complexity of C_k-Coloring in Hereditary Classes of Graphs

Year: 2019
Media group: LIPIcs
Cover von Alignment- and Reference-Free Phylogenomics with Colored de Bruijn Graphs

Alignment- and Reference-Free Phylogenomics with Colored de Bruijn Graphs

Year: 2019
Media group: LIPIcs
Cover von Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs

Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs

Year: 2019
Media group: LIPIcs
Cover von Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs

Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs

Author: Wasa, Kunihiro
Year: 2019
Media group: LIPIcs
Cover von Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs

Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs

Year: 2019
Media group: LIPIcs
Cover von The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs

The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs

Year: 2019
Media group: LIPIcs
OPEN V 11.1.0.0