Graph-Theoretic Concepts in Computer Science: 46th International Workshop, WG 2020, Leeds, UK, June 24-26, 2020, Revised Selected Papers von Adler, Isolde, Müller, Haiko

Volltext

On the Switch Markov Chain for Perfect Matchings von Dyer, Martin, Jerrum, Mark, Müller, Haiko

Volltext

Counting independent sets in graphs with bounded bipartite pathwidth von Dyer, Martin, Greenhill, Catherine, Muller, Haiko

Volltext

COUNTING WEIGHTED INDEPENDENT SETS BEYOND THE PERMANENT von Dyer, Martin, Jerrum, Mark, Muller, Haiko, Vuskovic, Kristina

Volltext

Graph-Theoretic Concepts in Computer Science: 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007, Revised Papers von Brandstädt, Andreas, Kratsch, Dieter, Müller, Haiko

Volltext

Quasimonotone graphs von Dyer, Martin, Müller, Haiko

Volltext

Counting independent sets in cocomparability graphs von Dyer, Martin, Müller, Haiko

Volltext

Hamiltonian circuits in chordal bipartite graphs von Müller, Haiko

Volltext

Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs von Dyer, Martin, Heinrich, Marc, Jerrum, Mark, Mueller, Haiko

Volltext

On stable cutsets in claw-free graphs and planar graphs von Le, Van Bang, Mosca, Raffaele, Müller, Haiko

Volltext

Finding and counting small induced subgraphs efficiently von Kloks, Ton, Kratsch, Dieter, Müller, Haiko

Volltext

Random walks on the vertices of transportation polytopes with constant number of sources von Cryan, Mary, Dyer, Martin, Müller, Haiko, Stougie, Leen

Volltext

Stable Structure on Safe Set Problems in Vertex-Weighted Graphs II –Recognition and Complexity von Fujita, Shinya, Park, Boram, Sakuma, Tadashi

Volltext

2.5-Connectivity: Unique Components, Critical Graphs, and Applications von Heinrich, Irene, Heller, Till, Schmidt, Eva, Streicher, Manuel

Volltext

Strong Cliques in Diamond-Free Graphs von Chiarelli, Nina, Martínez-Barona, Berenice, Milanič, Martin, Monnot, Jérôme, Muršič, Peter

Volltext

On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings von Belmonte, Rémy, Sau, Ignasi

Volltext

Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space von Nederlof, Jesper, Pilipczuk, Michał, Swennenhuis, Céline M. F., Węgrzycki, Karol

Volltext

Partitioning a graph into disjoint cliques and a triangle-free graph von Abu-Khzam, Faisal N., Feghali, Carl, Müller, Haiko

Volltext

Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width von Benjamin, Bergougnoux, Papadopoulos, Charis, Telle, Jan Arne

Volltext

Weighted Additive Spanners von Ahmed, Reyan, Bodwin, Greg, Darabi Sahneh, Faryad, Kobourov, Stephen, Spence, Richard

Volltext