Reem, Daniel The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs. (English) Zbl 07723913 Theor. Comput. Sci. 970, Article ID 114054, 38 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{D. Reem}, Theor. Comput. Sci. 970, Article ID 114054, 38 p. (2023; Zbl 07723913) Full Text: DOI arXiv
Tripathi, Vikash; Kloks, Ton; Pandey, Arti; Paul, Kaustav; Wang, Hung-Lung Complexity of paired domination in AT-free and planar graphs. (English) Zbl 07575096 Theor. Comput. Sci. 930, 53-62 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{V. Tripathi} et al., Theor. Comput. Sci. 930, 53--62 (2022; Zbl 07575096) Full Text: DOI arXiv
Chaplick, Steven; Halldórsson, Magnús M.; de Lima, Murilo S.; Tonoyan, Tigran Query minimization under stochastic uncertainty. (English) Zbl 1514.68054 Theor. Comput. Sci. 895, 75-95 (2021). MSC: 68P10 68W20 68W27 68W40 90C15 PDFBibTeX XMLCite \textit{S. Chaplick} et al., Theor. Comput. Sci. 895, 75--95 (2021; Zbl 1514.68054) Full Text: DOI arXiv Link
Soulignac, Francisco J. A certifying and dynamic algorithm for the recognition of proper circular-arc graphs. (English) Zbl 1517.05170 Theor. Comput. Sci. 889, 105-134 (2021). MSC: 05C85 05C62 PDFBibTeX XMLCite \textit{F. J. Soulignac}, Theor. Comput. Sci. 889, 105--134 (2021; Zbl 1517.05170) Full Text: DOI arXiv
Halldórsson, Magnús M.; de Lima, Murilo Santos Query-competitive sorting with uncertainty. (English) Zbl 1462.68031 Theor. Comput. Sci. 867, 50-67 (2021). MSC: 68P10 68W20 68W27 PDFBibTeX XMLCite \textit{M. M. Halldórsson} and \textit{M. S. de Lima}, Theor. Comput. Sci. 867, 50--67 (2021; Zbl 1462.68031) Full Text: DOI arXiv Link
Rong, Guozhen; Li, Wenjun; Yang, Yongjie; Wang, Jianxin Reconstruction and verification of chordal graphs with a distance oracle. (English) Zbl 1497.68395 Theor. Comput. Sci. 859, 48-56 (2021). MSC: 68R10 05C62 05C85 PDFBibTeX XMLCite \textit{G. Rong} et al., Theor. Comput. Sci. 859, 48--56 (2021; Zbl 1497.68395) Full Text: DOI
Hon, Wing-Kai; Kloks, Ton; Liu, Hsiang-Hsuan; Wang, Hung-Lung; Wang, Yue-Li A note on the geodetic number and the Steiner number of AT-free graphs. (English) Zbl 1480.05035 Theor. Comput. Sci. 854, 131-135 (2021). MSC: 05C10 05C12 PDFBibTeX XMLCite \textit{W.-K. Hon} et al., Theor. Comput. Sci. 854, 131--135 (2021; Zbl 1480.05035) Full Text: DOI
Brešar, Boštjan; Gologranc, Tanja; Kos, Tim Convex and isometric domination of (weak) dominating pair graphs. (English) Zbl 1391.05195 Theor. Comput. Sci. 730, 32-43 (2018). MSC: 05C69 68Q17 05C85 PDFBibTeX XMLCite \textit{B. Brešar} et al., Theor. Comput. Sci. 730, 32--43 (2018; Zbl 1391.05195) Full Text: DOI arXiv
Kang, Dong Yeap; Kwon, O-joung; Strømme, Torstein J. F.; Telle, Jan Arne A width parameter useful for chordal and co-comparability graphs. (English) Zbl 1380.05151 Theor. Comput. Sci. 704, 1-17 (2017). MSC: 05C69 05C85 68Q25 PDFBibTeX XMLCite \textit{D. Y. Kang} et al., Theor. Comput. Sci. 704, 1--17 (2017; Zbl 1380.05151) Full Text: DOI arXiv
Du, Chen Fei; Mousavi, Hamoon; Rowland, Eric; Schaeffer, Luke; Shallit, Jeffrey Decision algorithms for Fibonacci-automatic words. II: Related sequences and avoidability. (English) Zbl 1366.68223 Theor. Comput. Sci. 657, Part B, 146-162 (2017). MSC: 68R15 11B85 68Q45 11A67 PDFBibTeX XMLCite \textit{C. F. Du} et al., Theor. Comput. Sci. 657, Part B, 146--162 (2017; Zbl 1366.68223) Full Text: DOI
Kloks, Ton; Poon, Sheung-Hung; Tsai, Feng-Ren; Wang, Yue-Li On the complexity of the black-and-white coloring problem on some classes of perfect graphs. (English) Zbl 1418.68104 Theor. Comput. Sci. 532, 51-63 (2014). MSC: 68Q25 05C15 05C62 68Q17 PDFBibTeX XMLCite \textit{T. Kloks} et al., Theor. Comput. Sci. 532, 51--63 (2014; Zbl 1418.68104) Full Text: DOI
Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël Detecting induced minors in AT-free graphs. (English) Zbl 1296.05183 Theor. Comput. Sci. 482, 20-32 (2013). MSC: 05C83 05C85 68Q17 68Q25 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Theor. Comput. Sci. 482, 20--32 (2013; Zbl 1296.05183) Full Text: DOI
Chen, Danny Z.; Misiołek, Ewa Computing feasible toolpaths for 5-axis machines. (English) Zbl 1243.68307 Theor. Comput. Sci. 447, 13-25 (2012). MSC: 68U05 68U07 68R10 PDFBibTeX XMLCite \textit{D. Z. Chen} and \textit{E. Misiołek}, Theor. Comput. Sci. 447, 13--25 (2012; Zbl 1243.68307) Full Text: DOI
Mezzini, Mauro Fast minimal triangulation algorithm using minimum degree criterion. (English) Zbl 1220.05121 Theor. Comput. Sci. 412, No. 29, 3775-3787 (2011). MSC: 05C85 05C70 PDFBibTeX XMLCite \textit{M. Mezzini}, Theor. Comput. Sci. 412, No. 29, 3775--3787 (2011; Zbl 1220.05121) Full Text: DOI
Kiyomi, Masashi; Saitoh, Toshiki; Uehara, Ryuhei Reconstruction of interval graphs. (English) Zbl 1198.05114 Theor. Comput. Sci. 411, No. 43, 3859-3866 (2010). MSC: 05C60 05C85 PDFBibTeX XMLCite \textit{M. Kiyomi} et al., Theor. Comput. Sci. 411, No. 43, 3859--3866 (2010; Zbl 1198.05114) Full Text: DOI
Kijima, Shuji; Kiyomi, Masashi; Okamoto, Yoshio; Uno, Takeaki On listing, sampling, and counting the chordal graphs with edge constraints. (English) Zbl 1209.68377 Theor. Comput. Sci. 411, No. 26-28, 2591-2601 (2010). MSC: 68R10 68W05 PDFBibTeX XMLCite \textit{S. Kijima} et al., Theor. Comput. Sci. 411, No. 26--28, 2591--2601 (2010; Zbl 1209.68377) Full Text: DOI
Brijder, Robert; Hoogeboom, Hendrik Jan Combining overlap and containment for gene assembly in ciliates. (English) Zbl 1191.68358 Theor. Comput. Sci. 411, No. 6, 897-905 (2010). MSC: 68Q42 68R10 PDFBibTeX XMLCite \textit{R. Brijder} and \textit{H. J. Hoogeboom}, Theor. Comput. Sci. 411, No. 6, 897--905 (2010; Zbl 1191.68358) Full Text: DOI
Berry, Anne; Dahlhaus, Elias; Heggernes, Pinar; Simonet, Geneviève Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree. (English) Zbl 1155.68088 Theor. Comput. Sci. 409, No. 3, 601-616 (2008). MSC: 68W10 PDFBibTeX XMLCite \textit{A. Berry} et al., Theor. Comput. Sci. 409, No. 3, 601--616 (2008; Zbl 1155.68088) Full Text: DOI
Sheng, Li 2-role assignments on triangulated graphs. (English) Zbl 1045.68105 Theor. Comput. Sci. 304, No. 1-3, 201-214 (2003). MSC: 68R10 PDFBibTeX XMLCite \textit{L. Sheng}, Theor. Comput. Sci. 304, No. 1--3, 201--214 (2003; Zbl 1045.68105) Full Text: DOI
Sander, J. W.; Tijdeman, R. The complexity of functions on lattices. (English) Zbl 1005.68118 Theor. Comput. Sci. 246, No. 1-2, 195-225 (2000). MSC: 68R15 11B85 PDFBibTeX XMLCite \textit{J. W. Sander} and \textit{R. Tijdeman}, Theor. Comput. Sci. 246, No. 1--2, 195--225 (2000; Zbl 1005.68118) Full Text: DOI
Cai, Jin-Yi A relation of primal–dual lattices and the complexity of shortest lattice vector problem. (English) Zbl 0926.11047 Theor. Comput. Sci. 207, No. 1, 105-116 (1998). MSC: 11H55 11H06 68Q25 11H50 11Y16 PDFBibTeX XMLCite \textit{J.-Y. Cai}, Theor. Comput. Sci. 207, No. 1, 105--116 (1998; Zbl 0926.11047) Full Text: DOI
Pomerance, Carl; Robson, John Michael; Shallit, Jeffrey Automaticity. II: Descriptional complexity in the unary case. (English) Zbl 0959.11015 Theor. Comput. Sci. 180, No. 1-2, 181-201 (1997). MSC: 11B85 68Q45 68R15 PDFBibTeX XMLCite \textit{C. Pomerance} et al., Theor. Comput. Sci. 180, No. 1--2, 181--201 (1997; Zbl 0959.11015) Full Text: DOI
Cameron, Helen; Wood, Derick Balance in AVL trees and space cost of brother trees. (English) Zbl 0824.68028 Theor. Comput. Sci. 127, No. 2, 199-228 (1994). MSC: 68P10 68R10 PDFBibTeX XMLCite \textit{H. Cameron} and \textit{D. Wood}, Theor. Comput. Sci. 127, No. 2, 199--228 (1994; Zbl 0824.68028) Full Text: DOI
Daudé, Hervé; Vallée, Brigitte An upper bound on the average number of iterations of the LLL algorithm. (English) Zbl 0796.11024 Theor. Comput. Sci. 123, No. 1, 95-115 (1994). Reviewer: M.Pohst (Berlin) MSC: 11H55 11Y16 68Q25 PDFBibTeX XMLCite \textit{H. Daudé} and \textit{B. Vallée}, Theor. Comput. Sci. 123, No. 1, 95--115 (1994; Zbl 0796.11024) Full Text: DOI
Helfrich, Bettina Algorithms to construct Minkowski reduced and Hermite reduced lattice bases. (English) Zbl 0601.68034 Theor. Comput. Sci. 41, 125-139 (1985). Reviewer: A.Bachem MSC: 68Q25 11H06 11H55 PDFBibTeX XMLCite \textit{B. Helfrich}, Theor. Comput. Sci. 41, 125--139 (1985; Zbl 0601.68034) Full Text: DOI
Lipski, Witold jun. Information storage and retrieval - mathematical foundations. II: Combinatorial problems. (English) Zbl 0352.68121 Theor. Comput. Sci. 3, 183-211 (1977). MSC: 68P20 05A99 PDFBibTeX XMLCite \textit{W. Lipski jun.}, Theor. Comput. Sci. 3, 183--211 (1977; Zbl 0352.68121) Full Text: DOI
Marek, Wiktor; Pawlak, Zdzislaw Information storage and retrieval systems: Mathematical foundations. (English) Zbl 0354.68035 Theor. Comput. Sci. 1, 331-354 (1976). MSC: 68N01 68P20 68W99 PDFBibTeX XMLCite \textit{W. Marek} and \textit{Z. Pawlak}, Theor. Comput. Sci. 1, 331--354 (1976; Zbl 0354.68035) Full Text: DOI