Канал: WG 2021 Warsaw

WG 2021: Odd Cycle Transversal in Mixed Graphs

WG 2021: Odd Cycle Transversal in Mixed Graphs

WG 2021 Invited talk: Twin-width

WG 2021 Invited talk: Twin-width

WG 2021 Invited talk: On a method of enumerating independent sets

WG 2021 Invited talk: On a method of enumerating independent sets

WG 2021 Invited talk: Graph Product Structure Theory

WG 2021 Invited talk: Graph Product Structure Theory

WG 2021: A heuristic approach to the treedepth decomposition problem for large graphs

WG 2021: A heuristic approach to the treedepth decomposition problem for large graphs

WG 2021: Parameterized complexity of Bandwidth of Caterpillars and Weighted Path Emulation

WG 2021: Parameterized complexity of Bandwidth of Caterpillars and Weighted Path Emulation

WG 2021: Sparse and Lightweight Spanners in Weighted Graphs with Local Additive Error

WG 2021: Sparse and Lightweight Spanners in Weighted Graphs with Local Additive Error

WG 2021: On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem

WG 2021: On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem

WG 2021: Linearizable special cases of the quadratic shortest path problem

WG 2021: Linearizable special cases of the quadratic shortest path problem

WG 2021: Can Romeo and Juliet Meet? Or Rendezvous Games with Adversaries on Graphs

WG 2021: Can Romeo and Juliet Meet? Or Rendezvous Games with Adversaries on Graphs

WG 2021: The Complexity of Gerrymandering over Graphs: Paths and Trees

WG 2021: The Complexity of Gerrymandering over Graphs: Paths and Trees

WG 2021: Disjoint Stable Matchings in Linear Time

WG 2021: Disjoint Stable Matchings in Linear Time

WG 2021: On 3-Coloring of (2P_4 ,C_5)-Free Graphs

WG 2021: On 3-Coloring of (2P_4 ,C_5)-Free Graphs

WG 2021: Completion to chordal distance-hereditary graphs: a quartic vertex-kernel

WG 2021: Completion to chordal distance-hereditary graphs: a quartic vertex-kernel

WG 2021: The Perfect Matching Cut Problem Revisited

WG 2021: The Perfect Matching Cut Problem Revisited

WG 2021: Feedback Vertex Set on Hamiltonian Graphs

WG 2021: Feedback Vertex Set on Hamiltonian Graphs

WG 2021: Complementation in T-perfect Graphs

WG 2021: Complementation in T-perfect Graphs

WG 2021: On subgraph complementation to H-free graphs

WG 2021: On subgraph complementation to H-free graphs

WG 2021: On Fair Covering and Hitting Problems

WG 2021: On Fair Covering and Hitting Problems

WG 2021: Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set

WG 2021: Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set

WG 2021: The Graphs of Stably Matchable Pairs

WG 2021: The Graphs of Stably Matchable Pairs

WG 2021: FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More

WG 2021: FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More

WG 2021: The Largest Connected Subgraph Game

WG 2021: The Largest Connected Subgraph Game

WG 2021: On Morphing 1-Planar Drawings

WG 2021: On Morphing 1-Planar Drawings

WG 2021: Labeling Schemes for Deterministic Radio Multi-Broadcast

WG 2021: Labeling Schemes for Deterministic Radio Multi-Broadcast

WG 2021: Acyclic, Star, and Injective Colouring: Bounding the Diameter

WG 2021: Acyclic, Star, and Injective Colouring: Bounding the Diameter

WG 2021: Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality

WG 2021: Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality

WG 2021: A linear-time parameterized algorithm for computing the width of a DAG

WG 2021: A linear-time parameterized algorithm for computing the width of a DAG

WG 2021: Beyond Helly graphs: the diameter problem on absolute retracts

WG 2021: Beyond Helly graphs: the diameter problem on absolute retracts

WG 2021: Bears with Hats and Independence Polynomials

WG 2021: Bears with Hats and Independence Polynomials

WG 2021: The Dynamic Complexity of Acyclic Hypergraph Homomorphisms

WG 2021: The Dynamic Complexity of Acyclic Hypergraph Homomorphisms

WG 2021: Preventing Small (s,t)-Cuts by Protecting Edges

WG 2021: Preventing Small (s,t)-Cuts by Protecting Edges

WG 2021: Block Elimination Distance

WG 2021: Block Elimination Distance