Provider: Schloss Dagstuhl - Leibniz Center for Informatics
Database: dblp computer science bibliography
Content:text/plain; charset="utf-8"
TY - JOUR
ID - DBLP:journals/dam/KonagayaOU16
AU - Konagaya, Matsuo
AU - Otachi, Yota
AU - Uehara, Ryuhei
TI - Polynomial-time algorithms for Subgraph Isomorphism in small graph classes of perfect graphs.
JO - Discret. Appl. Math.
VL - 199
SP - 37
EP - 45
PY - 2016//
DO - 10.1016/J.DAM.2015.01.040
UR - https://doi.org/10.1016/j.dam.2015.01.040
ER -
TY - CPAPER
ID - DBLP:conf/isaac/AsanoIKKOOSTU14
AU - Asano, Tetsuo
AU - Izumi, Taisuke
AU - Kiyomi, Masashi
AU - Konagaya, Matsuo
AU - Ono, Hirotaka
AU - Otachi, Yota
AU - Schweitzer, Pascal
AU - Tarui, Jun
AU - Uehara, Ryuhei
TI - Depth-First Search Using O(n) Bits.
BT - Algorithms and Computation - 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings
SP - 553
EP - 564
PY - 2014//
DO - 10.1007/978-3-319-13075-0_44
UR - https://doi.org/10.1007/978-3-319-13075-0_44
ER -
TY - CPAPER
ID - DBLP:conf/tamc/KonagayaOU14
AU - Konagaya, Matsuo
AU - Otachi, Yota
AU - Uehara, Ryuhei
TI - Polynomial-Time Algorithms for Subgraph Isomorphism in Small Graph Classes of Perfect Graphs.
BT - Theory and Applications of Models of Computation - 11th Annual Conference, TAMC 2014, Chennai, India, April 11-13, 2014. Proceedings
SP - 216
EP - 228
PY - 2014//
DO - 10.1007/978-3-319-06089-7_15
UR - https://doi.org/10.1007/978-3-319-06089-7_15
ER -
TY - JOUR
ID - DBLP:journals/ieicet/KonagayaA13
AU - Konagaya, Matsuo
AU - Asano, Tetsuo
TI - Reporting All Segment Intersections Using an Arbitrary Sized Work Space.
JO - IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
VL - 96-A
IS - 6
SP - 1066
EP - 1071
PY - 2013//
DO - 10.1587/TRANSFUN.E96.A.1066
UR - https://doi.org/10.1587/transfun.E96.A.1066
UR - http://search.ieice.org/bin/summary.php?id=e96-a_6_1066
ER -
