Vikas, Narayan Computational complexity relationship between compaction, vertex-compaction, and retraction. (English) Zbl 1410.68181 J. Discrete Algorithms 52-53, 168-181 (2018). MSC: 68Q25 68R10 PDFBibTeX XMLCite \textit{N. Vikas}, J. Discrete Algorithms 52--53, 168--181 (2018; Zbl 1410.68181) Full Text: DOI
Köbler, Johannes; Kuhnert, Sebastian; Verbitsky, Oleg Solving the canonical representation and star system problems for proper circular-arc graphs in logspace. (English) Zbl 1355.68124 J. Discrete Algorithms 38-41, 38-49 (2016). MSC: 68Q25 05C60 05C62 05C85 PDFBibTeX XMLCite \textit{J. Köbler} et al., J. Discrete Algorithms 38--41, 38--49 (2016; Zbl 1355.68124) Full Text: DOI arXiv Link
Gan, Heng-Soon; Mokhtar, Hamid; Zhou, Sanming Forwarding and optical indices of 4-regular circulant networks. (English) Zbl 1343.05141 J. Discrete Algorithms 35, 27-39 (2015). MSC: 05C82 05C38 05C85 05C15 68W25 PDFBibTeX XMLCite \textit{H.-S. Gan} et al., J. Discrete Algorithms 35, 27--39 (2015; Zbl 1343.05141) Full Text: DOI arXiv
Gavril, Fanica Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs. (English) Zbl 1326.05153 J. Discrete Algorithms 35, 17-26 (2015). MSC: 05C85 05C69 PDFBibTeX XMLCite \textit{F. Gavril}, J. Discrete Algorithms 35, 17--26 (2015; Zbl 1326.05153) Full Text: DOI
Köbler, Johannes; Kuhnert, Sebastian; Watanabe, Osamu Interval graph representation with given interval and intersection lengths. (English) Zbl 1336.05134 J. Discrete Algorithms 34, 108-117 (2015). MSC: 05C85 05C62 68Q17 68Q25 PDFBibTeX XMLCite \textit{J. Köbler} et al., J. Discrete Algorithms 34, 108--117 (2015; Zbl 1336.05134) Full Text: DOI
Heggernes, Pinar; Van ’t Hof, Pim; Paulusma, Daniël Computing role assignments of proper interval graphs in polynomial time. (English) Zbl 1247.05240 J. Discrete Algorithms 14, 173-188 (2012). MSC: 05C85 68W40 PDFBibTeX XMLCite \textit{P. Heggernes} et al., J. Discrete Algorithms 14, 173--188 (2012; Zbl 1247.05240) Full Text: DOI
Saitoh, Toshiki; Otachi, Yota; Yamanaka, Katsuhisa; Uehara, Ryuhei Random generation and enumeration of bipartite permutation graphs. (English) Zbl 1241.05050 J. Discrete Algorithms 10, 84-97 (2012). MSC: 05C30 05C70 05C60 PDFBibTeX XMLCite \textit{T. Saitoh} et al., J. Discrete Algorithms 10, 84--97 (2012; Zbl 1241.05050) Full Text: DOI
Fernau, Henning; Manlove, David F. Vertex and edge covers with clustering properties: Complexity and algorithms. (English) Zbl 1187.68342 J. Discrete Algorithms 7, No. 2, 149-167 (2009). MSC: 68R10 68W25 68Q25 05C85 PDFBibTeX XMLCite \textit{H. Fernau} and \textit{D. F. Manlove}, J. Discrete Algorithms 7, No. 2, 149--167 (2009; Zbl 1187.68342) Full Text: DOI
Le, Van Bang; Mosca, Raffaele; Müller, Haiko On stable cutsets in claw-free graphs and planar graphs. (English) Zbl 1154.05317 J. Discrete Algorithms 6, No. 2, 256-276 (2008). MSC: 05C35 05C10 05C85 68R10 PDFBibTeX XMLCite \textit{V. B. Le} et al., J. Discrete Algorithms 6, No. 2, 256--276 (2008; Zbl 1154.05317) Full Text: DOI