Published in: LIPIcs, Volume 107, 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)
Jisu Jeong, Eun Jung Kim, and Sang-il Oum. Finding Branch-Decompositions of Matroids, Hypergraphs, and More. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 80:1-80:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{jeong_et_al:LIPIcs.ICALP.2018.80, author = {Jeong, Jisu and Kim, Eun Jung and Oum, Sang-il}, title = {{Finding Branch-Decompositions of Matroids, Hypergraphs, and More}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {80:1--80:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.80}, URN = {urn:nbn:de:0030-drops-90849}, doi = {10.4230/LIPIcs.ICALP.2018.80}, annote = {Keywords: branch-width, rank-width, carving-width, fixed-parameter tractability} }
Published in: LIPIcs, Volume 43, 10th International Symposium on Parameterized and Exact Computation (IPEC 2015)
Jisu Jeong, Sigve Hortemo Sæther, and Jan Arne Telle. Maximum Matching Width: New Characterizations and a Fast Algorithm for Dominating Set. In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. 212-223, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{jeong_et_al:LIPIcs.IPEC.2015.212, author = {Jeong, Jisu and S{\ae}ther, Sigve Hortemo and Telle, Jan Arne}, title = {{Maximum Matching Width: New Characterizations and a Fast Algorithm for Dominating Set}}, booktitle = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)}, pages = {212--223}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-92-7}, ISSN = {1868-8969}, year = {2015}, volume = {43}, editor = {Husfeldt, Thore and Kanj, Iyad}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2015.212}, URN = {urn:nbn:de:0030-drops-55846}, doi = {10.4230/LIPIcs.IPEC.2015.212}, annote = {Keywords: FPT algorithms, treewidth, dominating set} }
Published in: LIPIcs, Volume 20, 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)
Jisu Jeong, O-joung Kwon, and Sang-il Oum. Excluded vertex-minors for graphs of linear rank-width at most k.. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 221-232, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@InProceedings{jeong_et_al:LIPIcs.STACS.2013.221, author = {Jeong, Jisu and Kwon, O-joung and Oum, Sang-il}, title = {{Excluded vertex-minors for graphs of linear rank-width at most k.}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {221--232}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.221}, URN = {urn:nbn:de:0030-drops-39369}, doi = {10.4230/LIPIcs.STACS.2013.221}, annote = {Keywords: rank-width, linear rank-width, vertex-minor, well-quasi-ordering} }
Feedback for Dagstuhl Publishing