Kanzaki, Masaaki; Otachi, Yota; Viglietta, Giovanni; Uehara, Ryuhei Computational complexity of jumping block puzzles. (English) Zbl 07784207 Theor. Comput. Sci. 983, Article ID 114292, 19 p. (2024). MSC: 68Qxx PDFBibTeX XMLCite \textit{M. Kanzaki} et al., Theor. Comput. Sci. 983, Article ID 114292, 19 p. (2024; Zbl 07784207) Full Text: DOI
Alegría, Carlos; Da Lozzo, Giordano; Di Battista, Giuseppe; Frati, Fabrizio; Grosso, Fabrizio; Patrignani, Maurizio Unit-length rectangular drawings of graphs. (English) Zbl 07727757 Angelini, Patrizio (ed.) et al., Graph drawing and network visualization. 30th international symposium, GD 2022, Tokyo, Japan, September 13–16, 2022. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13764, 127-143 (2023). MSC: 68R10 68U05 PDFBibTeX XMLCite \textit{C. Alegría} et al., Lect. Notes Comput. Sci. 13764, 127--143 (2023; Zbl 07727757) Full Text: DOI arXiv
Das, Avinandan; Kanesh, Lawqueen; Madathil, Jayakrishnan; Muluk, Komal; Purohit, Nidhi; Saurabh, Saket On the complexity of singly connected vertex deletion. (English) Zbl 07597110 Theor. Comput. Sci. 934, 47-64 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{A. Das} et al., Theor. Comput. Sci. 934, 47--64 (2022; Zbl 07597110) Full Text: DOI
Demange, Marc; Di Fonso, Alessia; Di Stefano, Gabriele; Vittorini, Pierpaolo A graph theoretical approach to the firebreak locating problem. (English) Zbl 1487.68124 Theor. Comput. Sci. 914, 47-72 (2022). MSC: 68Q25 68Q17 68R10 90B80 90C35 PDFBibTeX XMLCite \textit{M. Demange} et al., Theor. Comput. Sci. 914, 47--72 (2022; Zbl 1487.68124) Full Text: DOI arXiv
Belmonte, Rémy; Hanaka, Tesshu; Kanzaki, Masaaki; Kiyomi, Masashi; Kobayashi, Yasuaki; Kobayashi, Yusuke; Lampis, Michael; Ono, Hirotaka; Otachi, Yota Parameterized complexity of \((A,\ell)\)-path packing. (English) Zbl 07495627 Algorithmica 84, No. 4, 871-895 (2022). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{R. Belmonte} et al., Algorithmica 84, No. 4, 871--895 (2022; Zbl 07495627) Full Text: DOI
Luca, V. T. F.; Marín, N.; Oliveira, F. S.; Ramírez-Vigueras, A.; Solé-Pi, O.; Szwarcfiter, J. L.; Urrutia, J. Grid straight-line embeddings of trees with a minimum number of bends per path. (English) Zbl 07444824 Inf. Process. Lett. 174, Article ID 106210, 6 p. (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{V. T. F. Luca} et al., Inf. Process. Lett. 174, Article ID 106210, 6 p. (2022; Zbl 07444824) Full Text: DOI
Kanzaki, Masaaki; Otachi, Yota; Uehara, Ryuhei Computational complexity of jumping block puzzles. (English) Zbl 07670500 Chen, Chi-Yeh (ed.) et al., Computing and combinatorics. 27th international conference, COCOON 2021, Tainan, Taiwan, October 24–26, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13025, 655-667 (2021). MSC: 68Rxx PDFBibTeX XMLCite \textit{M. Kanzaki} et al., Lect. Notes Comput. Sci. 13025, 655--667 (2021; Zbl 07670500) Full Text: DOI arXiv
Hertz, Alain Decycling bipartite graphs. (English) Zbl 1489.05147 J. Graph Algorithms Appl. 25, No. 1, 461-480 (2021). MSC: 05C85 05C38 68Q17 PDFBibTeX XMLCite \textit{A. Hertz}, J. Graph Algorithms Appl. 25, No. 1, 461--480 (2021; Zbl 1489.05147) Full Text: DOI
Cavallaro, Dario; Fluschnik, Till Feedback vertex set on Hamiltonian graphs. (English) Zbl 07538578 Kowalik, Łukasz (ed.) et al., Graph-theoretic concepts in computer science. 47th international workshop, WG 2021, Warsaw, Poland, June 23–25, 2021. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12911, 207-218 (2021). MSC: 68R10 PDFBibTeX XMLCite \textit{D. Cavallaro} and \textit{T. Fluschnik}, Lect. Notes Comput. Sci. 12911, 207--218 (2021; Zbl 07538578) Full Text: DOI arXiv
Das, Avinandan; Kanesh, Lawqueen; Madathil, Jayakrishnan; Muluk, Komal; Purohit, Nidhi; Saurabh, Saket On the complexity of singly connected vertex deletion. (English) Zbl 07601011 Gąsieniec, Leszek (ed.) et al., Combinatorial algorithms. 31st international workshop, IWOCA 2020, Bordeaux, France, June 8–10, 2020, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12126, 237-250 (2020). MSC: 68Rxx 68Wxx PDFBibTeX XMLCite \textit{A. Das} et al., Lect. Notes Comput. Sci. 12126, 237--250 (2020; Zbl 07601011) Full Text: DOI
Demange, Marc; Gabrel, Virginie; Haddad, Marcel A.; Murat, Cécile A robust \(p\)-center problem under pressure to locate shelters in wildfire context. (English) Zbl 1476.90175 EURO J. Comput. Optim. 8, No. 2, 103-139 (2020). MSC: 90B80 68Q17 90C10 90C17 90C27 90C60 PDFBibTeX XMLCite \textit{M. Demange} et al., EURO J. Comput. Optim. 8, No. 2, 103--139 (2020; Zbl 1476.90175) Full Text: DOI
Manukyan, Artür; Ceyhan, Elvan Classification using proximity catch digraphs. (English) Zbl 1496.68277 Mach. Learn. 109, No. 4, 761-811 (2020). MSC: 68T05 05C20 05C62 05C69 05C80 62H30 68R10 PDFBibTeX XMLCite \textit{A. Manukyan} and \textit{E. Ceyhan}, Mach. Learn. 109, No. 4, 761--811 (2020; Zbl 1496.68277) Full Text: DOI arXiv
Okamoto, Yoshio; Ravsky, Alexander; Wolff, Alexander Variants of the segment number of a graph. (English) Zbl 07266134 Archambault, Daniel (ed.) et al., Graph drawing and network visualization. 27th international symposium, GD 2019, Prague, Czech Republic, September 17–20, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11904, 430-443 (2019). MSC: 68R10 68U05 PDFBibTeX XMLCite \textit{Y. Okamoto} et al., Lect. Notes Comput. Sci. 11904, 430--443 (2019; Zbl 07266134) Full Text: DOI arXiv
Angelini, Patrizio; Bekos, Michael A.; Liotta, Giuseppe; Montecchiani, Fabrizio Universal slope sets for 1-bend planar drawings. (English) Zbl 1421.68102 Algorithmica 81, No. 6, 2527-2556 (2019). MSC: 68R10 05C10 05C85 PDFBibTeX XMLCite \textit{P. Angelini} et al., Algorithmica 81, No. 6, 2527--2556 (2019; Zbl 1421.68102) Full Text: DOI arXiv
Bekos, Michael A.; Förster, Henry; Kaufmann, Michael On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings. (English) Zbl 1421.68106 Algorithmica 81, No. 5, 2046-2071 (2019). MSC: 68R10 05C85 68Q17 PDFBibTeX XMLCite \textit{M. A. Bekos} et al., Algorithmica 81, No. 5, 2046--2071 (2019; Zbl 1421.68106) Full Text: DOI arXiv
Lejeune, Miguel; Lozin, Vadim; Lozina, Irina; Ragab, Ahmed; Yacout, Soumaya Recent advances in the theory and practice of logical analysis of data. (English) Zbl 1430.90495 Eur. J. Oper. Res. 275, No. 1, 1-15 (2019). MSC: 90C27 68T10 90C90 PDFBibTeX XMLCite \textit{M. Lejeune} et al., Eur. J. Oper. Res. 275, No. 1, 1--15 (2019; Zbl 1430.90495) Full Text: DOI Link
Bekos, Michael A.; Förster, Henry; Kaufmann, Michael On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings. (English) Zbl 1503.68205 Frati, Fabrizio (ed.) et al., Graph drawing and network visualization. 25th international symposium, GD 2017, Boston, MA, USA, September 25–27, 2017. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 10692, 169-183 (2018). MSC: 68R10 05C85 68Q17 PDFBibTeX XMLCite \textit{M. A. Bekos} et al., Lect. Notes Comput. Sci. 10692, 169--183 (2018; Zbl 1503.68205) Full Text: DOI arXiv
Didimo, Walter; Liotta, Giuseppe; Patrignani, Maurizio Bend-minimum orthogonal drawings in quadratic time. (English) Zbl 1519.68188 Biedl, Therese (ed.) et al., Graph drawing and network visualization. 26th international symposium, GD 2018, Barcelona, Spain, September 26–28, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11282, 481-494 (2018). MSC: 68R10 68U05 68W40 PDFBibTeX XMLCite \textit{W. Didimo} et al., Lect. Notes Comput. Sci. 11282, 481--494 (2018; Zbl 1519.68188) Full Text: DOI arXiv
Kindermann, Philipp; Montecchiani, Fabrizio; Schlipf, Lena; Schulz, André Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles. (English) Zbl 1519.68195 Biedl, Therese (ed.) et al., Graph drawing and network visualization. 26th international symposium, GD 2018, Barcelona, Spain, September 26–28, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11282, 152-166 (2018). MSC: 68R10 68U05 PDFBibTeX XMLCite \textit{P. Kindermann} et al., Lect. Notes Comput. Sci. 11282, 152--166 (2018; Zbl 1519.68195) Full Text: DOI arXiv
Valiant, Leslie G. Some observations on holographic algorithms. (English) Zbl 1419.68211 Comput. Complexity 27, No. 3, 351-374 (2018). Reviewer: Roger Villemaire (Montréal) MSC: 68W05 05C85 68Q15 68Q17 68R10 PDFBibTeX XMLCite \textit{L. G. Valiant}, Comput. Complexity 27, No. 3, 351--374 (2018; Zbl 1419.68211) Full Text: DOI
Zhang, Xiaoling; Qian, Jianguo \(L(p,q)\)-labeling and integer tension of a graph embedded on torus. (English) Zbl 1331.05076 J. Comb. Optim. 31, No. 1, 67-77 (2016). MSC: 05C12 05C15 68R10 PDFBibTeX XMLCite \textit{X. Zhang} and \textit{J. Qian}, J. Comb. Optim. 31, No. 1, 67--77 (2016; Zbl 1331.05076) Full Text: DOI
Bläsius, Thomas; Krug, Marcus; Rutter, Ignaz; Wagner, Dorothea Orthogonal graph drawing with flexibility constraints. (English) Zbl 1303.05182 Algorithmica 68, No. 4, 859-885 (2014). MSC: 05C85 05C10 05C60 05C62 05C35 68Q17 68Q25 PDFBibTeX XMLCite \textit{T. Bläsius} et al., Algorithmica 68, No. 4, 859--885 (2014; Zbl 1303.05182) Full Text: DOI Link
Anthony, Martin; Ratsaby, Joel A hybrid classifier based on boxes and nearest neighbors. (English) Zbl 1312.68162 Discrete Appl. Math. 172, 1-11 (2014). MSC: 68T05 62H30 PDFBibTeX XMLCite \textit{M. Anthony} and \textit{J. Ratsaby}, Discrete Appl. Math. 172, 1--11 (2014; Zbl 1312.68162) Full Text: DOI
Serafini, Paolo Classifying negative and positive points by optimal box clustering. (English) Zbl 1358.68240 Discrete Appl. Math. 165, 270-282 (2014). MSC: 68T05 62H30 68T20 PDFBibTeX XMLCite \textit{P. Serafini}, Discrete Appl. Math. 165, 270--282 (2014; Zbl 1358.68240) Full Text: DOI
Kowalik, Łukasz; Mucha, Marcin A \(9k\) kernel for nonseparating independent set in planar graphs. (English) Zbl 1277.68096 Theor. Comput. Sci. 516, 86-95 (2014). MSC: 68Q25 05C10 05C35 PDFBibTeX XMLCite \textit{Ł. Kowalik} and \textit{M. Mucha}, Theor. Comput. Sci. 516, 86--95 (2014; Zbl 1277.68096) Full Text: DOI arXiv
Di Giacomo, Emilio; Frati, Fabrizio; Fulek, Radoslav; Grilli, Luca; Krug, Marcus Orthogeodesic point-set embedding of trees. (English) Zbl 1279.65027 Comput. Geom. 46, No. 8, 929-944 (2013). Reviewer: Krzystof Gdawiec (Sosnowiec) MSC: 65D18 68U05 05C05 68R10 PDFBibTeX XMLCite \textit{E. Di Giacomo} et al., Comput. Geom. 46, No. 8, 929--944 (2013; Zbl 1279.65027) Full Text: DOI Link
Anthony, Martin; Ratsaby, Joel Analysis of a multi-category classifier. (English) Zbl 1248.68397 Discrete Appl. Math. 160, No. 16-17, 2329-2338 (2012). MSC: 68T05 68T10 68U05 PDFBibTeX XMLCite \textit{M. Anthony} and \textit{J. Ratsaby}, Discrete Appl. Math. 160, No. 16--17, 2329--2338 (2012; Zbl 1248.68397) Full Text: DOI
Tayu, Satoshi; Nomura, Kumiko; Ueno, Shuichi On the two-dimensional orthogonal drawing of series-parallel graphs. (English) Zbl 1197.05100 Discrete Appl. Math. 157, No. 8, 1885-1895 (2009). MSC: 05C62 05C10 68R10 PDFBibTeX XMLCite \textit{S. Tayu} et al., Discrete Appl. Math. 157, No. 8, 1885--1895 (2009; Zbl 1197.05100) Full Text: DOI
Biedl, Therese; Chan, Timothy; Ganjali, Yashar; Hajiaghayi, Mohammad Taghi; Wood, David R. Balanced vertex-orderings of graphs. (English) Zbl 1060.05088 Discrete Appl. Math. 148, No. 1, 27-48 (2005). MSC: 05C85 05C10 68R10 PDFBibTeX XMLCite \textit{T. Biedl} et al., Discrete Appl. Math. 148, No. 1, 27--48 (2005; Zbl 1060.05088) Full Text: DOI
Zhang, Shaoqiang; Li, Guojun; Li, Shuguang A linear time algorithm for the minimum-weight feedback vertex set problem in series-parallel graphs. (English) Zbl 1055.05146 Acta Math. Appl. Sin., Engl. Ser. 20, No. 4, 579-588 (2004). Reviewer: Haiko Müller (Leeds) MSC: 05C85 68R10 PDFBibTeX XMLCite \textit{S. Zhang} et al., Acta Math. Appl. Sin., Engl. Ser. 20, No. 4, 579--588 (2004; Zbl 1055.05146) Full Text: DOI
Calamoneri, Tiziana; Massini, Annalisa; Vrťo, Imrich New results on edge-bandwidth. (English) Zbl 1070.68115 Theor. Comput. Sci. 307, No. 3, 503-513 (2003). MSC: 68R10 PDFBibTeX XMLCite \textit{T. Calamoneri} et al., Theor. Comput. Sci. 307, No. 3, 503--513 (2003; Zbl 1070.68115) Full Text: DOI
Garrido, M. A.; Márquez, A.; Morgana, A.; Portillo, J. R. Single bend wiring on surfaces. (English) Zbl 1004.68002 Discrete Appl. Math. 117, No. 1-3, 27-40 (2002). MSC: 68M07 68M99 PDFBibTeX XMLCite \textit{M. A. Garrido} et al., Discrete Appl. Math. 117, No. 1--3, 27--40 (2002; Zbl 1004.68002) Full Text: DOI
Liu, Yanpei Boolean approaches to graph embeddings related to VLSI. (English) Zbl 1002.68115 Sci. China, Ser. A 44, No. 8, 1034-1041 (2001). MSC: 68R10 05C10 68W35 PDFBibTeX XMLCite \textit{Y. Liu}, Sci. China, Ser. A 44, No. 8, 1034--1041 (2001; Zbl 1002.68115) Full Text: DOI
Liu, Yanpei Orthogonal drawings of graphs for the automation of VLSI circuit design. (English) Zbl 0945.68199 J. Comput. Sci. Technol. 14, No. 5, 447-459 (1999). MSC: 68W35 68R10 PDFBibTeX XMLCite \textit{Y. Liu}, J. Comput. Sci. Technol. 14, No. 5, 447--459 (1999; Zbl 0945.68199) Full Text: DOI
Tamassia, Roberto Advances in the theory and practice of graph drawing. (English) Zbl 0914.68207 Theor. Comput. Sci. 217, No. 2, 235-254 (1999). MSC: 68U10 PDFBibTeX XMLCite \textit{R. Tamassia}, Theor. Comput. Sci. 217, No. 2, 235--254 (1999; Zbl 0914.68207) Full Text: DOI
Biedl, Therese; Kant, Goos A better heuristic for orthogonal graph drawings. (English) Zbl 0894.68104 Comput. Geom. 9, No. 3, 159-180 (1998). MSC: 68R10 68U05 PDFBibTeX XMLCite \textit{T. Biedl} and \textit{G. Kant}, Comput. Geom. 9, No. 3, 159--180 (1998; Zbl 0894.68104) Full Text: DOI
Liu, Yanpei; Morgana, Aurora; Simeone, Bruno A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid. (English) Zbl 0912.68153 Discrete Appl. Math. 81, No. 1-3, 69-91 (1998). Reviewer: B.Mohar (Ljubljana) MSC: 68R10 05C85 PDFBibTeX XMLCite \textit{Y. Liu} et al., Discrete Appl. Math. 81, No. 1--3, 69--91 (1998; Zbl 0912.68153) Full Text: DOI
Kant, G. Drawing planar graphs using the canonical ordering. (English) Zbl 0851.68086 Algorithmica 16, No. 1, 4-32 (1996). MSC: 68R10 PDFBibTeX XMLCite \textit{G. Kant}, Algorithmica 16, No. 1, 4--32 (1996; Zbl 0851.68086) Full Text: DOI
Calamoneri, Tiziana; Petreschi, Rossella An efficient orthogonal grid drawing algorithm for cubic graphs. (English) Zbl 1527.68156 Du, Ding-Zhu (ed.) et al., Computing and combinatorics. 1st international conference, COCOON ’95, Xi’an, China, August 24–26, 1995. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 959, 31-40 (1995). MSC: 68R10 68U05 PDFBibTeX XMLCite \textit{T. Calamoneri} and \textit{R. Petreschi}, Lect. Notes Comput. Sci. 959, 31--40 (1995; Zbl 1527.68156) Full Text: DOI
Liu, Yanpei Some combinatorial optimization problems arising from VLSI circuit design. (English) Zbl 0789.68078 Appl. Math., Ser. B (Engl. Ed.) 8, No. 2, 218-235 (1993). MSC: 68W35 05C10 68R10 94C15 90C27 PDFBibTeX XMLCite \textit{Y. Liu}, Appl. Math., Ser. B (Engl. Ed.) 8, No. 2, 218--235 (1993; Zbl 0789.68078) Full Text: DOI