Chandran S. V., Ullas; Klavžar, Sandi; P. K., Neethu; Sampaio, Rudini The general position avoidance game and hardness of general position games. (English) Zbl 07802227 Theor. Comput. Sci. 988, Article ID 114370, 13 p. (2024). MSC: 68Qxx PDFBibTeX XMLCite \textit{U. Chandran S. V.} et al., Theor. Comput. Sci. 988, Article ID 114370, 13 p. (2024; Zbl 07802227) Full Text: DOI arXiv
Pan, Zhiyong; Cheng, Baolei; Fan, Jianxi; Wang, Yan; Li, Xiajing A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks. (English) Zbl 07635992 Theor. Comput. Sci. 942, 33-46 (2023). MSC: 68R10 68W10 PDFBibTeX XMLCite \textit{Z. Pan} et al., Theor. Comput. Sci. 942, 33--46 (2023; Zbl 07635992) Full Text: DOI
Angelini, Patrizio; Bekos, Michael A.; Kindermann, Philipp; Mchedlidze, Tamara On mixed linear layouts of series-parallel graphs. (English) Zbl 07604605 Theor. Comput. Sci. 936, 129-138 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{P. Angelini} et al., Theor. Comput. Sci. 936, 129--138 (2022; Zbl 07604605) Full Text: DOI
Alam, Md. Jawaherul; Bekos, Michael A.; Gronemann, Martin; Kaufmann, Michael; Pupyrev, Sergey The mixed page number of graphs. (English) Zbl 07579641 Theor. Comput. Sci. 931, 131-141 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{Md. J. Alam} et al., Theor. Comput. Sci. 931, 131--141 (2022; Zbl 07579641) Full Text: DOI arXiv
Gima, Tatsuya; Hanaka, Tesshu; Kiyomi, Masashi; Kobayashi, Yasuaki; Otachi, Yota Exploring the gap between treedepth and vertex cover through vertex integrity. (English) Zbl 07524431 Theor. Comput. Sci. 918, 60-76 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{T. Gima} et al., Theor. Comput. Sci. 918, 60--76 (2022; Zbl 07524431) Full Text: DOI arXiv
Eppstein, David; Frishberg, Daniel; Maxwell, William On the treewidth of Hanoi graphs. (English) Zbl 07477129 Theor. Comput. Sci. 906, 1-17 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{D. Eppstein} et al., Theor. Comput. Sci. 906, 1--17 (2022; Zbl 07477129) Full Text: DOI arXiv
Moscarini, Marina Computing a metric basis of a bipartite distance-hereditary graph. (English) Zbl 1518.05051 Theor. Comput. Sci. 900, 20-24 (2022). MSC: 05C12 68Q25 PDFBibTeX XMLCite \textit{M. Moscarini}, Theor. Comput. Sci. 900, 20--24 (2022; Zbl 1518.05051) Full Text: DOI
Di Giacomo, Emilio; Hančl, Jaroslav jun.; Liotta, Giuseppe 2-colored point-set embeddings of partial 2-trees. (English) Zbl 1514.68209 Theor. Comput. Sci. 896, 31-45 (2021). MSC: 68R10 05C05 05C10 05C62 68U05 PDFBibTeX XMLCite \textit{E. Di Giacomo} et al., Theor. Comput. Sci. 896, 31--45 (2021; Zbl 1514.68209) Full Text: DOI
Misra, Neeldhara; Mittal, Harshil Imbalance parameterized by twin cover revisited. (English) Zbl 1514.68226 Theor. Comput. Sci. 895, 1-15 (2021). MSC: 68R10 68Q27 PDFBibTeX XMLCite \textit{N. Misra} and \textit{H. Mittal}, Theor. Comput. Sci. 895, 1--15 (2021; Zbl 1514.68226) Full Text: DOI arXiv
Liu, Yunlong; Chen, Jie; Huang, Jingui; Wang, Jianxin On parameterized algorithms for fixed-order book thickness with respect to the pathwidth of the vertex ordering. (English) Zbl 1482.68178 Theor. Comput. Sci. 873, 16-24 (2021). MSC: 68R10 05C10 05C85 68Q27 68W40 PDFBibTeX XMLCite \textit{Y. Liu} et al., Theor. Comput. Sci. 873, 16--24 (2021; Zbl 1482.68178) Full Text: DOI
Brandenburg, Franz J. Fan-crossing free graphs and their relationship to other beyond-planar graphs. (English) Zbl 1465.68208 Theor. Comput. Sci. 867, 85-100 (2021). Reviewer: Charles J. Colbourn (Tempe) MSC: 68R10 PDFBibTeX XMLCite \textit{F. J. Brandenburg}, Theor. Comput. Sci. 867, 85--100 (2021; Zbl 1465.68208) Full Text: DOI arXiv
Alam, Jawaherul Md.; Bekos, Michael A.; Dujmović, Vida; Gronemann, Martin; Kaufmann, Michael; Pupyrev, Sergey On dispersable book embeddings. (English) Zbl 1497.68362 Theor. Comput. Sci. 861, 1-22 (2021). MSC: 68R10 05C10 05C62 PDFBibTeX XMLCite \textit{J. Md. Alam} et al., Theor. Comput. Sci. 861, 1--22 (2021; Zbl 1497.68362) Full Text: DOI arXiv
Huang, Yufei; Hou, Bo; Liu, Wen; Wu, Lidong; Rainwater, Stephen; Gao, Suogang On approximation algorithm for the edge metric dimension problem. (English) Zbl 1486.68255 Theor. Comput. Sci. 853, 2-6 (2021). Reviewer: Aleksa Stankovic (Stockholm) MSC: 68W25 05C12 68R10 90C59 PDFBibTeX XMLCite \textit{Y. Huang} et al., Theor. Comput. Sci. 853, 2--6 (2021; Zbl 1486.68255) Full Text: DOI
Basak, Mithun; Saha, Laxman; Das, Gour Kanta; Tiwary, Kalishankar Fault-tolerant metric dimension of circulant graphs \(C_n(1,2,3)\). (English) Zbl 1436.05054 Theor. Comput. Sci. 817, 66-79 (2020). MSC: 05C40 05C12 PDFBibTeX XMLCite \textit{M. Basak} et al., Theor. Comput. Sci. 817, 66--79 (2020; Zbl 1436.05054) Full Text: DOI
Jäger, Gerold; Drewes, Frank The metric dimension of \(\mathbb{Z}_n \times \mathbb{Z}_n \times \mathbb{Z}_n\) is \(\lfloor 3n/2 \rfloor \). (English) Zbl 1442.05050 Theor. Comput. Sci. 806, 344-362 (2020). MSC: 05C12 05C85 91A05 PDFBibTeX XMLCite \textit{G. Jäger} and \textit{F. Drewes}, Theor. Comput. Sci. 806, 344--362 (2020; Zbl 1442.05050) Full Text: DOI
Hakanen, Anni; Junnila, Ville; Laihonen, Tero The solid-metric dimension. (English) Zbl 1436.68241 Theor. Comput. Sci. 806, 156-170 (2020). MSC: 68R10 05C12 68Q17 PDFBibTeX XMLCite \textit{A. Hakanen} et al., Theor. Comput. Sci. 806, 156--170 (2020; Zbl 1436.68241) Full Text: DOI
Alcon, Liliana; Gutierrez, Marisa; Hernando, Carmen; Mora, Mercè; Pelayo, Ignacio M. Neighbor-locating colorings in graphs. (English) Zbl 1442.05054 Theor. Comput. Sci. 806, 144-155 (2020). MSC: 05C15 05C69 05C76 05C75 PDFBibTeX XMLCite \textit{L. Alcon} et al., Theor. Comput. Sci. 806, 144--155 (2020; Zbl 1442.05054) Full Text: DOI arXiv Link
Eroh, Linda; Kang, Cong X.; Yi, Eunjeong The connected metric dimension at a vertex of a graph. (English) Zbl 1442.05048 Theor. Comput. Sci. 806, 53-69 (2020). MSC: 05C12 05C10 05C35 68Q25 PDFBibTeX XMLCite \textit{L. Eroh} et al., Theor. Comput. Sci. 806, 53--69 (2020; Zbl 1442.05048) Full Text: DOI arXiv
Estrada-Moreno, Alejandro On the \(k\)-partition dimension of graphs. (English) Zbl 1437.05195 Theor. Comput. Sci. 806, 42-52 (2020). Reviewer: Ioan Tomescu (Bucureşti) MSC: 05C70 05C40 PDFBibTeX XMLCite \textit{A. Estrada-Moreno}, Theor. Comput. Sci. 806, 42--52 (2020; Zbl 1437.05195) Full Text: DOI arXiv
Moscarini, Marina Computing a metric basis of a 2-connected bipartite distance-hereditary graph. (English) Zbl 1436.68255 Theor. Comput. Sci. 804, 186-206 (2020). MSC: 68R10 05C12 05C85 68W40 PDFBibTeX XMLCite \textit{M. Moscarini}, Theor. Comput. Sci. 804, 186--206 (2020; Zbl 1436.68255) Full Text: DOI
Siddiqui, Hafiz Muhammad Afzal; Hayat, Sakander; Khan, Asad; Imran, Muhammad; Razzaq, Ayesha; Liu, Jia-Bao Resolvability and fault-tolerant resolvability structures of convex polytopes. (English) Zbl 1433.05104 Theor. Comput. Sci. 796, 114-128 (2019). Reviewer: Ioan Tomescu (Bucureşti) MSC: 05C12 52B12 68Q17 PDFBibTeX XMLCite \textit{H. M. A. Siddiqui} et al., Theor. Comput. Sci. 796, 114--128 (2019; Zbl 1433.05104) Full Text: DOI
Bae, Sang Won; Baffier, Jean-Francois; Chun, Jinhee; Eades, Peter; Eickmeyer, Kord; Grilli, Luca; Hong, Seok-Hee; Korman, Matias; Montecchiani, Fabrizio; Rutter, Ignaz; Tóth, Csaba D. Gap-planar graphs. (English) Zbl 1400.68151 Theor. Comput. Sci. 745, 36-52 (2018). MSC: 68R10 68Q25 PDFBibTeX XMLCite \textit{S. W. Bae} et al., Theor. Comput. Sci. 745, 36--52 (2018; Zbl 1400.68151) Full Text: DOI
Kelk, Steven; Stamoulis, Georgios; Wu, Taoyang Treewidth distance on phylogenetic trees. (English) Zbl 1395.05171 Theor. Comput. Sci. 731, 99-117 (2018). MSC: 05C85 05C05 92D15 PDFBibTeX XMLCite \textit{S. Kelk} et al., Theor. Comput. Sci. 731, 99--117 (2018; Zbl 1395.05171) Full Text: DOI arXiv Link
Bang-Jensen, J.; Bessy, S.; Havet, F.; Yeo, A. Out-degree reducing partitions of digraphs. (English) Zbl 1390.05184 Theor. Comput. Sci. 719, 64-72 (2018). MSC: 05C70 05C20 05C31 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., Theor. Comput. Sci. 719, 64--72 (2018; Zbl 1390.05184) Full Text: DOI arXiv
Di Giacomo, Emilio; Liotta, Giuseppe; Montecchiani, Fabrizio Drawing subcubic planar graphs with four slopes and optimal angular resolution. (English) Zbl 1387.68178 Theor. Comput. Sci. 714, 51-73 (2018). MSC: 68R10 05C10 05C62 PDFBibTeX XMLCite \textit{E. Di Giacomo} et al., Theor. Comput. Sci. 714, 51--73 (2018; Zbl 1387.68178) Full Text: DOI
Foucaud, Florent; Mertzios, George B.; Naserasr, Reza; Parreau, Aline; Valicov, Petru Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds. (English) Zbl 1358.05216 Theor. Comput. Sci. 668, 43-58 (2017). MSC: 05C69 94B60 94B65 PDFBibTeX XMLCite \textit{F. Foucaud} et al., Theor. Comput. Sci. 668, 43--58 (2017; Zbl 1358.05216) Full Text: DOI arXiv
Kintali, Shiva Directed width parameters and circumference of digraphs. (English) Zbl 1357.05052 Theor. Comput. Sci. 659, 83-87 (2017). MSC: 05C20 05C70 PDFBibTeX XMLCite \textit{S. Kintali}, Theor. Comput. Sci. 659, 83--87 (2017; Zbl 1357.05052) Full Text: DOI arXiv
Chen, Xujin; Hu, Xiaodong; Wang, Changjun Approximation for the minimum cost doubly resolving set problem. (English) Zbl 1332.05131 Theor. Comput. Sci. 609, Part 3, 526-543 (2016). MSC: 05C82 05C12 05C85 68W25 PDFBibTeX XMLCite \textit{X. Chen} et al., Theor. Comput. Sci. 609, Part 3, 526--543 (2016; Zbl 1332.05131) Full Text: DOI
Ghosh, Subir Kumar; Roy, Bodhayan Some results on point visibility graphs. (English) Zbl 1309.68195 Theor. Comput. Sci. 575, 17-32 (2015). MSC: 68U05 05C85 68Q25 68R10 PDFBibTeX XMLCite \textit{S. K. Ghosh} and \textit{B. Roy}, Theor. Comput. Sci. 575, 17--32 (2015; Zbl 1309.68195) Full Text: DOI arXiv
Borowiecki, Piotr; Dereniowski, Dariusz; Prałat, Paweł Brushing with additional cleaning restrictions. (English) Zbl 1339.05252 Theor. Comput. Sci. 557, 76-86 (2014). MSC: 05C57 05C85 PDFBibTeX XMLCite \textit{P. Borowiecki} et al., Theor. Comput. Sci. 557, 76--86 (2014; Zbl 1339.05252) Full Text: DOI
Mans, Bernard; Mathieson, Luke On the treewidth of dynamic graphs. (English) Zbl 1381.68225 Theor. Comput. Sci. 554, 217-228 (2014). MSC: 68R10 68Q19 PDFBibTeX XMLCite \textit{B. Mans} and \textit{L. Mathieson}, Theor. Comput. Sci. 554, 217--228 (2014; Zbl 1381.68225) Full Text: DOI
Babu, Jasine; Basavaraju, Manu; Chandran, L. Sunil; Rajendraprasad, Deepak 2-connecting outerplanar graphs without blowing up the pathwidth. (English) Zbl 1383.68058 Theor. Comput. Sci. 554, 119-134 (2014). MSC: 68R10 05C85 68W25 PDFBibTeX XMLCite \textit{J. Babu} et al., Theor. Comput. Sci. 554, 119--134 (2014; Zbl 1383.68058) Full Text: DOI
Kobayashi, Yasuaki; Maruta, Hirokazu; Nakae, Yusuke; Tamaki, Hisao A linear edge kernel for two-layer crossing minimization. (English) Zbl 1382.68117 Theor. Comput. Sci. 554, 74-81 (2014). MSC: 68Q25 05C85 68R10 PDFBibTeX XMLCite \textit{Y. Kobayashi} et al., Theor. Comput. Sci. 554, 74--81 (2014; Zbl 1382.68117) Full Text: DOI
Seager, Suzanne Locating a backtracking robber on a tree. (English) Zbl 1358.05189 Theor. Comput. Sci. 539, 28-37 (2014). MSC: 05C57 91A24 91A43 PDFBibTeX XMLCite \textit{S. Seager}, Theor. Comput. Sci. 539, 28--37 (2014; Zbl 1358.05189) Full Text: DOI
Binucci, Carla; Didimo, Walter; Patrignani, Maurizio Upward and quasi-upward planarity testing of embedded mixed graphs. (English) Zbl 1418.68160 Theor. Comput. Sci. 526, 75-89 (2014). MSC: 68R10 05C85 68Q17 90C10 PDFBibTeX XMLCite \textit{C. Binucci} et al., Theor. Comput. Sci. 526, 75--89 (2014; Zbl 1418.68160) Full Text: DOI
Yang, Boting Fast-mixed searching and related problems on graphs. (English) Zbl 1302.05197 Theor. Comput. Sci. 507, 100-113 (2013). MSC: 05C85 68Q25 68R10 PDFBibTeX XMLCite \textit{B. Yang}, Theor. Comput. Sci. 507, 100--113 (2013; Zbl 1302.05197) Full Text: DOI
Uhlmann, Johannes; Weller, Mathias Two-layer planarization parameterized by feedback edge set. (English) Zbl 1295.05242 Theor. Comput. Sci. 494, 99-111 (2013). MSC: 05C85 05C62 68Q25 PDFBibTeX XMLCite \textit{J. Uhlmann} and \textit{M. Weller}, Theor. Comput. Sci. 494, 99--111 (2013; Zbl 1295.05242) Full Text: DOI
Cibulka, Josef; Kynčl, Jan; Mészáros, Viola; Stolař, Rudolf; Valtr, Pavel Graph sharing games: complexity and connectivity. (English) Zbl 1295.91020 Theor. Comput. Sci. 494, 49-62 (2013). MSC: 91A43 68Q25 PDFBibTeX XMLCite \textit{J. Cibulka} et al., Theor. Comput. Sci. 494, 49--62 (2013; Zbl 1295.91020) Full Text: DOI
Gordinowicz, Przemysław; Nowakowski, Richard J.; Prałat, Paweł polish – Let us play the cleaning game. (English) Zbl 1258.91043 Theor. Comput. Sci. 463, 123-132 (2012). MSC: 91A46 91A43 PDFBibTeX XMLCite \textit{P. Gordinowicz} et al., Theor. Comput. Sci. 463, 123--132 (2012; Zbl 1258.91043) Full Text: DOI
Carraher, James; Choi, Ilkyoo; Delcourt, Michelle; Erickson, Lawrence H.; West, Douglas B. Locating a robber on a graph via distance queries. (English) Zbl 1258.91041 Theor. Comput. Sci. 463, 54-61 (2012). MSC: 91A43 PDFBibTeX XMLCite \textit{J. Carraher} et al., Theor. Comput. Sci. 463, 54--61 (2012; Zbl 1258.91041) Full Text: DOI
Yang, Boting Fast edge searching and fast searching on graphs. (English) Zbl 1211.68294 Theor. Comput. Sci. 412, No. 12-14, 1208-1219 (2011). MSC: 68R10 68Q17 91A43 68W25 PDFBibTeX XMLCite \textit{B. Yang}, Theor. Comput. Sci. 412, No. 12--14, 1208--1219 (2011; Zbl 1211.68294) Full Text: DOI
Yuster, Raphael Single source shortest paths in \(H\)-minor free graphs. (English) Zbl 1196.68177 Theor. Comput. Sci. 411, No. 34-36, 3042-3047 (2010). MSC: 68R10 05C85 68Q25 PDFBibTeX XMLCite \textit{R. Yuster}, Theor. Comput. Sci. 411, No. 34--36, 3042--3047 (2010; Zbl 1196.68177) Full Text: DOI
Fernau, Henning Parameterized algorithms for \(d\)-hitting set: the weighted case. (English) Zbl 1192.68824 Theor. Comput. Sci. 411, No. 16-18, 1698-1713 (2010). MSC: 68W05 68P10 PDFBibTeX XMLCite \textit{H. Fernau}, Theor. Comput. Sci. 411, No. 16--18, 1698--1713 (2010; Zbl 1192.68824) Full Text: DOI
Sauerwald, Thomas; Sudholt, Dirk A self-stabilizing algorithm for cut problems in synchronous networks. (English) Zbl 1191.68057 Theor. Comput. Sci. 411, No. 14-15, 1599-1612 (2010). MSC: 68M10 PDFBibTeX XMLCite \textit{T. Sauerwald} and \textit{D. Sudholt}, Theor. Comput. Sci. 411, No. 14--15, 1599--1612 (2010; Zbl 1191.68057) Full Text: DOI
Verbitsky, Oleg On the obfuscation complexity of planar graphs. (English) Zbl 1155.68059 Theor. Comput. Sci. 396, No. 1-3, 294-300 (2008). MSC: 68R10 68Q17 68Q25 91A43 91A46 PDFBibTeX XMLCite \textit{O. Verbitsky}, Theor. Comput. Sci. 396, No. 1--3, 294--300 (2008; Zbl 1155.68059) Full Text: DOI
Di Giacomo, Emilio; Didimo, Walter; Liotta, Giuseppe; Suderman, Matthew \(k\)-spine, 1-bend planarity. (English) Zbl 1097.68103 Theor. Comput. Sci. 359, No. 1-3, 148-175 (2006). MSC: 68R10 PDFBibTeX XMLCite \textit{E. Di Giacomo} et al., Theor. Comput. Sci. 359, No. 1--3, 148--175 (2006; Zbl 1097.68103) Full Text: DOI
Healy, Patrick; Kuusik, Ago Algorithms for multi-level graph planarity testing and layout. (English) Zbl 1068.05064 Theor. Comput. Sci. 320, No. 2-3, 331-344 (2004). MSC: 05C85 68R10 90C10 PDFBibTeX XMLCite \textit{P. Healy} and \textit{A. Kuusik}, Theor. Comput. Sci. 320, No. 2--3, 331--344 (2004; Zbl 1068.05064) Full Text: DOI
Wood, David R. Optimal three-dimensional orthogonal graph drawing in the general position model. (English) Zbl 1040.68069 Theor. Comput. Sci. 299, No. 1-3, 151-178 (2003). MSC: 68R10 PDFBibTeX XMLCite \textit{D. R. Wood}, Theor. Comput. Sci. 299, No. 1--3, 151--178 (2003; Zbl 1040.68069) Full Text: DOI
Di Battista, Giuseppe; Liotta, Giuseppe; Lubiw, Anna; Whitesides, Sue Embedding problems for paths with direction constrained edges. (English) Zbl 1061.68120 Theor. Comput. Sci. 289, No. 2, 897-917 (2002). MSC: 68R10 68W35 PDFBibTeX XMLCite \textit{G. Di Battista} et al., Theor. Comput. Sci. 289, No. 2, 897--917 (2002; Zbl 1061.68120) Full Text: DOI