Dabrowski, Konrad K.; Dross, François; Jeong, Jisu; Kanté, Mamadou Moustapha; Kwon, O-joung; Oum, Sang-il; Paulusma, Daniël Computing pivot-minors. arXiv:2311.04656 Preprint, arXiv:2311.04656 [math.CO] (2023). BibTeX Cite \textit{K. K. Dabrowski} et al., ``Computing pivot-minors'', Preprint, arXiv:2311.04656 [math.CO] (2023) Full Text: arXiv OA License
Dabrowski, Konrad K.; Dross, François; Jeong, Jisu; Kanté, Mamadou M.; Kwon, O-joung; Oum, Sang-il; Paulusma, Daniël Tree pivot-minors and linear rank-width. (English) Zbl 1480.05119 SIAM J. Discrete Math. 35, No. 4, 2922-2945 (2021). MSC: 05C83 05C05 05C75 PDFBibTeX XMLCite \textit{K. K. Dabrowski} et al., SIAM J. Discrete Math. 35, No. 4, 2922--2945 (2021; Zbl 1480.05119) Full Text: DOI arXiv
Jeong, Jisu; Kim, Eun Jung; Oum, Sang-il Finding branch-decompositions of matroids, hypergraphs, and more. (English) Zbl 1499.68278 SIAM J. Discrete Math. 35, No. 4, 2544-2617 (2021). MSC: 68R10 05B35 05C50 05C65 68Q27 68W05 68W40 PDFBibTeX XMLCite \textit{J. Jeong} et al., SIAM J. Discrete Math. 35, No. 4, 2544--2617 (2021; Zbl 1499.68278) Full Text: DOI
Choi, Hojin; Choi, Ilkyoo; Jeong, Jisu; Oum, Sang-il Online Ramsey theory for a triangle on \(F\)-free graphs. (English) Zbl 1425.05097 J. Graph Theory 92, No. 2, 152-171 (2019). MSC: 05C57 05C55 05D10 91A43 PDFBibTeX XMLCite \textit{H. Choi} et al., J. Graph Theory 92, No. 2, 152--171 (2019; Zbl 1425.05097) Full Text: DOI arXiv
Brignall, Robert; Choi, Hojin; Jeong, Jisu; Oum, Sang-il Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs. (English) Zbl 1406.05078 Discrete Appl. Math. 257, 60-66 (2019). MSC: 05C70 05C60 PDFBibTeX XMLCite \textit{R. Brignall} et al., Discrete Appl. Math. 257, 60--66 (2019; Zbl 1406.05078) Full Text: DOI arXiv Link
Jeong, Jisu; Kim, Eun Jung; Oum, Sang-il Finding branch-decompositions of matroids, hypergraphs, and more. (English) Zbl 1499.68277 Chatzigiannakis, Ioannis (ed.) et al., 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 107, Article 80, 14 p. (2018). MSC: 68R10 05B35 05C50 05C65 68Q27 68W05 68W40 PDFBibTeX XMLCite \textit{J. Jeong} et al., LIPIcs -- Leibniz Int. Proc. Inform. 107, Article 80, 14 p. (2018; Zbl 1499.68277) Full Text: DOI arXiv
Dabrowski, Konrad K.; Dross, François; Jeong, Jisu; Kanté, Mamadou Moustapha; Kwon, O-joung; Oum, Sang-il; Paulusma, Daniël Computing small pivot-minors. (English) Zbl 1517.68286 Brandstädt, Andreas (ed.) et al., Graph-theoretic concepts in computer science. 44th international workshop, WG 2018, Cottbus, Germany, June 27–29, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11159, 125-138 (2018). MSC: 68R10 05C83 05C85 68Q17 68W40 PDFBibTeX XMLCite \textit{K. K. Dabrowski} et al., Lect. Notes Comput. Sci. 11159, 125--138 (2018; Zbl 1517.68286) Full Text: DOI Link
Jeong, Jisu; Sæther, Sigve Hortemo; Telle, Jan Arne Maximum matching width: new characterizations and a fast algorithm for dominating set. (English) Zbl 1395.05116 Discrete Appl. Math. 248, 114-124 (2018). MSC: 05C62 05C85 05C69 68Q25 PDFBibTeX XMLCite \textit{J. Jeong} et al., Discrete Appl. Math. 248, 114--124 (2018; Zbl 1395.05116) Full Text: DOI Link
Jeong, Jisu; Ok, Seongmin; Suh, Geewon Characterizing graphs of maximum matching width at most 2. (English) Zbl 1395.05133 Discrete Appl. Math. 248, 102-113 (2018). MSC: 05C70 05C35 PDFBibTeX XMLCite \textit{J. Jeong} et al., Discrete Appl. Math. 248, 102--113 (2018; Zbl 1395.05133) Full Text: DOI arXiv Link
Jeong, Jisu; Kim, Eun Jung; Oum, Sang-il The “Art of Trellis decoding” is fixed-parameter tractable. (English) Zbl 1390.94926 IEEE Trans. Inf. Theory 63, No. 11, 7178-7205 (2017). MSC: 94B35 PDFBibTeX XMLCite \textit{J. Jeong} et al., IEEE Trans. Inf. Theory 63, No. 11, 7178--7205 (2017; Zbl 1390.94926) Full Text: DOI arXiv
Choi, Hojin; Choi, Ilkyoo; Jeong, Jisu; Suh, Geewon \((1,k)\)-coloring of graphs with girth at least five on a surface. (English) Zbl 1359.05099 J. Graph Theory 84, No. 4, 521-535 (2017). MSC: 05C70 05C07 05C15 PDFBibTeX XMLCite \textit{H. Choi} et al., J. Graph Theory 84, No. 4, 521--535 (2017; Zbl 1359.05099) Full Text: DOI arXiv
Jeong, Jisu; Kim, Eun Jung; Oum, Sang-il Constructive algorithm for path-width of matroids. (English) Zbl 1410.68377 Krauthgamer, Robert (ed.), Proceedings of the 27th annual ACM-SIAM symposium on discrete algorithms, SODA 2016, Arlington, VA, USA, January 10–12, 2016. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1695-1704 (2016). MSC: 68W05 05B35 68Q25 PDFBibTeX XMLCite \textit{J. Jeong} et al., in: Proceedings of the 27th annual ACM-SIAM symposium on discrete algorithms, SODA 2016, Arlington, VA, USA, January 10--12, 2016. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1695--1704 (2016; Zbl 1410.68377) Full Text: DOI
Jeong, Jisu; Sæther, Sigve Hortemo; Telle, Jan Arne Maximum matching width: new characterizations and a fast algorithm for dominating set. (English) Zbl 1378.68082 Husfeldt, Thore (ed.) et al., 10th international symposium on parameterized and exact computation, IPEC 2015, Patras, Greece, September 16–18, 2015. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-92-7). LIPIcs – Leibniz International Proceedings in Informatics 43, 212-223 (2015). MSC: 68Q25 05C69 05C85 PDFBibTeX XMLCite \textit{J. Jeong} et al., LIPIcs -- Leibniz Int. Proc. Inform. 43, 212--223 (2015; Zbl 1378.68082) Full Text: DOI arXiv
Jeong, Jisu; Kwon, O-joung; Oum, Sang-il Excluded vertex-minors for graphs of linear rank-width at most \(k\). (English) Zbl 1297.05228 Eur. J. Comb. 41, 242-257 (2014). MSC: 05C83 05C12 PDFBibTeX XMLCite \textit{J. Jeong} et al., Eur. J. Comb. 41, 242--257 (2014; Zbl 1297.05228) Full Text: DOI arXiv
Jeong, Jisu; Kwon, O-Joung; Oum, Sang-il Excluded vertex-minors for graphs of linear rank-width at most \(k\). (English) Zbl 1354.05127 Portier, Natacha (ed.) et al., 30th international symposium on theoretical aspects of computer science, STACS’ 13, Kiel, Germany, February 27 – March 2, 2013. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-50-7). LIPIcs – Leibniz International Proceedings in Informatics 20, 221-232 (2013). MSC: 05C83 05C12 PDFBibTeX XMLCite \textit{J. Jeong} et al., LIPIcs -- Leibniz Int. Proc. Inform. 20, 221--232 (2013; Zbl 1354.05127) Full Text: DOI
Jeong, J.; Grinstein, F. F.; Hussain, F. Eduction of coherent structures in a numerically simulated plane wake. (English) Zbl 0825.76300 Appl. Sci. Res. 53, No. 3-4, 227-236 (1994). MSC: 76F10 76M25 PDFBibTeX XMLCite \textit{J. Jeong} et al., Appl. Sci. Res. 53, No. 3--4, 227--236 (1994; Zbl 0825.76300) Full Text: DOI