Kanj, Iyad; Komusiewicz, Christian; Sorge, Manuel; van Leeuwen, Erik Jan Solving partition problems almost always requires pushing many vertices around. (English) Zbl 1434.05123 SIAM J. Discrete Math. 34, No. 1, 640-681 (2020). MSC: 05C70 05C85 68Q17 68Q25 68W40 PDFBibTeX XMLCite \textit{I. Kanj} et al., SIAM J. Discrete Math. 34, No. 1, 640--681 (2020; Zbl 1434.05123) Full Text: DOI
Fluschnik, Till; Komusiewicz, Christian; Mertzios, George B.; Nichterlein, André; Niedermeier, Rolf; Talmon, Nimrod When can graph hyperbolicity be computed in linear time? (English) Zbl 1439.68016 Algorithmica 81, No. 5, 2016-2045 (2019). Reviewer: K. Subramani (Morgantown) MSC: 68R10 05C85 68Q17 68Q25 68Q27 PDFBibTeX XMLCite \textit{T. Fluschnik} et al., Algorithmica 81, No. 5, 2016--2045 (2019; Zbl 1439.68016) Full Text: DOI Link
Kanj, Iyad; Komusiewicz, Christian; Sorge, Manuel; van Leeuwen, Erik Jan Solving partition problems almost always requires pushing many vertices around. (English) Zbl 1524.05240 Azar, Yossi (ed.) et al., 26th annual European symposium on algorithms, ESA 2018, August 20–22, 2018, Helsinki, Finland. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 112, Article 51, 14 p. (2018). MSC: 05C70 05C85 68Q17 68Q27 68W40 PDFBibTeX XMLCite \textit{I. Kanj} et al., LIPIcs -- Leibniz Int. Proc. Inform. 112, Article 51, 14 p. (2018; Zbl 1524.05240) Full Text: DOI arXiv
Kanj, Iyad; Komusiewicz, Christian; Sorge, Manuel; van Leeuwen, Erik Jan Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs. (English) Zbl 1380.68227 J. Comput. Syst. Sci. 92, 22-47 (2018). MSC: 68Q25 05C70 05C85 PDFBibTeX XMLCite \textit{I. Kanj} et al., J. Comput. Syst. Sci. 92, 22--47 (2018; Zbl 1380.68227) Full Text: DOI arXiv Link
Komusiewicz, Christian; Niedermeier, Rolf; Uhlmann, Johannes Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring. (English) Zbl 1228.05154 J. Discrete Algorithms 9, No. 1, 137-151 (2011). MSC: 05C15 05C90 PDFBibTeX XMLCite \textit{C. Komusiewicz} et al., J. Discrete Algorithms 9, No. 1, 137--151 (2011; Zbl 1228.05154) Full Text: DOI
Weller, Mathias; Komusiewicz, Christian; Niedermeier, Rolf; Uhlmann, Johannes On making directed graphs transitive. (English) Zbl 1253.68267 Dehne, Frank (ed.) et al., Algorithms and data structures. 11th international symposium, WADS 2009, Banff, Canada, August 21–23, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03366-7/pbk). Lecture Notes in Computer Science 5664, 542-553 (2009). MSC: 68R10 05C20 05C85 68Q17 PDFBibTeX XMLCite \textit{M. Weller} et al., Lect. Notes Comput. Sci. 5664, 542--553 (2009; Zbl 1253.68267) Full Text: DOI