search result

Cover von Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs

Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs

Year: 2020
Media group: LIPIcs
Cover von Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games

Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games

Year: 2020
Media group: LIPIcs
Cover von On the Parameterized Approximability of Contraction to Classes of Chordal Graphs

On the Parameterized Approximability of Contraction to Classes of Chordal Graphs

Year: 2020
Media group: LIPIcs
Cover von Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size

Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size

Year: 2020
Media group: LIPIcs
Cover von Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs

Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs

Year: 2020
Media group: LIPIcs
Cover von Efficient Diagonalization of Symmetric Matrices Associated with Graphs of Small Treewidth

Efficient Diagonalization of Symmetric Matrices Associated with Graphs of Small Treewidth

Year: 2020
Media group: LIPIcs
Cover von A Scaling Algorithm for Weighted f-Factors in General Graphs

A Scaling Algorithm for Weighted f-Factors in General Graphs

Year: 2020
Media group: LIPIcs
Cover von Medians in Median Graphs and Their Cube Complexes in Linear Time

Medians in Median Graphs and Their Cube Complexes in Linear Time

Year: 2020
Media group: LIPIcs
Cover von Drawing Graphs with Circular Arcs and Right-Angle Crossings

Drawing Graphs with Circular Arcs and Right-Angle Crossings

Year: 2020
Media group: LIPIcs
Cover von Low-Stretch Spanning Trees of Graphs with Bounded Width

Low-Stretch Spanning Trees of Graphs with Bounded Width

Year: 2020
Media group: LIPIcs
OPEN V 11.1.0.0