Gagie, Travis; Manzini, Giovanni; Valenzuela, Daniel Compressed spaced suffix arrays. (English) Zbl 1378.68032 Math. Comput. Sci. 11, No. 2, 151-157 (2017). MSC: 68P05 PDFBibTeX XMLCite \textit{T. Gagie} et al., Math. Comput. Sci. 11, No. 2, 151--157 (2017; Zbl 1378.68032) Full Text: DOI arXiv Link
Arroyuelo, Diego; Claude, Francisco; Dorrigiv, Reza; Durocher, Stephane; He, Meng; López-Ortiz, Alejandro; Munro, J. Ian; Nicholson, Patrick K.; Salinger, Alejandro; Skala, Matthew Untangled monotonic chains and adaptive range search. (English) Zbl 1221.68069 Theor. Comput. Sci. 412, No. 32, 4200-4211 (2011). MSC: 68P05 68P10 68U05 PDFBibTeX XMLCite \textit{D. Arroyuelo} et al., Theor. Comput. Sci. 412, No. 32, 4200--4211 (2011; Zbl 1221.68069) Full Text: DOI
Demange, Marc; Ekim, Tınaz; De Werra, Dominique A tutorial on the use of graph coloring for some problems in robotics. (English) Zbl 1198.05045 Eur. J. Oper. Res. 192, No. 1, 41-55 (2009). MSC: 05C15 05C90 68T40 93C85 PDFBibTeX XMLCite \textit{M. Demange} et al., Eur. J. Oper. Res. 192, No. 1, 41--55 (2009; Zbl 1198.05045) Full Text: DOI
Nikolopoulos, Stavros D. Coloring permutation graphs in parallel. (English) Zbl 1002.68514 Discrete Appl. Math. 120, No. 1-3, 165-195 (2002). MSC: 68R10 05C15 05C17 PDFBibTeX XMLCite \textit{S. D. Nikolopoulos}, Discrete Appl. Math. 120, No. 1--3, 165--195 (2002; Zbl 1002.68514) Full Text: DOI
Ivković, Zoran; Sarnath, Ramnath; Sunder, Sivaprakasam Fully dynamic algorithms for permutation graph coloring. (English) Zbl 0865.68091 Int. J. Comput. Math. 63, No. 1-2, 37-55 (1997). MSC: 68R10 PDFBibTeX XMLCite \textit{Z. Ivković} et al., Int. J. Comput. Math. 63, No. 1--2, 37--55 (1997; Zbl 0865.68091) Full Text: DOI
Marathe, M. V.; Hunt, H. B. III; Ravi, S. S. Efficient approximation algorithms for domatic partition and on-line coloring of circular arc graphs. (English) Zbl 0847.68084 Discrete Appl. Math. 64, No. 2, 135-149 (1996). MSC: 68R10 05C05 PDFBibTeX XMLCite \textit{M. V. Marathe} et al., Discrete Appl. Math. 64, No. 2, 135--149 (1996; Zbl 0847.68084) Full Text: DOI
Yu, Chang-Wu; Chen, Gen-Huey A theorem on permutation graphs with applications. (English) Zbl 0803.05051 Inf. Sci. 77, No. 3-4, 179-193 (1994). Reviewer: R.L.Hemminger (Nashville) MSC: 05C99 68R10 68W15 PDFBibTeX XMLCite \textit{C.-W. Yu} and \textit{G.-H. Chen}, Inf. Sci. 77, No. 3--4, 179--193 (1994; Zbl 0803.05051) Full Text: DOI Link
Yu, Chang-Wu; Chen, Gen-Huey Generate all maximal independent sets in permutation graphs. (English) Zbl 0824.68091 Int. J. Comput. Math. 47, No. 1-2, 1-8 (1993). MSC: 68R10 68Q25 PDFBibTeX XMLCite \textit{C.-W. Yu} and \textit{G.-H. Chen}, Int. J. Comput. Math. 47, No. 1--2, 1--8 (1993; Zbl 0824.68091) Full Text: DOI
Yu, Chang-Wu; Chen, Gen-Huey Parallel algorithms for permutation graphs. (English) Zbl 0818.68091 BIT 33, No. 3, 413-419 (1993). MSC: 68W15 68R10 PDFBibTeX XMLCite \textit{C.-W. Yu} and \textit{G.-H. Chen}, BIT 33, No. 3, 413--419 (1993; Zbl 0818.68091) Full Text: DOI
Yu, Chang-Wu; Chen, Gen-Huey The weighted maximum independent set problem in permutation graphs. (English) Zbl 0757.68065 BIT 32, No. 4, 609-618 (1992). MSC: 68Q25 68W15 68R99 PDFBibTeX XMLCite \textit{C.-W. Yu} and \textit{G.-H. Chen}, BIT 32, No. 4, 609--618 (1992; Zbl 0757.68065) Full Text: DOI
Srinivasan, A.; Pandu Rangan, C. Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs. (English) Zbl 0752.68046 Theor. Comput. Sci. 91, No. 1, 1-21 (1991). Reviewer: M.Kubale (Gdańsk) MSC: 68Q25 68R10 05C35 05C85 PDFBibTeX XMLCite \textit{A. Srinivasan} and \textit{C. Pandu Rangan}, Theor. Comput. Sci. 91, No. 1, 1--21 (1991; Zbl 0752.68046) Full Text: DOI
Zanakis, Stelios H.; Evans, James R.; Vazacopoulos, Alkis A. Heuristic methods and applications: A categorized survey. (English) Zbl 0681.90090 Eur. J. Oper. Res. 43, No. 1, 88-110 (1989). MSC: 90C99 90-02 65K05 PDFBibTeX XMLCite \textit{S. H. Zanakis} et al., Eur. J. Oper. Res. 43, No. 1, 88--110 (1989; Zbl 0681.90090) Full Text: DOI
Bloniarz, Peter A.; Ravi, S. S. An \(\Omega\) (n log n) lower bound for decomposing a set of points into chains. (English) Zbl 0678.68029 Inf. Process. Lett. 31, No. 6, 319-322 (1989). MSC: 68Q25 68W30 PDFBibTeX XMLCite \textit{P. A. Bloniarz} and \textit{S. S. Ravi}, Inf. Process. Lett. 31, No. 6, 319--322 (1989; Zbl 0678.68029) Full Text: DOI