학술논문

	o	ㅋ	ㄱ	ㅅ	ㅈ	ㅌ	ㄷ	촉	ㄴ	ㅎ	ㅂ	ㅃ	ㅁ	야	ㄹ	와
ㅏ	あ a	ぁ	か ka	が ga	さ sa	ざ za	た ta	だ da		な na	は ha	ば ba	ぱ pa	ま ma	や ya	ゃ lya	ら ra	わ wa	ゎ lwa	ん n
l	い i	ぃ	き ki	ぎ gi	し si	じ zi	ち ti	ぢ di		に ni	ひ hi	び bi	ぴ pi	み mi			り ri
ㅜ	う u	ぅ	く ku	ぐ gu	す su	ず zu	つ tu	づ du	っ	ぬ nu	ふ hu	ぶ bu	ぷ pu	む mu	ゆ yu	ゅ lyu	る ru
ㅔ	え e	ぇ	け ke	げ ge	せ se	ぜ ze	て te	で de		ね ne	へ he	べ be	ぺ pe	め me			れ re
ㅗ	お o	ぉ	こ ko	ご go	そ so	ぞ zo	と to	ど do		の no	ほ ho	ぼ bo	ぽ po	も mo	よ yo	ょ lyo	ろ ro	を wo

	o	ㅋ	ㄱ	ㅅ	ㅈ	ㅌ	ㄷ	촉	ㄴ	ㅎ	ㅂ	ㅃ	ㅁ	야	ㄹ	와
ㅏ	ア a	ァ	カ ka	ガ ga	サ sa	ザ za	タ ta	ダ da		ナ na	ハ ha	バ ba	パ pa	マ ma	ヤ ya	ャ lya	ラ ra	ワ wa	ヮ lwa		ン n
l	イ i	ィ	キ ki	ギ gi	シ si	ジ zi	チ ti	ヂ di		ニ ni	ヒ hi	ビ bi	ピ pi	ミ mi			リ ri
ㅜ	ウ u	ゥ	ク ku	グ gu	ス su	ズ zu	ツ tu	ヅ du	ッ	ヌ nu	フ hu	ブ bu	プ pu	ム mu	ユ yu	ュ lyu	ル ru			ヴ vu
ㅔ	エ e	ェ	ケ ke	ゲ ge	セ se	ゼ ze	テ te	デ de		ネ ne	ヘ he	ベ be	ぺ pe	メ me			レ re
ㅗ	オ o	ォ	コ ko	ゴ go	ソ so	ゾ zo	ト to	ド do		ノ no	ホ ho	ボ bo	ポ po	モ mo	ヨ yo	ョ lyo	ロ ro	ヲ wo		ーー

독일어
ä	Ä	ö	Ö	ü	Ü	ß
프랑스어
á	à	Á	À	é	è	É	È	ç	Ç	ê
스페인어
à	á	Á	é	É	í	Í	Ó	ó	Ú	ú	Ñ	ñ	ä	Ä

발행년	- (예 : 2010-2015)

전체선택

Sparse graphs with bounded induced cycle packing number have logarithmic treewidth

Academic Journal

Bonamy, M.; Bonnet, É.; Déprés, H.; Geniet, C.; Thomassé, S.; Esperet, L.; Hilaire, C.; Wesolek, A.

In: Journal of Combinatorial Theory. Series B. (Journal of Combinatorial Theory. Series B, July 2024, 167:215-249)

Full Text (ScienceDirect 종량제) Web of Science JCR 저널정보 Scopus Find it@PNU

Twin-width can be exponential in treewidth

Academic Journal

Bonnet, É.; Déprés, H.

In: Journal of Combinatorial Theory. Series B. (Journal of Combinatorial Theory. Series B, July 2023, 161:1-14)

Full Text (ScienceDirect 종량제) Web of Science JCR 저널정보 Scopus Find it@PNU

Spanning eulerian subdigraphs avoiding k prescribed arcs in tournaments

Academic Journal

Bang-Jensen, J.; Yeo, A.; Déprés, H.

In: Discrete Mathematics. (Discrete Mathematics, December 2020, 343(12))

Full Text (ScienceDirect 종량제) Web of Science JCR 저널정보 Scopus Find it@PNU

Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width

Conference

Bergé, P.; Bonnet, É.; Déprés, H.; Watrigant, R.

In: Leibniz International Proceedings in Informatics, LIPIcs, 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023. (Leibniz International Proceedings in Informatics, LIPIcs, 1 March 2023, 254)

Scopus Find it@PNU

Sparse graphs with bounded induced cycle packing number have logarithmic treewidth

Conference

Bonamy, M.; Déprés, H.; Geniet, C.; Thomassé, S.; Bonnet, É.; Esperet, L.; Wesolek, A.; Hilaire, C.

In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 34th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2023. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 2023, 2023-January:3006-3028)

Scopus Find it@PNU

Deciding Twin-Width at Most 4 Is NP-Complete

Conference

Bergé, P.; Bonnet, É.; Déprés, H.

In: Leibniz International Proceedings in Informatics, LIPIcs, 49th EATCS International Conference on Automata, Languages, and Programming, ICALP 2022. (Leibniz International Proceedings in Informatics, LIPIcs, 1 July 2022, 229)

Scopus Find it@PNU

Improved Lower Bounds for the Cyclic Bandwidth Problem

Book

Déprés, H.; Fertin, G.; Monfroy, E.

In: Computational Science – ICCS 2021 - 21st International Conference, Proceedings. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2021, 12742 LNCS:555-569)

Scopus Find it@PNU

부산대학교 도서관

메일 발송