Items where authors include "Muller, H"

Article

Dyer, M and Muller, H (2019) Quasimonotone graphs. Discrete Applied Mathematics, 271. pp. 25-48. ISSN 0166-218X

Dyer, M orcid.org/0000-0002-2018-0374 and Muller, H orcid.org/0000-0002-1123-1774 (2019) Counting Perfect Matchings and the Switch Chain. SIAM Journal on Discrete Mathematics, 33 (3). pp. 1146-1174. ISSN 0895-4801

Cheung, SY, Henrot, M, Al-Saad, M et al. (17 more authors) (2018) TRPC4/TRPC5 channels mediate adverse reaction to the cancer cell cytotoxic agent (-)-Englerin A. Oncotarget, 9 (51). pp. 29634-29643. ISSN 1949-2553

Adler, I, Le, NK, Muller, H et al. (3 more authors) (2017) On rank-width of even-hole-free graphs. Discrete Mathematics and Theoretical Computer Science, 19 (1). 25. ISSN 1462-7264

Dyer, M, Jerrum, M and Muller, H (2017) On the switch Markov chain for perfect matchings. Journal of the ACM, 64 (2). 12. ISSN 0004-5411

Dyer, ME and Muller, H (2015) Graph classes and the switch Markov chain for matchings. Annales de la Faculte des Sciences de Toulouse, 24 (4). pp. 885-993. ISSN 0240-2963

Abu-Khzam, FN, Feghali, C and Muller, H (2015) Partitioning a graph into disjoint cliques and a triangle-free graph. Discrete Applied Mathematics, 190-19. 1 - 12. ISSN 0166-218X

Kloks, T, Muller, H and Vuskovic, K (2009) Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences. Journal of Combinatorial Theory: Series B, 99 (5). 733 - 800 . ISSN 0095-8956

Proceedings Paper

Dyer, M and Muller, H (2018) Quasimonotone Graphs. In: Graph-Theoretic Concepts in Computer Science. 44th International Workshop on Graph-Theoretic Concepts in Computer Science, 27-29 Jun 2018, Cottbus, Germany. Springer , pp. 190-202.

Dyer, ME, Jerrum, MR and Muller, H (2016) On the switch Markov chain for perfect matchings. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms. Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 10-12 Jan 2016, Arlington, Virginia, USA. SIAM , pp. 1972-1983. ISBN 978-1-611974-12-6

Muller, H and Wilson, S (2013) An FPT certifying algorithm for the vertex-deletion problem. In: Lecroq, T and Mouchard, L, (eds.) Combinatorial Algorithms, 24th International Workshop, IWOCA 2013, Revised Selected Papers. 24th International Workshop, IWOCA 2013, 10-12 Jul 2013, Rouen, France. Springer , 468 - 472. ISBN 978-3-642-45277-2